Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r323-tall-165472292900253.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
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 r323-tall-165472292900253
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 58M
-rw-r--r-- 1 mcc users 5.6K Jun 7 17:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Jun 7 17:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 7 17:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 7 17:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 6 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 6 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 14K Jun 7 17:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Jun 7 17:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Jun 7 17:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 7 17:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 58M Jun 6 12:11 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 1654785083288

Running Version 0
[2022-06-09 14:31:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 14:31:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 14:31:26] [INFO ] Load time of PNML (sax parser for PT used): 1850 ms
[2022-06-09 14:31:26] [INFO ] Transformed 1382 places.
[2022-06-09 14:31:27] [INFO ] Transformed 104643 transitions.
[2022-06-09 14:31:27] [INFO ] Found NUPN structural information;
[2022-06-09 14:31:27] [INFO ] Parsed PT model containing 1382 places and 104643 transitions in 2261 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Ensure Unique test removed 11427 transitions
Reduce redundant transitions removed 11427 transitions.
Normalized transition count is 62870 out of 93216 initially.
// Phase 1: matrix 62870 rows 1382 cols
[2022-06-09 14:31:28] [INFO ] Computed 25 place invariants in 431 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 773 ms. (steps per millisecond=12 ) properties (out of 16) seen :5
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-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb107-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb107-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :1
FORMULA RERS2020-PT-pb107-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
[2022-06-09 14:31:30] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1382 cols
[2022-06-09 14:31:30] [INFO ] Computed 25 place invariants in 254 ms
[2022-06-09 14:31:30] [INFO ] [Real]Absence check using 13 positive place invariants in 34 ms returned sat
[2022-06-09 14:31:30] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2022-06-09 14:31:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:31:35] [INFO ] [Real]Absence check using state equation in 4692 ms returned unknown
[2022-06-09 14:31:35] [INFO ] [Real]Absence check using 13 positive place invariants in 24 ms returned sat
[2022-06-09 14:31:35] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 3 ms returned sat
[2022-06-09 14:31:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:31:40] [INFO ] [Real]Absence check using state equation in 4817 ms returned unknown
[2022-06-09 14:31:40] [INFO ] [Real]Absence check using 13 positive place invariants in 24 ms returned sat
[2022-06-09 14:31:40] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 4 ms returned sat
[2022-06-09 14:31:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:31:45] [INFO ] [Real]Absence check using state equation in 4814 ms returned unknown
[2022-06-09 14:31:45] [INFO ] [Real]Absence check using 13 positive place invariants in 25 ms returned sat
[2022-06-09 14:31:45] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 5 ms returned sat
[2022-06-09 14:31:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:31:50] [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: Stream closed... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 14:31:50] [INFO ] [Real]Absence check using 13 positive place invariants in 25 ms returned sat
[2022-06-09 14:31:50] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 4 ms returned sat
[2022-06-09 14:31:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:31:55] [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 4
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 14:31:55] [INFO ] [Real]Absence check using 13 positive place invariants in 30 ms returned sat
[2022-06-09 14:31:55] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 1 ms returned sat
[2022-06-09 14:31:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:32:00] [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 5
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 14:32:00] [INFO ] [Real]Absence check using 13 positive place invariants in 24 ms returned sat
[2022-06-09 14:32:00] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 5 ms returned sat
[2022-06-09 14:32:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:32:05] [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 6
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 14:32:05] [INFO ] [Real]Absence check using 13 positive place invariants in 24 ms returned sat
[2022-06-09 14:32:05] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 4 ms returned sat
[2022-06-09 14:32:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:32:10] [INFO ] [Real]Absence check using state equation in 4803 ms returned unknown
[2022-06-09 14:32:10] [INFO ] [Real]Absence check using 13 positive place invariants in 25 ms returned sat
[2022-06-09 14:32:10] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 3 ms returned sat
[2022-06-09 14:32:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:32:15] [INFO ] [Real]Absence check using state equation in 4834 ms returned unknown
[2022-06-09 14:32:15] [INFO ] [Real]Absence check using 13 positive place invariants in 24 ms returned sat
[2022-06-09 14:32:15] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2022-06-09 14:32:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:32:20] [INFO ] [Real]Absence check using state equation in 4818 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 10 out of 1382 places. Attempting structural reductions.
Starting structural reductions, 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.98 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 53 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 49 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 117 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 15 times with reduction of 16 identical transitions.
Iterating global reduction 7 with 15 rules applied. Total rules applied 4098 place count 1312 transition count 89935
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 7 with 41 rules applied. Total rules applied 4139 place count 1297 transition count 89909
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 4140 place count 1296 transition count 89908
Applied a total of 4140 rules in 5141 ms. Remains 1296 /1382 variables (removed 86) and now considering 89908/93216 (removed 3308) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1382 places, 89908/93216 transitions.
Normalized transition count is 62424 out of 89908 initially.
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-09 14:32:26] [INFO ] Computed 12 place invariants in 243 ms
Interrupted random walk after 600818 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=20 ) properties seen :{}
Interrupted Best-First random walk after 711318 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=142 ) properties seen :{}
Interrupted Best-First random walk after 724451 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=144 ) properties seen :{}
Interrupted Best-First random walk after 804798 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=160 ) properties seen :{}
Interrupted Best-First random walk after 596958 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=119 ) properties seen :{}
Interrupted Best-First random walk after 481599 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen :{}
Interrupted Best-First random walk after 515937 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=103 ) properties seen :{}
Interrupted Best-First random walk after 550449 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=110 ) properties seen :{}
Interrupted Best-First random walk after 580444 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=116 ) properties seen :{}
Interrupted Best-First random walk after 510531 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=102 ) properties seen :{}
Interrupted Best-First random walk after 496727 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=99 ) properties seen :{}
[2022-06-09 14:33:46] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-09 14:33:46] [INFO ] Computed 12 place invariants in 256 ms
[2022-06-09 14:33:46] [INFO ] [Real]Absence check using 12 positive place invariants in 23 ms returned sat
[2022-06-09 14:33:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:33:59] [INFO ] [Real]Absence check using state equation in 12488 ms returned sat
[2022-06-09 14:34:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 14:34:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 23 ms returned sat
[2022-06-09 14:34:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 14:34:12] [INFO ] [Nat]Absence check using state equation in 12376 ms returned sat
[2022-06-09 14:34:14] [INFO ] State equation strengthened by 3689 read => feed constraints.
[2022-06-09 14:34:34] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 14:34:37] [INFO ] [Nat]Added 3689 Read/Feed constraints in 23505 ms returned unknown
[2022-06-09 14:34:37] [INFO ] [Real]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-09 14:34:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:34:49] [INFO ] [Real]Absence check using state equation in 11800 ms returned sat
[2022-06-09 14:34:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 14:34:50] [INFO ] [Nat]Absence check using 12 positive place invariants in 23 ms returned sat
[2022-06-09 14:34:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 14:35:02] [INFO ] [Nat]Absence check using state equation in 12072 ms returned sat
[2022-06-09 14:35:22] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 14:35:25] [INFO ] [Nat]Added 3689 Read/Feed constraints in 22256 ms returned unknown
[2022-06-09 14:35:25] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned sat
[2022-06-09 14:35:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:35:37] [INFO ] [Real]Absence check using state equation in 11713 ms returned sat
[2022-06-09 14:35:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 14:35:38] [INFO ] [Nat]Absence check using 12 positive place invariants in 22 ms returned sat
[2022-06-09 14:35:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 14:35:49] [INFO ] [Nat]Absence check using state equation in 11838 ms returned sat
[2022-06-09 14:36:08] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 14:36:11] [INFO ] [Nat]Added 3689 Read/Feed constraints in 21218 ms returned unknown
[2022-06-09 14:36:11] [INFO ] [Real]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-09 14:36:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:36:23] [INFO ] [Real]Absence check using state equation in 11973 ms returned sat
[2022-06-09 14:36:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 14:36:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 22 ms returned sat
[2022-06-09 14:36:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 14:36:36] [INFO ] [Nat]Absence check using state equation in 11892 ms returned sat
[2022-06-09 14:36:54] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 14:36:57] [INFO ] [Nat]Added 3689 Read/Feed constraints in 20871 ms returned unknown
[2022-06-09 14:36:57] [INFO ] [Real]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-09 14:36:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:37:09] [INFO ] [Real]Absence check using state equation in 11814 ms returned sat
[2022-06-09 14:37:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 14:37:10] [INFO ] [Nat]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-09 14:37:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 14:37:21] [INFO ] [Nat]Absence check using state equation in 11862 ms returned sat
[2022-06-09 14:37:41] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 14:37:44] [INFO ] [Nat]Added 3689 Read/Feed constraints in 22459 ms returned unknown
[2022-06-09 14:37:44] [INFO ] [Real]Absence check using 12 positive place invariants in 22 ms returned sat
[2022-06-09 14:37:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:37:56] [INFO ] [Real]Absence check using state equation in 11684 ms returned sat
[2022-06-09 14:37:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 14:37:57] [INFO ] [Nat]Absence check using 12 positive place invariants in 22 ms returned sat
[2022-06-09 14:37:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 14:38:09] [INFO ] [Nat]Absence check using state equation in 12109 ms returned sat
[2022-06-09 14:38:28] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 14:38:31] [INFO ] [Nat]Added 3689 Read/Feed constraints in 21849 ms returned unknown
[2022-06-09 14:38:31] [INFO ] [Real]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-09 14:38:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:38:43] [INFO ] [Real]Absence check using state equation in 11840 ms returned sat
[2022-06-09 14:38:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 14:38:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 24 ms returned sat
[2022-06-09 14:38:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 14:38:56] [INFO ] [Nat]Absence check using state equation in 11787 ms returned sat
[2022-06-09 14:39:13] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 14:39:16] [INFO ] [Nat]Added 3689 Read/Feed constraints in 20704 ms returned unknown
[2022-06-09 14:39:17] [INFO ] [Real]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-09 14:39:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:39:28] [INFO ] [Real]Absence check using state equation in 11630 ms returned sat
[2022-06-09 14:39:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 14:39:29] [INFO ] [Nat]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-09 14:39:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 14:39:41] [INFO ] [Nat]Absence check using state equation in 11630 ms returned sat
[2022-06-09 14:39:57] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 14:40:00] [INFO ] [Nat]Added 3689 Read/Feed constraints in 19352 ms returned unknown
[2022-06-09 14:40:00] [INFO ] [Real]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-09 14:40:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:40:12] [INFO ] [Real]Absence check using state equation in 11732 ms returned sat
[2022-06-09 14:40:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 14:40:13] [INFO ] [Nat]Absence check using 12 positive place invariants in 22 ms returned sat
[2022-06-09 14:40:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 14:40:25] [INFO ] [Nat]Absence check using state equation in 11757 ms returned sat
[2022-06-09 14:40:42] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 14:40:45] [INFO ] [Nat]Added 3689 Read/Feed constraints in 20225 ms returned unknown
[2022-06-09 14:40:45] [INFO ] [Real]Absence check using 12 positive place invariants in 22 ms returned sat
[2022-06-09 14:40:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:40:57] [INFO ] [Real]Absence check using state equation in 11712 ms returned sat
[2022-06-09 14:40:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 14:40:58] [INFO ] [Nat]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-09 14:40:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 14:41:10] [INFO ] [Nat]Absence check using state equation in 11853 ms returned sat
[2022-06-09 14:41:27] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 14:41:30] [INFO ] [Nat]Added 3689 Read/Feed constraints in 20578 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 10 out of 1296 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 463 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89908/89908 transitions.
Starting structural reductions, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 471 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
[2022-06-09 14:41:31] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-09 14:41:32] [INFO ] Computed 12 place invariants in 235 ms
[2022-06-09 14:41:36] [INFO ] Implicit Places using invariants in 4085 ms returned []
Implicit Place search using SMT only with invariants took 4086 ms to find 0 implicit places.
[2022-06-09 14:41:36] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-09 14:41:36] [INFO ] Computed 12 place invariants in 217 ms
[2022-06-09 14:42:06] [INFO ] Performed 89076/89908 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-09 14:42:06] [INFO ] Dead Transitions using invariants and state equation in 30707 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89908/89908 transitions.
Starting property specific reduction for RERS2020-PT-pb107-UpperBounds-00
Normalized transition count is 62424 out of 89908 initially.
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-09 14:42:07] [INFO ] Computed 12 place invariants in 238 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 506 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
[2022-06-09 14:42:07] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-09 14:42:07] [INFO ] Computed 12 place invariants in 223 ms
[2022-06-09 14:42:08] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned sat
[2022-06-09 14:42:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:42:12] [INFO ] [Real]Absence check using state equation in 4839 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Drop transitions removed 205 transitions
Starting structural reductions, iteration 0 : 1296/1296 places, 89703/89703 transitions.
Applied a total of 0 rules in 476 ms. Remains 1296 /1296 variables (removed 0) and now considering 89703/89703 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89703/89703 transitions.
Normalized transition count is 62237 out of 89703 initially.
// Phase 1: matrix 62237 rows 1296 cols
[2022-06-09 14:42:13] [INFO ] Computed 12 place invariants in 250 ms
Interrupted random walk after 564235 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen :{}
Interrupted Best-First random walk after 650926 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=130 ) properties seen :{}
[2022-06-09 14:42:48] [INFO ] Flow matrix only has 62237 transitions (discarded 27466 similar events)
// Phase 1: matrix 62237 rows 1296 cols
[2022-06-09 14:42:49] [INFO ] Computed 12 place invariants in 255 ms
[2022-06-09 14:42:49] [INFO ] [Real]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-09 14:42:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:43:01] [INFO ] [Real]Absence check using state equation in 12509 ms returned sat
[2022-06-09 14:43:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 14:43:02] [INFO ] [Nat]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-09 14:43:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 14:43:15] [INFO ] [Nat]Absence check using state equation in 12202 ms returned sat
[2022-06-09 14:43:16] [INFO ] State equation strengthened by 3685 read => feed constraints.
[2022-06-09 14:43:35] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 14:43:38] [INFO ] [Nat]Added 3685 Read/Feed constraints in 22373 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1296/1296 places, 89703/89703 transitions.
Applied a total of 0 rules in 751 ms. Remains 1296 /1296 variables (removed 0) and now considering 89703/89703 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89703/89703 transitions.
Starting structural reductions, iteration 0 : 1296/1296 places, 89703/89703 transitions.
Applied a total of 0 rules in 447 ms. Remains 1296 /1296 variables (removed 0) and now considering 89703/89703 (removed 0) transitions.
[2022-06-09 14:43:40] [INFO ] Flow matrix only has 62237 transitions (discarded 27466 similar events)
// Phase 1: matrix 62237 rows 1296 cols
[2022-06-09 14:43:40] [INFO ] Computed 12 place invariants in 230 ms
[2022-06-09 14:43:44] [INFO ] Implicit Places using invariants in 4594 ms returned []
Implicit Place search using SMT only with invariants took 4595 ms to find 0 implicit places.
[2022-06-09 14:43:44] [INFO ] Flow matrix only has 62237 transitions (discarded 27466 similar events)
// Phase 1: matrix 62237 rows 1296 cols
[2022-06-09 14:43:45] [INFO ] Computed 12 place invariants in 318 ms
[2022-06-09 14:44:14] [INFO ] Dead Transitions using invariants and state equation in 30093 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89703/89703 transitions.
Ending property specific reduction for RERS2020-PT-pb107-UpperBounds-00 in 128170 ms.
Starting property specific reduction for RERS2020-PT-pb107-UpperBounds-01
Normalized transition count is 62424 out of 89908 initially.
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-09 14:44:15] [INFO ] Computed 12 place invariants in 211 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 532 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 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
[2022-06-09 14:44:15] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-09 14:44:16] [INFO ] Computed 12 place invariants in 218 ms
[2022-06-09 14:44:16] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned sat
[2022-06-09 14:44:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:44:21] [INFO ] [Real]Absence check using state equation in 4834 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Drop transitions removed 210 transitions
Starting structural reductions, iteration 0 : 1296/1296 places, 89698/89698 transitions.
Applied a total of 0 rules in 452 ms. Remains 1296 /1296 variables (removed 0) and now considering 89698/89698 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89698/89698 transitions.
Normalized transition count is 62237 out of 89698 initially.
// Phase 1: matrix 62237 rows 1296 cols
[2022-06-09 14:44:21] [INFO ] Computed 12 place invariants in 240 ms
Interrupted random walk after 639591 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen :{}
Interrupted Best-First random walk after 795432 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=159 ) properties seen :{}
[2022-06-09 14:44:56] [INFO ] Flow matrix only has 62237 transitions (discarded 27461 similar events)
// Phase 1: matrix 62237 rows 1296 cols
[2022-06-09 14:44:57] [INFO ] Computed 12 place invariants in 234 ms
[2022-06-09 14:44:57] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2022-06-09 14:44:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:45:09] [INFO ] [Real]Absence check using state equation in 11780 ms returned sat
[2022-06-09 14:45:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 14:45:10] [INFO ] [Nat]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-09 14:45:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 14:45:21] [INFO ] [Nat]Absence check using state equation in 11650 ms returned sat
[2022-06-09 14:45:22] [INFO ] State equation strengthened by 3686 read => feed constraints.
[2022-06-09 14:45:37] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 14:45:41] [INFO ] [Nat]Added 3686 Read/Feed constraints in 18637 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1296/1296 places, 89698/89698 transitions.
Applied a total of 0 rules in 465 ms. Remains 1296 /1296 variables (removed 0) and now considering 89698/89698 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89698/89698 transitions.
Starting structural reductions, iteration 0 : 1296/1296 places, 89698/89698 transitions.
Applied a total of 0 rules in 444 ms. Remains 1296 /1296 variables (removed 0) and now considering 89698/89698 (removed 0) transitions.
[2022-06-09 14:45:42] [INFO ] Flow matrix only has 62237 transitions (discarded 27461 similar events)
// Phase 1: matrix 62237 rows 1296 cols
[2022-06-09 14:45:42] [INFO ] Computed 12 place invariants in 207 ms
[2022-06-09 14:45:45] [INFO ] Implicit Places using invariants in 3806 ms returned []
Implicit Place search using SMT only with invariants took 3806 ms to find 0 implicit places.
[2022-06-09 14:45:45] [INFO ] Flow matrix only has 62237 transitions (discarded 27461 similar events)
// Phase 1: matrix 62237 rows 1296 cols
[2022-06-09 14:45:46] [INFO ] Computed 12 place invariants in 212 ms
[2022-06-09 14:46:16] [INFO ] Dead Transitions using invariants and state equation in 30092 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89698/89698 transitions.
Ending property specific reduction for RERS2020-PT-pb107-UpperBounds-01 in 121118 ms.
Starting property specific reduction for RERS2020-PT-pb107-UpperBounds-04
Normalized transition count is 62424 out of 89908 initially.
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-09 14:46:16] [INFO ] Computed 12 place invariants in 194 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 487 ms. (steps per millisecond=20 ) 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
[2022-06-09 14:46:16] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-09 14:46:17] [INFO ] Computed 12 place invariants in 165 ms
[2022-06-09 14:46:17] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2022-06-09 14:46:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:46:22] [INFO ] [Real]Absence check using state equation in 4847 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Drop transitions removed 362 transitions
Starting structural reductions, iteration 0 : 1296/1296 places, 89546/89546 transitions.
Applied a total of 0 rules in 449 ms. Remains 1296 /1296 variables (removed 0) and now considering 89546/89546 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89546/89546 transitions.
Normalized transition count is 62132 out of 89546 initially.
// Phase 1: matrix 62132 rows 1296 cols
[2022-06-09 14:46:22] [INFO ] Computed 12 place invariants in 229 ms
Interrupted random walk after 603469 steps, including 3 resets, run timeout after 30001 ms. (steps per millisecond=20 ) properties seen :{}
Interrupted Best-First random walk after 823554 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=164 ) properties seen :{}
[2022-06-09 14:46:57] [INFO ] Flow matrix only has 62132 transitions (discarded 27414 similar events)
// Phase 1: matrix 62132 rows 1296 cols
[2022-06-09 14:46:58] [INFO ] Computed 12 place invariants in 233 ms
[2022-06-09 14:46:58] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned sat
[2022-06-09 14:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:47:09] [INFO ] [Real]Absence check using state equation in 11546 ms returned sat
[2022-06-09 14:47:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 14:47:10] [INFO ] [Nat]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-09 14:47:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 14:47:22] [INFO ] [Nat]Absence check using state equation in 11805 ms returned sat
[2022-06-09 14:47:23] [INFO ] State equation strengthened by 3686 read => feed constraints.
[2022-06-09 14:47:40] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 14:47:43] [INFO ] [Nat]Added 3686 Read/Feed constraints in 20079 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1296/1296 places, 89546/89546 transitions.
Applied a total of 0 rules in 453 ms. Remains 1296 /1296 variables (removed 0) and now considering 89546/89546 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89546/89546 transitions.
Starting structural reductions, iteration 0 : 1296/1296 places, 89546/89546 transitions.
Applied a total of 0 rules in 451 ms. Remains 1296 /1296 variables (removed 0) and now considering 89546/89546 (removed 0) transitions.
[2022-06-09 14:47:44] [INFO ] Flow matrix only has 62132 transitions (discarded 27414 similar events)
// Phase 1: matrix 62132 rows 1296 cols
[2022-06-09 14:47:44] [INFO ] Computed 12 place invariants in 212 ms
[2022-06-09 14:47:48] [INFO ] Implicit Places using invariants in 3908 ms returned []
Implicit Place search using SMT only with invariants took 3909 ms to find 0 implicit places.
[2022-06-09 14:47:48] [INFO ] Flow matrix only has 62132 transitions (discarded 27414 similar events)
// Phase 1: matrix 62132 rows 1296 cols
[2022-06-09 14:47:48] [INFO ] Computed 12 place invariants in 214 ms
[2022-06-09 14:48:18] [INFO ] Dead Transitions using invariants and state equation in 29994 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89546/89546 transitions.
Ending property specific reduction for RERS2020-PT-pb107-UpperBounds-04 in 122351 ms.
Starting property specific reduction for RERS2020-PT-pb107-UpperBounds-05
Normalized transition count is 62424 out of 89908 initially.
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-09 14:48:18] [INFO ] Computed 12 place invariants in 242 ms
Incomplete random walk after 10000 steps, including 4 resets, run finished after 502 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 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
[2022-06-09 14:48:19] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-09 14:48:19] [INFO ] Computed 12 place invariants in 223 ms
[2022-06-09 14:48:19] [INFO ] [Real]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-09 14:48:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:48:24] [INFO ] [Real]Absence check using state equation in 4802 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Drop transitions removed 25 transitions
Starting structural reductions, iteration 0 : 1296/1296 places, 89883/89883 transitions.
Applied a total of 0 rules in 445 ms. Remains 1296 /1296 variables (removed 0) and now considering 89883/89883 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89883/89883 transitions.
Normalized transition count is 62399 out of 89883 initially.
// Phase 1: matrix 62399 rows 1296 cols
[2022-06-09 14:48:25] [INFO ] Computed 12 place invariants in 232 ms
Interrupted random walk after 614671 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=20 ) properties seen :{}
Interrupted Best-First random walk after 759752 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=151 ) properties seen :{}
[2022-06-09 14:49:00] [INFO ] Flow matrix only has 62399 transitions (discarded 27484 similar events)
// Phase 1: matrix 62399 rows 1296 cols
[2022-06-09 14:49:00] [INFO ] Computed 12 place invariants in 255 ms
[2022-06-09 14:49:00] [INFO ] [Real]Absence check using 12 positive place invariants in 22 ms returned sat
[2022-06-09 14:49:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:49:12] [INFO ] [Real]Absence check using state equation in 11785 ms returned sat
[2022-06-09 14:49:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 14:49:13] [INFO ] [Nat]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-09 14:49:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 14:49:25] [INFO ] [Nat]Absence check using state equation in 11539 ms returned sat
[2022-06-09 14:49:25] [INFO ] State equation strengthened by 3686 read => feed constraints.
[2022-06-09 14:49:42] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 14:49:46] [INFO ] [Nat]Added 3686 Read/Feed constraints in 20678 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1296/1296 places, 89883/89883 transitions.
Applied a total of 0 rules in 441 ms. Remains 1296 /1296 variables (removed 0) and now considering 89883/89883 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89883/89883 transitions.
Starting structural reductions, iteration 0 : 1296/1296 places, 89883/89883 transitions.
Applied a total of 0 rules in 438 ms. Remains 1296 /1296 variables (removed 0) and now considering 89883/89883 (removed 0) transitions.
[2022-06-09 14:49:47] [INFO ] Flow matrix only has 62399 transitions (discarded 27484 similar events)
// Phase 1: matrix 62399 rows 1296 cols
[2022-06-09 14:49:47] [INFO ] Computed 12 place invariants in 203 ms
[2022-06-09 14:49:51] [INFO ] Implicit Places using invariants in 3999 ms returned []
Implicit Place search using SMT only with invariants took 4000 ms to find 0 implicit places.
[2022-06-09 14:49:51] [INFO ] Flow matrix only has 62399 transitions (discarded 27484 similar events)
// Phase 1: matrix 62399 rows 1296 cols
[2022-06-09 14:49:51] [INFO ] Computed 12 place invariants in 203 ms
[2022-06-09 14:50:21] [INFO ] Performed 89262/89883 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-09 14:50:22] [INFO ] Dead Transitions using invariants and state equation in 30624 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89883/89883 transitions.
Ending property specific reduction for RERS2020-PT-pb107-UpperBounds-05 in 123708 ms.
Starting property specific reduction for RERS2020-PT-pb107-UpperBounds-06
Normalized transition count is 62424 out of 89908 initially.
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-09 14:50:22] [INFO ] Computed 12 place invariants in 228 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 523 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
[2022-06-09 14:50:23] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-09 14:50:23] [INFO ] Computed 12 place invariants in 219 ms
[2022-06-09 14:50:23] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned sat
[2022-06-09 14:50:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:50:28] [INFO ] [Real]Absence check using state equation in 4831 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Drop transitions removed 32 transitions
Starting structural reductions, iteration 0 : 1296/1296 places, 89876/89876 transitions.
Applied a total of 0 rules in 450 ms. Remains 1296 /1296 variables (removed 0) and now considering 89876/89876 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89876/89876 transitions.
Normalized transition count is 62415 out of 89876 initially.
// Phase 1: matrix 62415 rows 1296 cols
[2022-06-09 14:50:29] [INFO ] Computed 12 place invariants in 241 ms
Interrupted random walk after 596379 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=19 ) properties seen :{}
Interrupted Best-First random walk after 752567 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=150 ) properties seen :{}
[2022-06-09 14:51:04] [INFO ] Flow matrix only has 62415 transitions (discarded 27461 similar events)
// Phase 1: matrix 62415 rows 1296 cols
[2022-06-09 14:51:04] [INFO ] Computed 12 place invariants in 249 ms
[2022-06-09 14:51:04] [INFO ] [Real]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-09 14:51:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:51:16] [INFO ] [Real]Absence check using state equation in 11666 ms returned sat
[2022-06-09 14:51:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 14:51:17] [INFO ] [Nat]Absence check using 12 positive place invariants in 20 ms returned sat
[2022-06-09 14:51:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 14:51:28] [INFO ] [Nat]Absence check using state equation in 11625 ms returned sat
[2022-06-09 14:51:29] [INFO ] State equation strengthened by 3688 read => feed constraints.
[2022-06-09 14:51:46] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 14:51:49] [INFO ] [Nat]Added 3688 Read/Feed constraints in 19734 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1296/1296 places, 89876/89876 transitions.
Applied a total of 0 rules in 464 ms. Remains 1296 /1296 variables (removed 0) and now considering 89876/89876 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89876/89876 transitions.
Starting structural reductions, iteration 0 : 1296/1296 places, 89876/89876 transitions.
Applied a total of 0 rules in 463 ms. Remains 1296 /1296 variables (removed 0) and now considering 89876/89876 (removed 0) transitions.
[2022-06-09 14:51:50] [INFO ] Flow matrix only has 62415 transitions (discarded 27461 similar events)
// Phase 1: matrix 62415 rows 1296 cols
[2022-06-09 14:51:50] [INFO ] Computed 12 place invariants in 252 ms
[2022-06-09 14:51:54] [INFO ] Implicit Places using invariants in 4107 ms returned []
Implicit Place search using SMT only with invariants took 4108 ms to find 0 implicit places.
[2022-06-09 14:51:54] [INFO ] Flow matrix only has 62415 transitions (discarded 27461 similar events)
// Phase 1: matrix 62415 rows 1296 cols
[2022-06-09 14:51:54] [INFO ] Computed 12 place invariants in 215 ms
[2022-06-09 14:52:23] [INFO ] Dead Transitions using invariants and state equation in 29244 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89876/89876 transitions.
Ending property specific reduction for RERS2020-PT-pb107-UpperBounds-06 in 121511 ms.
Starting property specific reduction for RERS2020-PT-pb107-UpperBounds-07
Normalized transition count is 62424 out of 89908 initially.
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-09 14:52:23] [INFO ] Computed 12 place invariants in 235 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
[2022-06-09 14:52:24] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-09 14:52:24] [INFO ] Computed 12 place invariants in 210 ms
[2022-06-09 14:52:24] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned sat
[2022-06-09 14:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:52:29] [INFO ] [Real]Absence check using state equation in 4847 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Drop transitions removed 75 transitions
Starting structural reductions, iteration 0 : 1296/1296 places, 89833/89833 transitions.
Applied a total of 0 rules in 439 ms. Remains 1296 /1296 variables (removed 0) and now considering 89833/89833 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89833/89833 transitions.
Normalized transition count is 62360 out of 89833 initially.
// Phase 1: matrix 62360 rows 1296 cols
[2022-06-09 14:52:30] [INFO ] Computed 12 place invariants in 208 ms
Interrupted random walk after 637712 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen :{}
Interrupted Best-First random walk after 852297 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=170 ) properties seen :{}
[2022-06-09 14:53:05] [INFO ] Flow matrix only has 62360 transitions (discarded 27473 similar events)
// Phase 1: matrix 62360 rows 1296 cols
[2022-06-09 14:53:05] [INFO ] Computed 12 place invariants in 210 ms
[2022-06-09 14:53:05] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2022-06-09 14:53:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:53:17] [INFO ] [Real]Absence check using state equation in 11612 ms returned sat
[2022-06-09 14:53:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 14:53:18] [INFO ] [Nat]Absence check using 12 positive place invariants in 20 ms returned sat
[2022-06-09 14:53:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 14:53:29] [INFO ] [Nat]Absence check using state equation in 11283 ms returned sat
[2022-06-09 14:53:30] [INFO ] State equation strengthened by 3685 read => feed constraints.
[2022-06-09 14:53:47] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 14:53:51] [INFO ] [Nat]Added 3685 Read/Feed constraints in 20618 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1296/1296 places, 89833/89833 transitions.
Applied a total of 0 rules in 449 ms. Remains 1296 /1296 variables (removed 0) and now considering 89833/89833 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89833/89833 transitions.
Starting structural reductions, iteration 0 : 1296/1296 places, 89833/89833 transitions.
Applied a total of 0 rules in 442 ms. Remains 1296 /1296 variables (removed 0) and now considering 89833/89833 (removed 0) transitions.
[2022-06-09 14:53:52] [INFO ] Flow matrix only has 62360 transitions (discarded 27473 similar events)
// Phase 1: matrix 62360 rows 1296 cols
[2022-06-09 14:53:52] [INFO ] Computed 12 place invariants in 216 ms
[2022-06-09 14:53:56] [INFO ] Implicit Places using invariants in 3929 ms returned []
Implicit Place search using SMT only with invariants took 3929 ms to find 0 implicit places.
[2022-06-09 14:53:56] [INFO ] Flow matrix only has 62360 transitions (discarded 27473 similar events)
// Phase 1: matrix 62360 rows 1296 cols
[2022-06-09 14:53:56] [INFO ] Computed 12 place invariants in 220 ms
[2022-06-09 14:54:25] [INFO ] Dead Transitions using invariants and state equation in 29446 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89833/89833 transitions.
Ending property specific reduction for RERS2020-PT-pb107-UpperBounds-07 in 122004 ms.
Starting property specific reduction for RERS2020-PT-pb107-UpperBounds-09
Normalized transition count is 62424 out of 89908 initially.
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-09 14:54:25] [INFO ] Computed 12 place invariants in 211 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 499 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 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
[2022-06-09 14:54:26] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-09 14:54:26] [INFO ] Computed 12 place invariants in 200 ms
[2022-06-09 14:54:26] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2022-06-09 14:54:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:54:31] [INFO ] [Real]Absence check using state equation in 4834 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Drop transitions removed 257 transitions
Starting structural reductions, iteration 0 : 1296/1296 places, 89651/89651 transitions.
Applied a total of 0 rules in 439 ms. Remains 1296 /1296 variables (removed 0) and now considering 89651/89651 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89651/89651 transitions.
Normalized transition count is 62235 out of 89651 initially.
// Phase 1: matrix 62235 rows 1296 cols
[2022-06-09 14:54:32] [INFO ] Computed 12 place invariants in 237 ms
Interrupted random walk after 634236 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen :{}
Interrupted Best-First random walk after 724402 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=144 ) properties seen :{}
[2022-06-09 14:55:07] [INFO ] Flow matrix only has 62235 transitions (discarded 27416 similar events)
// Phase 1: matrix 62235 rows 1296 cols
[2022-06-09 14:55:07] [INFO ] Computed 12 place invariants in 256 ms
[2022-06-09 14:55:08] [INFO ] [Real]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-09 14:55:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:55:19] [INFO ] [Real]Absence check using state equation in 11712 ms returned sat
[2022-06-09 14:55:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 14:55:20] [INFO ] [Nat]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-09 14:55:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 14:55:32] [INFO ] [Nat]Absence check using state equation in 11780 ms returned sat
[2022-06-09 14:55:33] [INFO ] State equation strengthened by 3687 read => feed constraints.
[2022-06-09 14:55:51] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 14:55:54] [INFO ] [Nat]Added 3687 Read/Feed constraints in 21563 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1296/1296 places, 89651/89651 transitions.
Applied a total of 0 rules in 468 ms. Remains 1296 /1296 variables (removed 0) and now considering 89651/89651 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89651/89651 transitions.
Starting structural reductions, iteration 0 : 1296/1296 places, 89651/89651 transitions.
Applied a total of 0 rules in 458 ms. Remains 1296 /1296 variables (removed 0) and now considering 89651/89651 (removed 0) transitions.
[2022-06-09 14:55:55] [INFO ] Flow matrix only has 62235 transitions (discarded 27416 similar events)
// Phase 1: matrix 62235 rows 1296 cols
[2022-06-09 14:55:56] [INFO ] Computed 12 place invariants in 240 ms
[2022-06-09 14:55:59] [INFO ] Implicit Places using invariants in 3869 ms returned []
Implicit Place search using SMT only with invariants took 3870 ms to find 0 implicit places.
[2022-06-09 14:55:59] [INFO ] Flow matrix only has 62235 transitions (discarded 27416 similar events)
// Phase 1: matrix 62235 rows 1296 cols
[2022-06-09 14:55:59] [INFO ] Computed 12 place invariants in 182 ms
[2022-06-09 14:56:29] [INFO ] Dead Transitions using invariants and state equation in 29620 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89651/89651 transitions.
Ending property specific reduction for RERS2020-PT-pb107-UpperBounds-09 in 123741 ms.
Starting property specific reduction for RERS2020-PT-pb107-UpperBounds-10
Normalized transition count is 62424 out of 89908 initially.
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-09 14:56:29] [INFO ] Computed 12 place invariants in 251 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 538 ms. (steps per millisecond=18 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
[2022-06-09 14:56:30] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-09 14:56:30] [INFO ] Computed 12 place invariants in 233 ms
[2022-06-09 14:56:30] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2022-06-09 14:56:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:56:35] [INFO ] [Real]Absence check using state equation in 4830 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Drop transitions removed 38 transitions
Starting structural reductions, iteration 0 : 1296/1296 places, 89870/89870 transitions.
Applied a total of 0 rules in 442 ms. Remains 1296 /1296 variables (removed 0) and now considering 89870/89870 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89870/89870 transitions.
Normalized transition count is 62394 out of 89870 initially.
// Phase 1: matrix 62394 rows 1296 cols
[2022-06-09 14:56:36] [INFO ] Computed 12 place invariants in 229 ms
Interrupted random walk after 645801 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen :{}
Interrupted Best-First random walk after 831886 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=166 ) properties seen :{}
[2022-06-09 14:57:11] [INFO ] Flow matrix only has 62394 transitions (discarded 27476 similar events)
// Phase 1: matrix 62394 rows 1296 cols
[2022-06-09 14:57:11] [INFO ] Computed 12 place invariants in 207 ms
[2022-06-09 14:57:11] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2022-06-09 14:57:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:57:23] [INFO ] [Real]Absence check using state equation in 11520 ms returned sat
[2022-06-09 14:57:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 14:57:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-09 14:57:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 14:57:36] [INFO ] [Nat]Absence check using state equation in 11755 ms returned sat
[2022-06-09 14:57:36] [INFO ] State equation strengthened by 3685 read => feed constraints.
[2022-06-09 14:57:54] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 14:57:57] [INFO ] [Nat]Added 3685 Read/Feed constraints in 20844 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1296/1296 places, 89870/89870 transitions.
Applied a total of 0 rules in 473 ms. Remains 1296 /1296 variables (removed 0) and now considering 89870/89870 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89870/89870 transitions.
Starting structural reductions, iteration 0 : 1296/1296 places, 89870/89870 transitions.
Applied a total of 0 rules in 464 ms. Remains 1296 /1296 variables (removed 0) and now considering 89870/89870 (removed 0) transitions.
[2022-06-09 14:57:58] [INFO ] Flow matrix only has 62394 transitions (discarded 27476 similar events)
// Phase 1: matrix 62394 rows 1296 cols
[2022-06-09 14:57:58] [INFO ] Computed 12 place invariants in 245 ms
[2022-06-09 14:58:03] [INFO ] Implicit Places using invariants in 4484 ms returned []
Implicit Place search using SMT only with invariants took 4485 ms to find 0 implicit places.
[2022-06-09 14:58:03] [INFO ] Flow matrix only has 62394 transitions (discarded 27476 similar events)
// Phase 1: matrix 62394 rows 1296 cols
[2022-06-09 14:58:03] [INFO ] Computed 12 place invariants in 245 ms
[2022-06-09 14:58:33] [INFO ] Dead Transitions using invariants and state equation in 30419 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89870/89870 transitions.
Ending property specific reduction for RERS2020-PT-pb107-UpperBounds-10 in 124205 ms.
Starting property specific reduction for RERS2020-PT-pb107-UpperBounds-12
Normalized transition count is 62424 out of 89908 initially.
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-09 14:58:33] [INFO ] Computed 12 place invariants in 253 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 630 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
[2022-06-09 14:58:34] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-09 14:58:34] [INFO ] Computed 12 place invariants in 307 ms
[2022-06-09 14:58:35] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2022-06-09 14:58:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:58:40] [INFO ] [Real]Absence check using state equation in 4842 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Drop transitions removed 90 transitions
Starting structural reductions, iteration 0 : 1296/1296 places, 89818/89818 transitions.
Applied a total of 0 rules in 452 ms. Remains 1296 /1296 variables (removed 0) and now considering 89818/89818 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89818/89818 transitions.
Normalized transition count is 62391 out of 89818 initially.
// Phase 1: matrix 62391 rows 1296 cols
[2022-06-09 14:58:40] [INFO ] Computed 12 place invariants in 249 ms
Interrupted random walk after 565869 steps, including 3 resets, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen :{}
Interrupted Best-First random walk after 667710 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=133 ) properties seen :{}
[2022-06-09 14:59:15] [INFO ] Flow matrix only has 62391 transitions (discarded 27427 similar events)
// Phase 1: matrix 62391 rows 1296 cols
[2022-06-09 14:59:16] [INFO ] Computed 12 place invariants in 255 ms
[2022-06-09 14:59:16] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned sat
[2022-06-09 14:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 14:59:28] [INFO ] [Real]Absence check using state equation in 11732 ms returned sat
[2022-06-09 14:59:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 14:59:29] [INFO ] [Nat]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-09 14:59:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 14:59:40] [INFO ] [Nat]Absence check using state equation in 11851 ms returned sat
[2022-06-09 14:59:41] [INFO ] State equation strengthened by 3686 read => feed constraints.
[2022-06-09 14:59:59] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 15:00:02] [INFO ] [Nat]Added 3686 Read/Feed constraints in 20770 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1296/1296 places, 89818/89818 transitions.
Applied a total of 0 rules in 464 ms. Remains 1296 /1296 variables (removed 0) and now considering 89818/89818 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89818/89818 transitions.
Starting structural reductions, iteration 0 : 1296/1296 places, 89818/89818 transitions.
Applied a total of 0 rules in 444 ms. Remains 1296 /1296 variables (removed 0) and now considering 89818/89818 (removed 0) transitions.
[2022-06-09 15:00:03] [INFO ] Flow matrix only has 62391 transitions (discarded 27427 similar events)
// Phase 1: matrix 62391 rows 1296 cols
[2022-06-09 15:00:03] [INFO ] Computed 12 place invariants in 206 ms
[2022-06-09 15:00:07] [INFO ] Implicit Places using invariants in 3785 ms returned []
Implicit Place search using SMT only with invariants took 3787 ms to find 0 implicit places.
[2022-06-09 15:00:07] [INFO ] Flow matrix only has 62391 transitions (discarded 27427 similar events)
// Phase 1: matrix 62391 rows 1296 cols
[2022-06-09 15:00:07] [INFO ] Computed 12 place invariants in 194 ms
[2022-06-09 15:00:36] [INFO ] Dead Transitions using invariants and state equation in 29782 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89818/89818 transitions.
Ending property specific reduction for RERS2020-PT-pb107-UpperBounds-12 in 123375 ms.
Starting property specific reduction for RERS2020-PT-pb107-UpperBounds-13
Normalized transition count is 62424 out of 89908 initially.
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-09 15:00:37] [INFO ] Computed 12 place invariants in 241 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 525 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 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
[2022-06-09 15:00:37] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-09 15:00:38] [INFO ] Computed 12 place invariants in 239 ms
[2022-06-09 15:00:38] [INFO ] [Real]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-09 15:00:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 15:00:43] [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 1296 places. Attempting structural reductions.
Drop transitions removed 81 transitions
Starting structural reductions, iteration 0 : 1296/1296 places, 89827/89827 transitions.
Applied a total of 0 rules in 447 ms. Remains 1296 /1296 variables (removed 0) and now considering 89827/89827 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89827/89827 transitions.
Normalized transition count is 62366 out of 89827 initially.
// Phase 1: matrix 62366 rows 1296 cols
[2022-06-09 15:00:43] [INFO ] Computed 12 place invariants in 233 ms
Interrupted random walk after 588110 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=19 ) properties seen :{}
Interrupted Best-First random walk after 734090 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=146 ) properties seen :{}
[2022-06-09 15:01:19] [INFO ] Flow matrix only has 62366 transitions (discarded 27461 similar events)
// Phase 1: matrix 62366 rows 1296 cols
[2022-06-09 15:01:19] [INFO ] Computed 12 place invariants in 234 ms
[2022-06-09 15:01:19] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned sat
[2022-06-09 15:01:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 15:01:31] [INFO ] [Real]Absence check using state equation in 11957 ms returned sat
[2022-06-09 15:01:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 15:01:32] [INFO ] [Nat]Absence check using 12 positive place invariants in 22 ms returned sat
[2022-06-09 15:01:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 15:01:44] [INFO ] [Nat]Absence check using state equation in 11635 ms returned sat
[2022-06-09 15:01:45] [INFO ] State equation strengthened by 3687 read => feed constraints.
[2022-06-09 15:02:02] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 15:02:05] [INFO ] [Nat]Added 3687 Read/Feed constraints in 19877 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1296/1296 places, 89827/89827 transitions.
Applied a total of 0 rules in 451 ms. Remains 1296 /1296 variables (removed 0) and now considering 89827/89827 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89827/89827 transitions.
Starting structural reductions, iteration 0 : 1296/1296 places, 89827/89827 transitions.
Applied a total of 0 rules in 450 ms. Remains 1296 /1296 variables (removed 0) and now considering 89827/89827 (removed 0) transitions.
[2022-06-09 15:02:06] [INFO ] Flow matrix only has 62366 transitions (discarded 27461 similar events)
// Phase 1: matrix 62366 rows 1296 cols
[2022-06-09 15:02:06] [INFO ] Computed 12 place invariants in 215 ms
[2022-06-09 15:02:09] [INFO ] Implicit Places using invariants in 3883 ms returned []
Implicit Place search using SMT only with invariants took 3884 ms to find 0 implicit places.
[2022-06-09 15:02:09] [INFO ] Flow matrix only has 62366 transitions (discarded 27461 similar events)
// Phase 1: matrix 62366 rows 1296 cols
[2022-06-09 15:02:10] [INFO ] Computed 12 place invariants in 215 ms
[2022-06-09 15:02:39] [INFO ] Dead Transitions using invariants and state equation in 29935 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89827/89827 transitions.
Ending property specific reduction for RERS2020-PT-pb107-UpperBounds-13 in 122924 ms.
[2022-06-09 15:02:43] [INFO ] Flatten gal took : 3109 ms
[2022-06-09 15:02:45] [INFO ] Applying decomposition
[2022-06-09 15:02:48] [INFO ] Flatten gal took : 2584 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14235803956458512009.txt, -o, /tmp/graph14235803956458512009.bin, -w, /tmp/graph14235803956458512009.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14235803956458512009.bin, -l, -1, -v, -w, /tmp/graph14235803956458512009.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 15:02:53] [INFO ] Decomposing Gal with order
[2022-06-09 15:02:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 15:03:01] [INFO ] Removed a total of 194856 redundant transitions.
[2022-06-09 15:03:02] [INFO ] Flatten gal took : 6783 ms
[2022-06-09 15:03:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 3171 labels/synchronizations in 3124 ms.
[2022-06-09 15:03:08] [INFO ] Time to serialize gal into /tmp/UpperBounds17059287517819135229.gal : 940 ms
[2022-06-09 15:03:09] [INFO ] Time to serialize properties into /tmp/UpperBounds6437583231457354019.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds17059287517819135229.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds6437583231457354019.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds17059287517819135229.gal -t CGAL -reachable-file /tmp/UpperBounds6437583231457354019.prop --nowitness
Loading property file /tmp/UpperBounds6437583231457354019.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,203.628,2686704,4170,13581,2.18036e+06,564404,35821,3.62939e+06,17453,2.10451e+06,0
Total reachable state count : 16439581208014

Verifying 10 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property RERS2020-PT-pb107-UpperBounds-00 :0 <= i6.u61.ps637 <= 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,203.829,2686704,1,0,2.18036e+06,564404,36725,3.62939e+06,17923,2.10451e+06,7391
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property RERS2020-PT-pb107-UpperBounds-01 :0 <= i7.u47.ps1287 <= 0
FORMULA RERS2020-PT-pb107-UpperBounds-01 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-01,0,203.843,2686704,1,0,2.18036e+06,564404,36816,3.62939e+06,17934,2.10451e+06,8706
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property RERS2020-PT-pb107-UpperBounds-04 :0 <= i6.u104.ps565 <= 0
FORMULA RERS2020-PT-pb107-UpperBounds-04 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-04,0,203.849,2686704,1,0,2.18036e+06,564404,36859,3.62939e+06,17940,2.10451e+06,8747
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property RERS2020-PT-pb107-UpperBounds-05 :0 <= i0.u151.ps69 <= 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,203.867,2686704,1,0,2.18036e+06,564404,36884,3.62939e+06,18574,2.10451e+06,8772
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property RERS2020-PT-pb107-UpperBounds-06 :0 <= i0.u151.ps311 <= 0
FORMULA RERS2020-PT-pb107-UpperBounds-06 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-06,0,203.88,2686704,1,0,2.18036e+06,564404,36901,3.62939e+06,18906,2.10451e+06,8797
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property RERS2020-PT-pb107-UpperBounds-07 :0 <= i7.u109.ps1182 <= 0
FORMULA RERS2020-PT-pb107-UpperBounds-07 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-07,0,203.887,2686704,1,0,2.18036e+06,564404,36988,3.62939e+06,18906,2.10451e+06,9549
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property RERS2020-PT-pb107-UpperBounds-09 :0 <= i5.u35.ps554 <= 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,203.892,2686704,1,0,2.18036e+06,564404,37035,3.62939e+06,18910,2.10451e+06,9664
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property RERS2020-PT-pb107-UpperBounds-10 :0 <= i1.u77.ps735 <= 1
FORMULA RERS2020-PT-pb107-UpperBounds-10 1 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,203.899,2686704,1,0,2.18036e+06,564404,37105,3.62939e+06,18911,2.10451e+06,10054
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property RERS2020-PT-pb107-UpperBounds-12 :0 <= i6.u149.ps1057 <= 0
FORMULA RERS2020-PT-pb107-UpperBounds-12 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-12,0,203.905,2686704,1,0,2.18036e+06,564404,37153,3.62939e+06,18917,2.10451e+06,10085
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property RERS2020-PT-pb107-UpperBounds-13 :0 <= i7.u134.ps1126 <= 0
FORMULA RERS2020-PT-pb107-UpperBounds-13 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-13,0,203.912,2686704,1,0,2.18036e+06,564404,37254,3.62939e+06,18925,2.10451e+06,10284

BK_STOP 1654787194524

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RERS2020-PT-pb107"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
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 r323-tall-165472292900253"
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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;