Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r159-oct2-162089268100251.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBLF-PT-S02J06T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-oct2-162089268100251
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 74K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 310K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 76K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 355K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 16K Mar 28 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 28 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Mar 28 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 36K Mar 28 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 27 09:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Mar 27 09:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 25 11:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 25 11:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.3M May 5 16:51 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-S02J06T08-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621198333529

Running Version 0
[2021-05-16 20:52:15] [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]
[2021-05-16 20:52:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 20:52:15] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2021-05-16 20:52:15] [INFO ] Transformed 690 places.
[2021-05-16 20:52:15] [INFO ] Transformed 1434 transitions.
[2021-05-16 20:52:15] [INFO ] Parsed PT model containing 690 places and 1434 transitions in 177 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Normalized transition count is 1290 out of 1306 initially.
// Phase 1: matrix 1290 rows 690 cols
[2021-05-16 20:52:15] [INFO ] Computed 54 place invariants in 81 ms
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 15) seen :17
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :15
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :14
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :16
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 :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :15
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 :15
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :15
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :14
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :16
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :15
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :15
[2021-05-16 20:52:16] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
[2021-05-16 20:52:16] [INFO ] Computed 54 place invariants in 60 ms
[2021-05-16 20:52:16] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2021-05-16 20:52:16] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 15 ms returned unsat
[2021-05-16 20:52:16] [INFO ] [Real]Absence check using 13 positive place invariants in 20 ms returned sat
[2021-05-16 20:52:16] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 20 ms returned unsat
[2021-05-16 20:52:16] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2021-05-16 20:52:16] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 8 ms returned unsat
[2021-05-16 20:52:16] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2021-05-16 20:52:16] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 29 ms returned sat
[2021-05-16 20:52:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:52:17] [INFO ] [Real]Absence check using state equation in 646 ms returned sat
[2021-05-16 20:52:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:52:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2021-05-16 20:52:17] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 29 ms returned unsat
[2021-05-16 20:52:17] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2021-05-16 20:52:17] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 11 ms returned unsat
[2021-05-16 20:52:17] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2021-05-16 20:52:17] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 9 ms returned unsat
[2021-05-16 20:52:17] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2021-05-16 20:52:17] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 7 ms returned unsat
[2021-05-16 20:52:17] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2021-05-16 20:52:17] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 8 ms returned unsat
[2021-05-16 20:52:17] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2021-05-16 20:52:17] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 26 ms returned unsat
[2021-05-16 20:52:17] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2021-05-16 20:52:17] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 7 ms returned unsat
[2021-05-16 20:52:18] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2021-05-16 20:52:18] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 26 ms returned sat
[2021-05-16 20:52:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:52:19] [INFO ] [Real]Absence check using state equation in 1616 ms returned sat
[2021-05-16 20:52:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:52:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2021-05-16 20:52:19] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 21 ms returned sat
[2021-05-16 20:52:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:52:24] [INFO ] [Nat]Absence check using state equation in 4869 ms returned unknown
[2021-05-16 20:52:24] [INFO ] [Real]Absence check using 13 positive place invariants in 23 ms returned sat
[2021-05-16 20:52:24] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 8 ms returned unsat
[2021-05-16 20:52:24] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2021-05-16 20:52:24] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 25 ms returned sat
[2021-05-16 20:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:52:25] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2021-05-16 20:52:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:52:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2021-05-16 20:52:25] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 28 ms returned sat
[2021-05-16 20:52:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:52:27] [INFO ] [Nat]Absence check using state equation in 1950 ms returned sat
[2021-05-16 20:52:27] [INFO ] State equation strengthened by 104 read => feed constraints.
[2021-05-16 20:52:28] [INFO ] [Nat]Added 104 Read/Feed constraints in 583 ms returned sat
[2021-05-16 20:52:28] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 3 ms to minimize.
[2021-05-16 20:52:28] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 1 ms to minimize.
[2021-05-16 20:52:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 385 ms
[2021-05-16 20:52:28] [INFO ] Computed and/alt/rep : 824/3142/816 causal constraints (skipped 472 transitions) in 108 ms.
[2021-05-16 20:52:30] [INFO ] Deduced a trap composed of 2 places in 410 ms of which 1 ms to minimize.
[2021-05-16 20:52:30] [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 12
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-16 20:52:30] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2021-05-16 20:52:30] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 26 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 8, 1, 36, 1] Max seen :[1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1]
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 690 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 688 transition count 1237
Reduce places removed 69 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 70 rules applied. Total rules applied 141 place count 619 transition count 1236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 142 place count 618 transition count 1236
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 142 place count 618 transition count 1156
Deduced a syphon composed of 80 places in 14 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 302 place count 538 transition count 1156
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 428 place count 475 transition count 1093
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 444 place count 475 transition count 1077
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 460 place count 459 transition count 1077
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 461 place count 459 transition count 1077
Applied a total of 461 rules in 323 ms. Remains 459 /690 variables (removed 231) and now considering 1077/1306 (removed 229) transitions.
[2021-05-16 20:52:31] [INFO ] Flow matrix only has 1061 transitions (discarded 16 similar events)
// Phase 1: matrix 1061 rows 459 cols
[2021-05-16 20:52:31] [INFO ] Computed 52 place invariants in 22 ms
[2021-05-16 20:52:32] [INFO ] Dead Transitions using invariants and state equation in 708 ms returned [936, 938, 939, 940, 941, 943, 944, 945, 946, 947, 948, 954, 955, 956, 957, 958, 960, 961, 963, 964, 965, 966, 971, 972, 974, 975, 976, 977, 980, 981, 982, 983, 984, 986, 987, 989, 991, 992, 993, 994, 995, 996, 997, 998, 1004, 1006, 1007, 1008, 1009, 1011, 1012, 1013, 1015, 1016, 1017, 1022, 1023, 1025, 1027, 1028, 1029, 1030, 1031, 1033, 1034, 1035, 1048, 1049, 1050, 1051, 1052, 1054, 1056, 1057, 1058, 1060, 1061, 1062, 1063, 1064, 1067, 1068, 1069, 1070, 1071, 1073, 1074, 1075]
Found 88 dead transitions using SMT.
Drop transitions removed 88 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 88 transitions :[1075, 1074, 1073, 1071, 1070, 1069, 1068, 1067, 1064, 1063, 1062, 1061, 1060, 1058, 1057, 1056, 1054, 1052, 1051, 1050, 1049, 1048, 1035, 1034, 1033, 1031, 1030, 1029, 1028, 1027, 1025, 1023, 1022, 1017, 1016, 1015, 1013, 1012, 1011, 1009, 1008, 1007, 1006, 1004, 998, 997, 996, 995, 994, 993, 992, 991, 989, 987, 986, 984, 983, 982, 981, 980, 977, 976, 975, 974, 972, 971, 966, 965, 964, 963, 961, 960, 958, 957, 956, 955, 954, 948, 947, 946, 945, 944, 943, 941, 940, 939, 938, 936]
Starting structural reductions, iteration 1 : 459/690 places, 989/1306 transitions.
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 457 transition count 973
Reduce places removed 16 places and 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 18 place count 441 transition count 957
Applied a total of 18 rules in 26 ms. Remains 441 /459 variables (removed 18) and now considering 957/989 (removed 32) transitions.
Finished structural reductions, in 2 iterations. Remains : 441/690 places, 957/1306 transitions.
Normalized transition count is 941 out of 957 initially.
// Phase 1: matrix 941 rows 441 cols
[2021-05-16 20:52:32] [INFO ] Computed 52 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 402 resets, run finished after 3413 ms. (steps per millisecond=292 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1045 ms. (steps per millisecond=956 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 151 resets, run finished after 1460 ms. (steps per millisecond=684 ) properties (out of 2) seen :3
[2021-05-16 20:52:38] [INFO ] Flow matrix only has 941 transitions (discarded 16 similar events)
// Phase 1: matrix 941 rows 441 cols
[2021-05-16 20:52:38] [INFO ] Computed 52 place invariants in 14 ms
[2021-05-16 20:52:38] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2021-05-16 20:52:38] [INFO ] [Real]Absence check using 15 positive and 37 generalized place invariants in 11 ms returned sat
[2021-05-16 20:52:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:53:23] [INFO ] [Real]Absence check using state equation in 44949 ms returned unknown
[2021-05-16 20:53:23] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2021-05-16 20:53:23] [INFO ] [Real]Absence check using 15 positive and 37 generalized place invariants in 22 ms returned unsat
Current structural bounds on expressions (after SMT) : [8, 2] Max seen :[1, 2]
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 441 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 441/441 places, 957/957 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 441 transition count 956
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 440 transition count 956
Applied a total of 2 rules in 74 ms. Remains 440 /441 variables (removed 1) and now considering 956/957 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 440/441 places, 956/957 transitions.
Normalized transition count is 940 out of 956 initially.
// Phase 1: matrix 940 rows 440 cols
[2021-05-16 20:53:23] [INFO ] Computed 52 place invariants in 25 ms
Incomplete random walk after 1000000 steps, including 429 resets, run finished after 3275 ms. (steps per millisecond=305 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1049 ms. (steps per millisecond=953 ) properties (out of 1) seen :1
[2021-05-16 20:53:27] [INFO ] Flow matrix only has 940 transitions (discarded 16 similar events)
// Phase 1: matrix 940 rows 440 cols
[2021-05-16 20:53:27] [INFO ] Computed 52 place invariants in 25 ms
[2021-05-16 20:53:27] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2021-05-16 20:53:27] [INFO ] [Real]Absence check using 15 positive and 37 generalized place invariants in 26 ms returned sat
[2021-05-16 20:53:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:53:28] [INFO ] [Real]Absence check using state equation in 917 ms returned sat
[2021-05-16 20:53:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:53:28] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2021-05-16 20:53:28] [INFO ] [Nat]Absence check using 15 positive and 37 generalized place invariants in 25 ms returned sat
[2021-05-16 20:53:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:53:30] [INFO ] [Nat]Absence check using state equation in 1541 ms returned sat
[2021-05-16 20:53:30] [INFO ] State equation strengthened by 104 read => feed constraints.
[2021-05-16 20:53:30] [INFO ] [Nat]Added 104 Read/Feed constraints in 145 ms returned sat
[2021-05-16 20:53:30] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 2 ms to minimize.
[2021-05-16 20:53:30] [INFO ] Deduced a trap composed of 206 places in 179 ms of which 13 ms to minimize.
[2021-05-16 20:53:31] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 1 ms to minimize.
[2021-05-16 20:53:31] [INFO ] Deduced a trap composed of 195 places in 176 ms of which 1 ms to minimize.
[2021-05-16 20:53:31] [INFO ] Deduced a trap composed of 187 places in 221 ms of which 13 ms to minimize.
[2021-05-16 20:53:31] [INFO ] Deduced a trap composed of 207 places in 186 ms of which 0 ms to minimize.
[2021-05-16 20:53:32] [INFO ] Deduced a trap composed of 86 places in 432 ms of which 1 ms to minimize.
[2021-05-16 20:53:32] [INFO ] Deduced a trap composed of 219 places in 201 ms of which 0 ms to minimize.
[2021-05-16 20:53:32] [INFO ] Deduced a trap composed of 78 places in 172 ms of which 4 ms to minimize.
[2021-05-16 20:53:32] [INFO ] Deduced a trap composed of 96 places in 152 ms of which 1 ms to minimize.
[2021-05-16 20:53:33] [INFO ] Deduced a trap composed of 88 places in 151 ms of which 0 ms to minimize.
[2021-05-16 20:53:33] [INFO ] Deduced a trap composed of 187 places in 132 ms of which 0 ms to minimize.
[2021-05-16 20:53:33] [INFO ] Deduced a trap composed of 204 places in 145 ms of which 1 ms to minimize.
[2021-05-16 20:53:33] [INFO ] Deduced a trap composed of 83 places in 137 ms of which 0 ms to minimize.
[2021-05-16 20:53:33] [INFO ] Deduced a trap composed of 88 places in 179 ms of which 1 ms to minimize.
[2021-05-16 20:53:34] [INFO ] Deduced a trap composed of 182 places in 142 ms of which 0 ms to minimize.
[2021-05-16 20:53:34] [INFO ] Deduced a trap composed of 105 places in 137 ms of which 1 ms to minimize.
[2021-05-16 20:53:34] [INFO ] Deduced a trap composed of 128 places in 144 ms of which 1 ms to minimize.
[2021-05-16 20:53:34] [INFO ] Deduced a trap composed of 83 places in 141 ms of which 1 ms to minimize.
[2021-05-16 20:53:34] [INFO ] Deduced a trap composed of 105 places in 135 ms of which 0 ms to minimize.
[2021-05-16 20:53:34] [INFO ] Deduced a trap composed of 223 places in 137 ms of which 0 ms to minimize.
[2021-05-16 20:53:35] [INFO ] Deduced a trap composed of 132 places in 150 ms of which 0 ms to minimize.
[2021-05-16 20:53:35] [INFO ] Deduced a trap composed of 82 places in 146 ms of which 0 ms to minimize.
[2021-05-16 20:53:35] [INFO ] Deduced a trap composed of 52 places in 132 ms of which 0 ms to minimize.
[2021-05-16 20:53:35] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2021-05-16 20:53:35] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 0 ms to minimize.
[2021-05-16 20:53:35] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 1 ms to minimize.
[2021-05-16 20:53:35] [INFO ] Deduced a trap composed of 43 places in 23 ms of which 0 ms to minimize.
[2021-05-16 20:53:36] [INFO ] Deduced a trap composed of 158 places in 187 ms of which 0 ms to minimize.
[2021-05-16 20:53:36] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 1 ms to minimize.
[2021-05-16 20:53:36] [INFO ] Deduced a trap composed of 191 places in 137 ms of which 1 ms to minimize.
[2021-05-16 20:53:36] [INFO ] Deduced a trap composed of 194 places in 139 ms of which 4 ms to minimize.
[2021-05-16 20:53:36] [INFO ] Deduced a trap composed of 182 places in 157 ms of which 1 ms to minimize.
[2021-05-16 20:53:37] [INFO ] Deduced a trap composed of 194 places in 161 ms of which 0 ms to minimize.
[2021-05-16 20:53:37] [INFO ] Deduced a trap composed of 180 places in 128 ms of which 1 ms to minimize.
[2021-05-16 20:53:37] [INFO ] Deduced a trap composed of 166 places in 150 ms of which 0 ms to minimize.
[2021-05-16 20:53:37] [INFO ] Deduced a trap composed of 181 places in 131 ms of which 1 ms to minimize.
[2021-05-16 20:53:37] [INFO ] Deduced a trap composed of 224 places in 143 ms of which 1 ms to minimize.
[2021-05-16 20:53:38] [INFO ] Deduced a trap composed of 183 places in 160 ms of which 0 ms to minimize.
[2021-05-16 20:53:38] [INFO ] Deduced a trap composed of 195 places in 148 ms of which 0 ms to minimize.
[2021-05-16 20:53:38] [INFO ] Deduced a trap composed of 219 places in 137 ms of which 0 ms to minimize.
[2021-05-16 20:53:38] [INFO ] Deduced a trap composed of 179 places in 140 ms of which 0 ms to minimize.
[2021-05-16 20:53:38] [INFO ] Deduced a trap composed of 219 places in 150 ms of which 0 ms to minimize.
[2021-05-16 20:53:39] [INFO ] Deduced a trap composed of 110 places in 148 ms of which 0 ms to minimize.
[2021-05-16 20:53:39] [INFO ] Deduced a trap composed of 201 places in 146 ms of which 0 ms to minimize.
[2021-05-16 20:53:39] [INFO ] Deduced a trap composed of 194 places in 144 ms of which 1 ms to minimize.
[2021-05-16 20:53:39] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 1 ms to minimize.
[2021-05-16 20:53:39] [INFO ] Deduced a trap composed of 130 places in 142 ms of which 1 ms to minimize.
[2021-05-16 20:53:40] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 1 ms to minimize.
[2021-05-16 20:53:40] [INFO ] Deduced a trap composed of 188 places in 145 ms of which 0 ms to minimize.
[2021-05-16 20:53:40] [INFO ] Deduced a trap composed of 157 places in 144 ms of which 0 ms to minimize.
[2021-05-16 20:53:40] [INFO ] Deduced a trap composed of 159 places in 146 ms of which 1 ms to minimize.
[2021-05-16 20:53:40] [INFO ] Deduced a trap composed of 183 places in 156 ms of which 7 ms to minimize.
[2021-05-16 20:53:40] [INFO ] Deduced a trap composed of 176 places in 148 ms of which 0 ms to minimize.
[2021-05-16 20:53:41] [INFO ] Deduced a trap composed of 202 places in 148 ms of which 0 ms to minimize.
[2021-05-16 20:53:41] [INFO ] Deduced a trap composed of 75 places in 146 ms of which 0 ms to minimize.
[2021-05-16 20:53:41] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 0 ms to minimize.
[2021-05-16 20:53:41] [INFO ] Deduced a trap composed of 117 places in 138 ms of which 0 ms to minimize.
[2021-05-16 20:53:42] [INFO ] Deduced a trap composed of 170 places in 147 ms of which 0 ms to minimize.
[2021-05-16 20:53:42] [INFO ] Deduced a trap composed of 105 places in 149 ms of which 1 ms to minimize.
[2021-05-16 20:53:42] [INFO ] Deduced a trap composed of 81 places in 146 ms of which 1 ms to minimize.
[2021-05-16 20:53:42] [INFO ] Deduced a trap composed of 164 places in 144 ms of which 1 ms to minimize.
[2021-05-16 20:53:43] [INFO ] Deduced a trap composed of 167 places in 141 ms of which 0 ms to minimize.
[2021-05-16 20:53:43] [INFO ] Deduced a trap composed of 161 places in 138 ms of which 1 ms to minimize.
[2021-05-16 20:53:43] [INFO ] Deduced a trap composed of 173 places in 166 ms of which 2 ms to minimize.
[2021-05-16 20:53:43] [INFO ] Trap strengthening (SAT) tested/added 66/65 trap constraints in 13446 ms
[2021-05-16 20:53:43] [INFO ] Computed and/alt/rep : 426/1504/418 causal constraints (skipped 520 transitions) in 57 ms.
[2021-05-16 20:53:47] [INFO ] Deduced a trap composed of 96 places in 172 ms of which 7 ms to minimize.
[2021-05-16 20:53:47] [INFO ] Deduced a trap composed of 85 places in 150 ms of which 1 ms to minimize.
[2021-05-16 20:53:47] [INFO ] Deduced a trap composed of 192 places in 133 ms of which 1 ms to minimize.
[2021-05-16 20:53:47] [INFO ] Deduced a trap composed of 42 places in 20 ms of which 1 ms to minimize.
[2021-05-16 20:53:47] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 0 ms to minimize.
[2021-05-16 20:53:48] [INFO ] Deduced a trap composed of 82 places in 127 ms of which 1 ms to minimize.
[2021-05-16 20:53:48] [INFO ] Deduced a trap composed of 100 places in 172 ms of which 1 ms to minimize.
[2021-05-16 20:53:48] [INFO ] Deduced a trap composed of 95 places in 151 ms of which 0 ms to minimize.
[2021-05-16 20:53:48] [INFO ] Deduced a trap composed of 111 places in 126 ms of which 1 ms to minimize.
[2021-05-16 20:53:49] [INFO ] Deduced a trap composed of 179 places in 125 ms of which 1 ms to minimize.
[2021-05-16 20:53:49] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 1 ms to minimize.
[2021-05-16 20:53:49] [INFO ] Deduced a trap composed of 155 places in 125 ms of which 0 ms to minimize.
[2021-05-16 20:53:49] [INFO ] Deduced a trap composed of 105 places in 144 ms of which 0 ms to minimize.
[2021-05-16 20:53:49] [INFO ] Deduced a trap composed of 102 places in 144 ms of which 0 ms to minimize.
[2021-05-16 20:53:49] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 0 ms to minimize.
[2021-05-16 20:53:50] [INFO ] Deduced a trap composed of 182 places in 131 ms of which 1 ms to minimize.
[2021-05-16 20:53:50] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 0 ms to minimize.
[2021-05-16 20:53:50] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 0 ms to minimize.
[2021-05-16 20:53:50] [INFO ] Deduced a trap composed of 111 places in 125 ms of which 0 ms to minimize.
[2021-05-16 20:53:51] [INFO ] Deduced a trap composed of 112 places in 127 ms of which 0 ms to minimize.
[2021-05-16 20:53:51] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 0 ms to minimize.
[2021-05-16 20:53:51] [INFO ] Deduced a trap composed of 82 places in 128 ms of which 0 ms to minimize.
[2021-05-16 20:53:51] [INFO ] Deduced a trap composed of 109 places in 131 ms of which 0 ms to minimize.
[2021-05-16 20:53:51] [INFO ] Deduced a trap composed of 111 places in 118 ms of which 0 ms to minimize.
[2021-05-16 20:53:52] [INFO ] Deduced a trap composed of 165 places in 124 ms of which 0 ms to minimize.
[2021-05-16 20:53:52] [INFO ] Deduced a trap composed of 209 places in 154 ms of which 1 ms to minimize.
[2021-05-16 20:53:52] [INFO ] Deduced a trap composed of 91 places in 147 ms of which 0 ms to minimize.
[2021-05-16 20:53:52] [INFO ] Deduced a trap composed of 105 places in 135 ms of which 0 ms to minimize.
[2021-05-16 20:53:52] [INFO ] Deduced a trap composed of 203 places in 189 ms of which 0 ms to minimize.
[2021-05-16 20:53:53] [INFO ] Deduced a trap composed of 199 places in 139 ms of which 0 ms to minimize.
[2021-05-16 20:53:53] [INFO ] Deduced a trap composed of 116 places in 137 ms of which 0 ms to minimize.
[2021-05-16 20:53:53] [INFO ] Deduced a trap composed of 170 places in 163 ms of which 0 ms to minimize.
[2021-05-16 20:53:53] [INFO ] Deduced a trap composed of 154 places in 160 ms of which 1 ms to minimize.
[2021-05-16 20:53:54] [INFO ] Deduced a trap composed of 173 places in 159 ms of which 1 ms to minimize.
[2021-05-16 20:53:54] [INFO ] Deduced a trap composed of 176 places in 175 ms of which 0 ms to minimize.
[2021-05-16 20:53:54] [INFO ] Deduced a trap composed of 140 places in 139 ms of which 0 ms to minimize.
[2021-05-16 20:53:55] [INFO ] Deduced a trap composed of 198 places in 143 ms of which 0 ms to minimize.
[2021-05-16 20:53:55] [INFO ] Deduced a trap composed of 221 places in 143 ms of which 1 ms to minimize.
[2021-05-16 20:53:55] [INFO ] Deduced a trap composed of 165 places in 147 ms of which 1 ms to minimize.
[2021-05-16 20:53:55] [INFO ] Deduced a trap composed of 151 places in 161 ms of which 0 ms to minimize.
[2021-05-16 20:53:56] [INFO ] Deduced a trap composed of 175 places in 140 ms of which 1 ms to minimize.
[2021-05-16 20:53:56] [INFO ] Deduced a trap composed of 157 places in 134 ms of which 1 ms to minimize.
[2021-05-16 20:53:56] [INFO ] Deduced a trap composed of 167 places in 142 ms of which 1 ms to minimize.
[2021-05-16 20:53:56] [INFO ] Deduced a trap composed of 192 places in 147 ms of which 1 ms to minimize.
[2021-05-16 20:53:57] [INFO ] Deduced a trap composed of 105 places in 146 ms of which 0 ms to minimize.
[2021-05-16 20:53:57] [INFO ] Deduced a trap composed of 109 places in 141 ms of which 0 ms to minimize.
[2021-05-16 20:53:57] [INFO ] Deduced a trap composed of 78 places in 147 ms of which 1 ms to minimize.
[2021-05-16 20:53:57] [INFO ] Deduced a trap composed of 80 places in 140 ms of which 0 ms to minimize.
[2021-05-16 20:53:57] [INFO ] Deduced a trap composed of 120 places in 138 ms of which 0 ms to minimize.
[2021-05-16 20:53:58] [INFO ] Deduced a trap composed of 128 places in 140 ms of which 0 ms to minimize.
[2021-05-16 20:53:58] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 1 ms to minimize.
[2021-05-16 20:53:58] [INFO ] Deduced a trap composed of 98 places in 140 ms of which 0 ms to minimize.
[2021-05-16 20:53:58] [INFO ] Deduced a trap composed of 109 places in 140 ms of which 0 ms to minimize.
[2021-05-16 20:53:58] [INFO ] Deduced a trap composed of 162 places in 145 ms of which 1 ms to minimize.
[2021-05-16 20:53:59] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 0 ms to minimize.
[2021-05-16 20:53:59] [INFO ] Deduced a trap composed of 100 places in 153 ms of which 0 ms to minimize.
[2021-05-16 20:53:59] [INFO ] Deduced a trap composed of 92 places in 156 ms of which 1 ms to minimize.
[2021-05-16 20:53:59] [INFO ] Deduced a trap composed of 83 places in 143 ms of which 0 ms to minimize.
[2021-05-16 20:53:59] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 1 ms to minimize.
[2021-05-16 20:54:00] [INFO ] Deduced a trap composed of 108 places in 149 ms of which 1 ms to minimize.
[2021-05-16 20:54:00] [INFO ] Deduced a trap composed of 104 places in 269 ms of which 1 ms to minimize.
[2021-05-16 20:54:00] [INFO ] Deduced a trap composed of 129 places in 133 ms of which 0 ms to minimize.
[2021-05-16 20:54:00] [INFO ] Deduced a trap composed of 105 places in 125 ms of which 0 ms to minimize.
[2021-05-16 20:54:01] [INFO ] Deduced a trap composed of 161 places in 124 ms of which 1 ms to minimize.
[2021-05-16 20:54:01] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 0 ms to minimize.
[2021-05-16 20:54:01] [INFO ] Deduced a trap composed of 181 places in 141 ms of which 0 ms to minimize.
[2021-05-16 20:54:01] [INFO ] Deduced a trap composed of 80 places in 153 ms of which 1 ms to minimize.
[2021-05-16 20:54:02] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 0 ms to minimize.
[2021-05-16 20:54:02] [INFO ] Deduced a trap composed of 103 places in 143 ms of which 0 ms to minimize.
[2021-05-16 20:54:02] [INFO ] Trap strengthening (SAT) tested/added 70/69 trap constraints in 15889 ms
[2021-05-16 20:54:02] [INFO ] Added : 249 causal constraints over 50 iterations in 19114 ms. Result :sat
Minimization took 2081 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Incomplete Parikh walk after 316800 steps, including 1002 resets, run finished after 1083 ms. (steps per millisecond=292 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 440 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 440/440 places, 956/956 transitions.
Applied a total of 0 rules in 15 ms. Remains 440 /440 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 440/440 places, 956/956 transitions.
Starting structural reductions, iteration 0 : 440/440 places, 956/956 transitions.
Applied a total of 0 rules in 14 ms. Remains 440 /440 variables (removed 0) and now considering 956/956 (removed 0) transitions.
[2021-05-16 20:54:06] [INFO ] Flow matrix only has 940 transitions (discarded 16 similar events)
// Phase 1: matrix 940 rows 440 cols
[2021-05-16 20:54:06] [INFO ] Computed 52 place invariants in 21 ms
[2021-05-16 20:54:06] [INFO ] Implicit Places using invariants in 534 ms returned [43, 113, 188, 224, 297, 312, 368, 373]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 540 ms to find 8 implicit places.
[2021-05-16 20:54:06] [INFO ] Redundant transitions in 45 ms returned []
[2021-05-16 20:54:06] [INFO ] Flow matrix only has 940 transitions (discarded 16 similar events)
// Phase 1: matrix 940 rows 432 cols
[2021-05-16 20:54:06] [INFO ] Computed 44 place invariants in 16 ms
[2021-05-16 20:54:07] [INFO ] Dead Transitions using invariants and state equation in 551 ms returned []
Starting structural reductions, iteration 1 : 432/440 places, 956/956 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 429 transition count 953
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 429 transition count 953
Applied a total of 6 rules in 38 ms. Remains 429 /432 variables (removed 3) and now considering 953/956 (removed 3) transitions.
[2021-05-16 20:54:07] [INFO ] Flow matrix only has 937 transitions (discarded 16 similar events)
// Phase 1: matrix 937 rows 429 cols
[2021-05-16 20:54:07] [INFO ] Computed 44 place invariants in 11 ms
[2021-05-16 20:54:07] [INFO ] Implicit Places using invariants in 408 ms returned []
[2021-05-16 20:54:07] [INFO ] Flow matrix only has 937 transitions (discarded 16 similar events)
// Phase 1: matrix 937 rows 429 cols
[2021-05-16 20:54:07] [INFO ] Computed 44 place invariants in 13 ms
[2021-05-16 20:54:08] [INFO ] State equation strengthened by 104 read => feed constraints.
[2021-05-16 20:54:21] [INFO ] Implicit Places using invariants and state equation in 13379 ms returned []
Implicit Place search using SMT with State Equation took 13802 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 429/440 places, 953/956 transitions.
Normalized transition count is 937 out of 953 initially.
// Phase 1: matrix 937 rows 429 cols
[2021-05-16 20:54:21] [INFO ] Computed 44 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 397 resets, run finished after 3410 ms. (steps per millisecond=293 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1114 ms. (steps per millisecond=897 ) properties (out of 1) seen :1
[2021-05-16 20:54:25] [INFO ] Flow matrix only has 937 transitions (discarded 16 similar events)
// Phase 1: matrix 937 rows 429 cols
[2021-05-16 20:54:25] [INFO ] Computed 44 place invariants in 24 ms
[2021-05-16 20:54:25] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2021-05-16 20:54:25] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 11 ms returned sat
[2021-05-16 20:54:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:54:26] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2021-05-16 20:54:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:54:26] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2021-05-16 20:54:26] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 18 ms returned sat
[2021-05-16 20:54:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:54:27] [INFO ] [Nat]Absence check using state equation in 865 ms returned sat
[2021-05-16 20:54:27] [INFO ] State equation strengthened by 104 read => feed constraints.
[2021-05-16 20:54:27] [INFO ] [Nat]Added 104 Read/Feed constraints in 221 ms returned sat
[2021-05-16 20:54:27] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 0 ms to minimize.
[2021-05-16 20:54:27] [INFO ] Deduced a trap composed of 84 places in 161 ms of which 1 ms to minimize.
[2021-05-16 20:54:28] [INFO ] Deduced a trap composed of 119 places in 151 ms of which 1 ms to minimize.
[2021-05-16 20:54:28] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 1 ms to minimize.
[2021-05-16 20:54:28] [INFO ] Deduced a trap composed of 53 places in 149 ms of which 1 ms to minimize.
[2021-05-16 20:54:28] [INFO ] Deduced a trap composed of 121 places in 153 ms of which 0 ms to minimize.
[2021-05-16 20:54:28] [INFO ] Deduced a trap composed of 165 places in 150 ms of which 0 ms to minimize.
[2021-05-16 20:54:29] [INFO ] Deduced a trap composed of 101 places in 148 ms of which 0 ms to minimize.
[2021-05-16 20:54:29] [INFO ] Deduced a trap composed of 195 places in 148 ms of which 1 ms to minimize.
[2021-05-16 20:54:29] [INFO ] Deduced a trap composed of 145 places in 149 ms of which 1 ms to minimize.
[2021-05-16 20:54:29] [INFO ] Deduced a trap composed of 132 places in 147 ms of which 0 ms to minimize.
[2021-05-16 20:54:29] [INFO ] Deduced a trap composed of 105 places in 150 ms of which 1 ms to minimize.
[2021-05-16 20:54:29] [INFO ] Deduced a trap composed of 108 places in 149 ms of which 0 ms to minimize.
[2021-05-16 20:54:30] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 0 ms to minimize.
[2021-05-16 20:54:30] [INFO ] Deduced a trap composed of 96 places in 146 ms of which 0 ms to minimize.
[2021-05-16 20:54:30] [INFO ] Deduced a trap composed of 84 places in 150 ms of which 1 ms to minimize.
[2021-05-16 20:54:30] [INFO ] Deduced a trap composed of 137 places in 149 ms of which 0 ms to minimize.
[2021-05-16 20:54:30] [INFO ] Deduced a trap composed of 102 places in 149 ms of which 1 ms to minimize.
[2021-05-16 20:54:30] [INFO ] Deduced a trap composed of 105 places in 148 ms of which 1 ms to minimize.
[2021-05-16 20:54:31] [INFO ] Deduced a trap composed of 43 places in 23 ms of which 1 ms to minimize.
[2021-05-16 20:54:31] [INFO ] Deduced a trap composed of 105 places in 164 ms of which 0 ms to minimize.
[2021-05-16 20:54:31] [INFO ] Deduced a trap composed of 85 places in 151 ms of which 1 ms to minimize.
[2021-05-16 20:54:31] [INFO ] Deduced a trap composed of 80 places in 175 ms of which 0 ms to minimize.
[2021-05-16 20:54:32] [INFO ] Deduced a trap composed of 116 places in 153 ms of which 0 ms to minimize.
[2021-05-16 20:54:32] [INFO ] Deduced a trap composed of 185 places in 149 ms of which 0 ms to minimize.
[2021-05-16 20:54:32] [INFO ] Deduced a trap composed of 108 places in 149 ms of which 0 ms to minimize.
[2021-05-16 20:54:32] [INFO ] Deduced a trap composed of 83 places in 163 ms of which 0 ms to minimize.
[2021-05-16 20:54:32] [INFO ] Deduced a trap composed of 86 places in 163 ms of which 0 ms to minimize.
[2021-05-16 20:54:33] [INFO ] Deduced a trap composed of 93 places in 151 ms of which 0 ms to minimize.
[2021-05-16 20:54:33] [INFO ] Deduced a trap composed of 42 places in 22 ms of which 0 ms to minimize.
[2021-05-16 20:54:33] [INFO ] Deduced a trap composed of 44 places in 19 ms of which 0 ms to minimize.
[2021-05-16 20:54:33] [INFO ] Deduced a trap composed of 43 places in 23 ms of which 0 ms to minimize.
[2021-05-16 20:54:33] [INFO ] Deduced a trap composed of 154 places in 149 ms of which 0 ms to minimize.
[2021-05-16 20:54:33] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 1 ms to minimize.
[2021-05-16 20:54:34] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 0 ms to minimize.
[2021-05-16 20:54:34] [INFO ] Deduced a trap composed of 59 places in 151 ms of which 1 ms to minimize.
[2021-05-16 20:54:34] [INFO ] Deduced a trap composed of 167 places in 147 ms of which 1 ms to minimize.
[2021-05-16 20:54:34] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 1 ms to minimize.
[2021-05-16 20:54:34] [INFO ] Deduced a trap composed of 86 places in 144 ms of which 0 ms to minimize.
[2021-05-16 20:54:35] [INFO ] Deduced a trap composed of 158 places in 152 ms of which 1 ms to minimize.
[2021-05-16 20:54:35] [INFO ] Deduced a trap composed of 196 places in 151 ms of which 0 ms to minimize.
[2021-05-16 20:54:35] [INFO ] Deduced a trap composed of 174 places in 148 ms of which 0 ms to minimize.
[2021-05-16 20:54:35] [INFO ] Deduced a trap composed of 187 places in 152 ms of which 0 ms to minimize.
[2021-05-16 20:54:35] [INFO ] Deduced a trap composed of 184 places in 147 ms of which 1 ms to minimize.
[2021-05-16 20:54:35] [INFO ] Deduced a trap composed of 157 places in 144 ms of which 0 ms to minimize.
[2021-05-16 20:54:36] [INFO ] Deduced a trap composed of 200 places in 146 ms of which 0 ms to minimize.
[2021-05-16 20:54:36] [INFO ] Deduced a trap composed of 89 places in 149 ms of which 0 ms to minimize.
[2021-05-16 20:54:36] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 0 ms to minimize.
[2021-05-16 20:54:36] [INFO ] Deduced a trap composed of 123 places in 142 ms of which 1 ms to minimize.
[2021-05-16 20:54:37] [INFO ] Deduced a trap composed of 80 places in 150 ms of which 0 ms to minimize.
[2021-05-16 20:54:37] [INFO ] Deduced a trap composed of 171 places in 147 ms of which 0 ms to minimize.
[2021-05-16 20:54:37] [INFO ] Deduced a trap composed of 107 places in 150 ms of which 1 ms to minimize.
[2021-05-16 20:54:37] [INFO ] Deduced a trap composed of 154 places in 151 ms of which 1 ms to minimize.
[2021-05-16 20:54:37] [INFO ] Deduced a trap composed of 168 places in 184 ms of which 0 ms to minimize.
[2021-05-16 20:54:38] [INFO ] Deduced a trap composed of 193 places in 144 ms of which 0 ms to minimize.
[2021-05-16 20:54:38] [INFO ] Deduced a trap composed of 163 places in 146 ms of which 1 ms to minimize.
[2021-05-16 20:54:38] [INFO ] Deduced a trap composed of 53 places in 145 ms of which 1 ms to minimize.
[2021-05-16 20:54:38] [INFO ] Deduced a trap composed of 77 places in 193 ms of which 0 ms to minimize.
[2021-05-16 20:54:39] [INFO ] Deduced a trap composed of 92 places in 184 ms of which 0 ms to minimize.
[2021-05-16 20:54:39] [INFO ] Deduced a trap composed of 104 places in 146 ms of which 0 ms to minimize.
[2021-05-16 20:54:40] [INFO ] Deduced a trap composed of 81 places in 143 ms of which 1 ms to minimize.
[2021-05-16 20:54:40] [INFO ] Deduced a trap composed of 134 places in 136 ms of which 0 ms to minimize.
[2021-05-16 20:54:40] [INFO ] Deduced a trap composed of 80 places in 137 ms of which 1 ms to minimize.
[2021-05-16 20:54:40] [INFO ] Deduced a trap composed of 87 places in 147 ms of which 1 ms to minimize.
[2021-05-16 20:54:40] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 0 ms to minimize.
[2021-05-16 20:54:40] [INFO ] Trap strengthening (SAT) tested/added 66/65 trap constraints in 13467 ms
[2021-05-16 20:54:41] [INFO ] Computed and/alt/rep : 420/1473/412 causal constraints (skipped 523 transitions) in 53 ms.
[2021-05-16 20:54:44] [INFO ] Deduced a trap composed of 104 places in 140 ms of which 0 ms to minimize.
[2021-05-16 20:54:44] [INFO ] Deduced a trap composed of 114 places in 151 ms of which 1 ms to minimize.
[2021-05-16 20:54:44] [INFO ] Deduced a trap composed of 102 places in 136 ms of which 1 ms to minimize.
[2021-05-16 20:54:44] [INFO ] Deduced a trap composed of 109 places in 135 ms of which 1 ms to minimize.
[2021-05-16 20:54:45] [INFO ] Deduced a trap composed of 165 places in 133 ms of which 0 ms to minimize.
[2021-05-16 20:54:45] [INFO ] Deduced a trap composed of 139 places in 135 ms of which 0 ms to minimize.
[2021-05-16 20:54:45] [INFO ] Deduced a trap composed of 177 places in 131 ms of which 0 ms to minimize.
[2021-05-16 20:54:45] [INFO ] Deduced a trap composed of 198 places in 148 ms of which 0 ms to minimize.
[2021-05-16 20:54:45] [INFO ] Deduced a trap composed of 197 places in 148 ms of which 0 ms to minimize.
[2021-05-16 20:54:46] [INFO ] Deduced a trap composed of 81 places in 136 ms of which 0 ms to minimize.
[2021-05-16 20:54:46] [INFO ] Deduced a trap composed of 84 places in 141 ms of which 1 ms to minimize.
[2021-05-16 20:54:46] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 0 ms to minimize.
[2021-05-16 20:54:46] [INFO ] Deduced a trap composed of 149 places in 119 ms of which 1 ms to minimize.
[2021-05-16 20:54:46] [INFO ] Deduced a trap composed of 109 places in 138 ms of which 0 ms to minimize.
[2021-05-16 20:54:47] [INFO ] Deduced a trap composed of 102 places in 148 ms of which 0 ms to minimize.
[2021-05-16 20:54:47] [INFO ] Deduced a trap composed of 110 places in 150 ms of which 0 ms to minimize.
[2021-05-16 20:54:47] [INFO ] Deduced a trap composed of 103 places in 175 ms of which 1 ms to minimize.
[2021-05-16 20:54:47] [INFO ] Deduced a trap composed of 108 places in 146 ms of which 0 ms to minimize.
[2021-05-16 20:54:48] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3932 ms
[2021-05-16 20:54:48] [INFO ] Added : 303 causal constraints over 62 iterations in 7257 ms. Result :sat
Minimization took 973 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Incomplete Parikh walk after 266000 steps, including 1000 resets, run finished after 912 ms. (steps per millisecond=291 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 429 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 429/429 places, 953/953 transitions.
Applied a total of 0 rules in 16 ms. Remains 429 /429 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 429/429 places, 953/953 transitions.
Starting structural reductions, iteration 0 : 429/429 places, 953/953 transitions.
Applied a total of 0 rules in 15 ms. Remains 429 /429 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2021-05-16 20:54:50] [INFO ] Flow matrix only has 937 transitions (discarded 16 similar events)
// Phase 1: matrix 937 rows 429 cols
[2021-05-16 20:54:50] [INFO ] Computed 44 place invariants in 10 ms
[2021-05-16 20:54:50] [INFO ] Implicit Places using invariants in 406 ms returned []
[2021-05-16 20:54:50] [INFO ] Flow matrix only has 937 transitions (discarded 16 similar events)
// Phase 1: matrix 937 rows 429 cols
[2021-05-16 20:54:50] [INFO ] Computed 44 place invariants in 16 ms
[2021-05-16 20:54:50] [INFO ] State equation strengthened by 104 read => feed constraints.
[2021-05-16 20:55:01] [INFO ] Implicit Places using invariants and state equation in 10690 ms returned []
Implicit Place search using SMT with State Equation took 11122 ms to find 0 implicit places.
[2021-05-16 20:55:01] [INFO ] Redundant transitions in 12 ms returned []
[2021-05-16 20:55:01] [INFO ] Flow matrix only has 937 transitions (discarded 16 similar events)
// Phase 1: matrix 937 rows 429 cols
[2021-05-16 20:55:01] [INFO ] Computed 44 place invariants in 11 ms
[2021-05-16 20:55:01] [INFO ] Dead Transitions using invariants and state equation in 637 ms returned []
Finished structural reductions, in 1 iterations. Remains : 429/429 places, 953/953 transitions.
Starting property specific reduction for PolyORBLF-PT-S02J06T08-UpperBounds-12
Normalized transition count is 937 out of 953 initially.
// Phase 1: matrix 937 rows 429 cols
[2021-05-16 20:55:01] [INFO ] Computed 44 place invariants in 13 ms
Incomplete random walk after 10000 steps, including 7 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :1
[2021-05-16 20:55:02] [INFO ] Flow matrix only has 937 transitions (discarded 16 similar events)
// Phase 1: matrix 937 rows 429 cols
[2021-05-16 20:55:02] [INFO ] Computed 44 place invariants in 17 ms
[2021-05-16 20:55:02] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2021-05-16 20:55:02] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 11 ms returned sat
[2021-05-16 20:55:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:55:02] [INFO ] [Real]Absence check using state equation in 493 ms returned sat
[2021-05-16 20:55:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:55:02] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2021-05-16 20:55:02] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 10 ms returned sat
[2021-05-16 20:55:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:55:03] [INFO ] [Nat]Absence check using state equation in 824 ms returned sat
[2021-05-16 20:55:03] [INFO ] State equation strengthened by 104 read => feed constraints.
[2021-05-16 20:55:03] [INFO ] [Nat]Added 104 Read/Feed constraints in 210 ms returned sat
[2021-05-16 20:55:03] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 0 ms to minimize.
[2021-05-16 20:55:04] [INFO ] Deduced a trap composed of 84 places in 156 ms of which 0 ms to minimize.
[2021-05-16 20:55:04] [INFO ] Deduced a trap composed of 119 places in 154 ms of which 0 ms to minimize.
[2021-05-16 20:55:04] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 0 ms to minimize.
[2021-05-16 20:55:04] [INFO ] Deduced a trap composed of 53 places in 168 ms of which 0 ms to minimize.
[2021-05-16 20:55:04] [INFO ] Deduced a trap composed of 121 places in 162 ms of which 1 ms to minimize.
[2021-05-16 20:55:05] [INFO ] Deduced a trap composed of 165 places in 154 ms of which 1 ms to minimize.
[2021-05-16 20:55:05] [INFO ] Deduced a trap composed of 101 places in 153 ms of which 0 ms to minimize.
[2021-05-16 20:55:05] [INFO ] Deduced a trap composed of 195 places in 172 ms of which 1 ms to minimize.
[2021-05-16 20:55:05] [INFO ] Deduced a trap composed of 145 places in 160 ms of which 1 ms to minimize.
[2021-05-16 20:55:05] [INFO ] Deduced a trap composed of 132 places in 152 ms of which 0 ms to minimize.
[2021-05-16 20:55:06] [INFO ] Deduced a trap composed of 105 places in 138 ms of which 1 ms to minimize.
[2021-05-16 20:55:06] [INFO ] Deduced a trap composed of 108 places in 155 ms of which 0 ms to minimize.
[2021-05-16 20:55:06] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 1 ms to minimize.
[2021-05-16 20:55:06] [INFO ] Deduced a trap composed of 96 places in 166 ms of which 1 ms to minimize.
[2021-05-16 20:55:06] [INFO ] Deduced a trap composed of 84 places in 151 ms of which 1 ms to minimize.
[2021-05-16 20:55:06] [INFO ] Deduced a trap composed of 137 places in 152 ms of which 0 ms to minimize.
[2021-05-16 20:55:07] [INFO ] Deduced a trap composed of 102 places in 158 ms of which 1 ms to minimize.
[2021-05-16 20:55:07] [INFO ] Deduced a trap composed of 105 places in 162 ms of which 0 ms to minimize.
[2021-05-16 20:55:07] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 1 ms to minimize.
[2021-05-16 20:55:07] [INFO ] Deduced a trap composed of 105 places in 182 ms of which 1 ms to minimize.
[2021-05-16 20:55:07] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 429 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 429/429 places, 953/953 transitions.
Applied a total of 0 rules in 16 ms. Remains 429 /429 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2021-05-16 20:55:07] [INFO ] Flow matrix only has 937 transitions (discarded 16 similar events)
// Phase 1: matrix 937 rows 429 cols
[2021-05-16 20:55:07] [INFO ] Computed 44 place invariants in 11 ms
[2021-05-16 20:55:08] [INFO ] Dead Transitions using invariants and state equation in 588 ms returned []
Finished structural reductions, in 1 iterations. Remains : 429/429 places, 953/953 transitions.
Normalized transition count is 937 out of 953 initially.
// Phase 1: matrix 937 rows 429 cols
[2021-05-16 20:55:08] [INFO ] Computed 44 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 425 resets, run finished after 3057 ms. (steps per millisecond=327 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 980 ms. (steps per millisecond=1020 ) properties (out of 1) seen :1
[2021-05-16 20:55:12] [INFO ] Flow matrix only has 937 transitions (discarded 16 similar events)
// Phase 1: matrix 937 rows 429 cols
[2021-05-16 20:55:12] [INFO ] Computed 44 place invariants in 16 ms
[2021-05-16 20:55:12] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2021-05-16 20:55:12] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 12 ms returned sat
[2021-05-16 20:55:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:55:13] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2021-05-16 20:55:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:55:13] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2021-05-16 20:55:13] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 9 ms returned sat
[2021-05-16 20:55:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:55:13] [INFO ] [Nat]Absence check using state equation in 817 ms returned sat
[2021-05-16 20:55:13] [INFO ] State equation strengthened by 104 read => feed constraints.
[2021-05-16 20:55:14] [INFO ] [Nat]Added 104 Read/Feed constraints in 219 ms returned sat
[2021-05-16 20:55:14] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 0 ms to minimize.
[2021-05-16 20:55:14] [INFO ] Deduced a trap composed of 84 places in 186 ms of which 0 ms to minimize.
[2021-05-16 20:55:14] [INFO ] Deduced a trap composed of 119 places in 156 ms of which 1 ms to minimize.
[2021-05-16 20:55:14] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 1 ms to minimize.
[2021-05-16 20:55:15] [INFO ] Deduced a trap composed of 53 places in 155 ms of which 1 ms to minimize.
[2021-05-16 20:55:15] [INFO ] Deduced a trap composed of 121 places in 160 ms of which 0 ms to minimize.
[2021-05-16 20:55:15] [INFO ] Deduced a trap composed of 165 places in 152 ms of which 1 ms to minimize.
[2021-05-16 20:55:15] [INFO ] Deduced a trap composed of 101 places in 156 ms of which 1 ms to minimize.
[2021-05-16 20:55:15] [INFO ] Deduced a trap composed of 195 places in 139 ms of which 1 ms to minimize.
[2021-05-16 20:55:16] [INFO ] Deduced a trap composed of 145 places in 148 ms of which 1 ms to minimize.
[2021-05-16 20:55:16] [INFO ] Deduced a trap composed of 132 places in 139 ms of which 1 ms to minimize.
[2021-05-16 20:55:16] [INFO ] Deduced a trap composed of 105 places in 128 ms of which 1 ms to minimize.
[2021-05-16 20:55:16] [INFO ] Deduced a trap composed of 108 places in 138 ms of which 0 ms to minimize.
[2021-05-16 20:55:16] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 0 ms to minimize.
[2021-05-16 20:55:16] [INFO ] Deduced a trap composed of 96 places in 148 ms of which 2 ms to minimize.
[2021-05-16 20:55:17] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 1 ms to minimize.
[2021-05-16 20:55:17] [INFO ] Deduced a trap composed of 137 places in 147 ms of which 0 ms to minimize.
[2021-05-16 20:55:17] [INFO ] Deduced a trap composed of 102 places in 145 ms of which 1 ms to minimize.
[2021-05-16 20:55:17] [INFO ] Deduced a trap composed of 105 places in 144 ms of which 1 ms to minimize.
[2021-05-16 20:55:17] [INFO ] Deduced a trap composed of 43 places in 24 ms of which 0 ms to minimize.
[2021-05-16 20:55:18] [INFO ] Deduced a trap composed of 105 places in 141 ms of which 1 ms to minimize.
[2021-05-16 20:55:18] [INFO ] Deduced a trap composed of 85 places in 148 ms of which 1 ms to minimize.
[2021-05-16 20:55:18] [INFO ] Deduced a trap composed of 80 places in 122 ms of which 1 ms to minimize.
[2021-05-16 20:55:18] [INFO ] Deduced a trap composed of 116 places in 164 ms of which 0 ms to minimize.
[2021-05-16 20:55:18] [INFO ] Deduced a trap composed of 185 places in 146 ms of which 0 ms to minimize.
[2021-05-16 20:55:19] [INFO ] Deduced a trap composed of 108 places in 145 ms of which 0 ms to minimize.
[2021-05-16 20:55:19] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 1 ms to minimize.
[2021-05-16 20:55:19] [INFO ] Deduced a trap composed of 86 places in 140 ms of which 1 ms to minimize.
[2021-05-16 20:55:19] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 1 ms to minimize.
[2021-05-16 20:55:19] [INFO ] Deduced a trap composed of 42 places in 20 ms of which 0 ms to minimize.
[2021-05-16 20:55:19] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 0 ms to minimize.
[2021-05-16 20:55:19] [INFO ] Deduced a trap composed of 43 places in 14 ms of which 0 ms to minimize.
[2021-05-16 20:55:20] [INFO ] Deduced a trap composed of 154 places in 184 ms of which 1 ms to minimize.
[2021-05-16 20:55:20] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 0 ms to minimize.
[2021-05-16 20:55:20] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 1 ms to minimize.
[2021-05-16 20:55:20] [INFO ] Deduced a trap composed of 59 places in 141 ms of which 0 ms to minimize.
[2021-05-16 20:55:20] [INFO ] Deduced a trap composed of 167 places in 148 ms of which 1 ms to minimize.
[2021-05-16 20:55:21] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 1 ms to minimize.
[2021-05-16 20:55:21] [INFO ] Deduced a trap composed of 86 places in 140 ms of which 0 ms to minimize.
[2021-05-16 20:55:21] [INFO ] Deduced a trap composed of 158 places in 148 ms of which 0 ms to minimize.
[2021-05-16 20:55:21] [INFO ] Deduced a trap composed of 196 places in 147 ms of which 0 ms to minimize.
[2021-05-16 20:55:21] [INFO ] Deduced a trap composed of 174 places in 139 ms of which 1 ms to minimize.
[2021-05-16 20:55:22] [INFO ] Deduced a trap composed of 187 places in 144 ms of which 0 ms to minimize.
[2021-05-16 20:55:22] [INFO ] Deduced a trap composed of 184 places in 141 ms of which 0 ms to minimize.
[2021-05-16 20:55:22] [INFO ] Deduced a trap composed of 157 places in 142 ms of which 0 ms to minimize.
[2021-05-16 20:55:22] [INFO ] Deduced a trap composed of 200 places in 156 ms of which 0 ms to minimize.
[2021-05-16 20:55:22] [INFO ] Deduced a trap composed of 89 places in 145 ms of which 0 ms to minimize.
[2021-05-16 20:55:23] [INFO ] Deduced a trap composed of 91 places in 142 ms of which 1 ms to minimize.
[2021-05-16 20:55:23] [INFO ] Deduced a trap composed of 123 places in 140 ms of which 0 ms to minimize.
[2021-05-16 20:55:23] [INFO ] Deduced a trap composed of 80 places in 147 ms of which 0 ms to minimize.
[2021-05-16 20:55:23] [INFO ] Deduced a trap composed of 171 places in 147 ms of which 0 ms to minimize.
[2021-05-16 20:55:23] [INFO ] Deduced a trap composed of 107 places in 147 ms of which 0 ms to minimize.
[2021-05-16 20:55:24] [INFO ] Deduced a trap composed of 154 places in 150 ms of which 0 ms to minimize.
[2021-05-16 20:55:24] [INFO ] Deduced a trap composed of 168 places in 143 ms of which 1 ms to minimize.
[2021-05-16 20:55:24] [INFO ] Deduced a trap composed of 193 places in 146 ms of which 0 ms to minimize.
[2021-05-16 20:55:24] [INFO ] Deduced a trap composed of 163 places in 147 ms of which 1 ms to minimize.
[2021-05-16 20:55:24] [INFO ] Deduced a trap composed of 53 places in 149 ms of which 0 ms to minimize.
[2021-05-16 20:55:25] [INFO ] Deduced a trap composed of 77 places in 142 ms of which 0 ms to minimize.
[2021-05-16 20:55:25] [INFO ] Deduced a trap composed of 92 places in 142 ms of which 1 ms to minimize.
[2021-05-16 20:55:25] [INFO ] Deduced a trap composed of 104 places in 146 ms of which 1 ms to minimize.
[2021-05-16 20:55:26] [INFO ] Deduced a trap composed of 81 places in 142 ms of which 1 ms to minimize.
[2021-05-16 20:55:26] [INFO ] Deduced a trap composed of 134 places in 141 ms of which 0 ms to minimize.
[2021-05-16 20:55:26] [INFO ] Deduced a trap composed of 80 places in 138 ms of which 0 ms to minimize.
[2021-05-16 20:55:27] [INFO ] Deduced a trap composed of 87 places in 146 ms of which 1 ms to minimize.
[2021-05-16 20:55:27] [INFO ] Deduced a trap composed of 92 places in 161 ms of which 0 ms to minimize.
[2021-05-16 20:55:27] [INFO ] Trap strengthening (SAT) tested/added 66/65 trap constraints in 13107 ms
[2021-05-16 20:55:27] [INFO ] Computed and/alt/rep : 420/1473/412 causal constraints (skipped 523 transitions) in 46 ms.
[2021-05-16 20:55:30] [INFO ] Deduced a trap composed of 104 places in 141 ms of which 0 ms to minimize.
[2021-05-16 20:55:30] [INFO ] Deduced a trap composed of 114 places in 139 ms of which 1 ms to minimize.
[2021-05-16 20:55:31] [INFO ] Deduced a trap composed of 102 places in 137 ms of which 0 ms to minimize.
[2021-05-16 20:55:31] [INFO ] Deduced a trap composed of 109 places in 139 ms of which 0 ms to minimize.
[2021-05-16 20:55:31] [INFO ] Deduced a trap composed of 165 places in 134 ms of which 1 ms to minimize.
[2021-05-16 20:55:31] [INFO ] Deduced a trap composed of 139 places in 140 ms of which 1 ms to minimize.
[2021-05-16 20:55:31] [INFO ] Deduced a trap composed of 177 places in 116 ms of which 0 ms to minimize.
[2021-05-16 20:55:32] [INFO ] Deduced a trap composed of 198 places in 133 ms of which 0 ms to minimize.
[2021-05-16 20:55:32] [INFO ] Deduced a trap composed of 197 places in 137 ms of which 0 ms to minimize.
[2021-05-16 20:55:32] [INFO ] Deduced a trap composed of 81 places in 136 ms of which 1 ms to minimize.
[2021-05-16 20:55:32] [INFO ] Deduced a trap composed of 84 places in 137 ms of which 0 ms to minimize.
[2021-05-16 20:55:32] [INFO ] Deduced a trap composed of 107 places in 133 ms of which 0 ms to minimize.
[2021-05-16 20:55:33] [INFO ] Deduced a trap composed of 149 places in 126 ms of which 0 ms to minimize.
[2021-05-16 20:55:33] [INFO ] Deduced a trap composed of 109 places in 119 ms of which 0 ms to minimize.
[2021-05-16 20:55:33] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 0 ms to minimize.
[2021-05-16 20:55:33] [INFO ] Deduced a trap composed of 110 places in 116 ms of which 1 ms to minimize.
[2021-05-16 20:55:33] [INFO ] Deduced a trap composed of 103 places in 173 ms of which 1 ms to minimize.
[2021-05-16 20:55:34] [INFO ] Deduced a trap composed of 108 places in 142 ms of which 1 ms to minimize.
[2021-05-16 20:55:34] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3891 ms
[2021-05-16 20:55:34] [INFO ] Added : 303 causal constraints over 62 iterations in 7118 ms. Result :sat
Minimization took 949 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 266000 steps, including 1000 resets, run finished after 856 ms. (steps per millisecond=310 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 429 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 429/429 places, 953/953 transitions.
Applied a total of 0 rules in 13 ms. Remains 429 /429 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 429/429 places, 953/953 transitions.
Starting structural reductions, iteration 0 : 429/429 places, 953/953 transitions.
Applied a total of 0 rules in 12 ms. Remains 429 /429 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2021-05-16 20:55:36] [INFO ] Flow matrix only has 937 transitions (discarded 16 similar events)
// Phase 1: matrix 937 rows 429 cols
[2021-05-16 20:55:36] [INFO ] Computed 44 place invariants in 31 ms
[2021-05-16 20:55:36] [INFO ] Implicit Places using invariants in 493 ms returned []
[2021-05-16 20:55:36] [INFO ] Flow matrix only has 937 transitions (discarded 16 similar events)
// Phase 1: matrix 937 rows 429 cols
[2021-05-16 20:55:36] [INFO ] Computed 44 place invariants in 16 ms
[2021-05-16 20:55:37] [INFO ] State equation strengthened by 104 read => feed constraints.
[2021-05-16 20:55:48] [INFO ] Implicit Places using invariants and state equation in 11296 ms returned []
Implicit Place search using SMT with State Equation took 11790 ms to find 0 implicit places.
[2021-05-16 20:55:48] [INFO ] Redundant transitions in 10 ms returned []
[2021-05-16 20:55:48] [INFO ] Flow matrix only has 937 transitions (discarded 16 similar events)
// Phase 1: matrix 937 rows 429 cols
[2021-05-16 20:55:48] [INFO ] Computed 44 place invariants in 10 ms
[2021-05-16 20:55:48] [INFO ] Dead Transitions using invariants and state equation in 548 ms returned []
Finished structural reductions, in 1 iterations. Remains : 429/429 places, 953/953 transitions.
Ending property specific reduction for PolyORBLF-PT-S02J06T08-UpperBounds-12 in 46719 ms.
[2021-05-16 20:55:48] [INFO ] Flatten gal took : 130 ms
[2021-05-16 20:55:49] [INFO ] Applying decomposition
[2021-05-16 20:55:49] [INFO ] Flatten gal took : 78 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17345035919664304222.txt, -o, /tmp/graph17345035919664304222.bin, -w, /tmp/graph17345035919664304222.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17345035919664304222.bin, -l, -1, -v, -w, /tmp/graph17345035919664304222.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 20:55:49] [INFO ] Decomposing Gal with order
[2021-05-16 20:55:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 20:55:49] [INFO ] Removed a total of 945 redundant transitions.
[2021-05-16 20:55:49] [INFO ] Flatten gal took : 422 ms
[2021-05-16 20:55:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 537 labels/synchronizations in 75 ms.
[2021-05-16 20:55:50] [INFO ] Time to serialize gal into /tmp/UpperBounds5097305156195238789.gal : 49 ms
[2021-05-16 20:55:50] [INFO ] Time to serialize properties into /tmp/UpperBounds12429505601192937363.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds5097305156195238789.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds12429505601192937363.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds5097305156195238789.gal -t CGAL -reachable-file /tmp/UpperBounds12429505601192937363.prop --nowitness
Loading property file /tmp/UpperBounds12429505601192937363.prop.
Detected timeout of ITS tools.
[2021-05-16 21:17:01] [INFO ] Flatten gal took : 97 ms
[2021-05-16 21:17:01] [INFO ] Time to serialize gal into /tmp/UpperBounds5879180091842695690.gal : 19 ms
[2021-05-16 21:17:01] [INFO ] Time to serialize properties into /tmp/UpperBounds11007460948513871216.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds5879180091842695690.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds11007460948513871216.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds5879180091842695690.gal -t CGAL -reachable-file /tmp/UpperBounds11007460948513871216.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds11007460948513871216.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.22908e+08,721.463,12829300,2,968037,5,1.04995e+07,6,0,2681,1.35855e+07,0
Total reachable state count : 222907584

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property PolyORBLF-PT-S02J06T08-UpperBounds-12 :0 <= RunB_5 <= 1
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-12 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBLF-PT-S02J06T08-UpperBounds-12,0,721.621,12829300,1,0,7,1.04995e+07,9,1,3129,1.35855e+07,4

BK_STOP 1621200544783

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-S02J06T08"
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-4028"
echo " Executing tool itstools"
echo " Input is PolyORBLF-PT-S02J06T08, 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 r159-oct2-162089268100251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J06T08.tgz
mv PolyORBLF-PT-S02J06T08 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;