About the Execution of ITS-Tools for RERS2020-PT-pb107
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10490.071 | 2026323.00 | 2205558.00 | 5636.30 | 0 1 0 0 1 0 1 1 0 0 0 0 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r325-tall-167889197000269.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 itstools
Input is RERS2020-PT-pb107, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r325-tall-167889197000269
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 59M
-rw-r--r-- 1 mcc users 6.9K Feb 26 08:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 08:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 08:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 08:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 08:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 08:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 08:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 08:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 59M 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 RERS2020-PT-pb107-UpperBounds-00
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-01
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-02
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-03
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-04
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-05
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-06
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-07
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-08
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-09
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-10
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-11
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-12
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-13
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-14
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678998411203
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS2020-PT-pb107
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-16 20:26:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 20:26:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 20:26:54] [INFO ] Load time of PNML (sax parser for PT used): 1771 ms
[2023-03-16 20:26:54] [INFO ] Transformed 1382 places.
[2023-03-16 20:26:54] [INFO ] Transformed 104643 transitions.
[2023-03-16 20:26:54] [INFO ] Found NUPN structural information;
[2023-03-16 20:26:54] [INFO ] Parsed PT model containing 1382 places and 104643 transitions and 417030 arcs in 2203 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 11427 transitions
Reduce redundant transitions removed 11427 transitions.
FORMULA RERS2020-PT-pb107-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 62870 out of 93216 initially.
// Phase 1: matrix 62870 rows 1382 cols
[2023-03-16 20:26:56] [INFO ] Computed 25 place invariants in 466 ms
Incomplete random walk after 10000 steps, including 4 resets, run finished after 787 ms. (steps per millisecond=12 ) properties (out of 15) seen :4
FORMULA RERS2020-PT-pb107-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb107-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb107-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb107-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 11) seen :2
FORMULA RERS2020-PT-pb107-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RERS2020-PT-pb107-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
[2023-03-16 20:26:58] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1382 cols
[2023-03-16 20:26:58] [INFO ] Computed 25 place invariants in 293 ms
[2023-03-16 20:26:59] [INFO ] [Real]Absence check using 13 positive place invariants in 28 ms returned sat
[2023-03-16 20:26:59] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-16 20:26:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:27:03] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 20:27:04] [INFO ] [Real]Absence check using 13 positive place invariants in 32 ms returned sat
[2023-03-16 20:27:04] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 9 ms returned sat
[2023-03-16 20:27:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:27:08] [INFO ] [Real]Absence check using state equation in 4792 ms returned unknown
[2023-03-16 20:27:09] [INFO ] [Real]Absence check using 13 positive place invariants in 22 ms returned sat
[2023-03-16 20:27:09] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-16 20:27:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:27:13] [INFO ] [Real]Absence check using state equation in 4804 ms returned unknown
[2023-03-16 20:27:14] [INFO ] [Real]Absence check using 13 positive place invariants in 21 ms returned sat
[2023-03-16 20:27:14] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-16 20:27:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:27:18] [INFO ] [Real]Absence check using state equation in 4818 ms returned unknown
[2023-03-16 20:27:19] [INFO ] [Real]Absence check using 13 positive place invariants in 22 ms returned sat
[2023-03-16 20:27:19] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-16 20:27:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:27:23] [INFO ] [Real]Absence check using state equation in 4827 ms returned unknown
[2023-03-16 20:27:24] [INFO ] [Real]Absence check using 13 positive place invariants in 25 ms returned sat
[2023-03-16 20:27:24] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-16 20:27:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:27: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 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 20:27:29] [INFO ] [Real]Absence check using 13 positive place invariants in 22 ms returned sat
[2023-03-16 20:27:29] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-16 20:27:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:27:33] [INFO ] [Real]Absence check using state equation in 4812 ms returned unknown
[2023-03-16 20:27:34] [INFO ] [Real]Absence check using 13 positive place invariants in 22 ms returned sat
[2023-03-16 20:27:34] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-16 20:27:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:27:38] [INFO ] [Real]Absence check using state equation in 4803 ms returned unknown
[2023-03-16 20:27:39] [INFO ] [Real]Absence check using 13 positive place invariants in 33 ms returned sat
[2023-03-16 20:27:39] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-16 20:27:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:27:43] [INFO ] [Real]Absence check using state equation in 4791 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 9 out of 1382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1382/1382 places, 93216/93216 transitions.
Graph (complete) has 84016 edges and 1382 vertex of which 1381 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.86 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 12 places
Drop transitions removed 2811 transitions
Reduce isomorphic transitions removed 2811 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 2824 rules applied. Total rules applied 2825 place count 1369 transition count 90404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2826 place count 1368 transition count 90404
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2826 place count 1368 transition count 90402
Deduced a syphon composed of 2 places in 59 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2830 place count 1366 transition count 90402
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2832 place count 1366 transition count 90400
Performed 17 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 17 places in 57 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 2866 place count 1349 transition count 90380
Drop transitions removed 6 transitions
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 445 transitions.
Iterating post reduction 3 with 445 rules applied. Total rules applied 3311 place count 1349 transition count 89935
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 50 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 3319 place count 1345 transition count 89931
Drop transitions removed 4 transitions
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 4 with 96 rules applied. Total rules applied 3415 place count 1345 transition count 89835
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 48 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3417 place count 1344 transition count 89836
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 3420 place count 1344 transition count 89833
Free-agglomeration rule applied 32 times.
Iterating global reduction 6 with 32 rules applied. Total rules applied 3452 place count 1344 transition count 89801
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 44 transitions
Ensure Unique test removed 555 transitions
Reduce isomorphic transitions removed 599 transitions.
Iterating post reduction 6 with 631 rules applied. Total rules applied 4083 place count 1312 transition count 89202
Free-agglomeration rule (complex) applied 14 times with reduction of 16 identical transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 4097 place count 1312 transition count 89916
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 7 with 39 rules applied. Total rules applied 4136 place count 1298 transition count 89891
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 4137 place count 1297 transition count 89890
Applied a total of 4137 rules in 4563 ms. Remains 1297 /1382 variables (removed 85) and now considering 89890/93216 (removed 3326) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4573 ms. Remains : 1297/1382 places, 89890/93216 transitions.
Normalized transition count is 62408 out of 89890 initially.
// Phase 1: matrix 62408 rows 1297 cols
[2023-03-16 20:27:48] [INFO ] Computed 12 place invariants in 262 ms
Interrupted random walk after 618690 steps, including 3 resets, run timeout after 30001 ms. (steps per millisecond=20 ) properties seen 0
Interrupted Best-First random walk after 821201 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=164 ) properties seen 0
Interrupted Best-First random walk after 805488 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=161 ) properties seen 0
Interrupted Best-First random walk after 824186 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=164 ) properties seen 0
Interrupted Best-First random walk after 825076 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=164 ) properties seen 0
Interrupted Best-First random walk after 819651 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=163 ) properties seen 0
Interrupted Best-First random walk after 824270 steps, including 3 resets, run timeout after 5001 ms. (steps per millisecond=164 ) properties seen 0
Interrupted Best-First random walk after 846990 steps, including 3 resets, run timeout after 5001 ms. (steps per millisecond=169 ) properties seen 0
Interrupted Best-First random walk after 822510 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=164 ) properties seen 0
Interrupted Best-First random walk after 818648 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=163 ) properties seen 0
[2023-03-16 20:29:04] [INFO ] Flow matrix only has 62408 transitions (discarded 27482 similar events)
// Phase 1: matrix 62408 rows 1297 cols
[2023-03-16 20:29:04] [INFO ] Computed 12 place invariants in 235 ms
[2023-03-16 20:29:04] [INFO ] [Real]Absence check using 12 positive place invariants in 29 ms returned sat
[2023-03-16 20:29:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:29:16] [INFO ] [Real]Absence check using state equation in 11952 ms returned sat
[2023-03-16 20:29:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 20:29:17] [INFO ] [Nat]Absence check using 12 positive place invariants in 21 ms returned sat
[2023-03-16 20:29:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 20:29:29] [INFO ] [Nat]Absence check using state equation in 11922 ms returned sat
[2023-03-16 20:29:30] [INFO ] State equation strengthened by 3687 read => feed constraints.
[2023-03-16 20:29:36] [INFO ] [Nat]Added 3687 Read/Feed constraints in 5888 ms returned sat
[2023-03-16 20:29:43] [INFO ] Deduced a trap composed of 62 places in 6419 ms of which 7 ms to minimize.
[2023-03-16 20:29:50] [INFO ] Deduced a trap composed of 15 places in 6862 ms of which 2 ms to minimize.
[2023-03-16 20:29:58] [INFO ] Deduced a trap composed of 28 places in 6701 ms of which 2 ms to minimize.
[2023-03-16 20:30:06] [INFO ] Deduced a trap composed of 99 places in 6870 ms of which 3 ms to minimize.
[2023-03-16 20:30:06] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 20:30:06] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned sat
[2023-03-16 20:30:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:30:18] [INFO ] [Real]Absence check using state equation in 12122 ms returned sat
[2023-03-16 20:30:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 20:30:19] [INFO ] [Nat]Absence check using 12 positive place invariants in 19 ms returned sat
[2023-03-16 20:30:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 20:30:31] [INFO ] [Nat]Absence check using state equation in 12073 ms returned sat
[2023-03-16 20:30:36] [INFO ] [Nat]Added 3687 Read/Feed constraints in 5194 ms returned sat
[2023-03-16 20:30:43] [INFO ] Deduced a trap composed of 16 places in 5793 ms of which 1 ms to minimize.
[2023-03-16 20:30:49] [INFO ] Deduced a trap composed of 21 places in 5999 ms of which 2 ms to minimize.
[2023-03-16 20:30:56] [INFO ] Deduced a trap composed of 69 places in 5791 ms of which 1 ms to minimize.
[2023-03-16 20:31:02] [INFO ] Deduced a trap composed of 30 places in 5634 ms of which 2 ms to minimize.
[2023-03-16 20:31:10] [INFO ] Deduced a trap composed of 84 places in 7144 ms of which 2 ms to minimize.
[2023-03-16 20:31:10] [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 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 20:31:10] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned sat
[2023-03-16 20:31:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:31:23] [INFO ] [Real]Absence check using state equation in 13002 ms returned sat
[2023-03-16 20:31:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 20:31:25] [INFO ] [Nat]Absence check using 12 positive place invariants in 20 ms returned sat
[2023-03-16 20:31:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 20:31:37] [INFO ] [Nat]Absence check using state equation in 12483 ms returned sat
[2023-03-16 20:31:42] [INFO ] [Nat]Added 3687 Read/Feed constraints in 5335 ms returned sat
[2023-03-16 20:31:50] [INFO ] Deduced a trap composed of 21 places in 6773 ms of which 2 ms to minimize.
[2023-03-16 20:31:57] [INFO ] Deduced a trap composed of 70 places in 6652 ms of which 1 ms to minimize.
[2023-03-16 20:32:05] [INFO ] Deduced a trap composed of 16 places in 6832 ms of which 1 ms to minimize.
[2023-03-16 20:32:12] [INFO ] Deduced a trap composed of 108 places in 6798 ms of which 2 ms to minimize.
[2023-03-16 20:32:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 20:32:13] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2023-03-16 20:32:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:32:25] [INFO ] [Real]Absence check using state equation in 11932 ms returned sat
[2023-03-16 20:32:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 20:32:26] [INFO ] [Nat]Absence check using 12 positive place invariants in 31 ms returned sat
[2023-03-16 20:32:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 20:32:38] [INFO ] [Nat]Absence check using state equation in 12153 ms returned sat
[2023-03-16 20:32:43] [INFO ] [Nat]Added 3687 Read/Feed constraints in 4892 ms returned sat
[2023-03-16 20:32:49] [INFO ] Deduced a trap composed of 27 places in 5942 ms of which 2 ms to minimize.
[2023-03-16 20:32:57] [INFO ] Deduced a trap composed of 16 places in 6849 ms of which 1 ms to minimize.
[2023-03-16 20:33:05] [INFO ] Deduced a trap composed of 70 places in 7698 ms of which 4 ms to minimize.
[2023-03-16 20:33:14] [INFO ] Deduced a trap composed of 21 places in 7567 ms of which 2 ms to minimize.
[2023-03-16 20:33:14] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 20:33:14] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2023-03-16 20:33:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:33:27] [INFO ] [Real]Absence check using state equation in 12576 ms returned sat
[2023-03-16 20:33:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 20:33:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 22 ms returned sat
[2023-03-16 20:33:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 20:33:40] [INFO ] [Nat]Absence check using state equation in 12533 ms returned sat
[2023-03-16 20:33:46] [INFO ] [Nat]Added 3687 Read/Feed constraints in 5514 ms returned sat
[2023-03-16 20:33:52] [INFO ] Deduced a trap composed of 16 places in 6091 ms of which 1 ms to minimize.
[2023-03-16 20:33:59] [INFO ] Deduced a trap composed of 77 places in 6168 ms of which 2 ms to minimize.
[2023-03-16 20:34:06] [INFO ] Deduced a trap composed of 27 places in 5871 ms of which 1 ms to minimize.
[2023-03-16 20:34:14] [INFO ] Deduced a trap composed of 52 places in 6905 ms of which 1 ms to minimize.
[2023-03-16 20:34:14] [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 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 20:34:14] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2023-03-16 20:34:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:34:26] [INFO ] [Real]Absence check using state equation in 12048 ms returned sat
[2023-03-16 20:34:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 20:34:27] [INFO ] [Nat]Absence check using 12 positive place invariants in 20 ms returned sat
[2023-03-16 20:34:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 20:34:39] [INFO ] [Nat]Absence check using state equation in 12043 ms returned sat
[2023-03-16 20:34:44] [INFO ] [Nat]Added 3687 Read/Feed constraints in 5094 ms returned sat
[2023-03-16 20:34:51] [INFO ] Deduced a trap composed of 27 places in 5895 ms of which 1 ms to minimize.
[2023-03-16 20:34:58] [INFO ] Deduced a trap composed of 16 places in 6842 ms of which 1 ms to minimize.
[2023-03-16 20:35:06] [INFO ] Deduced a trap composed of 70 places in 6993 ms of which 2 ms to minimize.
[2023-03-16 20:35:14] [INFO ] Deduced a trap composed of 21 places in 6830 ms of which 1 ms to minimize.
[2023-03-16 20:35:14] [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 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 20:35:14] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2023-03-16 20:35:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:35:26] [INFO ] [Real]Absence check using state equation in 11870 ms returned sat
[2023-03-16 20:35:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 20:35:27] [INFO ] [Nat]Absence check using 12 positive place invariants in 20 ms returned sat
[2023-03-16 20:35:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 20:35:39] [INFO ] [Nat]Absence check using state equation in 12032 ms returned sat
[2023-03-16 20:35:44] [INFO ] [Nat]Added 3687 Read/Feed constraints in 5055 ms returned sat
[2023-03-16 20:35:52] [INFO ] Deduced a trap composed of 16 places in 7087 ms of which 2 ms to minimize.
[2023-03-16 20:35:59] [INFO ] Deduced a trap composed of 21 places in 7071 ms of which 2 ms to minimize.
[2023-03-16 20:36:07] [INFO ] Deduced a trap composed of 50 places in 7233 ms of which 2 ms to minimize.
[2023-03-16 20:36:15] [INFO ] Deduced a trap composed of 187 places in 6750 ms of which 1 ms to minimize.
[2023-03-16 20:36: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 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 20:36:15] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2023-03-16 20:36:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:36:27] [INFO ] [Real]Absence check using state equation in 12224 ms returned sat
[2023-03-16 20:36:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 20:36:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 19 ms returned sat
[2023-03-16 20:36:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 20:36:40] [INFO ] [Nat]Absence check using state equation in 11956 ms returned sat
[2023-03-16 20:36:46] [INFO ] [Nat]Added 3687 Read/Feed constraints in 5272 ms returned sat
[2023-03-16 20:36:52] [INFO ] Deduced a trap composed of 21 places in 6051 ms of which 4 ms to minimize.
[2023-03-16 20:36:59] [INFO ] Deduced a trap composed of 52 places in 6045 ms of which 2 ms to minimize.
[2023-03-16 20:37:06] [INFO ] Deduced a trap composed of 29 places in 6218 ms of which 1 ms to minimize.
[2023-03-16 20:37:14] [INFO ] Deduced a trap composed of 15 places in 6903 ms of which 1 ms to minimize.
[2023-03-16 20:37:14] [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 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 20:37:14] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned sat
[2023-03-16 20:37:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:37:26] [INFO ] [Real]Absence check using state equation in 12008 ms returned sat
[2023-03-16 20:37:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 20:37:27] [INFO ] [Nat]Absence check using 12 positive place invariants in 20 ms returned sat
[2023-03-16 20:37:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 20:37:39] [INFO ] [Nat]Absence check using state equation in 12074 ms returned sat
[2023-03-16 20:37:44] [INFO ] [Nat]Added 3687 Read/Feed constraints in 5112 ms returned sat
[2023-03-16 20:37:51] [INFO ] Deduced a trap composed of 30 places in 6104 ms of which 2 ms to minimize.
[2023-03-16 20:37:59] [INFO ] Deduced a trap composed of 20 places in 6938 ms of which 5 ms to minimize.
[2023-03-16 20:38:06] [INFO ] Deduced a trap composed of 50 places in 6820 ms of which 2 ms to minimize.
[2023-03-16 20:38:14] [INFO ] Deduced a trap composed of 60 places in 6592 ms of which 1 ms to minimize.
[2023-03-16 20:38:14] [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 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 9 out of 1297 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1297/1297 places, 89890/89890 transitions.
Applied a total of 0 rules in 409 ms. Remains 1297 /1297 variables (removed 0) and now considering 89890/89890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 410 ms. Remains : 1297/1297 places, 89890/89890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1297/1297 places, 89890/89890 transitions.
Applied a total of 0 rules in 406 ms. Remains 1297 /1297 variables (removed 0) and now considering 89890/89890 (removed 0) transitions.
[2023-03-16 20:38:15] [INFO ] Flow matrix only has 62408 transitions (discarded 27482 similar events)
[2023-03-16 20:38:15] [INFO ] Invariant cache hit.
[2023-03-16 20:38:18] [INFO ] Implicit Places using invariants in 3714 ms returned []
Implicit Place search using SMT only with invariants took 3715 ms to find 0 implicit places.
[2023-03-16 20:38:18] [INFO ] Flow matrix only has 62408 transitions (discarded 27482 similar events)
[2023-03-16 20:38:18] [INFO ] Invariant cache hit.
[2023-03-16 20:38:48] [INFO ] Dead Transitions using invariants and state equation in 29479 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33608 ms. Remains : 1297/1297 places, 89890/89890 transitions.
Starting property specific reduction for RERS2020-PT-pb107-UpperBounds-00
Normalized transition count is 62408 out of 89890 initially.
// Phase 1: matrix 62408 rows 1297 cols
[2023-03-16 20:38:48] [INFO ] Computed 12 place invariants in 218 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 510 ms. (steps per millisecond=19 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
[2023-03-16 20:38:49] [INFO ] Flow matrix only has 62408 transitions (discarded 27482 similar events)
// Phase 1: matrix 62408 rows 1297 cols
[2023-03-16 20:38:49] [INFO ] Computed 12 place invariants in 209 ms
[2023-03-16 20:38:49] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2023-03-16 20:38:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:38:54] [INFO ] [Real]Absence check using state equation in 4838 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1297 places. Attempting structural reductions.
Drop transitions removed 128 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 1297/1297 places, 89762/89762 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1297 transition count 89781
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 1296 transition count 89780
Applied a total of 3 rules in 856 ms. Remains 1296 /1297 variables (removed 1) and now considering 89780/89762 (removed -18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 859 ms. Remains : 1296/1297 places, 89780/89762 transitions.
Normalized transition count is 62328 out of 89780 initially.
// Phase 1: matrix 62328 rows 1296 cols
[2023-03-16 20:38:55] [INFO ] Computed 12 place invariants in 206 ms
Interrupted random walk after 640722 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen 0
Interrupted Best-First random walk after 752114 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=150 ) properties seen 0
[2023-03-16 20:39:30] [INFO ] Flow matrix only has 62328 transitions (discarded 27452 similar events)
// Phase 1: matrix 62328 rows 1296 cols
[2023-03-16 20:39:30] [INFO ] Computed 12 place invariants in 228 ms
[2023-03-16 20:39:31] [INFO ] [Real]Absence check using 12 positive place invariants in 23 ms returned sat
[2023-03-16 20:39:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:39:43] [INFO ] [Real]Absence check using state equation in 12263 ms returned sat
[2023-03-16 20:39:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 20:39:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 20 ms returned sat
[2023-03-16 20:39:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 20:39:56] [INFO ] [Nat]Absence check using state equation in 12364 ms returned sat
[2023-03-16 20:39:57] [INFO ] State equation strengthened by 3684 read => feed constraints.
[2023-03-16 20:40:02] [INFO ] [Nat]Added 3684 Read/Feed constraints in 5050 ms returned sat
[2023-03-16 20:40:09] [INFO ] Deduced a trap composed of 19 places in 6458 ms of which 1 ms to minimize.
[2023-03-16 20:40:17] [INFO ] Deduced a trap composed of 49 places in 7198 ms of which 1 ms to minimize.
[2023-03-16 20:40:25] [INFO ] Deduced a trap composed of 98 places in 7412 ms of which 2 ms to minimize.
[2023-03-16 20:40:33] [INFO ] Deduced a trap composed of 220 places in 7216 ms of which 1 ms to minimize.
[2023-03-16 20:40:33] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89780/89780 transitions.
Applied a total of 0 rules in 389 ms. Remains 1296 /1296 variables (removed 0) and now considering 89780/89780 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 389 ms. Remains : 1296/1296 places, 89780/89780 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89780/89780 transitions.
Applied a total of 0 rules in 392 ms. Remains 1296 /1296 variables (removed 0) and now considering 89780/89780 (removed 0) transitions.
[2023-03-16 20:40:34] [INFO ] Flow matrix only has 62328 transitions (discarded 27452 similar events)
[2023-03-16 20:40:34] [INFO ] Invariant cache hit.
[2023-03-16 20:40:37] [INFO ] Implicit Places using invariants in 3372 ms returned []
Implicit Place search using SMT only with invariants took 3376 ms to find 0 implicit places.
[2023-03-16 20:40:37] [INFO ] Flow matrix only has 62328 transitions (discarded 27452 similar events)
[2023-03-16 20:40:37] [INFO ] Invariant cache hit.
[2023-03-16 20:41:07] [INFO ] Dead Transitions using invariants and state equation in 29426 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33204 ms. Remains : 1296/1296 places, 89780/89780 transitions.
Ending property specific reduction for RERS2020-PT-pb107-UpperBounds-00 in 139190 ms.
Starting property specific reduction for RERS2020-PT-pb107-UpperBounds-01
Normalized transition count is 62408 out of 89890 initially.
// Phase 1: matrix 62408 rows 1297 cols
[2023-03-16 20:41:07] [INFO ] Computed 12 place invariants in 247 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 489 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
[2023-03-16 20:41:08] [INFO ] Flow matrix only has 62408 transitions (discarded 27482 similar events)
// Phase 1: matrix 62408 rows 1297 cols
[2023-03-16 20:41:08] [INFO ] Computed 12 place invariants in 217 ms
[2023-03-16 20:41:08] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2023-03-16 20:41:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:41:13] [INFO ] [Real]Absence check using state equation in 4827 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1297 places. Attempting structural reductions.
Drop transitions removed 38 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 1297/1297 places, 89852/89852 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1297 transition count 89871
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 1296 transition count 89870
Applied a total of 3 rules in 848 ms. Remains 1296 /1297 variables (removed 1) and now considering 89870/89852 (removed -18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 851 ms. Remains : 1296/1297 places, 89870/89852 transitions.
Normalized transition count is 62386 out of 89870 initially.
// Phase 1: matrix 62386 rows 1296 cols
[2023-03-16 20:41:14] [INFO ] Computed 12 place invariants in 220 ms
Interrupted random walk after 604525 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=20 ) properties seen 0
Finished Best-First random walk after 713459 steps, including 4 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=142 )
FORMULA RERS2020-PT-pb107-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Ending property specific reduction for RERS2020-PT-pb107-UpperBounds-01 in 42337 ms.
Starting property specific reduction for RERS2020-PT-pb107-UpperBounds-02
Normalized transition count is 62408 out of 89890 initially.
// Phase 1: matrix 62408 rows 1297 cols
[2023-03-16 20:41:50] [INFO ] Computed 12 place invariants in 256 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 517 ms. (steps per millisecond=19 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
[2023-03-16 20:41:50] [INFO ] Flow matrix only has 62408 transitions (discarded 27482 similar events)
// Phase 1: matrix 62408 rows 1297 cols
[2023-03-16 20:41:50] [INFO ] Computed 12 place invariants in 240 ms
[2023-03-16 20:41:51] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2023-03-16 20:41:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:41:55] [INFO ] [Real]Absence check using state equation in 4816 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1297 places. Attempting structural reductions.
Drop transitions removed 31 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 1297/1297 places, 89859/89859 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1297 transition count 89878
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 1296 transition count 89877
Applied a total of 3 rules in 986 ms. Remains 1296 /1297 variables (removed 1) and now considering 89877/89859 (removed -18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 988 ms. Remains : 1296/1297 places, 89877/89859 transitions.
Normalized transition count is 62393 out of 89877 initially.
// Phase 1: matrix 62393 rows 1296 cols
[2023-03-16 20:41:57] [INFO ] Computed 12 place invariants in 248 ms
Interrupted random walk after 589175 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=19 ) properties seen 0
Interrupted Best-First random walk after 827827 steps, including 3 resets, run timeout after 5001 ms. (steps per millisecond=165 ) properties seen 0
[2023-03-16 20:42:32] [INFO ] Flow matrix only has 62393 transitions (discarded 27484 similar events)
// Phase 1: matrix 62393 rows 1296 cols
[2023-03-16 20:42:32] [INFO ] Computed 12 place invariants in 192 ms
[2023-03-16 20:42:32] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2023-03-16 20:42:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:42:44] [INFO ] [Real]Absence check using state equation in 12111 ms returned sat
[2023-03-16 20:42:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 20:42:45] [INFO ] [Nat]Absence check using 12 positive place invariants in 19 ms returned sat
[2023-03-16 20:42:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 20:42:58] [INFO ] [Nat]Absence check using state equation in 12159 ms returned sat
[2023-03-16 20:42:58] [INFO ] State equation strengthened by 3684 read => feed constraints.
[2023-03-16 20:43:03] [INFO ] [Nat]Added 3684 Read/Feed constraints in 4951 ms returned sat
[2023-03-16 20:43:09] [INFO ] Deduced a trap composed of 31 places in 5872 ms of which 1 ms to minimize.
[2023-03-16 20:43:16] [INFO ] Deduced a trap composed of 68 places in 6036 ms of which 1 ms to minimize.
[2023-03-16 20:43:22] [INFO ] Deduced a trap composed of 61 places in 5241 ms of which 1 ms to minimize.
[2023-03-16 20:43:28] [INFO ] Deduced a trap composed of 26 places in 4986 ms of which 1 ms to minimize.
[2023-03-16 20:43:33] [INFO ] Deduced a trap composed of 19 places in 4340 ms of which 1 ms to minimize.
[2023-03-16 20:43:33] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89877/89877 transitions.
Applied a total of 0 rules in 390 ms. Remains 1296 /1296 variables (removed 0) and now considering 89877/89877 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 390 ms. Remains : 1296/1296 places, 89877/89877 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89877/89877 transitions.
Applied a total of 0 rules in 390 ms. Remains 1296 /1296 variables (removed 0) and now considering 89877/89877 (removed 0) transitions.
[2023-03-16 20:43:34] [INFO ] Flow matrix only has 62393 transitions (discarded 27484 similar events)
[2023-03-16 20:43:34] [INFO ] Invariant cache hit.
[2023-03-16 20:43:38] [INFO ] Implicit Places using invariants in 3639 ms returned []
Implicit Place search using SMT only with invariants took 3640 ms to find 0 implicit places.
[2023-03-16 20:43:38] [INFO ] Flow matrix only has 62393 transitions (discarded 27484 similar events)
[2023-03-16 20:43:38] [INFO ] Invariant cache hit.
[2023-03-16 20:44:08] [INFO ] Performed 85754/89877 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 20:44:09] [INFO ] Dead Transitions using invariants and state equation in 31582 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35620 ms. Remains : 1296/1296 places, 89877/89877 transitions.
Ending property specific reduction for RERS2020-PT-pb107-UpperBounds-02 in 139944 ms.
Starting property specific reduction for RERS2020-PT-pb107-UpperBounds-03
Normalized transition count is 62408 out of 89890 initially.
// Phase 1: matrix 62408 rows 1297 cols
[2023-03-16 20:44:09] [INFO ] Computed 12 place invariants in 227 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 498 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
[2023-03-16 20:44:10] [INFO ] Flow matrix only has 62408 transitions (discarded 27482 similar events)
// Phase 1: matrix 62408 rows 1297 cols
[2023-03-16 20:44:10] [INFO ] Computed 12 place invariants in 221 ms
[2023-03-16 20:44:11] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2023-03-16 20:44:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:44: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: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1297 places. Attempting structural reductions.
Drop transitions removed 9 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 1297/1297 places, 89881/89881 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1297 transition count 89880
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 1296 transition count 89879
Applied a total of 3 rules in 855 ms. Remains 1296 /1297 variables (removed 1) and now considering 89879/89881 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 857 ms. Remains : 1296/1297 places, 89879/89881 transitions.
Normalized transition count is 62395 out of 89879 initially.
// Phase 1: matrix 62395 rows 1296 cols
[2023-03-16 20:44:17] [INFO ] Computed 12 place invariants in 252 ms
Interrupted random walk after 572436 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=19 ) properties seen 0
Interrupted Best-First random walk after 816975 steps, including 5 resets, run timeout after 5001 ms. (steps per millisecond=163 ) properties seen 0
[2023-03-16 20:44:52] [INFO ] Flow matrix only has 62395 transitions (discarded 27484 similar events)
// Phase 1: matrix 62395 rows 1296 cols
[2023-03-16 20:44:52] [INFO ] Computed 12 place invariants in 194 ms
[2023-03-16 20:44:52] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2023-03-16 20:44:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:45:05] [INFO ] [Real]Absence check using state equation in 12768 ms returned sat
[2023-03-16 20:45:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 20:45:06] [INFO ] [Nat]Absence check using 12 positive place invariants in 20 ms returned sat
[2023-03-16 20:45:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 20:45:18] [INFO ] [Nat]Absence check using state equation in 12014 ms returned sat
[2023-03-16 20:45:18] [INFO ] State equation strengthened by 3685 read => feed constraints.
[2023-03-16 20:45:24] [INFO ] [Nat]Added 3685 Read/Feed constraints in 5752 ms returned sat
[2023-03-16 20:45:32] [INFO ] Deduced a trap composed of 49 places in 6590 ms of which 2 ms to minimize.
[2023-03-16 20:45:39] [INFO ] Deduced a trap composed of 19 places in 6208 ms of which 1 ms to minimize.
[2023-03-16 20:45:45] [INFO ] Deduced a trap composed of 166 places in 5941 ms of which 1 ms to minimize.
[2023-03-16 20:45:50] [INFO ] Deduced a trap composed of 26 places in 4125 ms of which 1 ms to minimize.
[2023-03-16 20:45:58] [INFO ] Deduced a trap composed of 12 places in 7731 ms of which 1 ms to minimize.
[2023-03-16 20:45:58] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89879/89879 transitions.
Applied a total of 0 rules in 394 ms. Remains 1296 /1296 variables (removed 0) and now considering 89879/89879 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 394 ms. Remains : 1296/1296 places, 89879/89879 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89879/89879 transitions.
Applied a total of 0 rules in 393 ms. Remains 1296 /1296 variables (removed 0) and now considering 89879/89879 (removed 0) transitions.
[2023-03-16 20:45:59] [INFO ] Flow matrix only has 62395 transitions (discarded 27484 similar events)
[2023-03-16 20:45:59] [INFO ] Invariant cache hit.
[2023-03-16 20:46:03] [INFO ] Implicit Places using invariants in 3694 ms returned []
Implicit Place search using SMT only with invariants took 3695 ms to find 0 implicit places.
[2023-03-16 20:46:03] [INFO ] Flow matrix only has 62395 transitions (discarded 27484 similar events)
[2023-03-16 20:46:03] [INFO ] Invariant cache hit.
[2023-03-16 20:46:33] [INFO ] Performed 88405/89879 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 20:46:34] [INFO ] Dead Transitions using invariants and state equation in 30670 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34766 ms. Remains : 1296/1296 places, 89879/89879 transitions.
Ending property specific reduction for RERS2020-PT-pb107-UpperBounds-03 in 144399 ms.
Starting property specific reduction for RERS2020-PT-pb107-UpperBounds-05
Normalized transition count is 62408 out of 89890 initially.
// Phase 1: matrix 62408 rows 1297 cols
[2023-03-16 20:46:34] [INFO ] Computed 12 place invariants in 238 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 512 ms. (steps per millisecond=19 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
[2023-03-16 20:46:35] [INFO ] Flow matrix only has 62408 transitions (discarded 27482 similar events)
// Phase 1: matrix 62408 rows 1297 cols
[2023-03-16 20:46:35] [INFO ] Computed 12 place invariants in 222 ms
[2023-03-16 20:46:35] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2023-03-16 20:46:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:46:40] [INFO ] [Real]Absence check using state equation in 4823 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1297 places. Attempting structural reductions.
Drop transitions removed 43 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 1297/1297 places, 89847/89847 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1297 transition count 89866
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 1296 transition count 89865
Applied a total of 3 rules in 849 ms. Remains 1296 /1297 variables (removed 1) and now considering 89865/89847 (removed -18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 851 ms. Remains : 1296/1297 places, 89865/89847 transitions.
Normalized transition count is 62381 out of 89865 initially.
// Phase 1: matrix 62381 rows 1296 cols
[2023-03-16 20:46:41] [INFO ] Computed 12 place invariants in 224 ms
Interrupted random walk after 638016 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen 0
Interrupted Best-First random walk after 842117 steps, including 3 resets, run timeout after 5001 ms. (steps per millisecond=168 ) properties seen 0
[2023-03-16 20:47:16] [INFO ] Flow matrix only has 62381 transitions (discarded 27484 similar events)
// Phase 1: matrix 62381 rows 1296 cols
[2023-03-16 20:47:16] [INFO ] Computed 12 place invariants in 186 ms
[2023-03-16 20:47:16] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2023-03-16 20:47:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:47:28] [INFO ] [Real]Absence check using state equation in 12130 ms returned sat
[2023-03-16 20:47:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 20:47:29] [INFO ] [Nat]Absence check using 12 positive place invariants in 21 ms returned sat
[2023-03-16 20:47:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 20:47:41] [INFO ] [Nat]Absence check using state equation in 12021 ms returned sat
[2023-03-16 20:47:42] [INFO ] State equation strengthened by 3686 read => feed constraints.
[2023-03-16 20:47:47] [INFO ] [Nat]Added 3686 Read/Feed constraints in 5239 ms returned sat
[2023-03-16 20:47:54] [INFO ] Deduced a trap composed of 68 places in 6161 ms of which 1 ms to minimize.
[2023-03-16 20:48:01] [INFO ] Deduced a trap composed of 49 places in 5999 ms of which 1 ms to minimize.
[2023-03-16 20:48:07] [INFO ] Deduced a trap composed of 19 places in 5599 ms of which 1 ms to minimize.
[2023-03-16 20:48:13] [INFO ] Deduced a trap composed of 272 places in 5371 ms of which 1 ms to minimize.
[2023-03-16 20:48:18] [INFO ] Deduced a trap composed of 26 places in 3586 ms of which 1 ms to minimize.
[2023-03-16 20:48:18] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89865/89865 transitions.
Applied a total of 0 rules in 406 ms. Remains 1296 /1296 variables (removed 0) and now considering 89865/89865 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 406 ms. Remains : 1296/1296 places, 89865/89865 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89865/89865 transitions.
Applied a total of 0 rules in 415 ms. Remains 1296 /1296 variables (removed 0) and now considering 89865/89865 (removed 0) transitions.
[2023-03-16 20:48:19] [INFO ] Flow matrix only has 62381 transitions (discarded 27484 similar events)
[2023-03-16 20:48:19] [INFO ] Invariant cache hit.
[2023-03-16 20:48:22] [INFO ] Implicit Places using invariants in 3687 ms returned []
Implicit Place search using SMT only with invariants took 3688 ms to find 0 implicit places.
[2023-03-16 20:48:22] [INFO ] Flow matrix only has 62381 transitions (discarded 27484 similar events)
[2023-03-16 20:48:22] [INFO ] Invariant cache hit.
[2023-03-16 20:48:52] [INFO ] Dead Transitions using invariants and state equation in 29642 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33754 ms. Remains : 1296/1296 places, 89865/89865 transitions.
Ending property specific reduction for RERS2020-PT-pb107-UpperBounds-05 in 138296 ms.
Starting property specific reduction for RERS2020-PT-pb107-UpperBounds-08
Normalized transition count is 62408 out of 89890 initially.
// Phase 1: matrix 62408 rows 1297 cols
[2023-03-16 20:48:52] [INFO ] Computed 12 place invariants in 200 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 544 ms. (steps per millisecond=18 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
[2023-03-16 20:48:53] [INFO ] Flow matrix only has 62408 transitions (discarded 27482 similar events)
// Phase 1: matrix 62408 rows 1297 cols
[2023-03-16 20:48:53] [INFO ] Computed 12 place invariants in 194 ms
[2023-03-16 20:48:53] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2023-03-16 20:48:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:48:58] [INFO ] [Real]Absence check using state equation in 4833 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1297 places. Attempting structural reductions.
Drop transitions removed 9 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 1297/1297 places, 89881/89881 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1297 transition count 89900
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 1296 transition count 89899
Applied a total of 3 rules in 821 ms. Remains 1296 /1297 variables (removed 1) and now considering 89899/89881 (removed -18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 823 ms. Remains : 1296/1297 places, 89899/89881 transitions.
Normalized transition count is 62415 out of 89899 initially.
// Phase 1: matrix 62415 rows 1296 cols
[2023-03-16 20:48:59] [INFO ] Computed 12 place invariants in 188 ms
Interrupted random walk after 637193 steps, including 3 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen 0
Interrupted Best-First random walk after 813834 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=162 ) properties seen 0
[2023-03-16 20:49:34] [INFO ] Flow matrix only has 62415 transitions (discarded 27484 similar events)
// Phase 1: matrix 62415 rows 1296 cols
[2023-03-16 20:49:34] [INFO ] Computed 12 place invariants in 233 ms
[2023-03-16 20:49:35] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2023-03-16 20:49:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:49:47] [INFO ] [Real]Absence check using state equation in 12084 ms returned sat
[2023-03-16 20:49:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 20:49:48] [INFO ] [Nat]Absence check using 12 positive place invariants in 20 ms returned sat
[2023-03-16 20:49:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 20:50:00] [INFO ] [Nat]Absence check using state equation in 12229 ms returned sat
[2023-03-16 20:50:00] [INFO ] State equation strengthened by 3687 read => feed constraints.
[2023-03-16 20:50:05] [INFO ] [Nat]Added 3687 Read/Feed constraints in 4920 ms returned sat
[2023-03-16 20:50:13] [INFO ] Deduced a trap composed of 49 places in 6526 ms of which 1 ms to minimize.
[2023-03-16 20:50:20] [INFO ] Deduced a trap composed of 19 places in 6729 ms of which 1 ms to minimize.
[2023-03-16 20:50:27] [INFO ] Deduced a trap composed of 69 places in 6437 ms of which 1 ms to minimize.
[2023-03-16 20:50:34] [INFO ] Deduced a trap composed of 262 places in 6171 ms of which 1 ms to minimize.
[2023-03-16 20:50:34] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89899/89899 transitions.
Applied a total of 0 rules in 479 ms. Remains 1296 /1296 variables (removed 0) and now considering 89899/89899 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 479 ms. Remains : 1296/1296 places, 89899/89899 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89899/89899 transitions.
Applied a total of 0 rules in 481 ms. Remains 1296 /1296 variables (removed 0) and now considering 89899/89899 (removed 0) transitions.
[2023-03-16 20:50:35] [INFO ] Flow matrix only has 62415 transitions (discarded 27484 similar events)
[2023-03-16 20:50:35] [INFO ] Invariant cache hit.
[2023-03-16 20:50:39] [INFO ] Implicit Places using invariants in 3811 ms returned []
Implicit Place search using SMT only with invariants took 3811 ms to find 0 implicit places.
[2023-03-16 20:50:39] [INFO ] Flow matrix only has 62415 transitions (discarded 27484 similar events)
[2023-03-16 20:50:39] [INFO ] Invariant cache hit.
[2023-03-16 20:51:09] [INFO ] Performed 88960/89899 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 20:51:10] [INFO ] Dead Transitions using invariants and state equation in 30516 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34818 ms. Remains : 1296/1296 places, 89899/89899 transitions.
Ending property specific reduction for RERS2020-PT-pb107-UpperBounds-08 in 137741 ms.
Starting property specific reduction for RERS2020-PT-pb107-UpperBounds-09
Normalized transition count is 62408 out of 89890 initially.
// Phase 1: matrix 62408 rows 1297 cols
[2023-03-16 20:51:10] [INFO ] Computed 12 place invariants in 208 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 512 ms. (steps per millisecond=19 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
[2023-03-16 20:51:11] [INFO ] Flow matrix only has 62408 transitions (discarded 27482 similar events)
// Phase 1: matrix 62408 rows 1297 cols
[2023-03-16 20:51:11] [INFO ] Computed 12 place invariants in 257 ms
[2023-03-16 20:51:11] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2023-03-16 20:51:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:51:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1297 places. Attempting structural reductions.
Drop transitions removed 194 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 1297/1297 places, 89696/89696 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1297 transition count 89715
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 1296 transition count 89714
Applied a total of 3 rules in 822 ms. Remains 1296 /1297 variables (removed 1) and now considering 89714/89696 (removed -18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 825 ms. Remains : 1296/1297 places, 89714/89696 transitions.
Normalized transition count is 62274 out of 89714 initially.
// Phase 1: matrix 62274 rows 1296 cols
[2023-03-16 20:51:17] [INFO ] Computed 12 place invariants in 254 ms
Interrupted random walk after 637580 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen 0
Interrupted Best-First random walk after 850061 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=169 ) properties seen 0
[2023-03-16 20:51:52] [INFO ] Flow matrix only has 62274 transitions (discarded 27440 similar events)
// Phase 1: matrix 62274 rows 1296 cols
[2023-03-16 20:51:52] [INFO ] Computed 12 place invariants in 181 ms
[2023-03-16 20:51:52] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2023-03-16 20:51:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:52:04] [INFO ] [Real]Absence check using state equation in 11962 ms returned sat
[2023-03-16 20:52:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 20:52:05] [INFO ] [Nat]Absence check using 12 positive place invariants in 20 ms returned sat
[2023-03-16 20:52:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 20:52:17] [INFO ] [Nat]Absence check using state equation in 11808 ms returned sat
[2023-03-16 20:52:18] [INFO ] State equation strengthened by 3685 read => feed constraints.
[2023-03-16 20:52:23] [INFO ] [Nat]Added 3685 Read/Feed constraints in 5084 ms returned sat
[2023-03-16 20:52:29] [INFO ] Deduced a trap composed of 31 places in 5934 ms of which 2 ms to minimize.
[2023-03-16 20:52:36] [INFO ] Deduced a trap composed of 68 places in 5506 ms of which 1 ms to minimize.
[2023-03-16 20:52:42] [INFO ] Deduced a trap composed of 26 places in 5255 ms of which 1 ms to minimize.
[2023-03-16 20:52:48] [INFO ] Deduced a trap composed of 19 places in 5383 ms of which 4 ms to minimize.
[2023-03-16 20:52:54] [INFO ] Deduced a trap composed of 61 places in 5196 ms of which 1 ms to minimize.
[2023-03-16 20:52:54] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89714/89714 transitions.
Applied a total of 0 rules in 409 ms. Remains 1296 /1296 variables (removed 0) and now considering 89714/89714 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 409 ms. Remains : 1296/1296 places, 89714/89714 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89714/89714 transitions.
Applied a total of 0 rules in 411 ms. Remains 1296 /1296 variables (removed 0) and now considering 89714/89714 (removed 0) transitions.
[2023-03-16 20:52:55] [INFO ] Flow matrix only has 62274 transitions (discarded 27440 similar events)
[2023-03-16 20:52:55] [INFO ] Invariant cache hit.
[2023-03-16 20:52:58] [INFO ] Implicit Places using invariants in 3582 ms returned []
Implicit Place search using SMT only with invariants took 3585 ms to find 0 implicit places.
[2023-03-16 20:52:58] [INFO ] Flow matrix only has 62274 transitions (discarded 27440 similar events)
[2023-03-16 20:52:58] [INFO ] Invariant cache hit.
[2023-03-16 20:53:28] [INFO ] Performed 89556/89714 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 20:53:29] [INFO ] Dead Transitions using invariants and state equation in 30271 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34276 ms. Remains : 1296/1296 places, 89714/89714 transitions.
Ending property specific reduction for RERS2020-PT-pb107-UpperBounds-09 in 138936 ms.
Starting property specific reduction for RERS2020-PT-pb107-UpperBounds-10
Normalized transition count is 62408 out of 89890 initially.
// Phase 1: matrix 62408 rows 1297 cols
[2023-03-16 20:53:29] [INFO ] Computed 12 place invariants in 218 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 498 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
[2023-03-16 20:53:29] [INFO ] Flow matrix only has 62408 transitions (discarded 27482 similar events)
// Phase 1: matrix 62408 rows 1297 cols
[2023-03-16 20:53:30] [INFO ] Computed 12 place invariants in 212 ms
[2023-03-16 20:53:30] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2023-03-16 20:53:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:53:35] [INFO ] [Real]Absence check using state equation in 4823 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1297 places. Attempting structural reductions.
Drop transitions removed 146 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 1297/1297 places, 89744/89744 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1297 transition count 89763
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 1296 transition count 89762
Applied a total of 3 rules in 825 ms. Remains 1296 /1297 variables (removed 1) and now considering 89762/89744 (removed -18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 827 ms. Remains : 1296/1297 places, 89762/89744 transitions.
Normalized transition count is 62316 out of 89762 initially.
// Phase 1: matrix 62316 rows 1296 cols
[2023-03-16 20:53:36] [INFO ] Computed 12 place invariants in 203 ms
Interrupted random walk after 613119 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=20 ) properties seen 0
Interrupted Best-First random walk after 805295 steps, including 4 resets, run timeout after 5001 ms. (steps per millisecond=161 ) properties seen 0
[2023-03-16 20:54:11] [INFO ] Flow matrix only has 62316 transitions (discarded 27446 similar events)
// Phase 1: matrix 62316 rows 1296 cols
[2023-03-16 20:54:11] [INFO ] Computed 12 place invariants in 193 ms
[2023-03-16 20:54:11] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2023-03-16 20:54:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:54:23] [INFO ] [Real]Absence check using state equation in 11954 ms returned sat
[2023-03-16 20:54:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 20:54:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 19 ms returned sat
[2023-03-16 20:54:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 20:54:36] [INFO ] [Nat]Absence check using state equation in 12047 ms returned sat
[2023-03-16 20:54:37] [INFO ] State equation strengthened by 3683 read => feed constraints.
[2023-03-16 20:54:42] [INFO ] [Nat]Added 3683 Read/Feed constraints in 5020 ms returned sat
[2023-03-16 20:54:49] [INFO ] Deduced a trap composed of 49 places in 6742 ms of which 1 ms to minimize.
[2023-03-16 20:54:57] [INFO ] Deduced a trap composed of 19 places in 6511 ms of which 1 ms to minimize.
[2023-03-16 20:55:04] [INFO ] Deduced a trap composed of 52 places in 6350 ms of which 1 ms to minimize.
[2023-03-16 20:55:11] [INFO ] Deduced a trap composed of 69 places in 6324 ms of which 2 ms to minimize.
[2023-03-16 20:55:11] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89762/89762 transitions.
Applied a total of 0 rules in 379 ms. Remains 1296 /1296 variables (removed 0) and now considering 89762/89762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 380 ms. Remains : 1296/1296 places, 89762/89762 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89762/89762 transitions.
Applied a total of 0 rules in 382 ms. Remains 1296 /1296 variables (removed 0) and now considering 89762/89762 (removed 0) transitions.
[2023-03-16 20:55:11] [INFO ] Flow matrix only has 62316 transitions (discarded 27446 similar events)
[2023-03-16 20:55:11] [INFO ] Invariant cache hit.
[2023-03-16 20:55:15] [INFO ] Implicit Places using invariants in 3741 ms returned []
Implicit Place search using SMT only with invariants took 3741 ms to find 0 implicit places.
[2023-03-16 20:55:15] [INFO ] Flow matrix only has 62316 transitions (discarded 27446 similar events)
[2023-03-16 20:55:15] [INFO ] Invariant cache hit.
[2023-03-16 20:55:45] [INFO ] Performed 86348/89762 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 20:55:47] [INFO ] Dead Transitions using invariants and state equation in 31310 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35441 ms. Remains : 1296/1296 places, 89762/89762 transitions.
Ending property specific reduction for RERS2020-PT-pb107-UpperBounds-10 in 138007 ms.
Starting property specific reduction for RERS2020-PT-pb107-UpperBounds-11
Normalized transition count is 62408 out of 89890 initially.
// Phase 1: matrix 62408 rows 1297 cols
[2023-03-16 20:55:47] [INFO ] Computed 12 place invariants in 211 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 466 ms. (steps per millisecond=21 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
[2023-03-16 20:55:47] [INFO ] Flow matrix only has 62408 transitions (discarded 27482 similar events)
// Phase 1: matrix 62408 rows 1297 cols
[2023-03-16 20:55:48] [INFO ] Computed 12 place invariants in 260 ms
[2023-03-16 20:55:48] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2023-03-16 20:55:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:55:53] [INFO ] [Real]Absence check using state equation in 4833 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1297 places. Attempting structural reductions.
Drop transitions removed 290 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 1297/1297 places, 89600/89600 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1297 transition count 89619
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 1296 transition count 89618
Applied a total of 3 rules in 806 ms. Remains 1296 /1297 variables (removed 1) and now considering 89618/89600 (removed -18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 808 ms. Remains : 1296/1297 places, 89618/89600 transitions.
Normalized transition count is 62166 out of 89618 initially.
// Phase 1: matrix 62166 rows 1296 cols
[2023-03-16 20:55:54] [INFO ] Computed 12 place invariants in 200 ms
Interrupted random walk after 634222 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen 0
Interrupted Best-First random walk after 833855 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=166 ) properties seen 0
[2023-03-16 20:56:29] [INFO ] Flow matrix only has 62166 transitions (discarded 27452 similar events)
// Phase 1: matrix 62166 rows 1296 cols
[2023-03-16 20:56:29] [INFO ] Computed 12 place invariants in 239 ms
[2023-03-16 20:56:29] [INFO ] [Real]Absence check using 12 positive place invariants in 17 ms returned sat
[2023-03-16 20:56:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 20:56:41] [INFO ] [Real]Absence check using state equation in 11892 ms returned sat
[2023-03-16 20:56:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 20:56:42] [INFO ] [Nat]Absence check using 12 positive place invariants in 21 ms returned sat
[2023-03-16 20:56:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 20:56:55] [INFO ] [Nat]Absence check using state equation in 12585 ms returned sat
[2023-03-16 20:56:55] [INFO ] State equation strengthened by 3684 read => feed constraints.
[2023-03-16 20:57:01] [INFO ] [Nat]Added 3684 Read/Feed constraints in 5481 ms returned sat
[2023-03-16 20:57:08] [INFO ] Deduced a trap composed of 49 places in 6555 ms of which 1 ms to minimize.
[2023-03-16 20:57:16] [INFO ] Deduced a trap composed of 165 places in 7236 ms of which 1 ms to minimize.
[2023-03-16 20:57:22] [INFO ] Deduced a trap composed of 19 places in 5409 ms of which 1 ms to minimize.
[2023-03-16 20:57:28] [INFO ] Deduced a trap composed of 26 places in 5085 ms of which 1 ms to minimize.
[2023-03-16 20:57:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89618/89618 transitions.
Applied a total of 0 rules in 366 ms. Remains 1296 /1296 variables (removed 0) and now considering 89618/89618 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 366 ms. Remains : 1296/1296 places, 89618/89618 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 89618/89618 transitions.
Applied a total of 0 rules in 363 ms. Remains 1296 /1296 variables (removed 0) and now considering 89618/89618 (removed 0) transitions.
[2023-03-16 20:57:29] [INFO ] Flow matrix only has 62166 transitions (discarded 27452 similar events)
[2023-03-16 20:57:29] [INFO ] Invariant cache hit.
[2023-03-16 20:57:32] [INFO ] Implicit Places using invariants in 3475 ms returned []
Implicit Place search using SMT only with invariants took 3475 ms to find 0 implicit places.
[2023-03-16 20:57:32] [INFO ] Flow matrix only has 62166 transitions (discarded 27452 similar events)
[2023-03-16 20:57:32] [INFO ] Invariant cache hit.
[2023-03-16 20:58:02] [INFO ] Dead Transitions using invariants and state equation in 29630 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33477 ms. Remains : 1296/1296 places, 89618/89618 transitions.
Ending property specific reduction for RERS2020-PT-pb107-UpperBounds-11 in 135286 ms.
[2023-03-16 20:58:05] [INFO ] Flatten gal took : 2758 ms
[2023-03-16 20:58:07] [INFO ] Applying decomposition
[2023-03-16 20:58:09] [INFO ] Flatten gal took : 2445 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4040326927086404261.txt' '-o' '/tmp/graph4040326927086404261.bin' '-w' '/tmp/graph4040326927086404261.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4040326927086404261.bin' '-l' '-1' '-v' '-w' '/tmp/graph4040326927086404261.weights' '-q' '0' '-e' '0.001'
[2023-03-16 20:58:15] [INFO ] Decomposing Gal with order
[2023-03-16 20:58:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 20:58:23] [INFO ] Removed a total of 195332 redundant transitions.
[2023-03-16 20:58:23] [INFO ] Flatten gal took : 6187 ms
[2023-03-16 20:58:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 3381 labels/synchronizations in 3218 ms.
[2023-03-16 20:58:29] [INFO ] Time to serialize gal into /tmp/UpperBounds12763620897081680251.gal : 220 ms
[2023-03-16 20:58:29] [INFO ] Time to serialize properties into /tmp/UpperBounds14343776717027752777.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12763620897081680251.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14343776717027752777.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds14343776717027752777.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\_mod\_flat,1.64396e+13,127.124,2156560,3054,14029,1.34746e+06,620571,38432,2.24662e+06,17424,2.17003e+06,0
Total reachable state count : 16439581208014
Verifying 8 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property RERS2020-PT-pb107-UpperBounds-00 :0 <= i6.u159.ps824 <= 0
FORMULA RERS2020-PT-pb107-UpperBounds-00 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
RERS2020-PT-pb107-UpperBounds-00,0,127.271,2156560,1,0,1.34746e+06,620571,39356,2.24662e+06,17896,2.17003e+06,6869
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property RERS2020-PT-pb107-UpperBounds-02 :0 <= i7.u181.ps1030 <= 0
FORMULA RERS2020-PT-pb107-UpperBounds-02 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
RERS2020-PT-pb107-UpperBounds-02,0,127.279,2156560,1,0,1.34746e+06,620571,39519,2.24662e+06,17904,2.17003e+06,7277
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property RERS2020-PT-pb107-UpperBounds-03 :0 <= i5.u150.ps413 <= 0
FORMULA RERS2020-PT-pb107-UpperBounds-03 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
RERS2020-PT-pb107-UpperBounds-03,0,127.285,2156560,1,0,1.34746e+06,620571,39547,2.24662e+06,17980,2.17003e+06,7301
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property RERS2020-PT-pb107-UpperBounds-05 :0 <= i5.u150.ps80 <= 0
FORMULA RERS2020-PT-pb107-UpperBounds-05 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
RERS2020-PT-pb107-UpperBounds-05,0,127.3,2156560,1,0,1.34746e+06,620571,39565,2.24662e+06,18684,2.17003e+06,7325
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property RERS2020-PT-pb107-UpperBounds-08 :0 <= i5.u150.ps176 <= 0
FORMULA RERS2020-PT-pb107-UpperBounds-08 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
RERS2020-PT-pb107-UpperBounds-08,0,127.314,2156560,1,0,1.34746e+06,620571,39583,2.24662e+06,19402,2.17003e+06,7349
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property RERS2020-PT-pb107-UpperBounds-09 :0 <= i0.u211.ps1215 <= 0
FORMULA RERS2020-PT-pb107-UpperBounds-09 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
RERS2020-PT-pb107-UpperBounds-09,0,127.318,2156560,1,0,1.34746e+06,620571,39632,2.24662e+06,19402,2.17003e+06,7375
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property RERS2020-PT-pb107-UpperBounds-10 :0 <= i4.i0.i0.u9.ps827 <= 0
FORMULA RERS2020-PT-pb107-UpperBounds-10 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
RERS2020-PT-pb107-UpperBounds-10,0,127.321,2156560,1,0,1.34746e+06,620571,39668,2.24662e+06,19402,2.17003e+06,7612
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property RERS2020-PT-pb107-UpperBounds-11 :0 <= i4.i0.i1.u16.ps952 <= 0
FORMULA RERS2020-PT-pb107-UpperBounds-11 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
RERS2020-PT-pb107-UpperBounds-11,0,127.325,2156560,1,0,1.34746e+06,620571,39701,2.24662e+06,19402,2.17003e+06,7827
Total runtime 2024037 ms.
BK_STOP 1679000437526
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RERS2020-PT-pb107"
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-5348"
echo " Executing tool itstools"
echo " Input is RERS2020-PT-pb107, 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 r325-tall-167889197000269"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RERS2020-PT-pb107.tgz
mv RERS2020-PT-pb107 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 ;