About the Execution of 2021-gold for FunctionPointer-PT-c008
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13516.804 | 3600000.00 | 3677177.00 | 8235.60 | 0 8 ? 8 0 1 ? ? ? 0 8 0 0 8 ? 0 | normal |
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-165472292800184.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 FunctionPointer-PT-c008, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292800184
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 5.4K Jun 7 17:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Jun 7 17:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 7 17:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 7 17:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 6 15:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 14K Jun 7 17:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Jun 7 17:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 7 17:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Jun 7 17:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 4.2M 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 FunctionPointer-PT-c008-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1654766590914
Running Version 0
[2022-06-09 09:23:12] [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 09:23:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 09:23:13] [INFO ] Load time of PNML (sax parser for PT used): 367 ms
[2022-06-09 09:23:13] [INFO ] Transformed 2826 places.
[2022-06-09 09:23:13] [INFO ] Transformed 8960 transitions.
[2022-06-09 09:23:13] [INFO ] Parsed PT model containing 2826 places and 8960 transitions in 450 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 1198 places in 95 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c008-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3540 out of 5962 initially.
// Phase 1: matrix 3540 rows 1628 cols
[2022-06-09 09:23:13] [INFO ] Computed 4 place invariants in 142 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 10) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :4
FORMULA FunctionPointer-PT-c008-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :2
[2022-06-09 09:23:13] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2022-06-09 09:23:13] [INFO ] Computed 4 place invariants in 75 ms
[2022-06-09 09:23:14] [INFO ] [Real]Absence check using 3 positive place invariants in 25 ms returned sat
[2022-06-09 09:23:14] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 09:23:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:23:15] [INFO ] [Real]Absence check using state equation in 810 ms returned sat
[2022-06-09 09:23:15] [INFO ] State equation strengthened by 2822 read => feed constraints.
[2022-06-09 09:23:17] [INFO ] [Real]Added 2822 Read/Feed constraints in 2301 ms returned sat
[2022-06-09 09:23:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:23:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 09:23:18] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 09:23:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:23:19] [INFO ] [Nat]Absence check using state equation in 797 ms returned sat
[2022-06-09 09:23:21] [INFO ] [Nat]Added 2822 Read/Feed constraints in 1968 ms returned sat
[2022-06-09 09:23:21] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 774 ms.
[2022-06-09 09:23:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 09:23:23] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2022-06-09 09:23:23] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-09 09:23:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:23:24] [INFO ] [Real]Absence check using state equation in 814 ms returned sat
[2022-06-09 09:23:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:23:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 09:23:24] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 09:23:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:23:25] [INFO ] [Nat]Absence check using state equation in 792 ms returned sat
[2022-06-09 09:23:27] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2014 ms returned sat
[2022-06-09 09:23:27] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 534 ms.
[2022-06-09 09:23:30] [INFO ] Deduced a trap composed of 17 places in 1168 ms of which 11 ms to minimize.
[2022-06-09 09:23:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 09:23:30] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2022-06-09 09:23:30] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 7 ms returned sat
[2022-06-09 09:23:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:23:31] [INFO ] [Real]Absence check using state equation in 750 ms returned sat
[2022-06-09 09:23:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:23:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 09:23:31] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 4 ms returned sat
[2022-06-09 09:23:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:23:32] [INFO ] [Nat]Absence check using state equation in 816 ms returned sat
[2022-06-09 09:23:34] [INFO ] [Nat]Added 2822 Read/Feed constraints in 1981 ms returned sat
[2022-06-09 09:23:35] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 468 ms.
[2022-06-09 09:23:37] [INFO ] Deduced a trap composed of 17 places in 1207 ms of which 4 ms to minimize.
[2022-06-09 09:23:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 09:23:37] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 09:23:37] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 09:23:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:23:38] [INFO ] [Real]Absence check using state equation in 802 ms returned sat
[2022-06-09 09:23:40] [INFO ] [Real]Added 2822 Read/Feed constraints in 2028 ms returned sat
[2022-06-09 09:23:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:23:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 09:23:41] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 09:23:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:23:41] [INFO ] [Nat]Absence check using state equation in 770 ms returned sat
[2022-06-09 09:23:44] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2264 ms returned sat
[2022-06-09 09:23:44] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 687 ms.
[2022-06-09 09:23:47] [INFO ] Deduced a trap composed of 17 places in 1164 ms of which 2 ms to minimize.
[2022-06-09 09:23:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 09:23:47] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2022-06-09 09:23:47] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 09:23:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:23:48] [INFO ] [Real]Absence check using state equation in 793 ms returned sat
[2022-06-09 09:23:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:23:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 09:23:48] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 09:23:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:23:49] [INFO ] [Nat]Absence check using state equation in 797 ms returned sat
[2022-06-09 09:23:51] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2180 ms returned sat
[2022-06-09 09:23:51] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 462 ms.
[2022-06-09 09:23:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 09:23:53] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2022-06-09 09:23:53] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-09 09:23:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:23:54] [INFO ] [Real]Absence check using state equation in 729 ms returned sat
[2022-06-09 09:23:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:23:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 09:23:54] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 09:23:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:23:55] [INFO ] [Nat]Absence check using state equation in 763 ms returned sat
[2022-06-09 09:23:58] [INFO ] [Nat]Added 2822 Read/Feed constraints in 3666 ms returned sat
[2022-06-09 09:23:59] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 472 ms.
[2022-06-09 09:23:59] [INFO ] Added : 0 causal constraints over 0 iterations in 473 ms. Result :unknown
[2022-06-09 09:23:59] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 09:23:59] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 09:23:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:24:00] [INFO ] [Real]Absence check using state equation in 842 ms returned sat
[2022-06-09 09:24:02] [INFO ] [Real]Added 2822 Read/Feed constraints in 2039 ms returned sat
[2022-06-09 09:24:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:24:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 09:24:02] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 09:24:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:24:03] [INFO ] [Nat]Absence check using state equation in 802 ms returned sat
[2022-06-09 09:24:05] [INFO ] [Nat]Added 2822 Read/Feed constraints in 1912 ms returned sat
[2022-06-09 09:24:06] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 468 ms.
[2022-06-09 09:24:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 09:24:07] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2022-06-09 09:24:07] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 09:24:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:24:08] [INFO ] [Real]Absence check using state equation in 797 ms returned sat
[2022-06-09 09:24:10] [INFO ] [Real]Added 2822 Read/Feed constraints in 2006 ms returned sat
[2022-06-09 09:24:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:24:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 09:24:11] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 09:24:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:24:11] [INFO ] [Nat]Absence check using state equation in 708 ms returned sat
[2022-06-09 09:24:13] [INFO ] [Nat]Added 2822 Read/Feed constraints in 1902 ms returned sat
[2022-06-09 09:24:14] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 524 ms.
[2022-06-09 09:24:16] [INFO ] Deduced a trap composed of 17 places in 1108 ms of which 3 ms to minimize.
[2022-06-09 09:24:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 09:24:17] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 09:24:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 09:24:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:24:17] [INFO ] [Real]Absence check using state equation in 835 ms returned sat
[2022-06-09 09:24:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:24:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 09:24:18] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 09:24:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:24:18] [INFO ] [Nat]Absence check using state equation in 735 ms returned sat
[2022-06-09 09:24:20] [INFO ] [Nat]Added 2822 Read/Feed constraints in 1996 ms returned sat
[2022-06-09 09:24:21] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 523 ms.
[2022-06-09 09:24:24] [INFO ] Deduced a trap composed of 17 places in 1127 ms of which 18 ms to minimize.
[2022-06-09 09:24:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [8, -1, 8, 8, -1, -1, 8, 8, -1] Max seen :[1, 7, 7, 1, 0, 0, 1, 1, 0]
Incomplete Parikh walk after 1366400 steps, including 1000 resets, run finished after 21644 ms. (steps per millisecond=63 ) properties (out of 9) seen :24 could not realise parikh vector
Support contains 9 out of 1628 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1419 are kept as prefixes of interest. Removing 209 places using SCC suffix rule.34 ms
Discarding 209 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 1419 transition count 5578
Discarding 299 places :
Symmetric choice reduction at 1 with 299 rule applications. Total rules 684 place count 1120 transition count 3312
Iterating global reduction 1 with 299 rules applied. Total rules applied 983 place count 1120 transition count 3312
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 370 transitions.
Iterating post reduction 1 with 370 rules applied. Total rules applied 1353 place count 1120 transition count 2942
Discarding 156 places :
Symmetric choice reduction at 2 with 156 rule applications. Total rules 1509 place count 964 transition count 2630
Iterating global reduction 2 with 156 rules applied. Total rules applied 1665 place count 964 transition count 2630
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 1737 place count 964 transition count 2558
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1751 place count 950 transition count 2530
Iterating global reduction 3 with 14 rules applied. Total rules applied 1765 place count 950 transition count 2530
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1778 place count 937 transition count 2504
Iterating global reduction 3 with 13 rules applied. Total rules applied 1791 place count 937 transition count 2504
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1804 place count 924 transition count 2478
Iterating global reduction 3 with 13 rules applied. Total rules applied 1817 place count 924 transition count 2478
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1830 place count 911 transition count 2452
Iterating global reduction 3 with 13 rules applied. Total rules applied 1843 place count 911 transition count 2452
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1856 place count 898 transition count 2426
Iterating global reduction 3 with 13 rules applied. Total rules applied 1869 place count 898 transition count 2426
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1882 place count 885 transition count 2400
Iterating global reduction 3 with 13 rules applied. Total rules applied 1895 place count 885 transition count 2400
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1908 place count 872 transition count 2374
Iterating global reduction 3 with 13 rules applied. Total rules applied 1921 place count 872 transition count 2374
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 1981 place count 812 transition count 2146
Iterating global reduction 3 with 60 rules applied. Total rules applied 2041 place count 812 transition count 2146
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 2101 place count 752 transition count 1906
Iterating global reduction 3 with 60 rules applied. Total rules applied 2161 place count 752 transition count 1906
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 2221 place count 692 transition count 1774
Iterating global reduction 3 with 60 rules applied. Total rules applied 2281 place count 692 transition count 1774
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 2341 place count 632 transition count 1654
Iterating global reduction 3 with 60 rules applied. Total rules applied 2401 place count 632 transition count 1654
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 2461 place count 572 transition count 1534
Iterating global reduction 3 with 60 rules applied. Total rules applied 2521 place count 572 transition count 1534
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 2581 place count 512 transition count 1414
Iterating global reduction 3 with 60 rules applied. Total rules applied 2641 place count 512 transition count 1414
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 2700 place count 453 transition count 1296
Iterating global reduction 3 with 59 rules applied. Total rules applied 2759 place count 453 transition count 1296
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2765 place count 447 transition count 1284
Iterating global reduction 3 with 6 rules applied. Total rules applied 2771 place count 447 transition count 1284
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 2779 place count 447 transition count 1276
Applied a total of 2779 rules in 1471 ms. Remains 447 /1628 variables (removed 1181) and now considering 1276/5962 (removed 4686) transitions.
Finished structural reductions, in 1 iterations. Remains : 447/1628 places, 1276/5962 transitions.
Normalized transition count is 728 out of 1276 initially.
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:24:47] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 2397 ms. (steps per millisecond=417 ) properties (out of 9) seen :13
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 699 ms. (steps per millisecond=1430 ) properties (out of 9) seen :27
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 697 ms. (steps per millisecond=1434 ) properties (out of 9) seen :186
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 691 ms. (steps per millisecond=1447 ) properties (out of 9) seen :20
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 694 ms. (steps per millisecond=1440 ) properties (out of 9) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 725 ms. (steps per millisecond=1379 ) properties (out of 9) seen :14
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 737 ms. (steps per millisecond=1356 ) properties (out of 9) seen :73
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 676 ms. (steps per millisecond=1479 ) properties (out of 9) seen :13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 661 ms. (steps per millisecond=1512 ) properties (out of 9) seen :14
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 693 ms. (steps per millisecond=1443 ) properties (out of 9) seen :119
[2022-06-09 09:24:56] [INFO ] Flow matrix only has 728 transitions (discarded 548 similar events)
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:24:56] [INFO ] Computed 3 place invariants in 11 ms
[2022-06-09 09:24:56] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:24:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:24:56] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2022-06-09 09:24:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:24:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:24:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:24:56] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2022-06-09 09:24:56] [INFO ] State equation strengthened by 383 read => feed constraints.
[2022-06-09 09:24:56] [INFO ] [Nat]Added 383 Read/Feed constraints in 194 ms returned sat
[2022-06-09 09:24:56] [INFO ] Deduced a trap composed of 135 places in 162 ms of which 1 ms to minimize.
[2022-06-09 09:24:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2022-06-09 09:24:57] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 72 ms.
[2022-06-09 09:24:57] [INFO ] Added : 96 causal constraints over 20 iterations in 902 ms. Result :sat
Minimization took 805 ms.
[2022-06-09 09:24:58] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:24:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:24:58] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2022-06-09 09:24:59] [INFO ] [Real]Added 383 Read/Feed constraints in 198 ms returned sat
[2022-06-09 09:24:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:24:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:24:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:24:59] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2022-06-09 09:24:59] [INFO ] [Nat]Added 383 Read/Feed constraints in 182 ms returned sat
[2022-06-09 09:24:59] [INFO ] Deduced a trap composed of 135 places in 153 ms of which 0 ms to minimize.
[2022-06-09 09:24:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2022-06-09 09:24:59] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 103 ms.
[2022-06-09 09:25:00] [INFO ] Added : 109 causal constraints over 22 iterations in 1017 ms. Result :sat
Minimization took 794 ms.
[2022-06-09 09:25:01] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:25:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:25:01] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2022-06-09 09:25:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:25:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-09 09:25:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:25:02] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2022-06-09 09:25:02] [INFO ] [Nat]Added 383 Read/Feed constraints in 189 ms returned sat
[2022-06-09 09:25:02] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 79 ms.
[2022-06-09 09:25:02] [INFO ] Added : 10 causal constraints over 2 iterations in 248 ms. Result :sat
Minimization took 758 ms.
[2022-06-09 09:25:03] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:25:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:25:03] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2022-06-09 09:25:03] [INFO ] [Real]Added 383 Read/Feed constraints in 189 ms returned sat
[2022-06-09 09:25:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:25:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:25:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:25:03] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2022-06-09 09:25:04] [INFO ] [Nat]Added 383 Read/Feed constraints in 240 ms returned sat
[2022-06-09 09:25:04] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 71 ms.
[2022-06-09 09:25:05] [INFO ] Added : 99 causal constraints over 20 iterations in 846 ms. Result :sat
Minimization took 802 ms.
[2022-06-09 09:25:05] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:25:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:25:06] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2022-06-09 09:25:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:25:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:25:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:25:06] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2022-06-09 09:25:06] [INFO ] [Nat]Added 383 Read/Feed constraints in 264 ms returned sat
[2022-06-09 09:25:06] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 142 ms.
[2022-06-09 09:25:07] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 8 ms to minimize.
[2022-06-09 09:25:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2022-06-09 09:25:07] [INFO ] Added : 99 causal constraints over 20 iterations in 1206 ms. Result :sat
Minimization took 835 ms.
[2022-06-09 09:25:08] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2022-06-09 09:25:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:25:08] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2022-06-09 09:25:09] [INFO ] [Real]Added 383 Read/Feed constraints in 203 ms returned sat
[2022-06-09 09:25:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:25:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:25:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:25:09] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2022-06-09 09:25:09] [INFO ] [Nat]Added 383 Read/Feed constraints in 181 ms returned sat
[2022-06-09 09:25:09] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 74 ms.
[2022-06-09 09:25:10] [INFO ] Added : 90 causal constraints over 18 iterations in 848 ms. Result :sat
Minimization took 747 ms.
[2022-06-09 09:25:11] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:25:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:25:11] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2022-06-09 09:25:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:25:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:25:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:25:11] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2022-06-09 09:25:11] [INFO ] [Nat]Added 383 Read/Feed constraints in 192 ms returned sat
[2022-06-09 09:25:11] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 71 ms.
[2022-06-09 09:25:12] [INFO ] Added : 93 causal constraints over 19 iterations in 961 ms. Result :sat
Minimization took 917 ms.
[2022-06-09 09:25:13] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:25:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:25:13] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2022-06-09 09:25:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:25:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:25:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:25:14] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2022-06-09 09:25:14] [INFO ] [Nat]Added 383 Read/Feed constraints in 180 ms returned sat
[2022-06-09 09:25:14] [INFO ] Deduced a trap composed of 135 places in 135 ms of which 1 ms to minimize.
[2022-06-09 09:25:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2022-06-09 09:25:14] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 107 ms.
[2022-06-09 09:25:16] [INFO ] Added : 96 causal constraints over 20 iterations in 1909 ms. Result :sat
Minimization took 1474 ms.
[2022-06-09 09:25:17] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:25:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:25:18] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2022-06-09 09:25:18] [INFO ] [Real]Added 383 Read/Feed constraints in 199 ms returned sat
[2022-06-09 09:25:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:25:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:25:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:25:18] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2022-06-09 09:25:18] [INFO ] [Nat]Added 383 Read/Feed constraints in 184 ms returned sat
[2022-06-09 09:25:18] [INFO ] Deduced a trap composed of 135 places in 155 ms of which 0 ms to minimize.
[2022-06-09 09:25:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2022-06-09 09:25:19] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 83 ms.
[2022-06-09 09:25:19] [INFO ] Added : 45 causal constraints over 9 iterations in 583 ms. Result :sat
Minimization took 765 ms.
Current structural bounds on expressions (after SMT) : [8, -1, 8, 8, -1, -1, 8, 8, -1] Max seen :[6, 180, 7, 2, 5, 65, 3, 1, 109]
Incomplete Parikh walk after 151300 steps, including 1000 resets, run finished after 643 ms. (steps per millisecond=235 ) properties (out of 9) seen :15 could not realise parikh vector
Incomplete Parikh walk after 12000 steps, including 158 resets, run finished after 39 ms. (steps per millisecond=307 ) properties (out of 9) seen :8 could not realise parikh vector
FORMULA FunctionPointer-PT-c008-UpperBounds-13 8 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 28500 steps, including 632 resets, run finished after 51 ms. (steps per millisecond=558 ) properties (out of 8) seen :8 could not realise parikh vector
FORMULA FunctionPointer-PT-c008-UpperBounds-10 8 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 97900 steps, including 1000 resets, run finished after 372 ms. (steps per millisecond=263 ) properties (out of 7) seen :9 could not realise parikh vector
Incomplete Parikh walk after 9900 steps, including 160 resets, run finished after 24 ms. (steps per millisecond=412 ) properties (out of 7) seen :7 could not realise parikh vector
Incomplete Parikh walk after 31600 steps, including 992 resets, run finished after 111 ms. (steps per millisecond=284 ) properties (out of 7) seen :19 could not realise parikh vector
Incomplete Parikh walk after 8800 steps, including 161 resets, run finished after 14 ms. (steps per millisecond=628 ) properties (out of 7) seen :8 could not realise parikh vector
FORMULA FunctionPointer-PT-c008-UpperBounds-03 8 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 322000 steps, including 1000 resets, run finished after 1356 ms. (steps per millisecond=237 ) properties (out of 6) seen :11 could not realise parikh vector
Incomplete Parikh walk after 27200 steps, including 621 resets, run finished after 63 ms. (steps per millisecond=431 ) properties (out of 6) seen :9 could not realise parikh vector
FORMULA FunctionPointer-PT-c008-UpperBounds-01 8 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 447 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 447/447 places, 1276/1276 transitions.
Applied a total of 0 rules in 51 ms. Remains 447 /447 variables (removed 0) and now considering 1276/1276 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 447/447 places, 1276/1276 transitions.
Normalized transition count is 728 out of 1276 initially.
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:25:23] [INFO ] Computed 3 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2351 ms. (steps per millisecond=425 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 662 ms. (steps per millisecond=1510 ) properties (out of 5) seen :187
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 662 ms. (steps per millisecond=1510 ) properties (out of 5) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 641 ms. (steps per millisecond=1560 ) properties (out of 5) seen :543
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 635 ms. (steps per millisecond=1574 ) properties (out of 5) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 668 ms. (steps per millisecond=1497 ) properties (out of 5) seen :9
[2022-06-09 09:25:28] [INFO ] Flow matrix only has 728 transitions (discarded 548 similar events)
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:25:28] [INFO ] Computed 3 place invariants in 11 ms
[2022-06-09 09:25:28] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:25:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:25:28] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2022-06-09 09:25:29] [INFO ] State equation strengthened by 383 read => feed constraints.
[2022-06-09 09:25:29] [INFO ] [Real]Added 383 Read/Feed constraints in 198 ms returned sat
[2022-06-09 09:25:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:25:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:25:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:25:29] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2022-06-09 09:25:29] [INFO ] [Nat]Added 383 Read/Feed constraints in 186 ms returned sat
[2022-06-09 09:25:29] [INFO ] Deduced a trap composed of 135 places in 144 ms of which 1 ms to minimize.
[2022-06-09 09:25:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2022-06-09 09:25:29] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 69 ms.
[2022-06-09 09:25:30] [INFO ] Added : 109 causal constraints over 22 iterations in 1022 ms. Result :sat
Minimization took 949 ms.
[2022-06-09 09:25:31] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:25:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:25:32] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2022-06-09 09:25:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:25:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:25:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:25:32] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2022-06-09 09:25:32] [INFO ] [Nat]Added 383 Read/Feed constraints in 203 ms returned sat
[2022-06-09 09:25:32] [INFO ] Deduced a trap composed of 131 places in 170 ms of which 0 ms to minimize.
[2022-06-09 09:25:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2022-06-09 09:25:32] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 71 ms.
[2022-06-09 09:25:33] [INFO ] Added : 104 causal constraints over 21 iterations in 901 ms. Result :sat
Minimization took 837 ms.
[2022-06-09 09:25:34] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:25:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:25:34] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2022-06-09 09:25:35] [INFO ] [Real]Added 383 Read/Feed constraints in 240 ms returned sat
[2022-06-09 09:25:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:25:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:25:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:25:35] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2022-06-09 09:25:35] [INFO ] [Nat]Added 383 Read/Feed constraints in 262 ms returned sat
[2022-06-09 09:25:35] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 67 ms.
[2022-06-09 09:25:36] [INFO ] Deduced a trap composed of 131 places in 131 ms of which 1 ms to minimize.
[2022-06-09 09:25:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2022-06-09 09:25:36] [INFO ] Added : 100 causal constraints over 20 iterations in 1103 ms. Result :sat
Minimization took 776 ms.
[2022-06-09 09:25:37] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:25:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:25:37] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2022-06-09 09:25:37] [INFO ] [Real]Added 383 Read/Feed constraints in 193 ms returned sat
[2022-06-09 09:25:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:25:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:25:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:25:38] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2022-06-09 09:25:38] [INFO ] [Nat]Added 383 Read/Feed constraints in 184 ms returned sat
[2022-06-09 09:25:38] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 91 ms.
[2022-06-09 09:25:39] [INFO ] Added : 90 causal constraints over 18 iterations in 844 ms. Result :sat
Minimization took 700 ms.
[2022-06-09 09:25:39] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:25:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:25:40] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2022-06-09 09:25:40] [INFO ] [Real]Added 383 Read/Feed constraints in 200 ms returned sat
[2022-06-09 09:25:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:25:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:25:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:25:40] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2022-06-09 09:25:40] [INFO ] [Nat]Added 383 Read/Feed constraints in 182 ms returned sat
[2022-06-09 09:25:40] [INFO ] Deduced a trap composed of 135 places in 130 ms of which 0 ms to minimize.
[2022-06-09 09:25:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2022-06-09 09:25:40] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 75 ms.
[2022-06-09 09:25:41] [INFO ] Added : 45 causal constraints over 9 iterations in 547 ms. Result :sat
Minimization took 651 ms.
Current structural bounds on expressions (after SMT) : [-1, 8, -1, -1, -1] Max seen :[183, 7, 538, 65, 109]
Incomplete Parikh walk after 151300 steps, including 1000 resets, run finished after 519 ms. (steps per millisecond=291 ) properties (out of 5) seen :10 could not realise parikh vector
Incomplete Parikh walk after 97900 steps, including 1000 resets, run finished after 399 ms. (steps per millisecond=245 ) properties (out of 5) seen :5 could not realise parikh vector
Incomplete Parikh walk after 283500 steps, including 1000 resets, run finished after 1143 ms. (steps per millisecond=248 ) properties (out of 5) seen :15 could not realise parikh vector
Incomplete Parikh walk after 28600 steps, including 603 resets, run finished after 76 ms. (steps per millisecond=376 ) properties (out of 5) seen :4 could not realise parikh vector
Incomplete Parikh walk after 327100 steps, including 1000 resets, run finished after 1337 ms. (steps per millisecond=244 ) properties (out of 5) seen :4 could not realise parikh vector
Support contains 5 out of 447 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 447/447 places, 1276/1276 transitions.
Applied a total of 0 rules in 51 ms. Remains 447 /447 variables (removed 0) and now considering 1276/1276 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 447/447 places, 1276/1276 transitions.
Starting structural reductions, iteration 0 : 447/447 places, 1276/1276 transitions.
Applied a total of 0 rules in 52 ms. Remains 447 /447 variables (removed 0) and now considering 1276/1276 (removed 0) transitions.
[2022-06-09 09:25:45] [INFO ] Flow matrix only has 728 transitions (discarded 548 similar events)
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:25:45] [INFO ] Computed 3 place invariants in 8 ms
[2022-06-09 09:25:46] [INFO ] Implicit Places using invariants in 341 ms returned []
[2022-06-09 09:25:46] [INFO ] Flow matrix only has 728 transitions (discarded 548 similar events)
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:25:46] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 09:25:46] [INFO ] State equation strengthened by 383 read => feed constraints.
[2022-06-09 09:25:53] [INFO ] Implicit Places using invariants and state equation in 7936 ms returned []
Implicit Place search using SMT with State Equation took 8279 ms to find 0 implicit places.
[2022-06-09 09:25:54] [INFO ] Redundant transitions in 90 ms returned []
[2022-06-09 09:25:54] [INFO ] Flow matrix only has 728 transitions (discarded 548 similar events)
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:25:54] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-09 09:25:54] [INFO ] Dead Transitions using invariants and state equation in 402 ms returned []
Finished structural reductions, in 1 iterations. Remains : 447/447 places, 1276/1276 transitions.
Normalized transition count is 728 out of 1276 initially.
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:25:54] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2280 ms. (steps per millisecond=438 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 659 ms. (steps per millisecond=1517 ) properties (out of 5) seen :204
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 610 ms. (steps per millisecond=1639 ) properties (out of 5) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 644 ms. (steps per millisecond=1552 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 640 ms. (steps per millisecond=1562 ) properties (out of 5) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 645 ms. (steps per millisecond=1550 ) properties (out of 5) seen :10
[2022-06-09 09:25:59] [INFO ] Flow matrix only has 728 transitions (discarded 548 similar events)
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:25:59] [INFO ] Computed 3 place invariants in 9 ms
[2022-06-09 09:26:00] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:26:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:26:00] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2022-06-09 09:26:00] [INFO ] State equation strengthened by 383 read => feed constraints.
[2022-06-09 09:26:00] [INFO ] [Real]Added 383 Read/Feed constraints in 195 ms returned sat
[2022-06-09 09:26:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:26:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:26:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:26:00] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2022-06-09 09:26:00] [INFO ] [Nat]Added 383 Read/Feed constraints in 184 ms returned sat
[2022-06-09 09:26:00] [INFO ] Deduced a trap composed of 135 places in 127 ms of which 0 ms to minimize.
[2022-06-09 09:26:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-06-09 09:26:01] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 68 ms.
[2022-06-09 09:26:01] [INFO ] Added : 109 causal constraints over 22 iterations in 997 ms. Result :sat
Minimization took 857 ms.
[2022-06-09 09:26:02] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:26:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:26:03] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2022-06-09 09:26:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:26:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:26:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:26:03] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2022-06-09 09:26:03] [INFO ] [Nat]Added 383 Read/Feed constraints in 202 ms returned sat
[2022-06-09 09:26:03] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 0 ms to minimize.
[2022-06-09 09:26:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2022-06-09 09:26:03] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 66 ms.
[2022-06-09 09:26:04] [INFO ] Added : 104 causal constraints over 21 iterations in 944 ms. Result :sat
Minimization took 825 ms.
[2022-06-09 09:26:05] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:26:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:26:05] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2022-06-09 09:26:05] [INFO ] [Real]Added 383 Read/Feed constraints in 212 ms returned sat
[2022-06-09 09:26:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:26:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:26:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:26:06] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2022-06-09 09:26:06] [INFO ] [Nat]Added 383 Read/Feed constraints in 262 ms returned sat
[2022-06-09 09:26:06] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 67 ms.
[2022-06-09 09:26:07] [INFO ] Deduced a trap composed of 131 places in 126 ms of which 1 ms to minimize.
[2022-06-09 09:26:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2022-06-09 09:26:07] [INFO ] Added : 100 causal constraints over 20 iterations in 1072 ms. Result :sat
Minimization took 755 ms.
[2022-06-09 09:26:08] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:26:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:26:08] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2022-06-09 09:26:08] [INFO ] [Real]Added 383 Read/Feed constraints in 195 ms returned sat
[2022-06-09 09:26:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:26:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:26:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:26:08] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2022-06-09 09:26:09] [INFO ] [Nat]Added 383 Read/Feed constraints in 185 ms returned sat
[2022-06-09 09:26:09] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 68 ms.
[2022-06-09 09:26:09] [INFO ] Added : 90 causal constraints over 18 iterations in 819 ms. Result :sat
Minimization took 747 ms.
[2022-06-09 09:26:10] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:26:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:26:10] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2022-06-09 09:26:11] [INFO ] [Real]Added 383 Read/Feed constraints in 193 ms returned sat
[2022-06-09 09:26:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:26:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:26:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:26:11] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2022-06-09 09:26:11] [INFO ] [Nat]Added 383 Read/Feed constraints in 182 ms returned sat
[2022-06-09 09:26:11] [INFO ] Deduced a trap composed of 135 places in 118 ms of which 1 ms to minimize.
[2022-06-09 09:26:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2022-06-09 09:26:11] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 67 ms.
[2022-06-09 09:26:12] [INFO ] Added : 45 causal constraints over 9 iterations in 542 ms. Result :sat
Minimization took 648 ms.
Current structural bounds on expressions (after SMT) : [-1, 8, -1, -1, -1] Max seen :[197, 7, 538, 65, 109]
Incomplete Parikh walk after 151300 steps, including 1000 resets, run finished after 550 ms. (steps per millisecond=275 ) properties (out of 5) seen :14 could not realise parikh vector
Incomplete Parikh walk after 97900 steps, including 1000 resets, run finished after 354 ms. (steps per millisecond=276 ) properties (out of 5) seen :7 could not realise parikh vector
Incomplete Parikh walk after 283500 steps, including 1000 resets, run finished after 1072 ms. (steps per millisecond=264 ) properties (out of 5) seen :8 could not realise parikh vector
Incomplete Parikh walk after 28600 steps, including 604 resets, run finished after 62 ms. (steps per millisecond=461 ) properties (out of 5) seen :3 could not realise parikh vector
Incomplete Parikh walk after 350900 steps, including 1000 resets, run finished after 1411 ms. (steps per millisecond=248 ) properties (out of 5) seen :8 could not realise parikh vector
Support contains 5 out of 447 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 447/447 places, 1276/1276 transitions.
Applied a total of 0 rules in 48 ms. Remains 447 /447 variables (removed 0) and now considering 1276/1276 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 447/447 places, 1276/1276 transitions.
Starting structural reductions, iteration 0 : 447/447 places, 1276/1276 transitions.
Applied a total of 0 rules in 47 ms. Remains 447 /447 variables (removed 0) and now considering 1276/1276 (removed 0) transitions.
[2022-06-09 09:26:16] [INFO ] Flow matrix only has 728 transitions (discarded 548 similar events)
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:26:16] [INFO ] Computed 3 place invariants in 8 ms
[2022-06-09 09:26:16] [INFO ] Implicit Places using invariants in 319 ms returned []
[2022-06-09 09:26:16] [INFO ] Flow matrix only has 728 transitions (discarded 548 similar events)
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:26:16] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 09:26:17] [INFO ] State equation strengthened by 383 read => feed constraints.
[2022-06-09 09:26:19] [INFO ] Implicit Places using invariants and state equation in 2945 ms returned []
Implicit Place search using SMT with State Equation took 3281 ms to find 0 implicit places.
[2022-06-09 09:26:19] [INFO ] Redundant transitions in 15 ms returned []
[2022-06-09 09:26:19] [INFO ] Flow matrix only has 728 transitions (discarded 548 similar events)
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:26:19] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 09:26:20] [INFO ] Dead Transitions using invariants and state equation in 400 ms returned []
Finished structural reductions, in 1 iterations. Remains : 447/447 places, 1276/1276 transitions.
Normalized transition count is 728 out of 1276 initially.
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:26:20] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2339 ms. (steps per millisecond=427 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 664 ms. (steps per millisecond=1506 ) properties (out of 5) seen :177
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 667 ms. (steps per millisecond=1499 ) properties (out of 5) seen :14
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 646 ms. (steps per millisecond=1547 ) properties (out of 5) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 666 ms. (steps per millisecond=1501 ) properties (out of 5) seen :187
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 651 ms. (steps per millisecond=1536 ) properties (out of 5) seen :84
[2022-06-09 09:26:25] [INFO ] Flow matrix only has 728 transitions (discarded 548 similar events)
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:26:25] [INFO ] Computed 3 place invariants in 8 ms
[2022-06-09 09:26:25] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:26:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:26:26] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2022-06-09 09:26:26] [INFO ] State equation strengthened by 383 read => feed constraints.
[2022-06-09 09:26:26] [INFO ] [Real]Added 383 Read/Feed constraints in 193 ms returned sat
[2022-06-09 09:26:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:26:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:26:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:26:26] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2022-06-09 09:26:26] [INFO ] [Nat]Added 383 Read/Feed constraints in 184 ms returned sat
[2022-06-09 09:26:26] [INFO ] Deduced a trap composed of 135 places in 126 ms of which 0 ms to minimize.
[2022-06-09 09:26:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2022-06-09 09:26:26] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 67 ms.
[2022-06-09 09:26:27] [INFO ] Added : 109 causal constraints over 22 iterations in 1006 ms. Result :sat
Minimization took 792 ms.
[2022-06-09 09:26:28] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:26:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:26:28] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2022-06-09 09:26:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:26:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:26:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:26:29] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2022-06-09 09:26:29] [INFO ] [Nat]Added 383 Read/Feed constraints in 196 ms returned sat
[2022-06-09 09:26:29] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 0 ms to minimize.
[2022-06-09 09:26:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2022-06-09 09:26:29] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 119 ms.
[2022-06-09 09:26:30] [INFO ] Added : 104 causal constraints over 21 iterations in 900 ms. Result :sat
Minimization took 812 ms.
[2022-06-09 09:26:31] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:26:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:26:31] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2022-06-09 09:26:31] [INFO ] [Real]Added 383 Read/Feed constraints in 213 ms returned sat
[2022-06-09 09:26:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:26:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:26:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:26:31] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2022-06-09 09:26:32] [INFO ] [Nat]Added 383 Read/Feed constraints in 257 ms returned sat
[2022-06-09 09:26:32] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 67 ms.
[2022-06-09 09:26:33] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 1 ms to minimize.
[2022-06-09 09:26:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2022-06-09 09:26:33] [INFO ] Added : 100 causal constraints over 20 iterations in 1062 ms. Result :sat
Minimization took 739 ms.
[2022-06-09 09:26:34] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:26:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:26:34] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2022-06-09 09:26:34] [INFO ] [Real]Added 383 Read/Feed constraints in 191 ms returned sat
[2022-06-09 09:26:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:26:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:26:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:26:34] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2022-06-09 09:26:34] [INFO ] [Nat]Added 383 Read/Feed constraints in 185 ms returned sat
[2022-06-09 09:26:35] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 81 ms.
[2022-06-09 09:26:35] [INFO ] Added : 90 causal constraints over 18 iterations in 871 ms. Result :sat
Minimization took 677 ms.
[2022-06-09 09:26:36] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:26:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:26:36] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2022-06-09 09:26:36] [INFO ] [Real]Added 383 Read/Feed constraints in 193 ms returned sat
[2022-06-09 09:26:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:26:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:26:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:26:37] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2022-06-09 09:26:37] [INFO ] [Nat]Added 383 Read/Feed constraints in 182 ms returned sat
[2022-06-09 09:26:37] [INFO ] Deduced a trap composed of 135 places in 120 ms of which 1 ms to minimize.
[2022-06-09 09:26:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2022-06-09 09:26:37] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 70 ms.
[2022-06-09 09:26:38] [INFO ] Added : 45 causal constraints over 9 iterations in 513 ms. Result :sat
Minimization took 643 ms.
Current structural bounds on expressions (after SMT) : [-1, 8, -1, -1, -1] Max seen :[197, 7, 538, 178, 109]
Incomplete Parikh walk after 151300 steps, including 1000 resets, run finished after 582 ms. (steps per millisecond=259 ) properties (out of 5) seen :10 could not realise parikh vector
Incomplete Parikh walk after 233500 steps, including 1000 resets, run finished after 929 ms. (steps per millisecond=251 ) properties (out of 5) seen :15 could not realise parikh vector
Incomplete Parikh walk after 283500 steps, including 1000 resets, run finished after 1001 ms. (steps per millisecond=283 ) properties (out of 5) seen :11 could not realise parikh vector
Incomplete Parikh walk after 28600 steps, including 617 resets, run finished after 62 ms. (steps per millisecond=461 ) properties (out of 5) seen :3 could not realise parikh vector
Incomplete Parikh walk after 350900 steps, including 1000 resets, run finished after 1441 ms. (steps per millisecond=243 ) properties (out of 5) seen :5 could not realise parikh vector
Support contains 5 out of 447 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 447/447 places, 1276/1276 transitions.
Applied a total of 0 rules in 48 ms. Remains 447 /447 variables (removed 0) and now considering 1276/1276 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 447/447 places, 1276/1276 transitions.
Starting structural reductions, iteration 0 : 447/447 places, 1276/1276 transitions.
Applied a total of 0 rules in 46 ms. Remains 447 /447 variables (removed 0) and now considering 1276/1276 (removed 0) transitions.
[2022-06-09 09:26:42] [INFO ] Flow matrix only has 728 transitions (discarded 548 similar events)
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:26:42] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-09 09:26:43] [INFO ] Implicit Places using invariants in 307 ms returned []
[2022-06-09 09:26:43] [INFO ] Flow matrix only has 728 transitions (discarded 548 similar events)
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:26:43] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:26:43] [INFO ] State equation strengthened by 383 read => feed constraints.
[2022-06-09 09:26:49] [INFO ] Implicit Places using invariants and state equation in 6825 ms returned []
Implicit Place search using SMT with State Equation took 7132 ms to find 0 implicit places.
[2022-06-09 09:26:49] [INFO ] Redundant transitions in 21 ms returned []
[2022-06-09 09:26:49] [INFO ] Flow matrix only has 728 transitions (discarded 548 similar events)
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:26:49] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-09 09:26:50] [INFO ] Dead Transitions using invariants and state equation in 448 ms returned []
Finished structural reductions, in 1 iterations. Remains : 447/447 places, 1276/1276 transitions.
Normalized transition count is 728 out of 1276 initially.
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:26:50] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 2298 ms. (steps per millisecond=435 ) properties (out of 5) seen :17
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 648 ms. (steps per millisecond=1543 ) properties (out of 5) seen :186
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 652 ms. (steps per millisecond=1533 ) properties (out of 5) seen :12
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 647 ms. (steps per millisecond=1545 ) properties (out of 5) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 679 ms. (steps per millisecond=1472 ) properties (out of 5) seen :104
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 625 ms. (steps per millisecond=1600 ) properties (out of 5) seen :3
[2022-06-09 09:26:55] [INFO ] Flow matrix only has 728 transitions (discarded 548 similar events)
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:26:55] [INFO ] Computed 3 place invariants in 8 ms
[2022-06-09 09:26:56] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:26:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:26:56] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2022-06-09 09:26:56] [INFO ] State equation strengthened by 383 read => feed constraints.
[2022-06-09 09:26:56] [INFO ] [Real]Added 383 Read/Feed constraints in 202 ms returned sat
[2022-06-09 09:26:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:26:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:26:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:26:56] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2022-06-09 09:26:56] [INFO ] [Nat]Added 383 Read/Feed constraints in 185 ms returned sat
[2022-06-09 09:26:56] [INFO ] Deduced a trap composed of 135 places in 130 ms of which 0 ms to minimize.
[2022-06-09 09:26:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2022-06-09 09:26:57] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 67 ms.
[2022-06-09 09:26:58] [INFO ] Added : 109 causal constraints over 22 iterations in 1011 ms. Result :sat
Minimization took 783 ms.
[2022-06-09 09:26:58] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:26:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:26:59] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2022-06-09 09:26:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:26:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:26:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:26:59] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2022-06-09 09:26:59] [INFO ] [Nat]Added 383 Read/Feed constraints in 203 ms returned sat
[2022-06-09 09:26:59] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 0 ms to minimize.
[2022-06-09 09:26:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2022-06-09 09:26:59] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 68 ms.
[2022-06-09 09:27:00] [INFO ] Added : 104 causal constraints over 21 iterations in 895 ms. Result :sat
Minimization took 828 ms.
[2022-06-09 09:27:01] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:27:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:27:01] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2022-06-09 09:27:01] [INFO ] [Real]Added 383 Read/Feed constraints in 219 ms returned sat
[2022-06-09 09:27:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:27:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:27:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:27:02] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2022-06-09 09:27:02] [INFO ] [Nat]Added 383 Read/Feed constraints in 259 ms returned sat
[2022-06-09 09:27:02] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 105 ms.
[2022-06-09 09:27:03] [INFO ] Deduced a trap composed of 131 places in 126 ms of which 0 ms to minimize.
[2022-06-09 09:27:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2022-06-09 09:27:03] [INFO ] Added : 100 causal constraints over 20 iterations in 1113 ms. Result :sat
Minimization took 758 ms.
[2022-06-09 09:27:04] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:27:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:27:04] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2022-06-09 09:27:04] [INFO ] [Real]Added 383 Read/Feed constraints in 193 ms returned sat
[2022-06-09 09:27:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:27:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:27:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:27:04] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2022-06-09 09:27:05] [INFO ] [Nat]Added 383 Read/Feed constraints in 184 ms returned sat
[2022-06-09 09:27:05] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 68 ms.
[2022-06-09 09:27:05] [INFO ] Added : 90 causal constraints over 18 iterations in 842 ms. Result :sat
Minimization took 681 ms.
[2022-06-09 09:27:06] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:27:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:27:06] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2022-06-09 09:27:07] [INFO ] [Real]Added 383 Read/Feed constraints in 190 ms returned sat
[2022-06-09 09:27:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:27:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:27:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:27:07] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2022-06-09 09:27:07] [INFO ] [Nat]Added 383 Read/Feed constraints in 183 ms returned sat
[2022-06-09 09:27:07] [INFO ] Deduced a trap composed of 135 places in 126 ms of which 0 ms to minimize.
[2022-06-09 09:27:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2022-06-09 09:27:07] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 66 ms.
[2022-06-09 09:27:08] [INFO ] Added : 45 causal constraints over 9 iterations in 565 ms. Result :sat
Minimization took 648 ms.
Current structural bounds on expressions (after SMT) : [-1, 8, -1, -1, -1] Max seen :[197, 7, 538, 178, 109]
Incomplete Parikh walk after 151300 steps, including 1000 resets, run finished after 516 ms. (steps per millisecond=293 ) properties (out of 5) seen :48 could not realise parikh vector
Incomplete Parikh walk after 233500 steps, including 1000 resets, run finished after 823 ms. (steps per millisecond=283 ) properties (out of 5) seen :7 could not realise parikh vector
Incomplete Parikh walk after 283500 steps, including 1000 resets, run finished after 1103 ms. (steps per millisecond=257 ) properties (out of 5) seen :15 could not realise parikh vector
Incomplete Parikh walk after 28600 steps, including 615 resets, run finished after 71 ms. (steps per millisecond=402 ) properties (out of 5) seen :3 could not realise parikh vector
Incomplete Parikh walk after 350900 steps, including 1000 resets, run finished after 1508 ms. (steps per millisecond=232 ) properties (out of 5) seen :8 could not realise parikh vector
Support contains 5 out of 447 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 447/447 places, 1276/1276 transitions.
Applied a total of 0 rules in 47 ms. Remains 447 /447 variables (removed 0) and now considering 1276/1276 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 447/447 places, 1276/1276 transitions.
Starting structural reductions, iteration 0 : 447/447 places, 1276/1276 transitions.
Applied a total of 0 rules in 47 ms. Remains 447 /447 variables (removed 0) and now considering 1276/1276 (removed 0) transitions.
[2022-06-09 09:27:13] [INFO ] Flow matrix only has 728 transitions (discarded 548 similar events)
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:27:13] [INFO ] Computed 3 place invariants in 8 ms
[2022-06-09 09:27:13] [INFO ] Implicit Places using invariants in 293 ms returned []
[2022-06-09 09:27:13] [INFO ] Flow matrix only has 728 transitions (discarded 548 similar events)
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:27:13] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-09 09:27:13] [INFO ] State equation strengthened by 383 read => feed constraints.
[2022-06-09 09:27:16] [INFO ] Implicit Places using invariants and state equation in 3140 ms returned []
Implicit Place search using SMT with State Equation took 3437 ms to find 0 implicit places.
[2022-06-09 09:27:16] [INFO ] Redundant transitions in 25 ms returned []
[2022-06-09 09:27:16] [INFO ] Flow matrix only has 728 transitions (discarded 548 similar events)
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:27:16] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-09 09:27:16] [INFO ] Dead Transitions using invariants and state equation in 376 ms returned []
Finished structural reductions, in 1 iterations. Remains : 447/447 places, 1276/1276 transitions.
Starting property specific reduction for FunctionPointer-PT-c008-UpperBounds-02
Normalized transition count is 728 out of 1276 initially.
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:27:16] [INFO ] Computed 3 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2022-06-09 09:27:16] [INFO ] Flow matrix only has 728 transitions (discarded 548 similar events)
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:27:16] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 09:27:16] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:27:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:27:17] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2022-06-09 09:27:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:27:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:27:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:27:17] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2022-06-09 09:27:17] [INFO ] State equation strengthened by 383 read => feed constraints.
[2022-06-09 09:27:17] [INFO ] [Nat]Added 383 Read/Feed constraints in 266 ms returned sat
[2022-06-09 09:27:17] [INFO ] Deduced a trap composed of 135 places in 128 ms of which 1 ms to minimize.
[2022-06-09 09:27:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2022-06-09 09:27:17] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 68 ms.
[2022-06-09 09:27:18] [INFO ] Added : 100 causal constraints over 20 iterations in 843 ms. Result :sat
Minimization took 867 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 37600 steps, including 831 resets, run finished after 91 ms. (steps per millisecond=413 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 447 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 447/447 places, 1276/1276 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 444 transition count 1270
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 444 transition count 1270
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 444 transition count 1268
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 441 transition count 1262
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 441 transition count 1262
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 439 transition count 1254
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 439 transition count 1254
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 437 transition count 1250
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 437 transition count 1250
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 435 transition count 1246
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 435 transition count 1246
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 433 transition count 1242
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 433 transition count 1242
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 431 transition count 1238
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 431 transition count 1238
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 429 transition count 1234
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 429 transition count 1234
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 427 transition count 1230
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 427 transition count 1230
Applied a total of 42 rules in 120 ms. Remains 427 /447 variables (removed 20) and now considering 1230/1276 (removed 46) transitions.
Finished structural reductions, in 1 iterations. Remains : 427/447 places, 1230/1276 transitions.
Normalized transition count is 695 out of 1230 initially.
// Phase 1: matrix 695 rows 427 cols
[2022-06-09 09:27:19] [INFO ] Computed 3 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2272 ms. (steps per millisecond=440 ) properties (out of 1) seen :18
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 637 ms. (steps per millisecond=1569 ) properties (out of 1) seen :183
[2022-06-09 09:27:22] [INFO ] Flow matrix only has 695 transitions (discarded 535 similar events)
// Phase 1: matrix 695 rows 427 cols
[2022-06-09 09:27:22] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 09:27:22] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:27:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:27:22] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2022-06-09 09:27:22] [INFO ] State equation strengthened by 358 read => feed constraints.
[2022-06-09 09:27:23] [INFO ] [Real]Added 358 Read/Feed constraints in 188 ms returned sat
[2022-06-09 09:27:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:27:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:27:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:27:23] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2022-06-09 09:27:23] [INFO ] [Nat]Added 358 Read/Feed constraints in 170 ms returned sat
[2022-06-09 09:27:23] [INFO ] Deduced a trap composed of 113 places in 160 ms of which 0 ms to minimize.
[2022-06-09 09:27:23] [INFO ] Deduced a trap composed of 131 places in 128 ms of which 1 ms to minimize.
[2022-06-09 09:27:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 360 ms
[2022-06-09 09:27:23] [INFO ] Computed and/alt/rep : 340/1257/333 causal constraints (skipped 360 transitions) in 126 ms.
[2022-06-09 09:27:24] [INFO ] Added : 86 causal constraints over 18 iterations in 809 ms. Result :sat
Minimization took 740 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[183]
Incomplete Parikh walk after 322600 steps, including 1000 resets, run finished after 1253 ms. (steps per millisecond=257 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 1 out of 427 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 427/427 places, 1230/1230 transitions.
Applied a total of 0 rules in 45 ms. Remains 427 /427 variables (removed 0) and now considering 1230/1230 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 427/427 places, 1230/1230 transitions.
Starting structural reductions, iteration 0 : 427/427 places, 1230/1230 transitions.
Applied a total of 0 rules in 46 ms. Remains 427 /427 variables (removed 0) and now considering 1230/1230 (removed 0) transitions.
[2022-06-09 09:27:26] [INFO ] Flow matrix only has 695 transitions (discarded 535 similar events)
// Phase 1: matrix 695 rows 427 cols
[2022-06-09 09:27:26] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-09 09:27:27] [INFO ] Implicit Places using invariants in 281 ms returned []
[2022-06-09 09:27:27] [INFO ] Flow matrix only has 695 transitions (discarded 535 similar events)
// Phase 1: matrix 695 rows 427 cols
[2022-06-09 09:27:27] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:27:27] [INFO ] State equation strengthened by 358 read => feed constraints.
[2022-06-09 09:27:29] [INFO ] Implicit Places using invariants and state equation in 2931 ms returned []
Implicit Place search using SMT with State Equation took 3214 ms to find 0 implicit places.
[2022-06-09 09:27:30] [INFO ] Redundant transitions in 20 ms returned []
[2022-06-09 09:27:30] [INFO ] Flow matrix only has 695 transitions (discarded 535 similar events)
// Phase 1: matrix 695 rows 427 cols
[2022-06-09 09:27:30] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-09 09:27:30] [INFO ] Dead Transitions using invariants and state equation in 361 ms returned []
Finished structural reductions, in 1 iterations. Remains : 427/427 places, 1230/1230 transitions.
Normalized transition count is 695 out of 1230 initially.
// Phase 1: matrix 695 rows 427 cols
[2022-06-09 09:27:30] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2134 ms. (steps per millisecond=468 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 640 ms. (steps per millisecond=1562 ) properties (out of 1) seen :175
[2022-06-09 09:27:33] [INFO ] Flow matrix only has 695 transitions (discarded 535 similar events)
// Phase 1: matrix 695 rows 427 cols
[2022-06-09 09:27:33] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 09:27:33] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:27:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:27:33] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2022-06-09 09:27:33] [INFO ] State equation strengthened by 358 read => feed constraints.
[2022-06-09 09:27:33] [INFO ] [Real]Added 358 Read/Feed constraints in 182 ms returned sat
[2022-06-09 09:27:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:27:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:27:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:27:33] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2022-06-09 09:27:33] [INFO ] [Nat]Added 358 Read/Feed constraints in 168 ms returned sat
[2022-06-09 09:27:34] [INFO ] Deduced a trap composed of 113 places in 158 ms of which 0 ms to minimize.
[2022-06-09 09:27:34] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 0 ms to minimize.
[2022-06-09 09:27:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 363 ms
[2022-06-09 09:27:34] [INFO ] Computed and/alt/rep : 340/1257/333 causal constraints (skipped 360 transitions) in 59 ms.
[2022-06-09 09:27:35] [INFO ] Added : 86 causal constraints over 18 iterations in 764 ms. Result :sat
Minimization took 745 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[183]
Incomplete Parikh walk after 322600 steps, including 1000 resets, run finished after 1368 ms. (steps per millisecond=235 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 1 out of 427 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 427/427 places, 1230/1230 transitions.
Applied a total of 0 rules in 45 ms. Remains 427 /427 variables (removed 0) and now considering 1230/1230 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 427/427 places, 1230/1230 transitions.
Starting structural reductions, iteration 0 : 427/427 places, 1230/1230 transitions.
Applied a total of 0 rules in 46 ms. Remains 427 /427 variables (removed 0) and now considering 1230/1230 (removed 0) transitions.
[2022-06-09 09:27:37] [INFO ] Flow matrix only has 695 transitions (discarded 535 similar events)
// Phase 1: matrix 695 rows 427 cols
[2022-06-09 09:27:37] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 09:27:37] [INFO ] Implicit Places using invariants in 295 ms returned []
[2022-06-09 09:27:37] [INFO ] Flow matrix only has 695 transitions (discarded 535 similar events)
// Phase 1: matrix 695 rows 427 cols
[2022-06-09 09:27:37] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:27:37] [INFO ] State equation strengthened by 358 read => feed constraints.
[2022-06-09 09:27:40] [INFO ] Implicit Places using invariants and state equation in 2521 ms returned []
Implicit Place search using SMT with State Equation took 2818 ms to find 0 implicit places.
[2022-06-09 09:27:40] [INFO ] Redundant transitions in 23 ms returned []
[2022-06-09 09:27:40] [INFO ] Flow matrix only has 695 transitions (discarded 535 similar events)
// Phase 1: matrix 695 rows 427 cols
[2022-06-09 09:27:40] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-09 09:27:40] [INFO ] Dead Transitions using invariants and state equation in 382 ms returned []
Finished structural reductions, in 1 iterations. Remains : 427/427 places, 1230/1230 transitions.
Ending property specific reduction for FunctionPointer-PT-c008-UpperBounds-02 in 23676 ms.
Starting property specific reduction for FunctionPointer-PT-c008-UpperBounds-06
Normalized transition count is 728 out of 1276 initially.
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:27:40] [INFO ] Computed 3 place invariants in 5 ms
Incomplete random walk after 10002 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2022-06-09 09:27:40] [INFO ] Flow matrix only has 728 transitions (discarded 548 similar events)
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:27:40] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-09 09:27:40] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:27:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:27:40] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2022-06-09 09:27:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:27:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-09 09:27:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:27:41] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2022-06-09 09:27:41] [INFO ] State equation strengthened by 383 read => feed constraints.
[2022-06-09 09:27:41] [INFO ] [Nat]Added 383 Read/Feed constraints in 247 ms returned sat
[2022-06-09 09:27:41] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 0 ms to minimize.
[2022-06-09 09:27:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2022-06-09 09:27:41] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 100 ms.
[2022-06-09 09:27:42] [INFO ] Added : 107 causal constraints over 22 iterations in 1025 ms. Result :sat
Minimization took 1032 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[0]
This parikh vector is obviously unfeasible : no match in initial state.
Support contains 1 out of 447 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 447/447 places, 1276/1276 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 443 transition count 1268
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 443 transition count 1268
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 443 transition count 1266
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 439 transition count 1258
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 439 transition count 1258
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 436 transition count 1248
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 436 transition count 1248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 433 transition count 1242
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 433 transition count 1242
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 430 transition count 1236
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 430 transition count 1236
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 427 transition count 1230
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 427 transition count 1230
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 424 transition count 1224
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 424 transition count 1224
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 421 transition count 1216
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 421 transition count 1216
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 418 transition count 1210
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 418 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 417 transition count 1208
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 417 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 416 transition count 1206
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 416 transition count 1206
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 415 transition count 1204
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 415 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 414 transition count 1202
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 414 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 413 transition count 1200
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 413 transition count 1200
Applied a total of 70 rules in 183 ms. Remains 413 /447 variables (removed 34) and now considering 1200/1276 (removed 76) transitions.
Finished structural reductions, in 1 iterations. Remains : 413/447 places, 1200/1276 transitions.
Normalized transition count is 675 out of 1200 initially.
// Phase 1: matrix 675 rows 413 cols
[2022-06-09 09:27:43] [INFO ] Computed 3 place invariants in 7 ms
Incomplete random walk after 1000005 steps, including 2 resets, run finished after 2267 ms. (steps per millisecond=441 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 615 ms. (steps per millisecond=1626 ) properties (out of 1) seen :1
[2022-06-09 09:27:46] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2022-06-09 09:27:46] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 09:27:46] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:27:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:27:46] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2022-06-09 09:27:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:27:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-09 09:27:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:27:47] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2022-06-09 09:27:47] [INFO ] State equation strengthened by 343 read => feed constraints.
[2022-06-09 09:27:47] [INFO ] [Nat]Added 343 Read/Feed constraints in 194 ms returned sat
[2022-06-09 09:27:47] [INFO ] Deduced a trap composed of 79 places in 161 ms of which 1 ms to minimize.
[2022-06-09 09:27:47] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 1 ms to minimize.
[2022-06-09 09:27:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 367 ms
[2022-06-09 09:27:47] [INFO ] Computed and/alt/rep : 332/994/330 causal constraints (skipped 343 transitions) in 63 ms.
[2022-06-09 09:27:48] [INFO ] Added : 88 causal constraints over 18 iterations in 783 ms. Result :sat
Minimization took 930 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Incomplete Parikh walk after 9600 steps, including 220 resets, run finished after 39 ms. (steps per millisecond=246 ) properties (out of 1) seen :7 could not realise parikh vector
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 62 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 413/413 places, 1200/1200 transitions.
Starting structural reductions, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 45 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2022-06-09 09:27:49] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2022-06-09 09:27:49] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:27:49] [INFO ] Implicit Places using invariants in 303 ms returned []
[2022-06-09 09:27:49] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2022-06-09 09:27:49] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:27:50] [INFO ] State equation strengthened by 343 read => feed constraints.
[2022-06-09 09:27:52] [INFO ] Implicit Places using invariants and state equation in 2957 ms returned []
Implicit Place search using SMT with State Equation took 3271 ms to find 0 implicit places.
[2022-06-09 09:27:52] [INFO ] Redundant transitions in 24 ms returned []
[2022-06-09 09:27:52] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2022-06-09 09:27:52] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 09:27:53] [INFO ] Dead Transitions using invariants and state equation in 368 ms returned []
Finished structural reductions, in 1 iterations. Remains : 413/413 places, 1200/1200 transitions.
Normalized transition count is 675 out of 1200 initially.
// Phase 1: matrix 675 rows 413 cols
[2022-06-09 09:27:53] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2192 ms. (steps per millisecond=456 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 615 ms. (steps per millisecond=1626 ) properties (out of 1) seen :1
[2022-06-09 09:27:56] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2022-06-09 09:27:56] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 09:27:56] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:27:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:27:56] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2022-06-09 09:27:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:27:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:27:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:27:56] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2022-06-09 09:27:56] [INFO ] State equation strengthened by 343 read => feed constraints.
[2022-06-09 09:27:56] [INFO ] [Nat]Added 343 Read/Feed constraints in 190 ms returned sat
[2022-06-09 09:27:56] [INFO ] Deduced a trap composed of 135 places in 151 ms of which 5 ms to minimize.
[2022-06-09 09:27:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2022-06-09 09:27:56] [INFO ] Computed and/alt/rep : 332/994/330 causal constraints (skipped 343 transitions) in 64 ms.
[2022-06-09 09:27:57] [INFO ] Added : 74 causal constraints over 15 iterations in 597 ms. Result :sat
Minimization took 599 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[7]
Incomplete Parikh walk after 32400 steps, including 617 resets, run finished after 65 ms. (steps per millisecond=498 ) properties (out of 1) seen :7 could not realise parikh vector
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 49 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 413/413 places, 1200/1200 transitions.
Starting structural reductions, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 54 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2022-06-09 09:27:58] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2022-06-09 09:27:58] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-09 09:27:58] [INFO ] Implicit Places using invariants in 307 ms returned []
[2022-06-09 09:27:58] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2022-06-09 09:27:58] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:27:58] [INFO ] State equation strengthened by 343 read => feed constraints.
[2022-06-09 09:28:01] [INFO ] Implicit Places using invariants and state equation in 2441 ms returned []
Implicit Place search using SMT with State Equation took 2760 ms to find 0 implicit places.
[2022-06-09 09:28:01] [INFO ] Redundant transitions in 25 ms returned []
[2022-06-09 09:28:01] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2022-06-09 09:28:01] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 09:28:01] [INFO ] Dead Transitions using invariants and state equation in 375 ms returned []
Finished structural reductions, in 1 iterations. Remains : 413/413 places, 1200/1200 transitions.
Ending property specific reduction for FunctionPointer-PT-c008-UpperBounds-06 in 20863 ms.
Starting property specific reduction for FunctionPointer-PT-c008-UpperBounds-07
Normalized transition count is 728 out of 1276 initially.
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:28:01] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 10002 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2022-06-09 09:28:01] [INFO ] Flow matrix only has 728 transitions (discarded 548 similar events)
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:28:01] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-09 09:28:01] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:28:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:28:01] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2022-06-09 09:28:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:28:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:28:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:28:01] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2022-06-09 09:28:01] [INFO ] State equation strengthened by 383 read => feed constraints.
[2022-06-09 09:28:02] [INFO ] [Nat]Added 383 Read/Feed constraints in 270 ms returned sat
[2022-06-09 09:28:02] [INFO ] Deduced a trap composed of 135 places in 128 ms of which 1 ms to minimize.
[2022-06-09 09:28:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2022-06-09 09:28:02] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 73 ms.
[2022-06-09 09:28:03] [INFO ] Added : 99 causal constraints over 20 iterations in 887 ms. Result :sat
Minimization took 694 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 31200 steps, including 605 resets, run finished after 54 ms. (steps per millisecond=577 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 447 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 447/447 places, 1276/1276 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 444 transition count 1270
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 444 transition count 1270
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 441 transition count 1264
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 441 transition count 1264
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 438 transition count 1254
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 438 transition count 1254
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 435 transition count 1248
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 435 transition count 1248
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 432 transition count 1242
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 432 transition count 1242
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 429 transition count 1236
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 429 transition count 1236
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 426 transition count 1230
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 426 transition count 1230
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 423 transition count 1222
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 423 transition count 1222
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 420 transition count 1216
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 420 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 419 transition count 1214
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 419 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 418 transition count 1212
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 418 transition count 1212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 417 transition count 1210
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 417 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 416 transition count 1208
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 416 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 415 transition count 1206
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 415 transition count 1206
Applied a total of 64 rules in 154 ms. Remains 415 /447 variables (removed 32) and now considering 1206/1276 (removed 70) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/447 places, 1206/1276 transitions.
Normalized transition count is 680 out of 1206 initially.
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:28:04] [INFO ] Computed 3 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2164 ms. (steps per millisecond=462 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 613 ms. (steps per millisecond=1631 ) properties (out of 1) seen :591
[2022-06-09 09:28:06] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:28:06] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-09 09:28:07] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:28:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:28:07] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2022-06-09 09:28:07] [INFO ] State equation strengthened by 348 read => feed constraints.
[2022-06-09 09:28:07] [INFO ] [Real]Added 348 Read/Feed constraints in 195 ms returned sat
[2022-06-09 09:28:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:28:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:28:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:28:07] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2022-06-09 09:28:07] [INFO ] [Nat]Added 348 Read/Feed constraints in 239 ms returned sat
[2022-06-09 09:28:08] [INFO ] Deduced a trap composed of 80 places in 168 ms of which 1 ms to minimize.
[2022-06-09 09:28:08] [INFO ] Deduced a trap composed of 118 places in 183 ms of which 0 ms to minimize.
[2022-06-09 09:28:08] [INFO ] Deduced a trap composed of 139 places in 130 ms of which 0 ms to minimize.
[2022-06-09 09:28:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 585 ms
[2022-06-09 09:28:08] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 65 ms.
[2022-06-09 09:28:09] [INFO ] Added : 95 causal constraints over 19 iterations in 759 ms. Result :sat
Minimization took 742 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[591]
Incomplete Parikh walk after 308500 steps, including 1000 resets, run finished after 1325 ms. (steps per millisecond=232 ) properties (out of 1) seen :5 could not realise parikh vector
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 44 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 44 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2022-06-09 09:28:11] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:28:11] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-09 09:28:11] [INFO ] Implicit Places using invariants in 325 ms returned []
[2022-06-09 09:28:11] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:28:11] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-09 09:28:11] [INFO ] State equation strengthened by 348 read => feed constraints.
[2022-06-09 09:28:14] [INFO ] Implicit Places using invariants and state equation in 2897 ms returned []
Implicit Place search using SMT with State Equation took 3223 ms to find 0 implicit places.
[2022-06-09 09:28:14] [INFO ] Redundant transitions in 21 ms returned []
[2022-06-09 09:28:14] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:28:14] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-09 09:28:15] [INFO ] Dead Transitions using invariants and state equation in 366 ms returned []
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 1206/1206 transitions.
Normalized transition count is 680 out of 1206 initially.
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:28:15] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 2149 ms. (steps per millisecond=465 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 614 ms. (steps per millisecond=1628 ) properties (out of 1) seen :0
[2022-06-09 09:28:17] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:28:17] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 09:28:17] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:28:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:28:17] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2022-06-09 09:28:18] [INFO ] State equation strengthened by 348 read => feed constraints.
[2022-06-09 09:28:18] [INFO ] [Real]Added 348 Read/Feed constraints in 201 ms returned sat
[2022-06-09 09:28:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:28:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:28:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:28:18] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2022-06-09 09:28:18] [INFO ] [Nat]Added 348 Read/Feed constraints in 233 ms returned sat
[2022-06-09 09:28:18] [INFO ] Deduced a trap composed of 80 places in 170 ms of which 1 ms to minimize.
[2022-06-09 09:28:19] [INFO ] Deduced a trap composed of 118 places in 173 ms of which 1 ms to minimize.
[2022-06-09 09:28:19] [INFO ] Deduced a trap composed of 139 places in 129 ms of which 0 ms to minimize.
[2022-06-09 09:28:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 567 ms
[2022-06-09 09:28:19] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 65 ms.
[2022-06-09 09:28:20] [INFO ] Added : 95 causal constraints over 19 iterations in 784 ms. Result :sat
Minimization took 737 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[591]
Incomplete Parikh walk after 308500 steps, including 1000 resets, run finished after 1299 ms. (steps per millisecond=237 ) properties (out of 1) seen :6 could not realise parikh vector
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 46 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 45 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2022-06-09 09:28:22] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:28:22] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-09 09:28:22] [INFO ] Implicit Places using invariants in 285 ms returned []
[2022-06-09 09:28:22] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:28:22] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:28:22] [INFO ] State equation strengthened by 348 read => feed constraints.
[2022-06-09 09:28:24] [INFO ] Implicit Places using invariants and state equation in 1841 ms returned []
Implicit Place search using SMT with State Equation took 2128 ms to find 0 implicit places.
[2022-06-09 09:28:24] [INFO ] Redundant transitions in 19 ms returned []
[2022-06-09 09:28:24] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 09:28:24] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:28:24] [INFO ] Dead Transitions using invariants and state equation in 370 ms returned []
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 1206/1206 transitions.
Ending property specific reduction for FunctionPointer-PT-c008-UpperBounds-07 in 23293 ms.
Starting property specific reduction for FunctionPointer-PT-c008-UpperBounds-08
Normalized transition count is 728 out of 1276 initially.
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:28:24] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :1
[2022-06-09 09:28:24] [INFO ] Flow matrix only has 728 transitions (discarded 548 similar events)
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:28:24] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 09:28:24] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:28:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:28:24] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2022-06-09 09:28:24] [INFO ] State equation strengthened by 383 read => feed constraints.
[2022-06-09 09:28:25] [INFO ] [Real]Added 383 Read/Feed constraints in 205 ms returned sat
[2022-06-09 09:28:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:28:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:28:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:28:25] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2022-06-09 09:28:25] [INFO ] [Nat]Added 383 Read/Feed constraints in 191 ms returned sat
[2022-06-09 09:28:25] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 70 ms.
[2022-06-09 09:28:26] [INFO ] Added : 94 causal constraints over 19 iterations in 873 ms. Result :sat
Minimization took 754 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[8]
Incomplete Parikh walk after 44400 steps, including 955 resets, run finished after 142 ms. (steps per millisecond=312 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 447 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 447/447 places, 1276/1276 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 444 transition count 1270
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 444 transition count 1270
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 444 transition count 1268
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 441 transition count 1262
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 441 transition count 1262
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 439 transition count 1256
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 439 transition count 1256
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 437 transition count 1252
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 437 transition count 1252
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 435 transition count 1248
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 435 transition count 1248
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 433 transition count 1244
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 433 transition count 1244
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 431 transition count 1240
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 431 transition count 1240
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 429 transition count 1234
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 429 transition count 1234
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 427 transition count 1230
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 427 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 426 transition count 1228
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 425 transition count 1226
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 425 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 424 transition count 1224
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 423 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 422 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 422 transition count 1220
Applied a total of 52 rules in 185 ms. Remains 422 /447 variables (removed 25) and now considering 1220/1276 (removed 56) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/447 places, 1220/1276 transitions.
Normalized transition count is 689 out of 1220 initially.
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 09:28:27] [INFO ] Computed 3 place invariants in 7 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 2277 ms. (steps per millisecond=439 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 629 ms. (steps per millisecond=1589 ) properties (out of 1) seen :197
[2022-06-09 09:28:30] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 09:28:30] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-09 09:28:30] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:28:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:28:30] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2022-06-09 09:28:30] [INFO ] State equation strengthened by 353 read => feed constraints.
[2022-06-09 09:28:31] [INFO ] [Real]Added 353 Read/Feed constraints in 197 ms returned sat
[2022-06-09 09:28:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:28:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:28:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:28:31] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2022-06-09 09:28:31] [INFO ] [Nat]Added 353 Read/Feed constraints in 179 ms returned sat
[2022-06-09 09:28:31] [INFO ] Deduced a trap composed of 73 places in 170 ms of which 1 ms to minimize.
[2022-06-09 09:28:31] [INFO ] Deduced a trap composed of 131 places in 130 ms of which 1 ms to minimize.
[2022-06-09 09:28:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 379 ms
[2022-06-09 09:28:31] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 67 ms.
[2022-06-09 09:28:32] [INFO ] Added : 83 causal constraints over 17 iterations in 750 ms. Result :sat
Minimization took 783 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[197]
Incomplete Parikh walk after 250500 steps, including 1000 resets, run finished after 824 ms. (steps per millisecond=304 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 45 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 45 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2022-06-09 09:28:34] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 09:28:34] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-09 09:28:34] [INFO ] Implicit Places using invariants in 288 ms returned []
[2022-06-09 09:28:34] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 09:28:34] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:28:34] [INFO ] State equation strengthened by 353 read => feed constraints.
[2022-06-09 09:28:37] [INFO ] Implicit Places using invariants and state equation in 2513 ms returned []
Implicit Place search using SMT with State Equation took 2803 ms to find 0 implicit places.
[2022-06-09 09:28:37] [INFO ] Redundant transitions in 19 ms returned []
[2022-06-09 09:28:37] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 09:28:37] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:28:37] [INFO ] Dead Transitions using invariants and state equation in 385 ms returned []
Finished structural reductions, in 1 iterations. Remains : 422/422 places, 1220/1220 transitions.
Normalized transition count is 689 out of 1220 initially.
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 09:28:37] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 2108 ms. (steps per millisecond=474 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 593 ms. (steps per millisecond=1686 ) properties (out of 1) seen :0
[2022-06-09 09:28:40] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 09:28:40] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-09 09:28:40] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:28:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:28:40] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2022-06-09 09:28:40] [INFO ] State equation strengthened by 353 read => feed constraints.
[2022-06-09 09:28:40] [INFO ] [Real]Added 353 Read/Feed constraints in 190 ms returned sat
[2022-06-09 09:28:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:28:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:28:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:28:40] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2022-06-09 09:28:40] [INFO ] [Nat]Added 353 Read/Feed constraints in 173 ms returned sat
[2022-06-09 09:28:41] [INFO ] Deduced a trap composed of 73 places in 195 ms of which 0 ms to minimize.
[2022-06-09 09:28:41] [INFO ] Deduced a trap composed of 131 places in 127 ms of which 1 ms to minimize.
[2022-06-09 09:28:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 386 ms
[2022-06-09 09:28:41] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 62 ms.
[2022-06-09 09:28:42] [INFO ] Added : 83 causal constraints over 17 iterations in 731 ms. Result :sat
Minimization took 766 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[197]
Incomplete Parikh walk after 250500 steps, including 1000 resets, run finished after 787 ms. (steps per millisecond=318 ) properties (out of 1) seen :3 could not realise parikh vector
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 44 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 45 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2022-06-09 09:28:43] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 09:28:43] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-09 09:28:44] [INFO ] Implicit Places using invariants in 287 ms returned []
[2022-06-09 09:28:44] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 09:28:44] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:28:44] [INFO ] State equation strengthened by 353 read => feed constraints.
[2022-06-09 09:28:46] [INFO ] Implicit Places using invariants and state equation in 2826 ms returned []
Implicit Place search using SMT with State Equation took 3115 ms to find 0 implicit places.
[2022-06-09 09:28:46] [INFO ] Redundant transitions in 20 ms returned []
[2022-06-09 09:28:46] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 09:28:46] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-09 09:28:47] [INFO ] Dead Transitions using invariants and state equation in 370 ms returned []
Finished structural reductions, in 1 iterations. Remains : 422/422 places, 1220/1220 transitions.
Ending property specific reduction for FunctionPointer-PT-c008-UpperBounds-08 in 22592 ms.
Starting property specific reduction for FunctionPointer-PT-c008-UpperBounds-14
Normalized transition count is 728 out of 1276 initially.
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:28:47] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2022-06-09 09:28:47] [INFO ] Flow matrix only has 728 transitions (discarded 548 similar events)
// Phase 1: matrix 728 rows 447 cols
[2022-06-09 09:28:47] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-09 09:28:47] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:28:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:28:47] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2022-06-09 09:28:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:28:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:28:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:28:47] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2022-06-09 09:28:47] [INFO ] State equation strengthened by 383 read => feed constraints.
[2022-06-09 09:28:47] [INFO ] [Nat]Added 383 Read/Feed constraints in 207 ms returned sat
[2022-06-09 09:28:48] [INFO ] Computed and/alt/rep : 348/2066/342 causal constraints (skipped 384 transitions) in 67 ms.
[2022-06-09 09:28:48] [INFO ] Added : 80 causal constraints over 17 iterations in 809 ms. Result :sat
Minimization took 690 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 30500 steps, including 728 resets, run finished after 71 ms. (steps per millisecond=429 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 447 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 447/447 places, 1276/1276 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 444 transition count 1270
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 444 transition count 1270
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 444 transition count 1268
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 441 transition count 1262
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 441 transition count 1262
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 439 transition count 1256
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 439 transition count 1256
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 437 transition count 1252
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 437 transition count 1252
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 435 transition count 1248
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 435 transition count 1248
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 433 transition count 1244
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 433 transition count 1244
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 431 transition count 1240
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 431 transition count 1240
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 429 transition count 1234
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 429 transition count 1234
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 427 transition count 1230
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 427 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 426 transition count 1228
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 425 transition count 1226
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 425 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 424 transition count 1224
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 423 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 422 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 422 transition count 1220
Applied a total of 52 rules in 166 ms. Remains 422 /447 variables (removed 25) and now considering 1220/1276 (removed 56) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/447 places, 1220/1276 transitions.
Normalized transition count is 689 out of 1220 initially.
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 09:28:49] [INFO ] Computed 3 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2124 ms. (steps per millisecond=470 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 622 ms. (steps per millisecond=1607 ) properties (out of 1) seen :0
[2022-06-09 09:28:52] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 09:28:52] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-09 09:28:52] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:28:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:28:52] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2022-06-09 09:28:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:28:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:28:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:28:52] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2022-06-09 09:28:52] [INFO ] State equation strengthened by 353 read => feed constraints.
[2022-06-09 09:28:53] [INFO ] [Nat]Added 353 Read/Feed constraints in 175 ms returned sat
[2022-06-09 09:28:53] [INFO ] Deduced a trap composed of 95 places in 163 ms of which 0 ms to minimize.
[2022-06-09 09:28:53] [INFO ] Deduced a trap composed of 193 places in 160 ms of which 0 ms to minimize.
[2022-06-09 09:28:53] [INFO ] Deduced a trap composed of 131 places in 122 ms of which 0 ms to minimize.
[2022-06-09 09:28:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 537 ms
[2022-06-09 09:28:53] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 75 ms.
[2022-06-09 09:28:54] [INFO ] Added : 83 causal constraints over 17 iterations in 786 ms. Result :sat
Minimization took 704 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 15600 steps, including 337 resets, run finished after 34 ms. (steps per millisecond=458 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 58 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 44 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2022-06-09 09:28:55] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 09:28:55] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 09:28:55] [INFO ] Implicit Places using invariants in 282 ms returned []
[2022-06-09 09:28:55] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 09:28:55] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:28:55] [INFO ] State equation strengthened by 353 read => feed constraints.
[2022-06-09 09:29:01] [INFO ] Implicit Places using invariants and state equation in 6148 ms returned []
Implicit Place search using SMT with State Equation took 6434 ms to find 0 implicit places.
[2022-06-09 09:29:01] [INFO ] Redundant transitions in 20 ms returned []
[2022-06-09 09:29:01] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 09:29:01] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-09 09:29:02] [INFO ] Dead Transitions using invariants and state equation in 359 ms returned []
Finished structural reductions, in 1 iterations. Remains : 422/422 places, 1220/1220 transitions.
Normalized transition count is 689 out of 1220 initially.
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 09:29:02] [INFO ] Computed 3 place invariants in 5 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 2124 ms. (steps per millisecond=470 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 619 ms. (steps per millisecond=1615 ) properties (out of 1) seen :0
[2022-06-09 09:29:04] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 09:29:04] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-09 09:29:04] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 09:29:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:29:05] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2022-06-09 09:29:05] [INFO ] State equation strengthened by 353 read => feed constraints.
[2022-06-09 09:29:05] [INFO ] [Real]Added 353 Read/Feed constraints in 191 ms returned sat
[2022-06-09 09:29:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:29:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 09:29:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:29:05] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2022-06-09 09:29:05] [INFO ] [Nat]Added 353 Read/Feed constraints in 183 ms returned sat
[2022-06-09 09:29:05] [INFO ] Deduced a trap composed of 108 places in 173 ms of which 1 ms to minimize.
[2022-06-09 09:29:06] [INFO ] Deduced a trap composed of 131 places in 132 ms of which 1 ms to minimize.
[2022-06-09 09:29:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 394 ms
[2022-06-09 09:29:06] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 69 ms.
[2022-06-09 09:29:06] [INFO ] Added : 86 causal constraints over 18 iterations in 816 ms. Result :sat
Minimization took 687 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 40500 steps, including 783 resets, run finished after 99 ms. (steps per millisecond=409 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 47 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 47 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2022-06-09 09:29:07] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 09:29:07] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-09 09:29:08] [INFO ] Implicit Places using invariants in 295 ms returned []
[2022-06-09 09:29:08] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 09:29:08] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 09:29:08] [INFO ] State equation strengthened by 353 read => feed constraints.
[2022-06-09 09:29:13] [INFO ] Implicit Places using invariants and state equation in 5286 ms returned []
Implicit Place search using SMT with State Equation took 5583 ms to find 0 implicit places.
[2022-06-09 09:29:13] [INFO ] Redundant transitions in 19 ms returned []
[2022-06-09 09:29:13] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 09:29:13] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-09 09:29:13] [INFO ] Dead Transitions using invariants and state equation in 371 ms returned []
Finished structural reductions, in 1 iterations. Remains : 422/422 places, 1220/1220 transitions.
Ending property specific reduction for FunctionPointer-PT-c008-UpperBounds-14 in 26520 ms.
[2022-06-09 09:29:14] [INFO ] Flatten gal took : 128 ms
[2022-06-09 09:29:14] [INFO ] Applying decomposition
[2022-06-09 09:29:14] [INFO ] Flatten gal took : 82 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/graph15969312286119911081.txt, -o, /tmp/graph15969312286119911081.bin, -w, /tmp/graph15969312286119911081.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/graph15969312286119911081.bin, -l, -1, -v, -w, /tmp/graph15969312286119911081.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 09:29:14] [INFO ] Decomposing Gal with order
[2022-06-09 09:29:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 09:29:14] [INFO ] Removed a total of 2193 redundant transitions.
[2022-06-09 09:29:14] [INFO ] Flatten gal took : 163 ms
[2022-06-09 09:29:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 933 labels/synchronizations in 65 ms.
[2022-06-09 09:29:14] [INFO ] Time to serialize gal into /tmp/UpperBounds17666740875217432532.gal : 12 ms
[2022-06-09 09:29:14] [INFO ] Time to serialize properties into /tmp/UpperBounds15202738095968383102.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds17666740875217432532.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds15202738095968383102.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/UpperBounds17666740875217432532.gal -t CGAL -reachable-file /tmp/UpperBounds15202738095968383102.prop --nowitness
Loading property file /tmp/UpperBounds15202738095968383102.prop.
Detected timeout of ITS tools.
[2022-06-09 09:51:15] [INFO ] Flatten gal took : 104 ms
[2022-06-09 09:51:15] [INFO ] Time to serialize gal into /tmp/UpperBounds6228699123445122535.gal : 11 ms
[2022-06-09 09:51:15] [INFO ] Time to serialize properties into /tmp/UpperBounds13206085824987226466.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds6228699123445122535.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds13206085824987226466.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds6228699123445122535.gal -t CGAL -reachable-file /tmp/UpperBounds13206085824987226466.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds13206085824987226466.prop.
Detected timeout of ITS tools.
[2022-06-09 10:13:15] [INFO ] Flatten gal took : 61 ms
[2022-06-09 10:13:15] [INFO ] Input system was already deterministic with 1276 transitions.
[2022-06-09 10:13:15] [INFO ] Transformed 447 places.
[2022-06-09 10:13:15] [INFO ] Transformed 1276 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-09 10:13:16] [INFO ] Time to serialize gal into /tmp/UpperBounds8941022116969959978.gal : 19 ms
[2022-06-09 10:13:16] [INFO ] Time to serialize properties into /tmp/UpperBounds6854295914778167621.prop : 11 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/UpperBounds8941022116969959978.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds6854295914778167621.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds8941022116969959978.gal -t CGAL -reachable-file /tmp/UpperBounds6854295914778167621.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds6854295914778167621.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
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="FunctionPointer-PT-c008"
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 FunctionPointer-PT-c008, 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-165472292800184"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c008.tgz
mv FunctionPointer-PT-c008 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;