About the Execution of 2022-gold for PolyORBNT-PT-S10J60
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16217.323 | 3600000.00 | 2499262.00 | 724072.60 | ? 1 1 1 ? 2 1 1 1 1 1 1 1 1 1 10 | 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-167873970000098.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 PolyORBNT-PT-S10J60, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r319-tall-167873970000098
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 19M
-rw-r--r-- 1 mcc users 64K Feb 26 00:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 276K Feb 26 00:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 518K Feb 26 00:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.0M Feb 26 00:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 36K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 120K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 53K Feb 26 01:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 254K Feb 26 01:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 300K Feb 26 01:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 981K Feb 26 01:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 14M 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 PolyORBNT-PT-S10J60-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678880343497
Running Version 202205111006
[2023-03-15 11:39:04] [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 11:39:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 11:39:05] [INFO ] Load time of PNML (sax parser for PT used): 708 ms
[2023-03-15 11:39:05] [INFO ] Transformed 1234 places.
[2023-03-15 11:39:05] [INFO ] Transformed 12920 transitions.
[2023-03-15 11:39:05] [INFO ] Parsed PT model containing 1234 places and 12920 transitions in 933 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Normalized transition count is 2801 out of 2810 initially.
// Phase 1: matrix 2801 rows 1234 cols
[2023-03-15 11:39:05] [INFO ] Computed 152 place invariants in 289 ms
Incomplete random walk after 10000 steps, including 560 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 16) seen :20
FORMULA PolyORBNT-PT-S10J60-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-15 11:39:07] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1234 cols
[2023-03-15 11:39:07] [INFO ] Computed 152 place invariants in 131 ms
[2023-03-15 11:39:07] [INFO ] [Real]Absence check using 121 positive place invariants in 36 ms returned sat
[2023-03-15 11:39:07] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 42 ms returned sat
[2023-03-15 11:39:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:39:08] [INFO ] [Real]Absence check using state equation in 796 ms returned sat
[2023-03-15 11:39:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:39:09] [INFO ] [Nat]Absence check using 121 positive place invariants in 29 ms returned sat
[2023-03-15 11:39:09] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 48 ms returned sat
[2023-03-15 11:39:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:39:14] [INFO ] [Nat]Absence check using state equation in 4807 ms returned unknown
[2023-03-15 11:39:14] [INFO ] [Real]Absence check using 121 positive place invariants in 33 ms returned sat
[2023-03-15 11:39:14] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 33 ms returned unsat
[2023-03-15 11:39:14] [INFO ] [Real]Absence check using 121 positive place invariants in 29 ms returned sat
[2023-03-15 11:39:14] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 39 ms returned sat
[2023-03-15 11:39:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:39:15] [INFO ] [Real]Absence check using state equation in 791 ms returned sat
[2023-03-15 11:39:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:39:15] [INFO ] [Nat]Absence check using 121 positive place invariants in 34 ms returned sat
[2023-03-15 11:39:15] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 53 ms returned sat
[2023-03-15 11:39:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:39:20] [INFO ] [Nat]Absence check using state equation in 4819 ms returned unknown
[2023-03-15 11:39:20] [INFO ] [Real]Absence check using 121 positive place invariants in 31 ms returned sat
[2023-03-15 11:39:20] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 41 ms returned sat
[2023-03-15 11:39:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:39:23] [INFO ] [Real]Absence check using state equation in 2082 ms returned sat
[2023-03-15 11:39:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:39:23] [INFO ] [Nat]Absence check using 121 positive place invariants in 43 ms returned sat
[2023-03-15 11:39:23] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 43 ms returned sat
[2023-03-15 11:39:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:39:24] [INFO ] [Nat]Absence check using state equation in 1129 ms returned sat
[2023-03-15 11:39:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:39:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 191 ms returned sat
[2023-03-15 11:39:25] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 316 ms.
[2023-03-15 11:39:28] [INFO ] Deduced a trap composed of 630 places in 770 ms of which 4 ms to minimize.
[2023-03-15 11:39: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 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
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: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 11:39:28] [INFO ] [Real]Absence check using 121 positive place invariants in 27 ms returned sat
[2023-03-15 11:39:28] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 38 ms returned sat
[2023-03-15 11:39:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:39:29] [INFO ] [Real]Absence check using state equation in 848 ms returned sat
[2023-03-15 11:39:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:39:29] [INFO ] [Nat]Absence check using 121 positive place invariants in 31 ms returned sat
[2023-03-15 11:39:29] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 38 ms returned sat
[2023-03-15 11:39:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:39:33] [INFO ] [Nat]Absence check using state equation in 3082 ms returned sat
[2023-03-15 11:39:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 819 ms returned sat
[2023-03-15 11:39:34] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 210 ms.
[2023-03-15 11:39:34] [INFO ] Added : 15 causal constraints over 3 iterations in 820 ms. Result :unknown
[2023-03-15 11:39:34] [INFO ] [Real]Absence check using 121 positive place invariants in 29 ms returned sat
[2023-03-15 11:39:34] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 33 ms returned unsat
[2023-03-15 11:39:35] [INFO ] [Real]Absence check using 121 positive place invariants in 30 ms returned sat
[2023-03-15 11:39:35] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 32 ms returned unsat
[2023-03-15 11:39:35] [INFO ] [Real]Absence check using 121 positive place invariants in 31 ms returned sat
[2023-03-15 11:39:35] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 33 ms returned unsat
[2023-03-15 11:39:35] [INFO ] [Real]Absence check using 121 positive place invariants in 30 ms returned sat
[2023-03-15 11:39:35] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 32 ms returned unsat
[2023-03-15 11:39:35] [INFO ] [Real]Absence check using 121 positive place invariants in 32 ms returned sat
[2023-03-15 11:39:35] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 40 ms returned sat
[2023-03-15 11:39:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:39:38] [INFO ] [Real]Absence check using state equation in 2430 ms returned sat
[2023-03-15 11:39:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:39:38] [INFO ] [Nat]Absence check using 121 positive place invariants in 32 ms returned sat
[2023-03-15 11:39:38] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 57 ms returned sat
[2023-03-15 11:39:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:39:41] [INFO ] [Nat]Absence check using state equation in 2660 ms returned sat
[2023-03-15 11:39:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 309 ms returned sat
[2023-03-15 11:39:41] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 230 ms.
[2023-03-15 11:39:43] [INFO ] Added : 15 causal constraints over 3 iterations in 1724 ms. Result :unknown
[2023-03-15 11:39:43] [INFO ] [Real]Absence check using 121 positive place invariants in 30 ms returned sat
[2023-03-15 11:39:43] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 41 ms returned sat
[2023-03-15 11:39:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:39:47] [INFO ] [Real]Absence check using state equation in 4392 ms returned sat
[2023-03-15 11:39:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:39:48] [INFO ] [Nat]Absence check using 121 positive place invariants in 32 ms returned sat
[2023-03-15 11:39:48] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 45 ms returned sat
[2023-03-15 11:39:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:39:49] [INFO ] [Nat]Absence check using state equation in 980 ms returned sat
[2023-03-15 11:39:53] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 11:39:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 3837 ms returned unknown
[2023-03-15 11:39:53] [INFO ] [Real]Absence check using 121 positive place invariants in 31 ms returned sat
[2023-03-15 11:39:53] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 33 ms returned unsat
[2023-03-15 11:39:53] [INFO ] [Real]Absence check using 121 positive place invariants in 29 ms returned sat
[2023-03-15 11:39:53] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 45 ms returned sat
[2023-03-15 11:39:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:39:56] [INFO ] [Real]Absence check using state equation in 2730 ms returned sat
[2023-03-15 11:39:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:39:56] [INFO ] [Nat]Absence check using 121 positive place invariants in 29 ms returned sat
[2023-03-15 11:39:56] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 40 ms returned sat
[2023-03-15 11:39:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:40:00] [INFO ] [Nat]Absence check using state equation in 4176 ms returned sat
[2023-03-15 11:40:01] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 11:40:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 665 ms returned unknown
[2023-03-15 11:40:01] [INFO ] [Real]Absence check using 121 positive place invariants in 29 ms returned sat
[2023-03-15 11:40:01] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 41 ms returned sat
[2023-03-15 11:40:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:40:02] [INFO ] [Real]Absence check using state equation in 724 ms returned unsat
Current structural bounds on expressions (after SMT) : [523, 1, 523, 2, 70, 1, 1, 1, 1, 10, 1, 1, 1, 10] Max seen :[1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 10]
FORMULA PolyORBNT-PT-S10J60-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 7 out of 1234 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 1224 transition count 2746
Reduce places removed 64 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 139 place count 1160 transition count 2745
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 140 place count 1159 transition count 2745
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 140 place count 1159 transition count 2682
Deduced a syphon composed of 63 places in 2 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 266 place count 1096 transition count 2682
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 267 place count 1095 transition count 2681
Iterating global reduction 3 with 1 rules applied. Total rules applied 268 place count 1095 transition count 2681
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 272 place count 1093 transition count 2679
Applied a total of 272 rules in 1288 ms. Remains 1093 /1234 variables (removed 141) and now considering 2679/2810 (removed 131) transitions.
[2023-03-15 11:40:03] [INFO ] Flow matrix only has 2670 transitions (discarded 9 similar events)
// Phase 1: matrix 2670 rows 1093 cols
[2023-03-15 11:40:03] [INFO ] Computed 142 place invariants in 67 ms
[2023-03-15 11:40:05] [INFO ] Dead Transitions using invariants and state equation in 2286 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 1093/1234 places, 2064/2810 transitions.
Applied a total of 0 rules in 100 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1093/1234 places, 2064/2810 transitions.
Normalized transition count is 2055 out of 2064 initially.
// Phase 1: matrix 2055 rows 1093 cols
[2023-03-15 11:40:05] [INFO ] Computed 142 place invariants in 91 ms
Incomplete random walk after 1000000 steps, including 70204 resets, run finished after 10577 ms. (steps per millisecond=94 ) properties (out of 7) seen :12
FORMULA PolyORBNT-PT-S10J60-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 7242 resets, run finished after 2032 ms. (steps per millisecond=492 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000001 steps, including 7106 resets, run finished after 1960 ms. (steps per millisecond=510 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000001 steps, including 7250 resets, run finished after 1978 ms. (steps per millisecond=505 ) properties (out of 3) seen :7
[2023-03-15 11:40:22] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2023-03-15 11:40:22] [INFO ] Computed 142 place invariants in 64 ms
[2023-03-15 11:40:22] [INFO ] [Real]Absence check using 122 positive place invariants in 27 ms returned sat
[2023-03-15 11:40:22] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 28 ms returned sat
[2023-03-15 11:40:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:40:23] [INFO ] [Real]Absence check using state equation in 1152 ms returned sat
[2023-03-15 11:40:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:40:24] [INFO ] [Nat]Absence check using 122 positive place invariants in 27 ms returned sat
[2023-03-15 11:40:24] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 28 ms returned sat
[2023-03-15 11:40:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:40:24] [INFO ] [Nat]Absence check using state equation in 624 ms returned sat
[2023-03-15 11:40:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:40:27] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 11:40:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 3570 ms returned sat
[2023-03-15 11:40:28] [INFO ] Deduced a trap composed of 440 places in 512 ms of which 2 ms to minimize.
[2023-03-15 11:40:29] [INFO ] Deduced a trap composed of 446 places in 518 ms of which 1 ms to minimize.
[2023-03-15 11:40:30] [INFO ] Deduced a trap composed of 450 places in 517 ms of which 8 ms to minimize.
[2023-03-15 11:40:30] [INFO ] Deduced a trap composed of 441 places in 569 ms of which 9 ms to minimize.
[2023-03-15 11:40:31] [INFO ] Deduced a trap composed of 447 places in 464 ms of which 1 ms to minimize.
[2023-03-15 11:40:31] [INFO ] Deduced a trap composed of 429 places in 479 ms of which 1 ms to minimize.
[2023-03-15 11:40:32] [INFO ] Deduced a trap composed of 426 places in 483 ms of which 2 ms to minimize.
[2023-03-15 11:40:32] [INFO ] Deduced a trap composed of 451 places in 479 ms of which 1 ms to minimize.
[2023-03-15 11:40:33] [INFO ] Deduced a trap composed of 428 places in 479 ms of which 1 ms to minimize.
[2023-03-15 11:40:34] [INFO ] Deduced a trap composed of 451 places in 509 ms of which 1 ms to minimize.
[2023-03-15 11:40:34] [INFO ] Deduced a trap composed of 434 places in 472 ms of which 1 ms to minimize.
[2023-03-15 11:40:35] [INFO ] Deduced a trap composed of 442 places in 466 ms of which 1 ms to minimize.
[2023-03-15 11:40:35] [INFO ] Deduced a trap composed of 447 places in 469 ms of which 1 ms to minimize.
[2023-03-15 11:40:36] [INFO ] Deduced a trap composed of 432 places in 478 ms of which 1 ms to minimize.
[2023-03-15 11:40:37] [INFO ] Deduced a trap composed of 448 places in 490 ms of which 1 ms to minimize.
[2023-03-15 11:40:37] [INFO ] Deduced a trap composed of 433 places in 484 ms of which 0 ms to minimize.
[2023-03-15 11:40:38] [INFO ] Deduced a trap composed of 440 places in 465 ms of which 1 ms to minimize.
[2023-03-15 11:40:38] [INFO ] Deduced a trap composed of 461 places in 487 ms of which 1 ms to minimize.
[2023-03-15 11:40:39] [INFO ] Deduced a trap composed of 439 places in 471 ms of which 1 ms to minimize.
[2023-03-15 11:40:39] [INFO ] Deduced a trap composed of 436 places in 486 ms of which 1 ms to minimize.
[2023-03-15 11:40:40] [INFO ] Deduced a trap composed of 456 places in 474 ms of which 1 ms to minimize.
[2023-03-15 11:40:41] [INFO ] Deduced a trap composed of 457 places in 471 ms of which 0 ms to minimize.
[2023-03-15 11:40:41] [INFO ] Deduced a trap composed of 442 places in 476 ms of which 1 ms to minimize.
[2023-03-15 11:40:42] [INFO ] Deduced a trap composed of 452 places in 481 ms of which 1 ms to minimize.
[2023-03-15 11:40:42] [INFO ] Deduced a trap composed of 455 places in 464 ms of which 0 ms to minimize.
[2023-03-15 11:40:43] [INFO ] Deduced a trap composed of 453 places in 465 ms of which 1 ms to minimize.
[2023-03-15 11:40:43] [INFO ] Deduced a trap composed of 436 places in 469 ms of which 1 ms to minimize.
[2023-03-15 11:40:44] [INFO ] Deduced a trap composed of 447 places in 468 ms of which 1 ms to minimize.
[2023-03-15 11:40:45] [INFO ] Deduced a trap composed of 457 places in 479 ms of which 0 ms to minimize.
[2023-03-15 11:40:45] [INFO ] Deduced a trap composed of 439 places in 485 ms of which 1 ms to minimize.
[2023-03-15 11:40:46] [INFO ] Deduced a trap composed of 431 places in 467 ms of which 0 ms to minimize.
[2023-03-15 11:40:46] [INFO ] Deduced a trap composed of 437 places in 483 ms of which 1 ms to minimize.
[2023-03-15 11:40:47] [INFO ] Deduced a trap composed of 437 places in 478 ms of which 2 ms to minimize.
[2023-03-15 11:40:47] [INFO ] Deduced a trap composed of 451 places in 472 ms of which 1 ms to minimize.
[2023-03-15 11:40:48] [INFO ] Deduced a trap composed of 451 places in 481 ms of which 1 ms to minimize.
[2023-03-15 11:40:49] [INFO ] Deduced a trap composed of 444 places in 480 ms of which 1 ms to minimize.
[2023-03-15 11:40:49] [INFO ] Deduced a trap composed of 445 places in 478 ms of which 1 ms to minimize.
[2023-03-15 11:40:50] [INFO ] Deduced a trap composed of 430 places in 487 ms of which 1 ms to minimize.
[2023-03-15 11:40:50] [INFO ] Deduced a trap composed of 432 places in 479 ms of which 1 ms to minimize.
[2023-03-15 11:40:52] [INFO ] Deduced a trap composed of 430 places in 496 ms of which 1 ms to minimize.
[2023-03-15 11:40:53] [INFO ] Deduced a trap composed of 436 places in 469 ms of which 1 ms to minimize.
[2023-03-15 11:40:55] [INFO ] Deduced a trap composed of 446 places in 479 ms of which 1 ms to minimize.
[2023-03-15 11:40:55] [INFO ] Deduced a trap composed of 430 places in 479 ms of which 1 ms to minimize.
[2023-03-15 11:40:56] [INFO ] Deduced a trap composed of 458 places in 505 ms of which 1 ms to minimize.
[2023-03-15 11:40:57] [INFO ] Deduced a trap composed of 442 places in 514 ms of which 0 ms to minimize.
[2023-03-15 11:40:57] [INFO ] Deduced a trap composed of 454 places in 472 ms of which 1 ms to minimize.
[2023-03-15 11:40:58] [INFO ] Deduced a trap composed of 442 places in 486 ms of which 1 ms to minimize.
[2023-03-15 11:40:59] [INFO ] Deduced a trap composed of 456 places in 484 ms of which 1 ms to minimize.
[2023-03-15 11:40:59] [INFO ] Deduced a trap composed of 459 places in 481 ms of which 1 ms to minimize.
[2023-03-15 11:41:00] [INFO ] Deduced a trap composed of 455 places in 498 ms of which 1 ms to minimize.
[2023-03-15 11:41:00] [INFO ] Deduced a trap composed of 451 places in 487 ms of which 1 ms to minimize.
[2023-03-15 11:41:01] [INFO ] Deduced a trap composed of 432 places in 507 ms of which 1 ms to minimize.
[2023-03-15 11:41:02] [INFO ] Deduced a trap composed of 458 places in 496 ms of which 1 ms to minimize.
[2023-03-15 11:41:02] [INFO ] Deduced a trap composed of 454 places in 482 ms of which 1 ms to minimize.
[2023-03-15 11:41:03] [INFO ] Deduced a trap composed of 466 places in 503 ms of which 1 ms to minimize.
[2023-03-15 11:41:04] [INFO ] Deduced a trap composed of 450 places in 501 ms of which 1 ms to minimize.
[2023-03-15 11:41:04] [INFO ] Deduced a trap composed of 444 places in 485 ms of which 1 ms to minimize.
[2023-03-15 11:41:07] [INFO ] Trap strengthening (SAT) tested/added 57/57 trap constraints in 39342 ms
[2023-03-15 11:41:07] [INFO ] [Real]Absence check using 122 positive place invariants in 25 ms returned sat
[2023-03-15 11:41:07] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 29 ms returned sat
[2023-03-15 11:41:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:41:08] [INFO ] [Real]Absence check using state equation in 1138 ms returned sat
[2023-03-15 11:41:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:41:09] [INFO ] [Nat]Absence check using 122 positive place invariants in 27 ms returned sat
[2023-03-15 11:41:09] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 27 ms returned sat
[2023-03-15 11:41:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:41:54] [INFO ] [Nat]Absence check using state equation in 44866 ms returned unknown
[2023-03-15 11:41:54] [INFO ] [Real]Absence check using 122 positive place invariants in 26 ms returned sat
[2023-03-15 11:41:54] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 14 ms returned unsat
Current structural bounds on expressions (after SMT) : [118, 118, 1] Max seen :[3, 3, 1]
FORMULA PolyORBNT-PT-S10J60-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 1093 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1093 transition count 2063
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1092 transition count 2063
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1092 transition count 2062
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1091 transition count 2062
Applied a total of 4 rules in 110 ms. Remains 1091 /1093 variables (removed 2) and now considering 2062/2064 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1093 places, 2062/2064 transitions.
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 11:41:54] [INFO ] Computed 142 place invariants in 34 ms
Incomplete random walk after 1000000 steps, including 70274 resets, run finished after 9788 ms. (steps per millisecond=102 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 7212 resets, run finished after 1964 ms. (steps per millisecond=509 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 7011 resets, run finished after 1927 ms. (steps per millisecond=518 ) properties (out of 2) seen :4
[2023-03-15 11:42:08] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 11:42:08] [INFO ] Computed 142 place invariants in 38 ms
[2023-03-15 11:42:08] [INFO ] [Real]Absence check using 122 positive place invariants in 26 ms returned sat
[2023-03-15 11:42:08] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 26 ms returned sat
[2023-03-15 11:42:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:42:09] [INFO ] [Real]Absence check using state equation in 905 ms returned sat
[2023-03-15 11:42:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:42:09] [INFO ] [Nat]Absence check using 122 positive place invariants in 27 ms returned sat
[2023-03-15 11:42:09] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 24 ms returned sat
[2023-03-15 11:42:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:42:09] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2023-03-15 11:42:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:42:12] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 11:42:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 3855 ms returned sat
[2023-03-15 11:42:14] [INFO ] Deduced a trap composed of 448 places in 525 ms of which 1 ms to minimize.
[2023-03-15 11:42:15] [INFO ] Deduced a trap composed of 442 places in 501 ms of which 1 ms to minimize.
[2023-03-15 11:42:15] [INFO ] Deduced a trap composed of 442 places in 470 ms of which 1 ms to minimize.
[2023-03-15 11:42:16] [INFO ] Deduced a trap composed of 442 places in 476 ms of which 1 ms to minimize.
[2023-03-15 11:42:16] [INFO ] Deduced a trap composed of 477 places in 468 ms of which 1 ms to minimize.
[2023-03-15 11:42:17] [INFO ] Deduced a trap composed of 450 places in 467 ms of which 1 ms to minimize.
[2023-03-15 11:42:17] [INFO ] Deduced a trap composed of 444 places in 488 ms of which 1 ms to minimize.
[2023-03-15 11:42:18] [INFO ] Deduced a trap composed of 475 places in 476 ms of which 1 ms to minimize.
[2023-03-15 11:42:18] [INFO ] Deduced a trap composed of 470 places in 489 ms of which 1 ms to minimize.
[2023-03-15 11:42:19] [INFO ] Deduced a trap composed of 433 places in 480 ms of which 2 ms to minimize.
[2023-03-15 11:42:20] [INFO ] Deduced a trap composed of 454 places in 471 ms of which 1 ms to minimize.
[2023-03-15 11:42:20] [INFO ] Deduced a trap composed of 468 places in 490 ms of which 1 ms to minimize.
[2023-03-15 11:42:21] [INFO ] Deduced a trap composed of 464 places in 476 ms of which 1 ms to minimize.
[2023-03-15 11:42:22] [INFO ] Deduced a trap composed of 432 places in 474 ms of which 1 ms to minimize.
[2023-03-15 11:42:22] [INFO ] Deduced a trap composed of 447 places in 469 ms of which 1 ms to minimize.
[2023-03-15 11:42:23] [INFO ] Deduced a trap composed of 448 places in 469 ms of which 1 ms to minimize.
[2023-03-15 11:42:25] [INFO ] Deduced a trap composed of 444 places in 484 ms of which 1 ms to minimize.
[2023-03-15 11:42:25] [INFO ] Deduced a trap composed of 466 places in 470 ms of which 0 ms to minimize.
[2023-03-15 11:42:26] [INFO ] Deduced a trap composed of 432 places in 464 ms of which 1 ms to minimize.
[2023-03-15 11:42:26] [INFO ] Deduced a trap composed of 426 places in 450 ms of which 1 ms to minimize.
[2023-03-15 11:42:27] [INFO ] Deduced a trap composed of 426 places in 451 ms of which 1 ms to minimize.
[2023-03-15 11:42:27] [INFO ] Deduced a trap composed of 438 places in 466 ms of which 1 ms to minimize.
[2023-03-15 11:42:28] [INFO ] Deduced a trap composed of 453 places in 476 ms of which 1 ms to minimize.
[2023-03-15 11:42:29] [INFO ] Deduced a trap composed of 461 places in 472 ms of which 1 ms to minimize.
[2023-03-15 11:42:29] [INFO ] Deduced a trap composed of 434 places in 457 ms of which 1 ms to minimize.
[2023-03-15 11:42:30] [INFO ] Deduced a trap composed of 443 places in 465 ms of which 1 ms to minimize.
[2023-03-15 11:42:30] [INFO ] Deduced a trap composed of 447 places in 483 ms of which 0 ms to minimize.
[2023-03-15 11:42:31] [INFO ] Deduced a trap composed of 447 places in 478 ms of which 1 ms to minimize.
[2023-03-15 11:42:31] [INFO ] Deduced a trap composed of 434 places in 463 ms of which 1 ms to minimize.
[2023-03-15 11:42:32] [INFO ] Deduced a trap composed of 436 places in 465 ms of which 0 ms to minimize.
[2023-03-15 11:42:33] [INFO ] Deduced a trap composed of 430 places in 471 ms of which 1 ms to minimize.
[2023-03-15 11:42:33] [INFO ] Deduced a trap composed of 454 places in 461 ms of which 1 ms to minimize.
[2023-03-15 11:42:34] [INFO ] Deduced a trap composed of 428 places in 465 ms of which 0 ms to minimize.
[2023-03-15 11:42:35] [INFO ] Deduced a trap composed of 434 places in 484 ms of which 0 ms to minimize.
[2023-03-15 11:42:36] [INFO ] Deduced a trap composed of 454 places in 471 ms of which 1 ms to minimize.
[2023-03-15 11:42:36] [INFO ] Deduced a trap composed of 438 places in 459 ms of which 1 ms to minimize.
[2023-03-15 11:42:37] [INFO ] Deduced a trap composed of 456 places in 463 ms of which 1 ms to minimize.
[2023-03-15 11:42:38] [INFO ] Deduced a trap composed of 453 places in 457 ms of which 0 ms to minimize.
[2023-03-15 11:42:39] [INFO ] Deduced a trap composed of 442 places in 483 ms of which 0 ms to minimize.
[2023-03-15 11:42:40] [INFO ] Deduced a trap composed of 446 places in 470 ms of which 1 ms to minimize.
[2023-03-15 11:42:41] [INFO ] Deduced a trap composed of 430 places in 467 ms of which 1 ms to minimize.
[2023-03-15 11:42:42] [INFO ] Deduced a trap composed of 444 places in 454 ms of which 1 ms to minimize.
[2023-03-15 11:42:43] [INFO ] Deduced a trap composed of 481 places in 463 ms of which 0 ms to minimize.
[2023-03-15 11:42:43] [INFO ] Deduced a trap composed of 471 places in 466 ms of which 1 ms to minimize.
[2023-03-15 11:42:44] [INFO ] Deduced a trap composed of 454 places in 466 ms of which 1 ms to minimize.
[2023-03-15 11:42:45] [INFO ] Deduced a trap composed of 461 places in 467 ms of which 1 ms to minimize.
[2023-03-15 11:42:45] [INFO ] Deduced a trap composed of 469 places in 465 ms of which 1 ms to minimize.
[2023-03-15 11:42:47] [INFO ] Deduced a trap composed of 464 places in 475 ms of which 1 ms to minimize.
[2023-03-15 11:42:50] [INFO ] Deduced a trap composed of 456 places in 484 ms of which 1 ms to minimize.
[2023-03-15 11:42:50] [INFO ] Deduced a trap composed of 452 places in 477 ms of which 1 ms to minimize.
[2023-03-15 11:42:51] [INFO ] Deduced a trap composed of 432 places in 452 ms of which 1 ms to minimize.
[2023-03-15 11:42:52] [INFO ] Deduced a trap composed of 444 places in 462 ms of which 1 ms to minimize.
[2023-03-15 11:42:52] [INFO ] Deduced a trap composed of 445 places in 472 ms of which 1 ms to minimize.
[2023-03-15 11:42:53] [INFO ] Deduced a trap composed of 430 places in 459 ms of which 0 ms to minimize.
[2023-03-15 11:42:54] [INFO ] Trap strengthening (SAT) tested/added 54/54 trap constraints in 40465 ms
[2023-03-15 11:42:54] [INFO ] [Real]Absence check using 122 positive place invariants in 26 ms returned sat
[2023-03-15 11:42:54] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 25 ms returned sat
[2023-03-15 11:42:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:42:55] [INFO ] [Real]Absence check using state equation in 849 ms returned sat
[2023-03-15 11:42:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:42:55] [INFO ] [Nat]Absence check using 122 positive place invariants in 28 ms returned sat
[2023-03-15 11:42:55] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 23 ms returned sat
[2023-03-15 11:42:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:42:55] [INFO ] [Nat]Absence check using state equation in 558 ms returned sat
[2023-03-15 11:42:58] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 11:43:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 4205 ms returned sat
[2023-03-15 11:43:00] [INFO ] Deduced a trap composed of 455 places in 505 ms of which 1 ms to minimize.
[2023-03-15 11:43:01] [INFO ] Deduced a trap composed of 463 places in 488 ms of which 1 ms to minimize.
[2023-03-15 11:43:01] [INFO ] Deduced a trap composed of 438 places in 513 ms of which 1 ms to minimize.
[2023-03-15 11:43:02] [INFO ] Deduced a trap composed of 438 places in 487 ms of which 1 ms to minimize.
[2023-03-15 11:43:03] [INFO ] Deduced a trap composed of 469 places in 493 ms of which 1 ms to minimize.
[2023-03-15 11:43:03] [INFO ] Deduced a trap composed of 446 places in 503 ms of which 3 ms to minimize.
[2023-03-15 11:43:04] [INFO ] Deduced a trap composed of 462 places in 506 ms of which 1 ms to minimize.
[2023-03-15 11:43:04] [INFO ] Deduced a trap composed of 470 places in 524 ms of which 1 ms to minimize.
[2023-03-15 11:43:05] [INFO ] Deduced a trap composed of 420 places in 504 ms of which 1 ms to minimize.
[2023-03-15 11:43:05] [INFO ] Deduced a trap composed of 440 places in 491 ms of which 1 ms to minimize.
[2023-03-15 11:43:06] [INFO ] Deduced a trap composed of 453 places in 494 ms of which 1 ms to minimize.
[2023-03-15 11:43:07] [INFO ] Deduced a trap composed of 440 places in 471 ms of which 1 ms to minimize.
[2023-03-15 11:43:07] [INFO ] Deduced a trap composed of 442 places in 461 ms of which 1 ms to minimize.
[2023-03-15 11:43:08] [INFO ] Deduced a trap composed of 467 places in 479 ms of which 1 ms to minimize.
[2023-03-15 11:43:08] [INFO ] Deduced a trap composed of 442 places in 478 ms of which 1 ms to minimize.
[2023-03-15 11:43:09] [INFO ] Deduced a trap composed of 440 places in 452 ms of which 1 ms to minimize.
[2023-03-15 11:43:09] [INFO ] Deduced a trap composed of 454 places in 487 ms of which 1 ms to minimize.
[2023-03-15 11:43:10] [INFO ] Deduced a trap composed of 458 places in 468 ms of which 1 ms to minimize.
[2023-03-15 11:43:11] [INFO ] Deduced a trap composed of 434 places in 463 ms of which 0 ms to minimize.
[2023-03-15 11:43:11] [INFO ] Deduced a trap composed of 440 places in 464 ms of which 1 ms to minimize.
[2023-03-15 11:43:12] [INFO ] Deduced a trap composed of 436 places in 475 ms of which 1 ms to minimize.
[2023-03-15 11:43:12] [INFO ] Deduced a trap composed of 444 places in 489 ms of which 1 ms to minimize.
[2023-03-15 11:43:13] [INFO ] Deduced a trap composed of 465 places in 502 ms of which 1 ms to minimize.
[2023-03-15 11:43:13] [INFO ] Deduced a trap composed of 436 places in 491 ms of which 1 ms to minimize.
[2023-03-15 11:43:15] [INFO ] Deduced a trap composed of 442 places in 483 ms of which 1 ms to minimize.
[2023-03-15 11:43:16] [INFO ] Deduced a trap composed of 426 places in 473 ms of which 0 ms to minimize.
[2023-03-15 11:43:16] [INFO ] Deduced a trap composed of 440 places in 464 ms of which 1 ms to minimize.
[2023-03-15 11:43:17] [INFO ] Deduced a trap composed of 428 places in 473 ms of which 1 ms to minimize.
[2023-03-15 11:43:18] [INFO ] Deduced a trap composed of 430 places in 474 ms of which 1 ms to minimize.
[2023-03-15 11:43:18] [INFO ] Deduced a trap composed of 440 places in 494 ms of which 1 ms to minimize.
[2023-03-15 11:43:19] [INFO ] Deduced a trap composed of 436 places in 478 ms of which 1 ms to minimize.
[2023-03-15 11:43:20] [INFO ] Deduced a trap composed of 442 places in 484 ms of which 1 ms to minimize.
[2023-03-15 11:43:20] [INFO ] Deduced a trap composed of 444 places in 477 ms of which 1 ms to minimize.
[2023-03-15 11:43:22] [INFO ] Deduced a trap composed of 441 places in 463 ms of which 1 ms to minimize.
[2023-03-15 11:43:22] [INFO ] Deduced a trap composed of 438 places in 476 ms of which 1 ms to minimize.
[2023-03-15 11:43:23] [INFO ] Deduced a trap composed of 424 places in 474 ms of which 1 ms to minimize.
[2023-03-15 11:43:24] [INFO ] Deduced a trap composed of 455 places in 484 ms of which 1 ms to minimize.
[2023-03-15 11:43:25] [INFO ] Deduced a trap composed of 472 places in 482 ms of which 1 ms to minimize.
[2023-03-15 11:43:25] [INFO ] Deduced a trap composed of 432 places in 470 ms of which 1 ms to minimize.
[2023-03-15 11:43:26] [INFO ] Deduced a trap composed of 474 places in 483 ms of which 1 ms to minimize.
[2023-03-15 11:43:27] [INFO ] Deduced a trap composed of 459 places in 493 ms of which 1 ms to minimize.
[2023-03-15 11:43:28] [INFO ] Deduced a trap composed of 451 places in 482 ms of which 1 ms to minimize.
[2023-03-15 11:43:28] [INFO ] Deduced a trap composed of 442 places in 472 ms of which 1 ms to minimize.
[2023-03-15 11:43:29] [INFO ] Deduced a trap composed of 450 places in 467 ms of which 1 ms to minimize.
[2023-03-15 11:43:30] [INFO ] Deduced a trap composed of 446 places in 469 ms of which 1 ms to minimize.
[2023-03-15 11:43:31] [INFO ] Deduced a trap composed of 452 places in 475 ms of which 1 ms to minimize.
[2023-03-15 11:43:34] [INFO ] Trap strengthening (SAT) tested/added 46/46 trap constraints in 34459 ms
Current structural bounds on expressions (after SMT) : [118, 118] Max seen :[3, 3]
Support contains 2 out of 1091 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 67 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 64 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-15 11:43:34] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 11:43:34] [INFO ] Computed 142 place invariants in 43 ms
[2023-03-15 11:43:36] [INFO ] Implicit Places using invariants in 1929 ms returned []
[2023-03-15 11:43:36] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 11:43:36] [INFO ] Computed 142 place invariants in 39 ms
[2023-03-15 11:43:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:44:06] [INFO ] Implicit Places using invariants and state equation in 29672 ms returned []
Implicit Place search using SMT with State Equation took 31605 ms to find 0 implicit places.
[2023-03-15 11:44:06] [INFO ] Redundant transitions in 141 ms returned []
[2023-03-15 11:44:06] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 11:44:06] [INFO ] Computed 142 place invariants in 39 ms
[2023-03-15 11:44:08] [INFO ] Dead Transitions using invariants and state equation in 1850 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Starting property specific reduction for PolyORBNT-PT-S10J60-UpperBounds-00
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 11:44:08] [INFO ] Computed 142 place invariants in 40 ms
Incomplete random walk after 10000 steps, including 703 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :3
[2023-03-15 11:44:08] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 11:44:08] [INFO ] Computed 142 place invariants in 43 ms
[2023-03-15 11:44:08] [INFO ] [Real]Absence check using 122 positive place invariants in 27 ms returned sat
[2023-03-15 11:44:08] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 31 ms returned sat
[2023-03-15 11:44:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:44:09] [INFO ] [Real]Absence check using state equation in 944 ms returned sat
[2023-03-15 11:44:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:44:09] [INFO ] [Nat]Absence check using 122 positive place invariants in 27 ms returned sat
[2023-03-15 11:44:09] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 23 ms returned sat
[2023-03-15 11:44:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:44:10] [INFO ] [Nat]Absence check using state equation in 553 ms returned sat
[2023-03-15 11:44:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:44:13] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 11:44:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 4298 ms returned unknown
Current structural bounds on expressions (after SMT) : [136] Max seen :[3]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 66 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-15 11:44:14] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 11:44:14] [INFO ] Computed 142 place invariants in 39 ms
[2023-03-15 11:44:16] [INFO ] Dead Transitions using invariants and state equation in 1820 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 11:44:16] [INFO ] Computed 142 place invariants in 35 ms
Incomplete random walk after 1000000 steps, including 70116 resets, run finished after 9840 ms. (steps per millisecond=101 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 7411 resets, run finished after 1956 ms. (steps per millisecond=511 ) properties (out of 1) seen :3
[2023-03-15 11:44:28] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 11:44:28] [INFO ] Computed 142 place invariants in 38 ms
[2023-03-15 11:44:28] [INFO ] [Real]Absence check using 122 positive place invariants in 29 ms returned sat
[2023-03-15 11:44:28] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 26 ms returned sat
[2023-03-15 11:44:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:44:29] [INFO ] [Real]Absence check using state equation in 933 ms returned sat
[2023-03-15 11:44:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:44:29] [INFO ] [Nat]Absence check using 122 positive place invariants in 27 ms returned sat
[2023-03-15 11:44:29] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 23 ms returned sat
[2023-03-15 11:44:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:44:30] [INFO ] [Nat]Absence check using state equation in 555 ms returned sat
[2023-03-15 11:44:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:44:33] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 11:44:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 3696 ms returned sat
[2023-03-15 11:44:34] [INFO ] Deduced a trap composed of 448 places in 520 ms of which 1 ms to minimize.
[2023-03-15 11:44:35] [INFO ] Deduced a trap composed of 461 places in 544 ms of which 1 ms to minimize.
[2023-03-15 11:44:36] [INFO ] Deduced a trap composed of 443 places in 475 ms of which 1 ms to minimize.
[2023-03-15 11:44:36] [INFO ] Deduced a trap composed of 436 places in 463 ms of which 1 ms to minimize.
[2023-03-15 11:44:37] [INFO ] Deduced a trap composed of 445 places in 477 ms of which 0 ms to minimize.
[2023-03-15 11:44:37] [INFO ] Deduced a trap composed of 428 places in 466 ms of which 0 ms to minimize.
[2023-03-15 11:44:38] [INFO ] Deduced a trap composed of 447 places in 467 ms of which 1 ms to minimize.
[2023-03-15 11:44:38] [INFO ] Deduced a trap composed of 446 places in 473 ms of which 1 ms to minimize.
[2023-03-15 11:44:39] [INFO ] Deduced a trap composed of 428 places in 464 ms of which 1 ms to minimize.
[2023-03-15 11:44:40] [INFO ] Deduced a trap composed of 445 places in 477 ms of which 1 ms to minimize.
[2023-03-15 11:44:41] [INFO ] Deduced a trap composed of 444 places in 483 ms of which 1 ms to minimize.
[2023-03-15 11:44:41] [INFO ] Deduced a trap composed of 435 places in 483 ms of which 1 ms to minimize.
[2023-03-15 11:44:43] [INFO ] Deduced a trap composed of 486 places in 494 ms of which 1 ms to minimize.
[2023-03-15 11:44:44] [INFO ] Deduced a trap composed of 401 places in 536 ms of which 1 ms to minimize.
[2023-03-15 11:44:45] [INFO ] Deduced a trap composed of 438 places in 464 ms of which 1 ms to minimize.
[2023-03-15 11:44:45] [INFO ] Deduced a trap composed of 441 places in 471 ms of which 0 ms to minimize.
[2023-03-15 11:44:46] [INFO ] Deduced a trap composed of 426 places in 472 ms of which 1 ms to minimize.
[2023-03-15 11:44:46] [INFO ] Deduced a trap composed of 438 places in 466 ms of which 1 ms to minimize.
[2023-03-15 11:44:47] [INFO ] Deduced a trap composed of 428 places in 464 ms of which 1 ms to minimize.
[2023-03-15 11:44:48] [INFO ] Deduced a trap composed of 434 places in 487 ms of which 1 ms to minimize.
[2023-03-15 11:44:49] [INFO ] Deduced a trap composed of 481 places in 502 ms of which 1 ms to minimize.
[2023-03-15 11:44:49] [INFO ] Deduced a trap composed of 427 places in 479 ms of which 1 ms to minimize.
[2023-03-15 11:44:50] [INFO ] Deduced a trap composed of 443 places in 479 ms of which 1 ms to minimize.
[2023-03-15 11:44:51] [INFO ] Deduced a trap composed of 443 places in 479 ms of which 1 ms to minimize.
[2023-03-15 11:44:52] [INFO ] Deduced a trap composed of 449 places in 486 ms of which 1 ms to minimize.
[2023-03-15 11:44:53] [INFO ] Deduced a trap composed of 466 places in 508 ms of which 1 ms to minimize.
[2023-03-15 11:44:53] [INFO ] Deduced a trap composed of 434 places in 477 ms of which 1 ms to minimize.
[2023-03-15 11:44:54] [INFO ] Deduced a trap composed of 474 places in 499 ms of which 1 ms to minimize.
[2023-03-15 11:44:55] [INFO ] Deduced a trap composed of 449 places in 486 ms of which 1 ms to minimize.
[2023-03-15 11:44:55] [INFO ] Deduced a trap composed of 468 places in 474 ms of which 1 ms to minimize.
[2023-03-15 11:44:56] [INFO ] Deduced a trap composed of 455 places in 490 ms of which 1 ms to minimize.
[2023-03-15 11:44:56] [INFO ] Deduced a trap composed of 473 places in 520 ms of which 0 ms to minimize.
[2023-03-15 11:44:57] [INFO ] Deduced a trap composed of 446 places in 472 ms of which 1 ms to minimize.
[2023-03-15 11:44:58] [INFO ] Deduced a trap composed of 432 places in 476 ms of which 1 ms to minimize.
[2023-03-15 11:44:58] [INFO ] Deduced a trap composed of 474 places in 484 ms of which 1 ms to minimize.
[2023-03-15 11:45:00] [INFO ] Deduced a trap composed of 445 places in 470 ms of which 1 ms to minimize.
[2023-03-15 11:45:01] [INFO ] Deduced a trap composed of 446 places in 483 ms of which 1 ms to minimize.
[2023-03-15 11:45:03] [INFO ] Deduced a trap composed of 454 places in 508 ms of which 1 ms to minimize.
[2023-03-15 11:45:03] [INFO ] Deduced a trap composed of 467 places in 479 ms of which 1 ms to minimize.
[2023-03-15 11:45:04] [INFO ] Deduced a trap composed of 441 places in 477 ms of which 1 ms to minimize.
[2023-03-15 11:45:05] [INFO ] Deduced a trap composed of 440 places in 470 ms of which 1 ms to minimize.
[2023-03-15 11:45:06] [INFO ] Deduced a trap composed of 436 places in 487 ms of which 1 ms to minimize.
[2023-03-15 11:45:07] [INFO ] Deduced a trap composed of 449 places in 470 ms of which 1 ms to minimize.
[2023-03-15 11:45:08] [INFO ] Deduced a trap composed of 443 places in 497 ms of which 1 ms to minimize.
[2023-03-15 11:45:08] [INFO ] Deduced a trap composed of 450 places in 486 ms of which 1 ms to minimize.
[2023-03-15 11:45:09] [INFO ] Deduced a trap composed of 469 places in 481 ms of which 1 ms to minimize.
[2023-03-15 11:45:10] [INFO ] Deduced a trap composed of 439 places in 474 ms of which 1 ms to minimize.
[2023-03-15 11:45:13] [INFO ] Deduced a trap composed of 460 places in 506 ms of which 1 ms to minimize.
[2023-03-15 11:45:14] [INFO ] Deduced a trap composed of 473 places in 498 ms of which 1 ms to minimize.
[2023-03-15 11:45:15] [INFO ] Deduced a trap composed of 485 places in 515 ms of which 1 ms to minimize.
[2023-03-15 11:45:15] [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) : [136] Max seen :[3]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 76 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 63 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-15 11:45:15] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 11:45:15] [INFO ] Computed 142 place invariants in 41 ms
[2023-03-15 11:45:17] [INFO ] Implicit Places using invariants in 1910 ms returned []
[2023-03-15 11:45:17] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 11:45:17] [INFO ] Computed 142 place invariants in 34 ms
[2023-03-15 11:45:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:45:44] [INFO ] Implicit Places using invariants and state equation in 27125 ms returned []
Implicit Place search using SMT with State Equation took 29037 ms to find 0 implicit places.
[2023-03-15 11:45:44] [INFO ] Redundant transitions in 110 ms returned []
[2023-03-15 11:45:44] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 11:45:44] [INFO ] Computed 142 place invariants in 33 ms
[2023-03-15 11:45:46] [INFO ] Dead Transitions using invariants and state equation in 1735 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Ending property specific reduction for PolyORBNT-PT-S10J60-UpperBounds-00 in 97723 ms.
Starting property specific reduction for PolyORBNT-PT-S10J60-UpperBounds-04
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 11:45:46] [INFO ] Computed 142 place invariants in 33 ms
Incomplete random walk after 10000 steps, including 711 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :3
[2023-03-15 11:45:46] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 11:45:46] [INFO ] Computed 142 place invariants in 40 ms
[2023-03-15 11:45:46] [INFO ] [Real]Absence check using 122 positive place invariants in 27 ms returned sat
[2023-03-15 11:45:46] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 25 ms returned sat
[2023-03-15 11:45:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:45:47] [INFO ] [Real]Absence check using state equation in 856 ms returned sat
[2023-03-15 11:45:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:45:47] [INFO ] [Nat]Absence check using 122 positive place invariants in 28 ms returned sat
[2023-03-15 11:45:47] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 30 ms returned sat
[2023-03-15 11:45:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:45:48] [INFO ] [Nat]Absence check using state equation in 531 ms returned sat
[2023-03-15 11:45:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:45:51] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 11:45:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 4292 ms returned sat
[2023-03-15 11:45:53] [INFO ] Deduced a trap composed of 14 places in 716 ms of which 1 ms to minimize.
[2023-03-15 11:45:53] [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) : [136] Max seen :[3]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 62 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-15 11:45:53] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 11:45:53] [INFO ] Computed 142 place invariants in 39 ms
[2023-03-15 11:45:55] [INFO ] Dead Transitions using invariants and state equation in 1809 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 11:45:55] [INFO ] Computed 142 place invariants in 34 ms
Incomplete random walk after 1000000 steps, including 70600 resets, run finished after 9719 ms. (steps per millisecond=102 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 7200 resets, run finished after 1936 ms. (steps per millisecond=516 ) properties (out of 1) seen :3
[2023-03-15 11:46:06] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 11:46:06] [INFO ] Computed 142 place invariants in 45 ms
[2023-03-15 11:46:06] [INFO ] [Real]Absence check using 122 positive place invariants in 26 ms returned sat
[2023-03-15 11:46:06] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 26 ms returned sat
[2023-03-15 11:46:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:46:07] [INFO ] [Real]Absence check using state equation in 851 ms returned sat
[2023-03-15 11:46:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:46:07] [INFO ] [Nat]Absence check using 122 positive place invariants in 27 ms returned sat
[2023-03-15 11:46:08] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 23 ms returned sat
[2023-03-15 11:46:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:46:08] [INFO ] [Nat]Absence check using state equation in 544 ms returned sat
[2023-03-15 11:46:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:46:11] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 11:46:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 4800 ms returned sat
[2023-03-15 11:46:13] [INFO ] Deduced a trap composed of 219 places in 533 ms of which 1 ms to minimize.
[2023-03-15 11:46:14] [INFO ] Deduced a trap composed of 444 places in 497 ms of which 0 ms to minimize.
[2023-03-15 11:46:15] [INFO ] Deduced a trap composed of 434 places in 473 ms of which 1 ms to minimize.
[2023-03-15 11:46:15] [INFO ] Deduced a trap composed of 440 places in 477 ms of which 1 ms to minimize.
[2023-03-15 11:46:16] [INFO ] Deduced a trap composed of 436 places in 467 ms of which 1 ms to minimize.
[2023-03-15 11:46:16] [INFO ] Deduced a trap composed of 426 places in 449 ms of which 1 ms to minimize.
[2023-03-15 11:46:17] [INFO ] Deduced a trap composed of 446 places in 463 ms of which 0 ms to minimize.
[2023-03-15 11:46:18] [INFO ] Deduced a trap composed of 494 places in 469 ms of which 1 ms to minimize.
[2023-03-15 11:46:18] [INFO ] Deduced a trap composed of 428 places in 458 ms of which 1 ms to minimize.
[2023-03-15 11:46:19] [INFO ] Deduced a trap composed of 424 places in 472 ms of which 1 ms to minimize.
[2023-03-15 11:46:19] [INFO ] Deduced a trap composed of 449 places in 474 ms of which 1 ms to minimize.
[2023-03-15 11:46:20] [INFO ] Deduced a trap composed of 434 places in 464 ms of which 1 ms to minimize.
[2023-03-15 11:46:20] [INFO ] Deduced a trap composed of 432 places in 468 ms of which 1 ms to minimize.
[2023-03-15 11:46:21] [INFO ] Deduced a trap composed of 432 places in 477 ms of which 1 ms to minimize.
[2023-03-15 11:46:21] [INFO ] Deduced a trap composed of 428 places in 475 ms of which 1 ms to minimize.
[2023-03-15 11:46:22] [INFO ] Deduced a trap composed of 430 places in 457 ms of which 0 ms to minimize.
[2023-03-15 11:46:23] [INFO ] Deduced a trap composed of 438 places in 476 ms of which 1 ms to minimize.
[2023-03-15 11:46:23] [INFO ] Deduced a trap composed of 447 places in 475 ms of which 1 ms to minimize.
[2023-03-15 11:46:24] [INFO ] Deduced a trap composed of 440 places in 470 ms of which 1 ms to minimize.
[2023-03-15 11:46:24] [INFO ] Deduced a trap composed of 448 places in 489 ms of which 1 ms to minimize.
[2023-03-15 11:46:25] [INFO ] Deduced a trap composed of 477 places in 464 ms of which 1 ms to minimize.
[2023-03-15 11:46:26] [INFO ] Deduced a trap composed of 450 places in 495 ms of which 1 ms to minimize.
[2023-03-15 11:46:26] [INFO ] Deduced a trap composed of 453 places in 482 ms of which 1 ms to minimize.
[2023-03-15 11:46:27] [INFO ] Deduced a trap composed of 443 places in 480 ms of which 1 ms to minimize.
[2023-03-15 11:46:27] [INFO ] Deduced a trap composed of 465 places in 481 ms of which 1 ms to minimize.
[2023-03-15 11:46:28] [INFO ] Deduced a trap composed of 484 places in 496 ms of which 1 ms to minimize.
[2023-03-15 11:46:28] [INFO ] Deduced a trap composed of 451 places in 476 ms of which 1 ms to minimize.
[2023-03-15 11:46:29] [INFO ] Deduced a trap composed of 442 places in 469 ms of which 1 ms to minimize.
[2023-03-15 11:46:30] [INFO ] Deduced a trap composed of 432 places in 473 ms of which 1 ms to minimize.
[2023-03-15 11:46:30] [INFO ] Deduced a trap composed of 476 places in 481 ms of which 1 ms to minimize.
[2023-03-15 11:46:31] [INFO ] Deduced a trap composed of 487 places in 473 ms of which 0 ms to minimize.
[2023-03-15 11:46:32] [INFO ] Deduced a trap composed of 449 places in 490 ms of which 1 ms to minimize.
[2023-03-15 11:46:33] [INFO ] Deduced a trap composed of 458 places in 474 ms of which 1 ms to minimize.
[2023-03-15 11:46:36] [INFO ] Trap strengthening (SAT) tested/added 33/33 trap constraints in 22779 ms
Current structural bounds on expressions (after SMT) : [136] Max seen :[3]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 73 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 60 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-15 11:46:36] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 11:46:36] [INFO ] Computed 142 place invariants in 33 ms
[2023-03-15 11:46:38] [INFO ] Implicit Places using invariants in 1879 ms returned []
[2023-03-15 11:46:38] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 11:46:38] [INFO ] Computed 142 place invariants in 35 ms
[2023-03-15 11:46:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:47:06] [INFO ] Implicit Places using invariants and state equation in 28686 ms returned []
Implicit Place search using SMT with State Equation took 30567 ms to find 0 implicit places.
[2023-03-15 11:47:06] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-15 11:47:06] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-15 11:47:06] [INFO ] Computed 142 place invariants in 34 ms
[2023-03-15 11:47:08] [INFO ] Dead Transitions using invariants and state equation in 1813 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Ending property specific reduction for PolyORBNT-PT-S10J60-UpperBounds-04 in 82591 ms.
[2023-03-15 11:47:09] [INFO ] Flatten gal took : 261 ms
[2023-03-15 11:47:09] [INFO ] Applying decomposition
[2023-03-15 11:47:09] [INFO ] Flatten gal took : 141 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/graph12774386961830912148.txt' '-o' '/tmp/graph12774386961830912148.bin' '-w' '/tmp/graph12774386961830912148.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12774386961830912148.bin' '-l' '-1' '-v' '-w' '/tmp/graph12774386961830912148.weights' '-q' '0' '-e' '0.001'
[2023-03-15 11:47:10] [INFO ] Decomposing Gal with order
[2023-03-15 11:47:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 11:47:10] [INFO ] Removed a total of 1976 redundant transitions.
[2023-03-15 11:47:10] [INFO ] Flatten gal took : 442 ms
[2023-03-15 11:47:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 560 labels/synchronizations in 80 ms.
[2023-03-15 11:47:10] [INFO ] Time to serialize gal into /tmp/UpperBounds9283624058767027559.gal : 29 ms
[2023-03-15 11:47:10] [INFO ] Time to serialize properties into /tmp/UpperBounds12789753362567353579.prop : 0 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/UpperBounds9283624058767027559.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12789753362567353579.prop' '--nowitness'
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...275
Loading property file /tmp/UpperBounds12789753362567353579.prop.
Detected timeout of ITS tools.
[2023-03-15 12:10:01] [INFO ] Flatten gal took : 2120 ms
[2023-03-15 12:10:01] [INFO ] Time to serialize gal into /tmp/UpperBounds12560083072219436482.gal : 85 ms
[2023-03-15 12:10:02] [INFO ] Time to serialize properties into /tmp/UpperBounds12476686380073940080.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/UpperBounds12560083072219436482.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12476686380073940080.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...297
Loading property file /tmp/UpperBounds12476686380073940080.prop.
Detected timeout of ITS tools.
[2023-03-15 12:33:03] [INFO ] Flatten gal took : 564 ms
[2023-03-15 12:33:05] [INFO ] Input system was already deterministic with 2062 transitions.
[2023-03-15 12:33:05] [INFO ] Transformed 1091 places.
[2023-03-15 12:33:05] [INFO ] Transformed 2062 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 12:33:35] [INFO ] Time to serialize gal into /tmp/UpperBounds16863297496435105481.gal : 36 ms
[2023-03-15 12:33:35] [INFO ] Time to serialize properties into /tmp/UpperBounds1975988158344790767.prop : 2 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/UpperBounds16863297496435105481.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1975988158344790767.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...341
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds1975988158344790767.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="PolyORBNT-PT-S10J60"
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 PolyORBNT-PT-S10J60, 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-167873970000098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S10J60.tgz
mv PolyORBNT-PT-S10J60 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 ;