About the Execution of 2022-gold for PolyORBLF-PT-S06J06T04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16220.048 | 3600000.00 | 2684524.00 | 593397.00 | 3 1 ? 6 4 1 4 1 1 10 10 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r319-tall-167873969900077.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is PolyORBLF-PT-S06J06T04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r319-tall-167873969900077
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 16K Feb 26 13:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 13:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 223K Feb 26 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 956K Feb 26 13:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 211K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 658K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Feb 26 14:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 14:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 167K Feb 26 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 773K Feb 26 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K Feb 25 16:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.9M Mar 5 18:23 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-S06J06T04-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678874535486
Running Version 202205111006
[2023-03-15 10:02:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 10:02:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 10:02:17] [INFO ] Load time of PNML (sax parser for PT used): 420 ms
[2023-03-15 10:02:17] [INFO ] Transformed 506 places.
[2023-03-15 10:02:17] [INFO ] Transformed 7154 transitions.
[2023-03-15 10:02:17] [INFO ] Parsed PT model containing 506 places and 7154 transitions in 594 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Normalized transition count is 1750 out of 1774 initially.
// Phase 1: matrix 1750 rows 506 cols
[2023-03-15 10:02:17] [INFO ] Computed 54 place invariants in 124 ms
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 40 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 14) seen :37
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :19
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :21
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :20
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :22
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :20
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :21
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :20
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :21
[2023-03-15 10:02:17] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
// Phase 1: matrix 1750 rows 506 cols
[2023-03-15 10:02:17] [INFO ] Computed 54 place invariants in 72 ms
[2023-03-15 10:02:18] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned sat
[2023-03-15 10:02:18] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 17 ms returned sat
[2023-03-15 10:02:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:02:19] [INFO ] [Real]Absence check using state equation in 1620 ms returned sat
[2023-03-15 10:02:23] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:02:23] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:910)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 10:02:23] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned sat
[2023-03-15 10:02:23] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 13 ms returned sat
[2023-03-15 10:02:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:02:24] [INFO ] [Real]Absence check using state equation in 990 ms returned sat
[2023-03-15 10:02:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:02:24] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2023-03-15 10:02:24] [INFO ] [Nat]Absence check using 23 positive and 31 generalized place invariants in 22 ms returned sat
[2023-03-15 10:02:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:02:29] [INFO ] [Nat]Absence check using state equation in 4906 ms returned unknown
[2023-03-15 10:02:29] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-15 10:02:29] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 12 ms returned unsat
[2023-03-15 10:02:29] [INFO ] [Real]Absence check using 23 positive place invariants in 9 ms returned sat
[2023-03-15 10:02:29] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 14 ms returned unsat
[2023-03-15 10:02:29] [INFO ] [Real]Absence check using 23 positive place invariants in 7 ms returned unsat
[2023-03-15 10:02:29] [INFO ] [Real]Absence check using 23 positive place invariants in 7 ms returned sat
[2023-03-15 10:02:29] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 12 ms returned unsat
[2023-03-15 10:02:29] [INFO ] [Real]Absence check using 23 positive place invariants in 6 ms returned unsat
[2023-03-15 10:02:29] [INFO ] [Real]Absence check using 23 positive place invariants in 7 ms returned sat
[2023-03-15 10:02:29] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 12 ms returned unsat
[2023-03-15 10:02:30] [INFO ] [Real]Absence check using 23 positive place invariants in 9 ms returned sat
[2023-03-15 10:02:30] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 21 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, 356, 6, 4, 1, 4, 1, 1, 1] Max seen :[3, 2, 6, 4, 1, 4, 1, 1, 1]
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 28 out of 506 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 506/506 places, 1774/1774 transitions.
Ensure Unique test removed 6 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 500 transition count 1738
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 78 place count 464 transition count 1738
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 78 place count 464 transition count 1682
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 190 place count 408 transition count 1682
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 286 place count 360 transition count 1634
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 294 place count 360 transition count 1626
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 302 place count 352 transition count 1626
Applied a total of 302 rules in 285 ms. Remains 352 /506 variables (removed 154) and now considering 1626/1774 (removed 148) transitions.
[2023-03-15 10:02:30] [INFO ] Flow matrix only has 1602 transitions (discarded 24 similar events)
// Phase 1: matrix 1602 rows 352 cols
[2023-03-15 10:02:30] [INFO ] Computed 48 place invariants in 71 ms
[2023-03-15 10:02:31] [INFO ] Dead Transitions using invariants and state equation in 851 ms found 612 transitions.
Found 612 dead transitions using SMT.
Drop transitions removed 612 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 612 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 352/506 places, 1014/1774 transitions.
Applied a total of 0 rules in 25 ms. Remains 352 /352 variables (removed 0) and now considering 1014/1014 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 352/506 places, 1014/1774 transitions.
Normalized transition count is 990 out of 1014 initially.
// Phase 1: matrix 990 rows 352 cols
[2023-03-15 10:02:31] [INFO ] Computed 48 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 9775 resets, run finished after 5471 ms. (steps per millisecond=182 ) properties (out of 2) seen :5
Incomplete Best-First random walk after 1000000 steps, including 1351 resets, run finished after 2203 ms. (steps per millisecond=453 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 345 resets, run finished after 2340 ms. (steps per millisecond=427 ) properties (out of 2) seen :5
[2023-03-15 10:02:41] [INFO ] Flow matrix only has 990 transitions (discarded 24 similar events)
// Phase 1: matrix 990 rows 352 cols
[2023-03-15 10:02:41] [INFO ] Computed 48 place invariants in 24 ms
[2023-03-15 10:02:41] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-15 10:02:41] [INFO ] [Real]Absence check using 19 positive and 29 generalized place invariants in 12 ms returned sat
[2023-03-15 10:02:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:02:42] [INFO ] [Real]Absence check using state equation in 1467 ms returned sat
[2023-03-15 10:02:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:02:42] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-15 10:02:42] [INFO ] [Nat]Absence check using 19 positive and 29 generalized place invariants in 12 ms returned sat
[2023-03-15 10:02:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:02:44] [INFO ] [Nat]Absence check using state equation in 1196 ms returned sat
[2023-03-15 10:02:44] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:02:44] [INFO ] [Nat]Added 112 Read/Feed constraints in 664 ms returned sat
[2023-03-15 10:02:45] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 7 ms to minimize.
[2023-03-15 10:02:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 225 ms
[2023-03-15 10:02:45] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-03-15 10:02:45] [INFO ] [Real]Absence check using 19 positive and 29 generalized place invariants in 13 ms returned sat
[2023-03-15 10:02:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:02:46] [INFO ] [Real]Absence check using state equation in 1316 ms returned sat
[2023-03-15 10:02:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:02:46] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-15 10:02:46] [INFO ] [Nat]Absence check using 19 positive and 29 generalized place invariants in 13 ms returned sat
[2023-03-15 10:02:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:02:49] [INFO ] [Nat]Absence check using state equation in 2563 ms returned sat
[2023-03-15 10:02:50] [INFO ] [Nat]Added 112 Read/Feed constraints in 1526 ms returned sat
[2023-03-15 10:02:50] [INFO ] Deduced a trap composed of 57 places in 197 ms of which 1 ms to minimize.
[2023-03-15 10:02:51] [INFO ] Deduced a trap composed of 83 places in 190 ms of which 1 ms to minimize.
[2023-03-15 10:02:51] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 2 ms to minimize.
[2023-03-15 10:02:51] [INFO ] Deduced a trap composed of 171 places in 224 ms of which 1 ms to minimize.
[2023-03-15 10:02:52] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 1 ms to minimize.
[2023-03-15 10:02:52] [INFO ] Deduced a trap composed of 161 places in 202 ms of which 1 ms to minimize.
[2023-03-15 10:02:52] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 1 ms to minimize.
[2023-03-15 10:02:52] [INFO ] Deduced a trap composed of 201 places in 205 ms of which 1 ms to minimize.
[2023-03-15 10:02:53] [INFO ] Deduced a trap composed of 163 places in 206 ms of which 0 ms to minimize.
[2023-03-15 10:02:53] [INFO ] Deduced a trap composed of 168 places in 216 ms of which 0 ms to minimize.
[2023-03-15 10:02:53] [INFO ] Deduced a trap composed of 161 places in 195 ms of which 1 ms to minimize.
[2023-03-15 10:02:53] [INFO ] Deduced a trap composed of 153 places in 197 ms of which 1 ms to minimize.
[2023-03-15 10:02:54] [INFO ] Deduced a trap composed of 198 places in 201 ms of which 1 ms to minimize.
[2023-03-15 10:02:54] [INFO ] Deduced a trap composed of 175 places in 200 ms of which 0 ms to minimize.
[2023-03-15 10:02:54] [INFO ] Deduced a trap composed of 145 places in 221 ms of which 0 ms to minimize.
[2023-03-15 10:02:54] [INFO ] Deduced a trap composed of 203 places in 202 ms of which 0 ms to minimize.
[2023-03-15 10:02:55] [INFO ] Deduced a trap composed of 197 places in 215 ms of which 1 ms to minimize.
[2023-03-15 10:02:55] [INFO ] Deduced a trap composed of 200 places in 214 ms of which 0 ms to minimize.
[2023-03-15 10:02:55] [INFO ] Deduced a trap composed of 161 places in 209 ms of which 0 ms to minimize.
[2023-03-15 10:02:56] [INFO ] Deduced a trap composed of 151 places in 218 ms of which 1 ms to minimize.
[2023-03-15 10:02:56] [INFO ] Deduced a trap composed of 170 places in 216 ms of which 0 ms to minimize.
[2023-03-15 10:02:56] [INFO ] Deduced a trap composed of 157 places in 214 ms of which 0 ms to minimize.
[2023-03-15 10:02:56] [INFO ] Deduced a trap composed of 158 places in 219 ms of which 0 ms to minimize.
[2023-03-15 10:02:57] [INFO ] Deduced a trap composed of 183 places in 188 ms of which 1 ms to minimize.
[2023-03-15 10:02:57] [INFO ] Deduced a trap composed of 161 places in 243 ms of which 0 ms to minimize.
[2023-03-15 10:02:57] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 0 ms to minimize.
[2023-03-15 10:02:58] [INFO ] Deduced a trap composed of 168 places in 219 ms of which 0 ms to minimize.
[2023-03-15 10:02:58] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 1 ms to minimize.
[2023-03-15 10:02:58] [INFO ] Deduced a trap composed of 153 places in 211 ms of which 1 ms to minimize.
[2023-03-15 10:02:58] [INFO ] Deduced a trap composed of 185 places in 212 ms of which 1 ms to minimize.
[2023-03-15 10:02:59] [INFO ] Deduced a trap composed of 174 places in 205 ms of which 0 ms to minimize.
[2023-03-15 10:02:59] [INFO ] Deduced a trap composed of 180 places in 194 ms of which 1 ms to minimize.
[2023-03-15 10:02:59] [INFO ] Deduced a trap composed of 175 places in 190 ms of which 1 ms to minimize.
[2023-03-15 10:02:59] [INFO ] Deduced a trap composed of 188 places in 198 ms of which 0 ms to minimize.
[2023-03-15 10:03:00] [INFO ] Deduced a trap composed of 202 places in 189 ms of which 0 ms to minimize.
[2023-03-15 10:03:00] [INFO ] Deduced a trap composed of 177 places in 217 ms of which 0 ms to minimize.
[2023-03-15 10:03:00] [INFO ] Deduced a trap composed of 207 places in 184 ms of which 1 ms to minimize.
[2023-03-15 10:03:01] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 10320 ms
[2023-03-15 10:03:01] [INFO ] Computed and/alt/rep : 578/2814/573 causal constraints (skipped 411 transitions) in 79 ms.
[2023-03-15 10:03:05] [INFO ] Deduced a trap composed of 197 places in 221 ms of which 1 ms to minimize.
[2023-03-15 10:03:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 392 ms
[2023-03-15 10:03:05] [INFO ] Added : 146 causal constraints over 30 iterations in 4335 ms. Result :sat
Minimization took 850 ms.
Current structural bounds on expressions (after SMT) : [3, 356] Max seen :[3, 2]
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 24 out of 352 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 352/352 places, 1014/1014 transitions.
Applied a total of 0 rules in 22 ms. Remains 352 /352 variables (removed 0) and now considering 1014/1014 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 352/352 places, 1014/1014 transitions.
Normalized transition count is 990 out of 1014 initially.
// Phase 1: matrix 990 rows 352 cols
[2023-03-15 10:03:08] [INFO ] Computed 48 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 9838 resets, run finished after 5464 ms. (steps per millisecond=183 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 328 resets, run finished after 2370 ms. (steps per millisecond=421 ) properties (out of 1) seen :2
[2023-03-15 10:03:16] [INFO ] Flow matrix only has 990 transitions (discarded 24 similar events)
// Phase 1: matrix 990 rows 352 cols
[2023-03-15 10:03:16] [INFO ] Computed 48 place invariants in 23 ms
[2023-03-15 10:03:16] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-15 10:03:16] [INFO ] [Real]Absence check using 19 positive and 29 generalized place invariants in 14 ms returned sat
[2023-03-15 10:03:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:03:17] [INFO ] [Real]Absence check using state equation in 1309 ms returned sat
[2023-03-15 10:03:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:03:17] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-15 10:03:17] [INFO ] [Nat]Absence check using 19 positive and 29 generalized place invariants in 13 ms returned sat
[2023-03-15 10:03:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:03:20] [INFO ] [Nat]Absence check using state equation in 2519 ms returned sat
[2023-03-15 10:03:20] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:03:21] [INFO ] [Nat]Added 112 Read/Feed constraints in 1552 ms returned sat
[2023-03-15 10:03:22] [INFO ] Deduced a trap composed of 57 places in 189 ms of which 0 ms to minimize.
[2023-03-15 10:03:22] [INFO ] Deduced a trap composed of 83 places in 183 ms of which 1 ms to minimize.
[2023-03-15 10:03:22] [INFO ] Deduced a trap composed of 57 places in 38 ms of which 1 ms to minimize.
[2023-03-15 10:03:23] [INFO ] Deduced a trap composed of 171 places in 206 ms of which 0 ms to minimize.
[2023-03-15 10:03:23] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 0 ms to minimize.
[2023-03-15 10:03:23] [INFO ] Deduced a trap composed of 161 places in 215 ms of which 0 ms to minimize.
[2023-03-15 10:03:23] [INFO ] Deduced a trap composed of 168 places in 200 ms of which 0 ms to minimize.
[2023-03-15 10:03:24] [INFO ] Deduced a trap composed of 201 places in 206 ms of which 0 ms to minimize.
[2023-03-15 10:03:24] [INFO ] Deduced a trap composed of 163 places in 198 ms of which 0 ms to minimize.
[2023-03-15 10:03:24] [INFO ] Deduced a trap composed of 168 places in 203 ms of which 0 ms to minimize.
[2023-03-15 10:03:24] [INFO ] Deduced a trap composed of 161 places in 202 ms of which 0 ms to minimize.
[2023-03-15 10:03:25] [INFO ] Deduced a trap composed of 153 places in 221 ms of which 1 ms to minimize.
[2023-03-15 10:03:25] [INFO ] Deduced a trap composed of 198 places in 197 ms of which 1 ms to minimize.
[2023-03-15 10:03:25] [INFO ] Deduced a trap composed of 175 places in 201 ms of which 1 ms to minimize.
[2023-03-15 10:03:25] [INFO ] Deduced a trap composed of 145 places in 196 ms of which 0 ms to minimize.
[2023-03-15 10:03:26] [INFO ] Deduced a trap composed of 203 places in 202 ms of which 1 ms to minimize.
[2023-03-15 10:03:26] [INFO ] Deduced a trap composed of 197 places in 198 ms of which 0 ms to minimize.
[2023-03-15 10:03:26] [INFO ] Deduced a trap composed of 200 places in 204 ms of which 13 ms to minimize.
[2023-03-15 10:03:27] [INFO ] Deduced a trap composed of 161 places in 201 ms of which 1 ms to minimize.
[2023-03-15 10:03:27] [INFO ] Deduced a trap composed of 151 places in 217 ms of which 1 ms to minimize.
[2023-03-15 10:03:27] [INFO ] Deduced a trap composed of 170 places in 214 ms of which 1 ms to minimize.
[2023-03-15 10:03:27] [INFO ] Deduced a trap composed of 157 places in 216 ms of which 0 ms to minimize.
[2023-03-15 10:03:28] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 0 ms to minimize.
[2023-03-15 10:03:28] [INFO ] Deduced a trap composed of 183 places in 206 ms of which 0 ms to minimize.
[2023-03-15 10:03:28] [INFO ] Deduced a trap composed of 161 places in 203 ms of which 0 ms to minimize.
[2023-03-15 10:03:28] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 0 ms to minimize.
[2023-03-15 10:03:29] [INFO ] Deduced a trap composed of 168 places in 205 ms of which 0 ms to minimize.
[2023-03-15 10:03:29] [INFO ] Deduced a trap composed of 164 places in 231 ms of which 15 ms to minimize.
[2023-03-15 10:03:29] [INFO ] Deduced a trap composed of 153 places in 205 ms of which 3 ms to minimize.
[2023-03-15 10:03:30] [INFO ] Deduced a trap composed of 185 places in 199 ms of which 0 ms to minimize.
[2023-03-15 10:03:30] [INFO ] Deduced a trap composed of 174 places in 205 ms of which 1 ms to minimize.
[2023-03-15 10:03:30] [INFO ] Deduced a trap composed of 180 places in 203 ms of which 0 ms to minimize.
[2023-03-15 10:03:30] [INFO ] Deduced a trap composed of 175 places in 196 ms of which 0 ms to minimize.
[2023-03-15 10:03:31] [INFO ] Deduced a trap composed of 188 places in 201 ms of which 0 ms to minimize.
[2023-03-15 10:03:31] [INFO ] Deduced a trap composed of 202 places in 201 ms of which 0 ms to minimize.
[2023-03-15 10:03:31] [INFO ] Deduced a trap composed of 177 places in 203 ms of which 0 ms to minimize.
[2023-03-15 10:03:32] [INFO ] Deduced a trap composed of 207 places in 205 ms of which 0 ms to minimize.
[2023-03-15 10:03:32] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 10229 ms
[2023-03-15 10:03:32] [INFO ] Computed and/alt/rep : 578/2814/573 causal constraints (skipped 411 transitions) in 55 ms.
[2023-03-15 10:03:36] [INFO ] Deduced a trap composed of 197 places in 191 ms of which 0 ms to minimize.
[2023-03-15 10:03:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 363 ms
[2023-03-15 10:03:36] [INFO ] Added : 146 causal constraints over 30 iterations in 4193 ms. Result :sat
Minimization took 817 ms.
Current structural bounds on expressions (after SMT) : [356] Max seen :[2]
Support contains 24 out of 352 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 352/352 places, 1014/1014 transitions.
Applied a total of 0 rules in 57 ms. Remains 352 /352 variables (removed 0) and now considering 1014/1014 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 352/352 places, 1014/1014 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 352/352 places, 1014/1014 transitions.
Applied a total of 0 rules in 18 ms. Remains 352 /352 variables (removed 0) and now considering 1014/1014 (removed 0) transitions.
[2023-03-15 10:03:39] [INFO ] Flow matrix only has 990 transitions (discarded 24 similar events)
// Phase 1: matrix 990 rows 352 cols
[2023-03-15 10:03:39] [INFO ] Computed 48 place invariants in 18 ms
[2023-03-15 10:03:40] [INFO ] Implicit Places using invariants in 506 ms returned [17, 70, 145, 291]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 520 ms to find 4 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 348/352 places, 1014/1014 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 344 transition count 1010
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 344 transition count 1010
Applied a total of 8 rules in 42 ms. Remains 344 /348 variables (removed 4) and now considering 1010/1014 (removed 4) transitions.
[2023-03-15 10:03:40] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
// Phase 1: matrix 986 rows 344 cols
[2023-03-15 10:03:40] [INFO ] Computed 44 place invariants in 14 ms
[2023-03-15 10:03:40] [INFO ] Implicit Places using invariants in 420 ms returned []
[2023-03-15 10:03:40] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
// Phase 1: matrix 986 rows 344 cols
[2023-03-15 10:03:40] [INFO ] Computed 44 place invariants in 15 ms
[2023-03-15 10:03:41] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:03:49] [INFO ] Implicit Places using invariants and state equation in 9208 ms returned []
Implicit Place search using SMT with State Equation took 9632 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 344/352 places, 1010/1014 transitions.
Finished structural reductions, in 2 iterations. Remains : 344/352 places, 1010/1014 transitions.
Normalized transition count is 986 out of 1010 initially.
// Phase 1: matrix 986 rows 344 cols
[2023-03-15 10:03:49] [INFO ] Computed 44 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 9701 resets, run finished after 5370 ms. (steps per millisecond=186 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 354 resets, run finished after 2398 ms. (steps per millisecond=417 ) properties (out of 1) seen :2
[2023-03-15 10:03:57] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
// Phase 1: matrix 986 rows 344 cols
[2023-03-15 10:03:57] [INFO ] Computed 44 place invariants in 20 ms
[2023-03-15 10:03:57] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned sat
[2023-03-15 10:03:57] [INFO ] [Real]Absence check using 22 positive and 22 generalized place invariants in 12 ms returned sat
[2023-03-15 10:03:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:03:59] [INFO ] [Real]Absence check using state equation in 2317 ms returned sat
[2023-03-15 10:03:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:03:59] [INFO ] [Nat]Absence check using 22 positive place invariants in 5 ms returned sat
[2023-03-15 10:03:59] [INFO ] [Nat]Absence check using 22 positive and 22 generalized place invariants in 13 ms returned sat
[2023-03-15 10:03:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:04:03] [INFO ] [Nat]Absence check using state equation in 3176 ms returned sat
[2023-03-15 10:04:03] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:04:04] [INFO ] [Nat]Added 112 Read/Feed constraints in 1248 ms returned sat
[2023-03-15 10:04:04] [INFO ] Deduced a trap composed of 78 places in 190 ms of which 0 ms to minimize.
[2023-03-15 10:04:04] [INFO ] Deduced a trap composed of 18 places in 184 ms of which 1 ms to minimize.
[2023-03-15 10:04:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 596 ms
[2023-03-15 10:04:05] [INFO ] Computed and/alt/rep : 574/2809/569 causal constraints (skipped 411 transitions) in 71 ms.
[2023-03-15 10:04:08] [INFO ] Added : 97 causal constraints over 20 iterations in 3226 ms. Result :sat
Minimization took 2556 ms.
Current structural bounds on expressions (after SMT) : [356] Max seen :[2]
Support contains 24 out of 344 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 344/344 places, 1010/1010 transitions.
Applied a total of 0 rules in 32 ms. Remains 344 /344 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 344/344 places, 1010/1010 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 344/344 places, 1010/1010 transitions.
Applied a total of 0 rules in 17 ms. Remains 344 /344 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
[2023-03-15 10:04:11] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
// Phase 1: matrix 986 rows 344 cols
[2023-03-15 10:04:11] [INFO ] Computed 44 place invariants in 13 ms
[2023-03-15 10:04:12] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-03-15 10:04:12] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
// Phase 1: matrix 986 rows 344 cols
[2023-03-15 10:04:12] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-15 10:04:12] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:04:20] [INFO ] Implicit Places using invariants and state equation in 8107 ms returned []
Implicit Place search using SMT with State Equation took 8544 ms to find 0 implicit places.
[2023-03-15 10:04:20] [INFO ] Redundant transitions in 64 ms returned []
[2023-03-15 10:04:20] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
// Phase 1: matrix 986 rows 344 cols
[2023-03-15 10:04:20] [INFO ] Computed 44 place invariants in 15 ms
[2023-03-15 10:04:20] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 344/344 places, 1010/1010 transitions.
Starting property specific reduction for PolyORBLF-PT-S06J06T04-UpperBounds-02
Normalized transition count is 986 out of 1010 initially.
// Phase 1: matrix 986 rows 344 cols
[2023-03-15 10:04:20] [INFO ] Computed 44 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 79 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :2
[2023-03-15 10:04:21] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
// Phase 1: matrix 986 rows 344 cols
[2023-03-15 10:04:21] [INFO ] Computed 44 place invariants in 36 ms
[2023-03-15 10:04:21] [INFO ] [Real]Absence check using 22 positive place invariants in 6 ms returned sat
[2023-03-15 10:04:21] [INFO ] [Real]Absence check using 22 positive and 22 generalized place invariants in 13 ms returned sat
[2023-03-15 10:04:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:04:23] [INFO ] [Real]Absence check using state equation in 2327 ms returned sat
[2023-03-15 10:04:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:04:23] [INFO ] [Nat]Absence check using 22 positive place invariants in 6 ms returned sat
[2023-03-15 10:04:23] [INFO ] [Nat]Absence check using 22 positive and 22 generalized place invariants in 13 ms returned sat
[2023-03-15 10:04:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:04:26] [INFO ] [Nat]Absence check using state equation in 3173 ms returned sat
[2023-03-15 10:04:26] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:04:28] [INFO ] [Nat]Added 112 Read/Feed constraints in 1284 ms returned sat
[2023-03-15 10:04:28] [INFO ] Deduced a trap composed of 78 places in 187 ms of which 0 ms to minimize.
[2023-03-15 10:04:28] [INFO ] Deduced a trap composed of 18 places in 184 ms of which 1 ms to minimize.
[2023-03-15 10:04:28] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 24 out of 344 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 344/344 places, 1010/1010 transitions.
Applied a total of 0 rules in 17 ms. Remains 344 /344 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
[2023-03-15 10:04:28] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
// Phase 1: matrix 986 rows 344 cols
[2023-03-15 10:04:28] [INFO ] Computed 44 place invariants in 15 ms
[2023-03-15 10:04:29] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 344/344 places, 1010/1010 transitions.
Normalized transition count is 986 out of 1010 initially.
// Phase 1: matrix 986 rows 344 cols
[2023-03-15 10:04:29] [INFO ] Computed 44 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 9733 resets, run finished after 5255 ms. (steps per millisecond=190 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 352 resets, run finished after 2276 ms. (steps per millisecond=439 ) properties (out of 1) seen :2
[2023-03-15 10:04:36] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
// Phase 1: matrix 986 rows 344 cols
[2023-03-15 10:04:36] [INFO ] Computed 44 place invariants in 22 ms
[2023-03-15 10:04:36] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned sat
[2023-03-15 10:04:36] [INFO ] [Real]Absence check using 22 positive and 22 generalized place invariants in 13 ms returned sat
[2023-03-15 10:04:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:04:39] [INFO ] [Real]Absence check using state equation in 2632 ms returned sat
[2023-03-15 10:04:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:04:39] [INFO ] [Nat]Absence check using 22 positive place invariants in 5 ms returned sat
[2023-03-15 10:04:39] [INFO ] [Nat]Absence check using 22 positive and 22 generalized place invariants in 13 ms returned sat
[2023-03-15 10:04:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:04:42] [INFO ] [Nat]Absence check using state equation in 3191 ms returned sat
[2023-03-15 10:04:42] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:04:43] [INFO ] [Nat]Added 112 Read/Feed constraints in 1258 ms returned sat
[2023-03-15 10:04:44] [INFO ] Deduced a trap composed of 78 places in 193 ms of which 0 ms to minimize.
[2023-03-15 10:04:44] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 0 ms to minimize.
[2023-03-15 10:04:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 583 ms
[2023-03-15 10:04:44] [INFO ] Computed and/alt/rep : 574/2809/569 causal constraints (skipped 411 transitions) in 55 ms.
[2023-03-15 10:04:47] [INFO ] Added : 97 causal constraints over 20 iterations in 3220 ms. Result :sat
Minimization took 2499 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 24 out of 344 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 344/344 places, 1010/1010 transitions.
Applied a total of 0 rules in 16 ms. Remains 344 /344 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 344/344 places, 1010/1010 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 344/344 places, 1010/1010 transitions.
Applied a total of 0 rules in 15 ms. Remains 344 /344 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
[2023-03-15 10:04:51] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
// Phase 1: matrix 986 rows 344 cols
[2023-03-15 10:04:51] [INFO ] Computed 44 place invariants in 13 ms
[2023-03-15 10:04:51] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-15 10:04:51] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
// Phase 1: matrix 986 rows 344 cols
[2023-03-15 10:04:51] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-15 10:04:52] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:04:59] [INFO ] Implicit Places using invariants and state equation in 7617 ms returned []
Implicit Place search using SMT with State Equation took 8038 ms to find 0 implicit places.
[2023-03-15 10:04:59] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-15 10:04:59] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
// Phase 1: matrix 986 rows 344 cols
[2023-03-15 10:04:59] [INFO ] Computed 44 place invariants in 19 ms
[2023-03-15 10:04:59] [INFO ] Dead Transitions using invariants and state equation in 510 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 344/344 places, 1010/1010 transitions.
Ending property specific reduction for PolyORBLF-PT-S06J06T04-UpperBounds-02 in 38913 ms.
[2023-03-15 10:05:00] [INFO ] Flatten gal took : 137 ms
[2023-03-15 10:05:00] [INFO ] Applying decomposition
[2023-03-15 10:05:00] [INFO ] Flatten gal took : 83 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18192671371364788961.txt' '-o' '/tmp/graph18192671371364788961.bin' '-w' '/tmp/graph18192671371364788961.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18192671371364788961.bin' '-l' '-1' '-v' '-w' '/tmp/graph18192671371364788961.weights' '-q' '0' '-e' '0.001'
[2023-03-15 10:05:00] [INFO ] Decomposing Gal with order
[2023-03-15 10:05:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 10:05:00] [INFO ] Removed a total of 744 redundant transitions.
[2023-03-15 10:05:00] [INFO ] Flatten gal took : 284 ms
[2023-03-15 10:05:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 220 labels/synchronizations in 28 ms.
[2023-03-15 10:05:01] [INFO ] Time to serialize gal into /tmp/UpperBounds1961896349443546124.gal : 18 ms
[2023-03-15 10:05:01] [INFO ] Time to serialize properties into /tmp/UpperBounds6621447544590948865.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1961896349443546124.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6621447544590948865.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...295
Loading property file /tmp/UpperBounds6621447544590948865.prop.
Detected timeout of ITS tools.
[2023-03-15 10:26:26] [INFO ] Flatten gal took : 425 ms
[2023-03-15 10:26:26] [INFO ] Time to serialize gal into /tmp/UpperBounds11162244820695156272.gal : 71 ms
[2023-03-15 10:26:26] [INFO ] Time to serialize properties into /tmp/UpperBounds8715140343495426328.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11162244820695156272.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8715140343495426328.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...296
Loading property file /tmp/UpperBounds8715140343495426328.prop.
Detected timeout of ITS tools.
[2023-03-15 10:47:50] [INFO ] Flatten gal took : 503 ms
[2023-03-15 10:47:52] [INFO ] Input system was already deterministic with 1010 transitions.
[2023-03-15 10:47:52] [INFO ] Transformed 344 places.
[2023-03-15 10:47:52] [INFO ] Transformed 1010 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-15 10:48:23] [INFO ] Time to serialize gal into /tmp/UpperBounds9909807823271274647.gal : 16 ms
[2023-03-15 10:48:23] [INFO ] Time to serialize properties into /tmp/UpperBounds799963152343414625.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9909807823271274647.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds799963152343414625.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...339
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds799963152343414625.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-S06J06T04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is PolyORBLF-PT-S06J06T04, 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 r319-tall-167873969900077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J06T04.tgz
mv PolyORBLF-PT-S06J06T04 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 ;