Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r266-smll-167863541200629.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is Peterson-PT-5, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863541200629
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.3M
-rw-r--r-- 1 mcc users 139K Feb 25 22:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 565K Feb 25 22:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 124K Feb 25 22:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 584K Feb 25 22:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 64K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 201K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 48K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 166K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 161K Feb 25 22:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 668K Feb 25 22:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 189K Feb 25 22:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 841K Feb 25 22:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 36K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 535K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-PT-5-UpperBounds-00
FORMULA_NAME Peterson-PT-5-UpperBounds-01
FORMULA_NAME Peterson-PT-5-UpperBounds-02
FORMULA_NAME Peterson-PT-5-UpperBounds-03
FORMULA_NAME Peterson-PT-5-UpperBounds-04
FORMULA_NAME Peterson-PT-5-UpperBounds-05
FORMULA_NAME Peterson-PT-5-UpperBounds-06
FORMULA_NAME Peterson-PT-5-UpperBounds-07
FORMULA_NAME Peterson-PT-5-UpperBounds-08
FORMULA_NAME Peterson-PT-5-UpperBounds-09
FORMULA_NAME Peterson-PT-5-UpperBounds-10
FORMULA_NAME Peterson-PT-5-UpperBounds-11
FORMULA_NAME Peterson-PT-5-UpperBounds-12
FORMULA_NAME Peterson-PT-5-UpperBounds-13
FORMULA_NAME Peterson-PT-5-UpperBounds-14
FORMULA_NAME Peterson-PT-5-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679206333703

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-5
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 06:12:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-19 06:12:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 06:12:17] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2023-03-19 06:12:17] [INFO ] Transformed 834 places.
[2023-03-19 06:12:17] [INFO ] Transformed 1242 transitions.
[2023-03-19 06:12:17] [INFO ] Found NUPN structural information;
[2023-03-19 06:12:17] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_1_3_5, IsEndLoop_2_1_5, BeginLoop_5_4_3, BeginLoop_3_4_3, BeginLoop_4_4_3, BeginLoop_4_1_5, BeginLoop_3_1_5, BeginLoop_5_1_5, BeginLoop_1_4_5, TestAlone_0_1_4, TestIdentity_1_3_3, TestIdentity_2_3_3, TestIdentity_0_0_2, TestIdentity_1_4_1, TestIdentity_4_4_1, TestIdentity_3_4_1, TestIdentity_5_3_2, TestIdentity_0_4_2, TestIdentity_1_4_2, TestIdentity_3_3_2, TestIdentity_4_3_2, TestIdentity_5_2_2]
[2023-03-19 06:12:17] [INFO ] Parsed PT model containing 834 places and 1242 transitions and 3828 arcs in 414 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 ms.
FORMULA Peterson-PT-5-UpperBounds-00 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 1122 out of 1242 initially.
// Phase 1: matrix 1122 rows 834 cols
[2023-03-19 06:12:17] [INFO ] Computed 23 place invariants in 39 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 14) seen :33
FORMULA Peterson-PT-5-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :28
[2023-03-19 06:12:18] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2023-03-19 06:12:18] [INFO ] Computed 23 place invariants in 14 ms
[2023-03-19 06:12:19] [INFO ] [Real]Absence check using 17 positive place invariants in 44 ms returned unsat
[2023-03-19 06:12:19] [INFO ] [Real]Absence check using 17 positive place invariants in 48 ms returned sat
[2023-03-19 06:12:19] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-19 06:12:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 06:12:20] [INFO ] [Real]Absence check using state equation in 714 ms returned sat
[2023-03-19 06:12:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 06:12:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 29 ms returned sat
[2023-03-19 06:12:20] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 7 ms returned sat
[2023-03-19 06:12:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 06:12:21] [INFO ] [Nat]Absence check using state equation in 597 ms returned sat
[2023-03-19 06:12:21] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-19 06:12:21] [INFO ] [Nat]Added 205 Read/Feed constraints in 257 ms returned sat
[2023-03-19 06:12:22] [INFO ] Deduced a trap composed of 11 places in 931 ms of which 13 ms to minimize.
[2023-03-19 06:12:23] [INFO ] Deduced a trap composed of 11 places in 910 ms of which 3 ms to minimize.
[2023-03-19 06:12:24] [INFO ] Deduced a trap composed of 41 places in 832 ms of which 2 ms to minimize.
[2023-03-19 06:12:25] [INFO ] Deduced a trap composed of 90 places in 873 ms of which 2 ms to minimize.
[2023-03-19 06:12:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 06:12:25] [INFO ] [Real]Absence check using 17 positive place invariants in 41 ms returned unsat
[2023-03-19 06:12:26] [INFO ] [Real]Absence check using 17 positive place invariants in 39 ms returned unsat
[2023-03-19 06:12:26] [INFO ] [Real]Absence check using 17 positive place invariants in 41 ms returned unsat
[2023-03-19 06:12:26] [INFO ] [Real]Absence check using 17 positive place invariants in 40 ms returned unsat
[2023-03-19 06:12:27] [INFO ] [Real]Absence check using 17 positive place invariants in 39 ms returned sat
[2023-03-19 06:12:27] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-19 06:12:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 06:12:27] [INFO ] [Real]Absence check using state equation in 642 ms returned sat
[2023-03-19 06:12:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 06:12:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 38 ms returned sat
[2023-03-19 06:12:28] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-19 06:12:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 06:12:28] [INFO ] [Nat]Absence check using state equation in 608 ms returned sat
[2023-03-19 06:12:28] [INFO ] [Nat]Added 205 Read/Feed constraints in 62 ms returned sat
[2023-03-19 06:12:29] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 165 ms.
[2023-03-19 06:12:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 06:12:33] [INFO ] [Real]Absence check using 17 positive place invariants in 40 ms returned sat
[2023-03-19 06:12:33] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-19 06:12:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 06:12:33] [INFO ] [Real]Absence check using state equation in 642 ms returned sat
[2023-03-19 06:12:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 06:12:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 32 ms returned sat
[2023-03-19 06:12:34] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-19 06:12:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 06:12:34] [INFO ] [Nat]Absence check using state equation in 610 ms returned sat
[2023-03-19 06:12:34] [INFO ] [Nat]Added 205 Read/Feed constraints in 116 ms returned sat
[2023-03-19 06:12:35] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 119 ms.
[2023-03-19 06:12:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 06:12:39] [INFO ] [Real]Absence check using 17 positive place invariants in 39 ms returned sat
[2023-03-19 06:12:39] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-19 06:12:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 06:12:40] [INFO ] [Real]Absence check using state equation in 697 ms returned sat
[2023-03-19 06:12:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 06:12:40] [INFO ] [Nat]Absence check using 17 positive place invariants in 41 ms returned sat
[2023-03-19 06:12:40] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-19 06:12:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 06:12:40] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2023-03-19 06:12:40] [INFO ] [Nat]Added 205 Read/Feed constraints in 48 ms returned sat
[2023-03-19 06:12:41] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 140 ms.
[2023-03-19 06:12:45] [INFO ] Deduced a trap composed of 2 places in 721 ms of which 2 ms to minimize.
[2023-03-19 06:12:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [6, 180, 6, 6, 6, 6, 1, 1, 1] Max seen :[6, 4, 6, 6, 6, 6, 0, 0, 0]
FORMULA Peterson-PT-5-UpperBounds-07 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 183 out of 834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 147 place count 834 transition count 1095
Reduce places removed 147 places and 0 transitions.
Performed 149 Post agglomeration using F-continuation condition.Transition count delta: 149
Iterating post reduction 1 with 296 rules applied. Total rules applied 443 place count 687 transition count 946
Reduce places removed 149 places and 0 transitions.
Iterating post reduction 2 with 149 rules applied. Total rules applied 592 place count 538 transition count 946
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 592 place count 538 transition count 886
Deduced a syphon composed of 60 places in 3 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 712 place count 478 transition count 886
Applied a total of 712 rules in 197 ms. Remains 478 /834 variables (removed 356) and now considering 886/1242 (removed 356) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 478/834 places, 886/1242 transitions.
Normalized transition count is 766 out of 886 initially.
// Phase 1: matrix 766 rows 478 cols
[2023-03-19 06:12:46] [INFO ] Computed 23 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5732 ms. (steps per millisecond=174 ) properties (out of 4) seen :6
FORMULA Peterson-PT-5-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4235 ms. (steps per millisecond=236 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1088 ms. (steps per millisecond=919 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1021 ms. (steps per millisecond=979 ) properties (out of 3) seen :4
[2023-03-19 06:12:58] [INFO ] Flow matrix only has 766 transitions (discarded 120 similar events)
// Phase 1: matrix 766 rows 478 cols
[2023-03-19 06:12:58] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-19 06:12:58] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2023-03-19 06:12:58] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-19 06:12:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 06:12:58] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2023-03-19 06:12:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 06:12:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2023-03-19 06:12:58] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-19 06:12:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 06:12:59] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2023-03-19 06:12:59] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-19 06:12:59] [INFO ] [Nat]Added 205 Read/Feed constraints in 86 ms returned sat
[2023-03-19 06:12:59] [INFO ] Deduced a trap composed of 33 places in 315 ms of which 1 ms to minimize.
[2023-03-19 06:12:59] [INFO ] Deduced a trap composed of 9 places in 264 ms of which 1 ms to minimize.
[2023-03-19 06:13:00] [INFO ] Deduced a trap composed of 41 places in 362 ms of which 2 ms to minimize.
[2023-03-19 06:13:00] [INFO ] Deduced a trap composed of 25 places in 482 ms of which 1 ms to minimize.
[2023-03-19 06:13:01] [INFO ] Deduced a trap composed of 9 places in 469 ms of which 2 ms to minimize.
[2023-03-19 06:13:01] [INFO ] Deduced a trap composed of 9 places in 478 ms of which 1 ms to minimize.
[2023-03-19 06:13:02] [INFO ] Deduced a trap composed of 51 places in 456 ms of which 1 ms to minimize.
[2023-03-19 06:13:02] [INFO ] Deduced a trap composed of 49 places in 427 ms of which 1 ms to minimize.
[2023-03-19 06:13:03] [INFO ] Deduced a trap composed of 11 places in 397 ms of which 0 ms to minimize.
[2023-03-19 06:13:03] [INFO ] Deduced a trap composed of 39 places in 393 ms of which 1 ms to minimize.
[2023-03-19 06:13:04] [INFO ] Deduced a trap composed of 13 places in 407 ms of which 2 ms to minimize.
[2023-03-19 06:13:04] [INFO ] Deduced a trap composed of 25 places in 339 ms of which 1 ms to minimize.
[2023-03-19 06:13:04] [INFO ] Deduced a trap composed of 53 places in 357 ms of which 1 ms to minimize.
[2023-03-19 06:13:05] [INFO ] Deduced a trap composed of 49 places in 350 ms of which 1 ms to minimize.
[2023-03-19 06:13:05] [INFO ] Deduced a trap composed of 49 places in 412 ms of which 1 ms to minimize.
[2023-03-19 06:13:06] [INFO ] Deduced a trap composed of 63 places in 289 ms of which 1 ms to minimize.
[2023-03-19 06:13:06] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 6964 ms
[2023-03-19 06:13:06] [INFO ] Computed and/alt/rep : 700/1756/700 causal constraints (skipped 60 transitions) in 100 ms.
[2023-03-19 06:13:10] [INFO ] Added : 206 causal constraints over 42 iterations in 4156 ms. Result :sat
Minimization took 403 ms.
[2023-03-19 06:13:10] [INFO ] [Real]Absence check using 17 positive place invariants in 24 ms returned sat
[2023-03-19 06:13:10] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-19 06:13:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 06:13:11] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2023-03-19 06:13:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 06:13:11] [INFO ] [Nat]Absence check using 17 positive place invariants in 24 ms returned sat
[2023-03-19 06:13:11] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-19 06:13:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 06:13:11] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2023-03-19 06:13:11] [INFO ] [Nat]Added 205 Read/Feed constraints in 53 ms returned sat
[2023-03-19 06:13:12] [INFO ] Computed and/alt/rep : 700/1756/700 causal constraints (skipped 60 transitions) in 85 ms.
[2023-03-19 06:13:15] [INFO ] Deduced a trap composed of 13 places in 400 ms of which 1 ms to minimize.
[2023-03-19 06:13:15] [INFO ] Deduced a trap composed of 31 places in 299 ms of which 1 ms to minimize.
[2023-03-19 06:13:16] [INFO ] Deduced a trap composed of 82 places in 305 ms of which 1 ms to minimize.
[2023-03-19 06:13:16] [INFO ] Deduced a trap composed of 45 places in 276 ms of which 1 ms to minimize.
[2023-03-19 06:13:16] [INFO ] Deduced a trap composed of 61 places in 308 ms of which 1 ms to minimize.
[2023-03-19 06:13:17] [INFO ] Deduced a trap composed of 70 places in 298 ms of which 1 ms to minimize.
[2023-03-19 06:13:17] [INFO ] Deduced a trap composed of 17 places in 306 ms of which 1 ms to minimize.
[2023-03-19 06:13:18] [INFO ] Deduced a trap composed of 37 places in 325 ms of which 2 ms to minimize.
[2023-03-19 06:13:18] [INFO ] Deduced a trap composed of 19 places in 310 ms of which 5 ms to minimize.
[2023-03-19 06:13:18] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 1 ms to minimize.
[2023-03-19 06:13:19] [INFO ] Deduced a trap composed of 60 places in 177 ms of which 1 ms to minimize.
[2023-03-19 06:13:19] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4410 ms
[2023-03-19 06:13:19] [INFO ] Added : 177 causal constraints over 37 iterations in 7904 ms. Result :sat
Minimization took 324 ms.
[2023-03-19 06:13:20] [INFO ] [Real]Absence check using 17 positive place invariants in 22 ms returned sat
[2023-03-19 06:13:20] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-19 06:13:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 06:13:20] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2023-03-19 06:13:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 06:13:21] [INFO ] [Nat]Absence check using 17 positive place invariants in 24 ms returned sat
[2023-03-19 06:13:21] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-19 06:13:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 06:13:21] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2023-03-19 06:13:21] [INFO ] [Nat]Added 205 Read/Feed constraints in 40 ms returned sat
[2023-03-19 06:13:21] [INFO ] Computed and/alt/rep : 700/1756/700 causal constraints (skipped 60 transitions) in 79 ms.
[2023-03-19 06:13:23] [INFO ] Deduced a trap composed of 27 places in 362 ms of which 2 ms to minimize.
[2023-03-19 06:13:24] [INFO ] Deduced a trap composed of 11 places in 309 ms of which 2 ms to minimize.
[2023-03-19 06:13:24] [INFO ] Deduced a trap composed of 53 places in 395 ms of which 1 ms to minimize.
[2023-03-19 06:13:25] [INFO ] Deduced a trap composed of 41 places in 348 ms of which 1 ms to minimize.
[2023-03-19 06:13:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1860 ms
[2023-03-19 06:13:25] [INFO ] Added : 108 causal constraints over 23 iterations in 3888 ms. Result :sat
Minimization took 122 ms.
Current structural bounds on expressions (after SMT) : [180, 1, 1] Max seen :[5, 0, 0]
Support contains 182 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 886/886 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 478 transition count 885
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 477 transition count 884
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 476 transition count 884
Applied a total of 4 rules in 53 ms. Remains 476 /478 variables (removed 2) and now considering 884/886 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 476/478 places, 884/886 transitions.
Normalized transition count is 764 out of 884 initially.
// Phase 1: matrix 764 rows 476 cols
[2023-03-19 06:13:26] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6382 ms. (steps per millisecond=156 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4202 ms. (steps per millisecond=237 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1023 ms. (steps per millisecond=977 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1403 ms. (steps per millisecond=712 ) properties (out of 3) seen :4
[2023-03-19 06:13:39] [INFO ] Flow matrix only has 764 transitions (discarded 120 similar events)
// Phase 1: matrix 764 rows 476 cols
[2023-03-19 06:13:39] [INFO ] Computed 23 place invariants in 8 ms
[2023-03-19 06:13:39] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-03-19 06:13:39] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-19 06:13:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 06:13:39] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2023-03-19 06:13:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 06:13:40] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-03-19 06:13:40] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-19 06:13:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 06:13:40] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2023-03-19 06:13:40] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-19 06:13:40] [INFO ] [Nat]Added 205 Read/Feed constraints in 96 ms returned sat
[2023-03-19 06:13:40] [INFO ] Deduced a trap composed of 9 places in 318 ms of which 1 ms to minimize.
[2023-03-19 06:13:41] [INFO ] Deduced a trap composed of 13 places in 396 ms of which 2 ms to minimize.
[2023-03-19 06:13:41] [INFO ] Deduced a trap composed of 13 places in 502 ms of which 1 ms to minimize.
[2023-03-19 06:13:42] [INFO ] Deduced a trap composed of 11 places in 472 ms of which 1 ms to minimize.
[2023-03-19 06:13:42] [INFO ] Deduced a trap composed of 29 places in 480 ms of which 2 ms to minimize.
[2023-03-19 06:13:43] [INFO ] Deduced a trap composed of 19 places in 501 ms of which 1 ms to minimize.
[2023-03-19 06:13:43] [INFO ] Deduced a trap composed of 11 places in 506 ms of which 1 ms to minimize.
[2023-03-19 06:13:44] [INFO ] Deduced a trap composed of 46 places in 509 ms of which 1 ms to minimize.
[2023-03-19 06:13:45] [INFO ] Deduced a trap composed of 17 places in 485 ms of which 1 ms to minimize.
[2023-03-19 06:13:45] [INFO ] Deduced a trap composed of 50 places in 511 ms of which 1 ms to minimize.
[2023-03-19 06:13:46] [INFO ] Deduced a trap composed of 57 places in 502 ms of which 2 ms to minimize.
[2023-03-19 06:13:46] [INFO ] Deduced a trap composed of 27 places in 514 ms of which 1 ms to minimize.
[2023-03-19 06:13:47] [INFO ] Deduced a trap composed of 11 places in 533 ms of which 1 ms to minimize.
[2023-03-19 06:13:47] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 7012 ms
[2023-03-19 06:13:47] [INFO ] Computed and/alt/rep : 698/1754/698 causal constraints (skipped 60 transitions) in 88 ms.
[2023-03-19 06:13:50] [INFO ] Deduced a trap composed of 25 places in 409 ms of which 1 ms to minimize.
[2023-03-19 06:13:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 555 ms
[2023-03-19 06:13:51] [INFO ] Added : 173 causal constraints over 36 iterations in 3837 ms. Result :sat
Minimization took 415 ms.
[2023-03-19 06:13:51] [INFO ] [Real]Absence check using 17 positive place invariants in 23 ms returned sat
[2023-03-19 06:13:51] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-19 06:13:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 06:13:52] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2023-03-19 06:13:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 06:13:52] [INFO ] [Nat]Absence check using 17 positive place invariants in 24 ms returned sat
[2023-03-19 06:13:52] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-19 06:13:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 06:13:53] [INFO ] [Nat]Absence check using state equation in 394 ms returned sat
[2023-03-19 06:13:53] [INFO ] [Nat]Added 205 Read/Feed constraints in 54 ms returned sat
[2023-03-19 06:13:53] [INFO ] Computed and/alt/rep : 698/1754/698 causal constraints (skipped 60 transitions) in 83 ms.
[2023-03-19 06:13:55] [INFO ] Deduced a trap composed of 42 places in 275 ms of which 2 ms to minimize.
[2023-03-19 06:13:56] [INFO ] Deduced a trap composed of 31 places in 267 ms of which 1 ms to minimize.
[2023-03-19 06:13:56] [INFO ] Deduced a trap composed of 17 places in 316 ms of which 0 ms to minimize.
[2023-03-19 06:13:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1153 ms
[2023-03-19 06:13:56] [INFO ] Added : 132 causal constraints over 28 iterations in 3659 ms. Result :sat
Minimization took 182 ms.
[2023-03-19 06:13:57] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2023-03-19 06:13:57] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-19 06:13:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 06:13:57] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2023-03-19 06:13:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 06:13:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 24 ms returned sat
[2023-03-19 06:13:57] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-19 06:13:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 06:13:58] [INFO ] [Nat]Absence check using state equation in 380 ms returned sat
[2023-03-19 06:13:58] [INFO ] [Nat]Added 205 Read/Feed constraints in 42 ms returned sat
[2023-03-19 06:13:58] [INFO ] Computed and/alt/rep : 698/1754/698 causal constraints (skipped 60 transitions) in 74 ms.
[2023-03-19 06:14:00] [INFO ] Deduced a trap composed of 43 places in 326 ms of which 0 ms to minimize.
[2023-03-19 06:14:00] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 0 ms to minimize.
[2023-03-19 06:14:01] [INFO ] Deduced a trap composed of 69 places in 370 ms of which 1 ms to minimize.
[2023-03-19 06:14:01] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 2 ms to minimize.
[2023-03-19 06:14:01] [INFO ] Deduced a trap composed of 19 places in 211 ms of which 1 ms to minimize.
[2023-03-19 06:14:02] [INFO ] Deduced a trap composed of 25 places in 362 ms of which 1 ms to minimize.
[2023-03-19 06:14:02] [INFO ] Deduced a trap composed of 33 places in 311 ms of which 0 ms to minimize.
[2023-03-19 06:14:03] [INFO ] Deduced a trap composed of 13 places in 351 ms of which 1 ms to minimize.
[2023-03-19 06:14:03] [INFO ] Deduced a trap composed of 19 places in 323 ms of which 1 ms to minimize.
[2023-03-19 06:14:04] [INFO ] Deduced a trap composed of 13 places in 330 ms of which 1 ms to minimize.
[2023-03-19 06:14:04] [INFO ] Deduced a trap composed of 34 places in 281 ms of which 1 ms to minimize.
[2023-03-19 06:14:04] [INFO ] Deduced a trap composed of 84 places in 310 ms of which 1 ms to minimize.
[2023-03-19 06:14:05] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4790 ms
[2023-03-19 06:14:05] [INFO ] Added : 127 causal constraints over 26 iterations in 7022 ms. Result :sat
Minimization took 331 ms.
Current structural bounds on expressions (after SMT) : [180, 1, 1] Max seen :[5, 0, 0]
Support contains 182 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 884/884 transitions.
Applied a total of 0 rules in 24 ms. Remains 476 /476 variables (removed 0) and now considering 884/884 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 476/476 places, 884/884 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 884/884 transitions.
Applied a total of 0 rules in 22 ms. Remains 476 /476 variables (removed 0) and now considering 884/884 (removed 0) transitions.
[2023-03-19 06:14:06] [INFO ] Flow matrix only has 764 transitions (discarded 120 similar events)
[2023-03-19 06:14:06] [INFO ] Invariant cache hit.
[2023-03-19 06:14:07] [INFO ] Implicit Places using invariants in 437 ms returned [440, 452, 453, 454, 455, 456]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 440 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 470/476 places, 884/884 transitions.
Applied a total of 0 rules in 28 ms. Remains 470 /470 variables (removed 0) and now considering 884/884 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 492 ms. Remains : 470/476 places, 884/884 transitions.
Normalized transition count is 764 out of 884 initially.
// Phase 1: matrix 764 rows 470 cols
[2023-03-19 06:14:07] [INFO ] Computed 17 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5284 ms. (steps per millisecond=189 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3917 ms. (steps per millisecond=255 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1027 ms. (steps per millisecond=973 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1049 ms. (steps per millisecond=953 ) properties (out of 3) seen :5
[2023-03-19 06:14:18] [INFO ] Flow matrix only has 764 transitions (discarded 120 similar events)
// Phase 1: matrix 764 rows 470 cols
[2023-03-19 06:14:18] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-19 06:14:18] [INFO ] [Real]Absence check using 17 positive place invariants in 28 ms returned sat
[2023-03-19 06:14:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 06:14:19] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2023-03-19 06:14:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 06:14:19] [INFO ] [Nat]Absence check using 17 positive place invariants in 25 ms returned sat
[2023-03-19 06:14:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 06:14:19] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2023-03-19 06:14:19] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-19 06:14:19] [INFO ] [Nat]Added 205 Read/Feed constraints in 142 ms returned sat
[2023-03-19 06:14:20] [INFO ] Deduced a trap composed of 39 places in 516 ms of which 2 ms to minimize.
[2023-03-19 06:14:20] [INFO ] Deduced a trap composed of 57 places in 458 ms of which 1 ms to minimize.
[2023-03-19 06:14:21] [INFO ] Deduced a trap composed of 27 places in 478 ms of which 1 ms to minimize.
[2023-03-19 06:14:21] [INFO ] Deduced a trap composed of 46 places in 457 ms of which 10 ms to minimize.
[2023-03-19 06:14:22] [INFO ] Deduced a trap composed of 37 places in 363 ms of which 2 ms to minimize.
[2023-03-19 06:14:22] [INFO ] Deduced a trap composed of 27 places in 339 ms of which 1 ms to minimize.
[2023-03-19 06:14:23] [INFO ] Deduced a trap composed of 17 places in 331 ms of which 0 ms to minimize.
[2023-03-19 06:14:23] [INFO ] Deduced a trap composed of 49 places in 358 ms of which 1 ms to minimize.
[2023-03-19 06:14:23] [INFO ] Deduced a trap composed of 11 places in 349 ms of which 1 ms to minimize.
[2023-03-19 06:14:24] [INFO ] Deduced a trap composed of 9 places in 318 ms of which 1 ms to minimize.
[2023-03-19 06:14:24] [INFO ] Deduced a trap composed of 49 places in 353 ms of which 1 ms to minimize.
[2023-03-19 06:14:25] [INFO ] Deduced a trap composed of 13 places in 348 ms of which 1 ms to minimize.
[2023-03-19 06:14:25] [INFO ] Deduced a trap composed of 25 places in 309 ms of which 1 ms to minimize.
[2023-03-19 06:14:25] [INFO ] Deduced a trap composed of 53 places in 339 ms of which 1 ms to minimize.
[2023-03-19 06:14:26] [INFO ] Deduced a trap composed of 45 places in 384 ms of which 1 ms to minimize.
[2023-03-19 06:14:26] [INFO ] Deduced a trap composed of 33 places in 337 ms of which 1 ms to minimize.
[2023-03-19 06:14:26] [INFO ] Deduced a trap composed of 55 places in 169 ms of which 0 ms to minimize.
[2023-03-19 06:14:26] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 7053 ms
[2023-03-19 06:14:26] [INFO ] Computed and/alt/rep : 698/1754/698 causal constraints (skipped 60 transitions) in 54 ms.
[2023-03-19 06:14:31] [INFO ] Deduced a trap composed of 11 places in 479 ms of which 1 ms to minimize.
[2023-03-19 06:14:31] [INFO ] Deduced a trap composed of 25 places in 420 ms of which 1 ms to minimize.
[2023-03-19 06:14:32] [INFO ] Deduced a trap composed of 90 places in 422 ms of which 1 ms to minimize.
[2023-03-19 06:14:32] [INFO ] Deduced a trap composed of 51 places in 433 ms of which 1 ms to minimize.
[2023-03-19 06:14:33] [INFO ] Deduced a trap composed of 47 places in 437 ms of which 1 ms to minimize.
[2023-03-19 06:14:33] [INFO ] Deduced a trap composed of 53 places in 475 ms of which 1 ms to minimize.
[2023-03-19 06:14:34] [INFO ] Deduced a trap composed of 61 places in 471 ms of which 1 ms to minimize.
[2023-03-19 06:14:34] [INFO ] Deduced a trap composed of 19 places in 470 ms of which 1 ms to minimize.
[2023-03-19 06:14:35] [INFO ] Deduced a trap composed of 11 places in 475 ms of which 1 ms to minimize.
[2023-03-19 06:14:35] [INFO ] Deduced a trap composed of 31 places in 485 ms of which 2 ms to minimize.
[2023-03-19 06:14:35] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5472 ms
[2023-03-19 06:14:36] [INFO ] Added : 216 causal constraints over 45 iterations in 9325 ms. Result :sat
Minimization took 513 ms.
[2023-03-19 06:14:36] [INFO ] [Real]Absence check using 17 positive place invariants in 23 ms returned sat
[2023-03-19 06:14:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 06:14:37] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2023-03-19 06:14:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 06:14:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 25 ms returned sat
[2023-03-19 06:14:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 06:14:37] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2023-03-19 06:14:38] [INFO ] [Nat]Added 205 Read/Feed constraints in 51 ms returned sat
[2023-03-19 06:14:38] [INFO ] Computed and/alt/rep : 698/1754/698 causal constraints (skipped 60 transitions) in 63 ms.
[2023-03-19 06:14:40] [INFO ] Deduced a trap composed of 11 places in 421 ms of which 1 ms to minimize.
[2023-03-19 06:14:41] [INFO ] Deduced a trap composed of 20 places in 400 ms of which 1 ms to minimize.
[2023-03-19 06:14:41] [INFO ] Deduced a trap composed of 25 places in 379 ms of which 1 ms to minimize.
[2023-03-19 06:14:42] [INFO ] Deduced a trap composed of 27 places in 371 ms of which 1 ms to minimize.
[2023-03-19 06:14:42] [INFO ] Deduced a trap composed of 11 places in 374 ms of which 1 ms to minimize.
[2023-03-19 06:14:43] [INFO ] Deduced a trap composed of 13 places in 367 ms of which 1 ms to minimize.
[2023-03-19 06:14:43] [INFO ] Deduced a trap composed of 11 places in 369 ms of which 1 ms to minimize.
[2023-03-19 06:14:44] [INFO ] Deduced a trap composed of 11 places in 382 ms of which 1 ms to minimize.
[2023-03-19 06:14:44] [INFO ] Deduced a trap composed of 37 places in 324 ms of which 1 ms to minimize.
[2023-03-19 06:14:45] [INFO ] Deduced a trap composed of 37 places in 339 ms of which 1 ms to minimize.
[2023-03-19 06:14:45] [INFO ] Deduced a trap composed of 39 places in 328 ms of which 1 ms to minimize.
[2023-03-19 06:14:46] [INFO ] Deduced a trap composed of 55 places in 274 ms of which 1 ms to minimize.
[2023-03-19 06:14:46] [INFO ] Deduced a trap composed of 70 places in 273 ms of which 0 ms to minimize.
[2023-03-19 06:14:46] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5964 ms
[2023-03-19 06:14:47] [INFO ] Added : 161 causal constraints over 34 iterations in 9013 ms. Result :sat
Minimization took 260 ms.
[2023-03-19 06:14:47] [INFO ] [Real]Absence check using 17 positive place invariants in 23 ms returned sat
[2023-03-19 06:14:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 06:14:47] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2023-03-19 06:14:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 06:14:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 25 ms returned sat
[2023-03-19 06:14:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 06:14:48] [INFO ] [Nat]Absence check using state equation in 378 ms returned sat
[2023-03-19 06:14:48] [INFO ] [Nat]Added 205 Read/Feed constraints in 57 ms returned sat
[2023-03-19 06:14:48] [INFO ] Computed and/alt/rep : 698/1754/698 causal constraints (skipped 60 transitions) in 74 ms.
[2023-03-19 06:14:51] [INFO ] Deduced a trap composed of 33 places in 406 ms of which 1 ms to minimize.
[2023-03-19 06:14:52] [INFO ] Deduced a trap composed of 45 places in 357 ms of which 1 ms to minimize.
[2023-03-19 06:14:52] [INFO ] Deduced a trap composed of 11 places in 359 ms of which 1 ms to minimize.
[2023-03-19 06:14:52] [INFO ] Deduced a trap composed of 39 places in 375 ms of which 1 ms to minimize.
[2023-03-19 06:14:53] [INFO ] Deduced a trap composed of 13 places in 356 ms of which 1 ms to minimize.
[2023-03-19 06:14:53] [INFO ] Deduced a trap composed of 13 places in 370 ms of which 1 ms to minimize.
[2023-03-19 06:14:54] [INFO ] Deduced a trap composed of 13 places in 374 ms of which 1 ms to minimize.
[2023-03-19 06:14:54] [INFO ] Deduced a trap composed of 27 places in 348 ms of which 1 ms to minimize.
[2023-03-19 06:14:55] [INFO ] Deduced a trap composed of 27 places in 358 ms of which 0 ms to minimize.
[2023-03-19 06:14:55] [INFO ] Deduced a trap composed of 31 places in 343 ms of which 1 ms to minimize.
[2023-03-19 06:14:56] [INFO ] Deduced a trap composed of 45 places in 280 ms of which 1 ms to minimize.
[2023-03-19 06:14:56] [INFO ] Deduced a trap composed of 25 places in 350 ms of which 1 ms to minimize.
[2023-03-19 06:14:56] [INFO ] Deduced a trap composed of 41 places in 284 ms of which 1 ms to minimize.
[2023-03-19 06:14:57] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5928 ms
[2023-03-19 06:14:57] [INFO ] Added : 160 causal constraints over 32 iterations in 8864 ms. Result :sat
Minimization took 436 ms.
Current structural bounds on expressions (after SMT) : [180, 1, 1] Max seen :[5, 0, 0]
Support contains 182 out of 470 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 884/884 transitions.
Applied a total of 0 rules in 36 ms. Remains 470 /470 variables (removed 0) and now considering 884/884 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 470/470 places, 884/884 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 884/884 transitions.
Applied a total of 0 rules in 28 ms. Remains 470 /470 variables (removed 0) and now considering 884/884 (removed 0) transitions.
[2023-03-19 06:14:59] [INFO ] Flow matrix only has 764 transitions (discarded 120 similar events)
[2023-03-19 06:14:59] [INFO ] Invariant cache hit.
[2023-03-19 06:15:00] [INFO ] Implicit Places using invariants in 469 ms returned []
[2023-03-19 06:15:00] [INFO ] Flow matrix only has 764 transitions (discarded 120 similar events)
[2023-03-19 06:15:00] [INFO ] Invariant cache hit.
[2023-03-19 06:15:01] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-19 06:15:02] [INFO ] Implicit Places using invariants and state equation in 2505 ms returned []
Implicit Place search using SMT with State Equation took 2980 ms to find 0 implicit places.
[2023-03-19 06:15:03] [INFO ] Redundant transitions in 101 ms returned []
[2023-03-19 06:15:03] [INFO ] Flow matrix only has 764 transitions (discarded 120 similar events)
[2023-03-19 06:15:03] [INFO ] Invariant cache hit.
[2023-03-19 06:15:04] [INFO ] Dead Transitions using invariants and state equation in 1108 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4228 ms. Remains : 470/470 places, 884/884 transitions.
Starting property specific reduction for Peterson-PT-5-UpperBounds-03
Normalized transition count is 764 out of 884 initially.
// Phase 1: matrix 764 rows 470 cols
[2023-03-19 06:15:04] [INFO ] Computed 17 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :1
[2023-03-19 06:15:04] [INFO ] Flow matrix only has 764 transitions (discarded 120 similar events)
// Phase 1: matrix 764 rows 470 cols
[2023-03-19 06:15:04] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-19 06:15:04] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2023-03-19 06:15:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 06:15:04] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2023-03-19 06:15:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 06:15:05] [INFO ] [Nat]Absence check using 17 positive place invariants in 24 ms returned sat
[2023-03-19 06:15:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 06:15:05] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2023-03-19 06:15:05] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-19 06:15:05] [INFO ] [Nat]Added 205 Read/Feed constraints in 92 ms returned sat
[2023-03-19 06:15:05] [INFO ] Deduced a trap composed of 59 places in 314 ms of which 2 ms to minimize.
[2023-03-19 06:15:06] [INFO ] Deduced a trap composed of 31 places in 451 ms of which 1 ms to minimize.
[2023-03-19 06:15:06] [INFO ] Deduced a trap composed of 17 places in 486 ms of which 1 ms to minimize.
[2023-03-19 06:15:07] [INFO ] Deduced a trap composed of 17 places in 479 ms of which 1 ms to minimize.
[2023-03-19 06:15:07] [INFO ] Deduced a trap composed of 17 places in 467 ms of which 1 ms to minimize.
[2023-03-19 06:15:08] [INFO ] Deduced a trap composed of 19 places in 490 ms of which 1 ms to minimize.
[2023-03-19 06:15:09] [INFO ] Deduced a trap composed of 19 places in 487 ms of which 1 ms to minimize.
[2023-03-19 06:15:09] [INFO ] Deduced a trap composed of 13 places in 471 ms of which 2 ms to minimize.
[2023-03-19 06:15:10] [INFO ] Deduced a trap composed of 13 places in 444 ms of which 1 ms to minimize.
[2023-03-19 06:15:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [180] Max seen :[4]
Support contains 180 out of 470 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 884/884 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 470 transition count 882
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 468 transition count 882
Applied a total of 4 rules in 44 ms. Remains 468 /470 variables (removed 2) and now considering 882/884 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 468/470 places, 882/884 transitions.
Normalized transition count is 762 out of 882 initially.
// Phase 1: matrix 762 rows 468 cols
[2023-03-19 06:15:10] [INFO ] Computed 17 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6165 ms. (steps per millisecond=162 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4258 ms. (steps per millisecond=234 ) properties (out of 1) seen :1
[2023-03-19 06:15:20] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2023-03-19 06:15:20] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-19 06:15:20] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-03-19 06:15:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 06:15:20] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2023-03-19 06:15:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 06:15:21] [INFO ] [Nat]Absence check using 17 positive place invariants in 24 ms returned sat
[2023-03-19 06:15:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 06:15:21] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2023-03-19 06:15:21] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-19 06:15:21] [INFO ] [Nat]Added 205 Read/Feed constraints in 128 ms returned sat
[2023-03-19 06:15:22] [INFO ] Deduced a trap composed of 23 places in 441 ms of which 1 ms to minimize.
[2023-03-19 06:15:22] [INFO ] Deduced a trap composed of 25 places in 462 ms of which 1 ms to minimize.
[2023-03-19 06:15:23] [INFO ] Deduced a trap composed of 17 places in 466 ms of which 2 ms to minimize.
[2023-03-19 06:15:23] [INFO ] Deduced a trap composed of 45 places in 448 ms of which 0 ms to minimize.
[2023-03-19 06:15:24] [INFO ] Deduced a trap composed of 11 places in 469 ms of which 2 ms to minimize.
[2023-03-19 06:15:24] [INFO ] Deduced a trap composed of 11 places in 433 ms of which 1 ms to minimize.
[2023-03-19 06:15:25] [INFO ] Deduced a trap composed of 11 places in 365 ms of which 1 ms to minimize.
[2023-03-19 06:15:25] [INFO ] Deduced a trap composed of 11 places in 301 ms of which 1 ms to minimize.
[2023-03-19 06:15:25] [INFO ] Deduced a trap composed of 11 places in 413 ms of which 1 ms to minimize.
[2023-03-19 06:15:26] [INFO ] Deduced a trap composed of 58 places in 463 ms of which 1 ms to minimize.
[2023-03-19 06:15:26] [INFO ] Deduced a trap composed of 11 places in 461 ms of which 1 ms to minimize.
[2023-03-19 06:15:27] [INFO ] Deduced a trap composed of 33 places in 234 ms of which 1 ms to minimize.
[2023-03-19 06:15:27] [INFO ] Deduced a trap composed of 78 places in 316 ms of which 1 ms to minimize.
[2023-03-19 06:15:27] [INFO ] Deduced a trap composed of 49 places in 340 ms of which 1 ms to minimize.
[2023-03-19 06:15:28] [INFO ] Deduced a trap composed of 91 places in 322 ms of which 1 ms to minimize.
[2023-03-19 06:15:28] [INFO ] Deduced a trap composed of 77 places in 318 ms of which 3 ms to minimize.
[2023-03-19 06:15:29] [INFO ] Deduced a trap composed of 71 places in 321 ms of which 1 ms to minimize.
[2023-03-19 06:15:29] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 7406 ms
[2023-03-19 06:15:29] [INFO ] Computed and/alt/rep : 696/1752/696 causal constraints (skipped 60 transitions) in 81 ms.
[2023-03-19 06:15:31] [INFO ] Deduced a trap composed of 78 places in 218 ms of which 1 ms to minimize.
[2023-03-19 06:15:31] [INFO ] Deduced a trap composed of 27 places in 241 ms of which 0 ms to minimize.
[2023-03-19 06:15:32] [INFO ] Deduced a trap composed of 82 places in 291 ms of which 1 ms to minimize.
[2023-03-19 06:15:32] [INFO ] Deduced a trap composed of 34 places in 247 ms of which 0 ms to minimize.
[2023-03-19 06:15:32] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 0 ms to minimize.
[2023-03-19 06:15:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1767 ms
[2023-03-19 06:15:33] [INFO ] Added : 165 causal constraints over 34 iterations in 4046 ms. Result :sat
Minimization took 345 ms.
Current structural bounds on expressions (after SMT) : [180] Max seen :[5]
Support contains 180 out of 468 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 468/468 places, 882/882 transitions.
Applied a total of 0 rules in 34 ms. Remains 468 /468 variables (removed 0) and now considering 882/882 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 468/468 places, 882/882 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 468/468 places, 882/882 transitions.
Applied a total of 0 rules in 27 ms. Remains 468 /468 variables (removed 0) and now considering 882/882 (removed 0) transitions.
[2023-03-19 06:15:33] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
[2023-03-19 06:15:33] [INFO ] Invariant cache hit.
[2023-03-19 06:15:34] [INFO ] Implicit Places using invariants in 379 ms returned []
[2023-03-19 06:15:34] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
[2023-03-19 06:15:34] [INFO ] Invariant cache hit.
[2023-03-19 06:15:34] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-19 06:15:36] [INFO ] Implicit Places using invariants and state equation in 1994 ms returned []
Implicit Place search using SMT with State Equation took 2376 ms to find 0 implicit places.
[2023-03-19 06:15:36] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-19 06:15:36] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
[2023-03-19 06:15:36] [INFO ] Invariant cache hit.
[2023-03-19 06:15:37] [INFO ] Dead Transitions using invariants and state equation in 913 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3347 ms. Remains : 468/468 places, 882/882 transitions.
Normalized transition count is 762 out of 882 initially.
// Phase 1: matrix 762 rows 468 cols
[2023-03-19 06:15:37] [INFO ] Computed 17 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5752 ms. (steps per millisecond=173 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4212 ms. (steps per millisecond=237 ) properties (out of 1) seen :1
[2023-03-19 06:15:47] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2023-03-19 06:15:47] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-19 06:15:47] [INFO ] [Real]Absence check using 17 positive place invariants in 24 ms returned sat
[2023-03-19 06:15:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 06:15:47] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2023-03-19 06:15:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 06:15:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2023-03-19 06:15:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 06:15:48] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2023-03-19 06:15:48] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-19 06:15:48] [INFO ] [Nat]Added 205 Read/Feed constraints in 101 ms returned sat
[2023-03-19 06:15:48] [INFO ] Deduced a trap composed of 23 places in 493 ms of which 1 ms to minimize.
[2023-03-19 06:15:49] [INFO ] Deduced a trap composed of 25 places in 472 ms of which 1 ms to minimize.
[2023-03-19 06:15:49] [INFO ] Deduced a trap composed of 17 places in 466 ms of which 1 ms to minimize.
[2023-03-19 06:15:50] [INFO ] Deduced a trap composed of 45 places in 494 ms of which 1 ms to minimize.
[2023-03-19 06:15:50] [INFO ] Deduced a trap composed of 11 places in 469 ms of which 1 ms to minimize.
[2023-03-19 06:15:51] [INFO ] Deduced a trap composed of 11 places in 472 ms of which 1 ms to minimize.
[2023-03-19 06:15:51] [INFO ] Deduced a trap composed of 11 places in 462 ms of which 1 ms to minimize.
[2023-03-19 06:15:52] [INFO ] Deduced a trap composed of 11 places in 473 ms of which 1 ms to minimize.
[2023-03-19 06:15:52] [INFO ] Deduced a trap composed of 11 places in 502 ms of which 1 ms to minimize.
[2023-03-19 06:15:53] [INFO ] Deduced a trap composed of 58 places in 474 ms of which 1 ms to minimize.
[2023-03-19 06:15:53] [INFO ] Deduced a trap composed of 11 places in 403 ms of which 2 ms to minimize.
[2023-03-19 06:15:54] [INFO ] Deduced a trap composed of 33 places in 419 ms of which 1 ms to minimize.
[2023-03-19 06:15:54] [INFO ] Deduced a trap composed of 78 places in 426 ms of which 1 ms to minimize.
[2023-03-19 06:15:55] [INFO ] Deduced a trap composed of 49 places in 302 ms of which 1 ms to minimize.
[2023-03-19 06:15:55] [INFO ] Deduced a trap composed of 91 places in 309 ms of which 1 ms to minimize.
[2023-03-19 06:15:55] [INFO ] Deduced a trap composed of 77 places in 303 ms of which 1 ms to minimize.
[2023-03-19 06:15:56] [INFO ] Deduced a trap composed of 71 places in 387 ms of which 1 ms to minimize.
[2023-03-19 06:15:56] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 8238 ms
[2023-03-19 06:15:56] [INFO ] Computed and/alt/rep : 696/1752/696 causal constraints (skipped 60 transitions) in 86 ms.
[2023-03-19 06:15:59] [INFO ] Deduced a trap composed of 78 places in 356 ms of which 1 ms to minimize.
[2023-03-19 06:16:00] [INFO ] Deduced a trap composed of 27 places in 380 ms of which 1 ms to minimize.
[2023-03-19 06:16:00] [INFO ] Deduced a trap composed of 82 places in 369 ms of which 1 ms to minimize.
[2023-03-19 06:16:01] [INFO ] Deduced a trap composed of 34 places in 335 ms of which 0 ms to minimize.
[2023-03-19 06:16:01] [INFO ] Deduced a trap composed of 95 places in 253 ms of which 1 ms to minimize.
[2023-03-19 06:16:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2587 ms
[2023-03-19 06:16:02] [INFO ] Added : 165 causal constraints over 34 iterations in 5670 ms. Result :sat
Minimization took 363 ms.
Current structural bounds on expressions (after SMT) : [180] Max seen :[5]
Support contains 180 out of 468 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 468/468 places, 882/882 transitions.
Applied a total of 0 rules in 32 ms. Remains 468 /468 variables (removed 0) and now considering 882/882 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 468/468 places, 882/882 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 468/468 places, 882/882 transitions.
Applied a total of 0 rules in 26 ms. Remains 468 /468 variables (removed 0) and now considering 882/882 (removed 0) transitions.
[2023-03-19 06:16:02] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
[2023-03-19 06:16:02] [INFO ] Invariant cache hit.
[2023-03-19 06:16:03] [INFO ] Implicit Places using invariants in 645 ms returned []
[2023-03-19 06:16:03] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
[2023-03-19 06:16:03] [INFO ] Invariant cache hit.
[2023-03-19 06:16:03] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-19 06:16:05] [INFO ] Implicit Places using invariants and state equation in 2101 ms returned []
Implicit Place search using SMT with State Equation took 2748 ms to find 0 implicit places.
[2023-03-19 06:16:05] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-19 06:16:05] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
[2023-03-19 06:16:05] [INFO ] Invariant cache hit.
[2023-03-19 06:16:06] [INFO ] Dead Transitions using invariants and state equation in 784 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3574 ms. Remains : 468/468 places, 882/882 transitions.
Ending property specific reduction for Peterson-PT-5-UpperBounds-03 in 62078 ms.
Starting property specific reduction for Peterson-PT-5-UpperBounds-08
Normalized transition count is 764 out of 884 initially.
// Phase 1: matrix 764 rows 470 cols
[2023-03-19 06:16:06] [INFO ] Computed 17 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-03-19 06:16:06] [INFO ] Flow matrix only has 764 transitions (discarded 120 similar events)
// Phase 1: matrix 764 rows 470 cols
[2023-03-19 06:16:06] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-19 06:16:06] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2023-03-19 06:16:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 06:16:06] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2023-03-19 06:16:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 06:16:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 24 ms returned sat
[2023-03-19 06:16:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 06:16:07] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2023-03-19 06:16:07] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-19 06:16:07] [INFO ] [Nat]Added 205 Read/Feed constraints in 57 ms returned sat
[2023-03-19 06:16:07] [INFO ] Computed and/alt/rep : 698/1754/698 causal constraints (skipped 60 transitions) in 80 ms.
[2023-03-19 06:16:10] [INFO ] Deduced a trap composed of 11 places in 398 ms of which 1 ms to minimize.
[2023-03-19 06:16:10] [INFO ] Deduced a trap composed of 20 places in 415 ms of which 2 ms to minimize.
[2023-03-19 06:16:11] [INFO ] Deduced a trap composed of 25 places in 371 ms of which 1 ms to minimize.
[2023-03-19 06:16:11] [INFO ] Deduced a trap composed of 27 places in 338 ms of which 1 ms to minimize.
[2023-03-19 06:16:12] [INFO ] Deduced a trap composed of 2 places in 526 ms of which 2 ms to minimize.
[2023-03-19 06:16:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 470 places. Attempting structural reductions.
Drop transitions removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 882/882 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 469 transition count 825
Reduce places removed 57 places and 2 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 114 place count 412 transition count 823
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 411 transition count 822
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 116 place count 410 transition count 820
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 117 place count 409 transition count 819
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 123 Pre rules applied. Total rules applied 117 place count 409 transition count 696
Deduced a syphon composed of 123 places in 0 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 5 with 246 rules applied. Total rules applied 363 place count 286 transition count 696
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 421 place count 257 transition count 667
Applied a total of 421 rules in 89 ms. Remains 257 /470 variables (removed 213) and now considering 667/882 (removed 215) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 257/470 places, 667/882 transitions.
Normalized transition count is 547 out of 667 initially.
// Phase 1: matrix 547 rows 257 cols
[2023-03-19 06:16:12] [INFO ] Computed 17 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1880 ms. (steps per millisecond=531 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 559 ms. (steps per millisecond=1788 ) properties (out of 1) seen :0
[2023-03-19 06:16:15] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
// Phase 1: matrix 547 rows 257 cols
[2023-03-19 06:16:15] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-19 06:16:15] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2023-03-19 06:16:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 06:16:15] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2023-03-19 06:16:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 06:16:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2023-03-19 06:16:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 06:16:15] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2023-03-19 06:16:15] [INFO ] State equation strengthened by 202 read => feed constraints.
[2023-03-19 06:16:15] [INFO ] [Nat]Added 202 Read/Feed constraints in 40 ms returned sat
[2023-03-19 06:16:15] [INFO ] Computed and/alt/rep : 481/1533/481 causal constraints (skipped 60 transitions) in 57 ms.
[2023-03-19 06:16:16] [INFO ] Deduced a trap composed of 25 places in 237 ms of which 1 ms to minimize.
[2023-03-19 06:16:17] [INFO ] Deduced a trap composed of 16 places in 227 ms of which 1 ms to minimize.
[2023-03-19 06:16:17] [INFO ] Deduced a trap composed of 10 places in 235 ms of which 1 ms to minimize.
[2023-03-19 06:16:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 879 ms
[2023-03-19 06:16:17] [INFO ] Added : 61 causal constraints over 13 iterations in 1670 ms. Result :sat
Minimization took 135 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 667/667 transitions.
Applied a total of 0 rules in 20 ms. Remains 257 /257 variables (removed 0) and now considering 667/667 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 257/257 places, 667/667 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 667/667 transitions.
Applied a total of 0 rules in 15 ms. Remains 257 /257 variables (removed 0) and now considering 667/667 (removed 0) transitions.
[2023-03-19 06:16:17] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
[2023-03-19 06:16:17] [INFO ] Invariant cache hit.
[2023-03-19 06:16:18] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-19 06:16:18] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
[2023-03-19 06:16:18] [INFO ] Invariant cache hit.
[2023-03-19 06:16:18] [INFO ] State equation strengthened by 202 read => feed constraints.
[2023-03-19 06:16:19] [INFO ] Implicit Places using invariants and state equation in 1187 ms returned []
Implicit Place search using SMT with State Equation took 1636 ms to find 0 implicit places.
[2023-03-19 06:16:19] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-19 06:16:19] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
[2023-03-19 06:16:19] [INFO ] Invariant cache hit.
[2023-03-19 06:16:20] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2306 ms. Remains : 257/257 places, 667/667 transitions.
Ending property specific reduction for Peterson-PT-5-UpperBounds-08 in 13805 ms.
Starting property specific reduction for Peterson-PT-5-UpperBounds-12
Normalized transition count is 764 out of 884 initially.
// Phase 1: matrix 764 rows 470 cols
[2023-03-19 06:16:20] [INFO ] Computed 17 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
[2023-03-19 06:16:20] [INFO ] Flow matrix only has 764 transitions (discarded 120 similar events)
// Phase 1: matrix 764 rows 470 cols
[2023-03-19 06:16:20] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-19 06:16:20] [INFO ] [Real]Absence check using 17 positive place invariants in 23 ms returned sat
[2023-03-19 06:16:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 06:16:20] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2023-03-19 06:16:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 06:16:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 24 ms returned sat
[2023-03-19 06:16:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 06:16:21] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2023-03-19 06:16:21] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-19 06:16:21] [INFO ] [Nat]Added 205 Read/Feed constraints in 60 ms returned sat
[2023-03-19 06:16:21] [INFO ] Computed and/alt/rep : 698/1754/698 causal constraints (skipped 60 transitions) in 81 ms.
[2023-03-19 06:16:24] [INFO ] Deduced a trap composed of 33 places in 420 ms of which 1 ms to minimize.
[2023-03-19 06:16:24] [INFO ] Deduced a trap composed of 45 places in 362 ms of which 0 ms to minimize.
[2023-03-19 06:16:25] [INFO ] Deduced a trap composed of 11 places in 371 ms of which 1 ms to minimize.
[2023-03-19 06:16:25] [INFO ] Deduced a trap composed of 39 places in 376 ms of which 1 ms to minimize.
[2023-03-19 06:16:25] [INFO ] Trap strengthening (SAT) tested/added 4/4 trap constraints in 1869 ms
[2023-03-19 06:16:26] [INFO ] Deduced a trap composed of 2 places in 513 ms of which 1 ms to minimize.
[2023-03-19 06:16:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 470 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 883/883 transitions.
Reduce places removed 1 places and 2 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 469 transition count 826
Reduce places removed 56 places and 1 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 413 transition count 825
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 113 place count 412 transition count 823
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 114 place count 411 transition count 822
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 115 place count 410 transition count 820
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 116 place count 409 transition count 819
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 123 Pre rules applied. Total rules applied 116 place count 409 transition count 696
Deduced a syphon composed of 123 places in 1 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 6 with 246 rules applied. Total rules applied 362 place count 286 transition count 696
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 420 place count 257 transition count 667
Applied a total of 420 rules in 74 ms. Remains 257 /470 variables (removed 213) and now considering 667/883 (removed 216) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 257/470 places, 667/883 transitions.
Normalized transition count is 547 out of 667 initially.
// Phase 1: matrix 547 rows 257 cols
[2023-03-19 06:16:26] [INFO ] Computed 17 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1929 ms. (steps per millisecond=518 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 519 ms. (steps per millisecond=1926 ) properties (out of 1) seen :0
[2023-03-19 06:16:28] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
// Phase 1: matrix 547 rows 257 cols
[2023-03-19 06:16:28] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-19 06:16:28] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-19 06:16:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 06:16:29] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2023-03-19 06:16:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 06:16:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2023-03-19 06:16:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 06:16:29] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2023-03-19 06:16:29] [INFO ] State equation strengthened by 202 read => feed constraints.
[2023-03-19 06:16:29] [INFO ] [Nat]Added 202 Read/Feed constraints in 39 ms returned sat
[2023-03-19 06:16:29] [INFO ] Computed and/alt/rep : 481/1528/481 causal constraints (skipped 60 transitions) in 61 ms.
[2023-03-19 06:16:30] [INFO ] Deduced a trap composed of 16 places in 234 ms of which 1 ms to minimize.
[2023-03-19 06:16:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 325 ms
[2023-03-19 06:16:30] [INFO ] Added : 66 causal constraints over 14 iterations in 1227 ms. Result :sat
Minimization took 144 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 667/667 transitions.
Applied a total of 0 rules in 15 ms. Remains 257 /257 variables (removed 0) and now considering 667/667 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 257/257 places, 667/667 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 667/667 transitions.
Applied a total of 0 rules in 14 ms. Remains 257 /257 variables (removed 0) and now considering 667/667 (removed 0) transitions.
[2023-03-19 06:16:31] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
[2023-03-19 06:16:31] [INFO ] Invariant cache hit.
[2023-03-19 06:16:31] [INFO ] Implicit Places using invariants in 449 ms returned []
[2023-03-19 06:16:31] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
[2023-03-19 06:16:31] [INFO ] Invariant cache hit.
[2023-03-19 06:16:31] [INFO ] State equation strengthened by 202 read => feed constraints.
[2023-03-19 06:16:32] [INFO ] Implicit Places using invariants and state equation in 1400 ms returned []
Implicit Place search using SMT with State Equation took 1851 ms to find 0 implicit places.
[2023-03-19 06:16:32] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-19 06:16:32] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
[2023-03-19 06:16:32] [INFO ] Invariant cache hit.
[2023-03-19 06:16:33] [INFO ] Dead Transitions using invariants and state equation in 743 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2625 ms. Remains : 257/257 places, 667/667 transitions.
Ending property specific reduction for Peterson-PT-5-UpperBounds-12 in 13610 ms.
[2023-03-19 06:16:34] [INFO ] Flatten gal took : 213 ms
[2023-03-19 06:16:34] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 5 ms.
[2023-03-19 06:16:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 470 places, 884 transitions and 3100 arcs took 11 ms.
Total runtime 257467 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Peterson_PT_5
(NrP: 470 NrTr: 884 NrArc: 3100)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.082sec

net check time: 0m 0.001sec

init dd package: 0m 3.532sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9275820 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16093604 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.005sec

205483 346090 391600 694828 721403 719070 703788 672007 666180 667654 680400 695736 711348 1835191

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="Peterson-PT-5"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is Peterson-PT-5, 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 r266-smll-167863541200629"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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