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-167863541200645.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-7, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863541200645
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.9M
-rw-r--r-- 1 mcc users 323K Feb 25 22:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Feb 25 22:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 139K Feb 25 22:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 629K Feb 25 22:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 141K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 411K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 98K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 318K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 197K Feb 25 23:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 794K Feb 25 23:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 608K Feb 25 23:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.7M Feb 25 23:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 49K 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 1.3M 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-7-UpperBounds-00
FORMULA_NAME Peterson-PT-7-UpperBounds-01
FORMULA_NAME Peterson-PT-7-UpperBounds-02
FORMULA_NAME Peterson-PT-7-UpperBounds-03
FORMULA_NAME Peterson-PT-7-UpperBounds-04
FORMULA_NAME Peterson-PT-7-UpperBounds-05
FORMULA_NAME Peterson-PT-7-UpperBounds-06
FORMULA_NAME Peterson-PT-7-UpperBounds-07
FORMULA_NAME Peterson-PT-7-UpperBounds-08
FORMULA_NAME Peterson-PT-7-UpperBounds-09
FORMULA_NAME Peterson-PT-7-UpperBounds-10
FORMULA_NAME Peterson-PT-7-UpperBounds-11
FORMULA_NAME Peterson-PT-7-UpperBounds-12
FORMULA_NAME Peterson-PT-7-UpperBounds-13
FORMULA_NAME Peterson-PT-7-UpperBounds-14
FORMULA_NAME Peterson-PT-7-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679228730675

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-7
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 12:25:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-19 12:25:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 12:25:34] [INFO ] Load time of PNML (sax parser for PT used): 417 ms
[2023-03-19 12:25:34] [INFO ] Transformed 1992 places.
[2023-03-19 12:25:34] [INFO ] Transformed 3096 transitions.
[2023-03-19 12:25:34] [INFO ] Found NUPN structural information;
[2023-03-19 12:25:34] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_3_0_5, IsEndLoop_2_0_5, IsEndLoop_0_3_6, IsEndLoop_0_2_7, EndTurn_4_2, EndTurn_4_1, EndTurn_7_0, EndTurn_6_0, EndTurn_5_0, IsEndLoop_7_6_7, IsEndLoop_6_6_7, IsEndLoop_5_6_7, BeginLoop_1_4_2, BeginLoop_0_4_2, BeginLoop_3_0_4, BeginLoop_3_6_3, BeginLoop_0_6_5, BeginLoop_3_6_5, BeginLoop_4_2_7, BeginLoop_7_1_7, BeginLoop_5_1_7, BeginLoop_6_1_7, BeginLoop_4_1_7, BeginLoop_7_0_7, BeginLoop_6_0_7, BeginLoop_5_0_7, TestAlone_2_4_0, TestAlone_2_5_0, TestAlone_3_6_1, TestAlone_3_0_2, TestAlone_1_5_5, TestAlone_0_5_5, TestAlone_3_5_6, TestAlone_2_5_6, TestIdentity_4_2_1, TestIdentity_4_3_1, TestIdentity_7_2_1, TestIdentity_5_2_1, TestIdentity_6_2_1, TestIdentity_7_6_0, TestIdentity_6_6_0, TestIdentity_5_6_0, TestIdentity_0_2_3, TestIdentity_1_2_3, TestIdentity_1_1_6, TestIdentity_0_2_6, TestIdentity_2_4_4, TestIdentity_1_4_4, TestIdentity_4_5_7, TestIdentity_6_4_7, TestIdentity_5_4_7, TestIdentity_7_4_7, TestIdentity_4_4_7, TestIdentity_6_3_7, TestIdentity_5_3_7, TestIdentity_7_3_7, CS_0, CS_2, AskForSection_2_5, AskForSection_0_5]
[2023-03-19 12:25:34] [INFO ] Parsed PT model containing 1992 places and 3096 transitions and 9584 arcs in 553 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 35 ms.
FORMULA Peterson-PT-7-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2760 out of 3096 initially.
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-19 12:25:34] [INFO ] Computed 31 place invariants in 69 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 13) seen :34
FORMULA Peterson-PT-7-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 9) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 9) seen :23
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 :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :27
[2023-03-19 12:25:35] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-19 12:25:35] [INFO ] Computed 31 place invariants in 19 ms
[2023-03-19 12:25:37] [INFO ] [Real]Absence check using 23 positive place invariants in 92 ms returned sat
[2023-03-19 12:25:37] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 11 ms returned sat
[2023-03-19 12:25:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:25:38] [INFO ] [Real]Absence check using state equation in 1896 ms returned sat
[2023-03-19 12:25:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:25:40] [INFO ] [Nat]Absence check using 23 positive place invariants in 66 ms returned sat
[2023-03-19 12:25:40] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 22 ms returned sat
[2023-03-19 12:25:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:25:41] [INFO ] [Nat]Absence check using state equation in 1543 ms returned sat
[2023-03-19 12:25:41] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-19 12:25:42] [INFO ] [Nat]Added 497 Read/Feed constraints in 960 ms returned sat
[2023-03-19 12:25:45] [INFO ] Deduced a trap composed of 13 places in 2336 ms of which 8 ms to minimize.
[2023-03-19 12:25: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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 12:25:45] [INFO ] [Real]Absence check using 23 positive place invariants in 91 ms returned sat
[2023-03-19 12:25:45] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-19 12:25:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:25:47] [INFO ] [Real]Absence check using state equation in 1624 ms returned sat
[2023-03-19 12:25:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:25:48] [INFO ] [Nat]Absence check using 23 positive place invariants in 111 ms returned sat
[2023-03-19 12:25:48] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-19 12:25:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:25:50] [INFO ] [Nat]Absence check using state equation in 1877 ms returned sat
[2023-03-19 12:25:51] [INFO ] [Nat]Added 497 Read/Feed constraints in 779 ms returned sat
[2023-03-19 12:25:53] [INFO ] Deduced a trap composed of 13 places in 2638 ms of which 4 ms to minimize.
[2023-03-19 12:25:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 12:25:54] [INFO ] [Real]Absence check using 23 positive place invariants in 56 ms returned unsat
[2023-03-19 12:25:55] [INFO ] [Real]Absence check using 23 positive place invariants in 97 ms returned sat
[2023-03-19 12:25:55] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-19 12:25:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:25:56] [INFO ] [Real]Absence check using state equation in 1707 ms returned sat
[2023-03-19 12:25:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:25:57] [INFO ] [Nat]Absence check using 23 positive place invariants in 96 ms returned sat
[2023-03-19 12:25:57] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-19 12:25:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:25:59] [INFO ] [Nat]Absence check using state equation in 1716 ms returned sat
[2023-03-19 12:26:00] [INFO ] [Nat]Added 497 Read/Feed constraints in 804 ms returned sat
[2023-03-19 12:26:02] [INFO ] Deduced a trap composed of 13 places in 2277 ms of which 2 ms to minimize.
[2023-03-19 12:26:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 12:26:03] [INFO ] [Real]Absence check using 23 positive place invariants in 97 ms returned unsat
[2023-03-19 12:26:04] [INFO ] [Real]Absence check using 23 positive place invariants in 65 ms returned unsat
[2023-03-19 12:26:04] [INFO ] [Real]Absence check using 23 positive place invariants in 90 ms returned sat
[2023-03-19 12:26:04] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 11 ms returned sat
[2023-03-19 12:26:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:26:06] [INFO ] [Real]Absence check using state equation in 1408 ms returned sat
[2023-03-19 12:26:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:26:06] [INFO ] [Nat]Absence check using 23 positive place invariants in 75 ms returned sat
[2023-03-19 12:26:06] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-19 12:26:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:26:08] [INFO ] [Nat]Absence check using state equation in 1248 ms returned sat
[2023-03-19 12:26:08] [INFO ] [Nat]Added 497 Read/Feed constraints in 120 ms returned sat
[2023-03-19 12:26:08] [INFO ] Computed and/alt/rep : 2640/5840/2640 causal constraints (skipped 112 transitions) in 279 ms.
[2023-03-19 12:26:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 12:26:12] [INFO ] [Real]Absence check using 23 positive place invariants in 61 ms returned sat
[2023-03-19 12:26:12] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-19 12:26:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:26:13] [INFO ] [Real]Absence check using state equation in 1373 ms returned sat
[2023-03-19 12:26:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:26:14] [INFO ] [Nat]Absence check using 23 positive place invariants in 93 ms returned sat
[2023-03-19 12:26:14] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-19 12:26:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:26:15] [INFO ] [Nat]Absence check using state equation in 1619 ms returned sat
[2023-03-19 12:26:16] [INFO ] [Nat]Added 497 Read/Feed constraints in 188 ms returned sat
[2023-03-19 12:26:16] [INFO ] Computed and/alt/rep : 2640/5840/2640 causal constraints (skipped 112 transitions) in 337 ms.
[2023-03-19 12:26:18] [INFO ] Added : 21 causal constraints over 5 iterations in 2216 ms. Result :sat
Minimization took 27 ms.
[2023-03-19 12:26:19] [INFO ] [Real]Absence check using 23 positive place invariants in 92 ms returned sat
[2023-03-19 12:26:19] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-19 12:26:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:26:21] [INFO ] [Real]Absence check using state equation in 1721 ms returned sat
[2023-03-19 12:26:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:26:21] [INFO ] [Nat]Absence check using 23 positive place invariants in 67 ms returned sat
[2023-03-19 12:26:21] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-19 12:26:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:26:23] [INFO ] [Nat]Absence check using state equation in 1465 ms returned sat
[2023-03-19 12:26:23] [INFO ] [Nat]Added 497 Read/Feed constraints in 116 ms returned sat
[2023-03-19 12:26:24] [INFO ] Computed and/alt/rep : 2640/5840/2640 causal constraints (skipped 112 transitions) in 317 ms.
[2023-03-19 12:26: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 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.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)
Current structural bounds on expressions (after SMT) : [8, 56, 8, 56, 8, 8, 1, 1, 1] Max seen :[1, 7, 8, 7, 8, 8, 0, 0, 0]
FORMULA Peterson-PT-7-UpperBounds-07 8 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-7-UpperBounds-06 8 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-7-UpperBounds-04 8 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 67 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 884 transitions
Trivial Post-agglo rules discarded 884 transitions
Performed 884 trivial Post agglomeration. Transition count delta: 884
Iterating post reduction 0 with 884 rules applied. Total rules applied 884 place count 1992 transition count 2212
Reduce places removed 884 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 885 rules applied. Total rules applied 1769 place count 1108 transition count 2211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1770 place count 1107 transition count 2211
Performed 398 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 398 Pre rules applied. Total rules applied 1770 place count 1107 transition count 1813
Deduced a syphon composed of 398 places in 3 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 3 with 796 rules applied. Total rules applied 2566 place count 709 transition count 1813
Applied a total of 2566 rules in 602 ms. Remains 709 /1992 variables (removed 1283) and now considering 1813/3096 (removed 1283) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 604 ms. Remains : 709/1992 places, 1813/3096 transitions.
Normalized transition count is 1477 out of 1813 initially.
// Phase 1: matrix 1477 rows 709 cols
[2023-03-19 12:26:26] [INFO ] Computed 31 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5052 ms. (steps per millisecond=197 ) properties (out of 6) seen :7
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1311 ms. (steps per millisecond=762 ) properties (out of 6) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1957 ms. (steps per millisecond=510 ) properties (out of 6) seen :14
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1986 ms. (steps per millisecond=503 ) properties (out of 6) seen :14
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 945 ms. (steps per millisecond=1058 ) properties (out of 6) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 934 ms. (steps per millisecond=1070 ) properties (out of 6) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 945 ms. (steps per millisecond=1058 ) properties (out of 6) seen :11
[2023-03-19 12:26:40] [INFO ] Flow matrix only has 1477 transitions (discarded 336 similar events)
// Phase 1: matrix 1477 rows 709 cols
[2023-03-19 12:26:40] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-19 12:26:40] [INFO ] [Real]Absence check using 23 positive place invariants in 31 ms returned sat
[2023-03-19 12:26:40] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-19 12:26:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:26:40] [INFO ] [Real]Absence check using state equation in 599 ms returned sat
[2023-03-19 12:26:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:26:41] [INFO ] [Nat]Absence check using 23 positive place invariants in 37 ms returned sat
[2023-03-19 12:26:41] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-19 12:26:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:26:41] [INFO ] [Nat]Absence check using state equation in 690 ms returned sat
[2023-03-19 12:26:41] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-19 12:26:42] [INFO ] [Nat]Added 497 Read/Feed constraints in 124 ms returned sat
[2023-03-19 12:26:42] [INFO ] Deduced a trap composed of 15 places in 734 ms of which 3 ms to minimize.
[2023-03-19 12:26:43] [INFO ] Deduced a trap composed of 28 places in 736 ms of which 2 ms to minimize.
[2023-03-19 12:26:44] [INFO ] Deduced a trap composed of 39 places in 729 ms of which 1 ms to minimize.
[2023-03-19 12:26:45] [INFO ] Deduced a trap composed of 26 places in 718 ms of which 1 ms to minimize.
[2023-03-19 12:26:46] [INFO ] Deduced a trap composed of 35 places in 714 ms of which 1 ms to minimize.
[2023-03-19 12:26:47] [INFO ] Deduced a trap composed of 34 places in 656 ms of which 1 ms to minimize.
[2023-03-19 12:26:48] [INFO ] Deduced a trap composed of 13 places in 755 ms of which 2 ms to minimize.
[2023-03-19 12:26:48] [INFO ] Deduced a trap composed of 50 places in 713 ms of which 2 ms to minimize.
[2023-03-19 12:26:49] [INFO ] Deduced a trap composed of 35 places in 704 ms of which 1 ms to minimize.
[2023-03-19 12:26:50] [INFO ] Deduced a trap composed of 14 places in 726 ms of which 16 ms to minimize.
[2023-03-19 12:26:51] [INFO ] Deduced a trap composed of 14 places in 753 ms of which 2 ms to minimize.
[2023-03-19 12:26:52] [INFO ] Deduced a trap composed of 24 places in 656 ms of which 2 ms to minimize.
[2023-03-19 12:26:52] [INFO ] Deduced a trap composed of 46 places in 674 ms of which 1 ms to minimize.
[2023-03-19 12:26:53] [INFO ] Deduced a trap composed of 27 places in 730 ms of which 5 ms to minimize.
[2023-03-19 12:26:54] [INFO ] Deduced a trap composed of 23 places in 762 ms of which 1 ms to minimize.
[2023-03-19 12:26:55] [INFO ] Deduced a trap composed of 26 places in 624 ms of which 1 ms to minimize.
[2023-03-19 12:26:56] [INFO ] Deduced a trap composed of 13 places in 665 ms of which 1 ms to minimize.
[2023-03-19 12:26:57] [INFO ] Deduced a trap composed of 57 places in 637 ms of which 2 ms to minimize.
[2023-03-19 12:26:57] [INFO ] Deduced a trap composed of 58 places in 735 ms of which 2 ms to minimize.
[2023-03-19 12:26:58] [INFO ] Deduced a trap composed of 79 places in 743 ms of which 1 ms to minimize.
[2023-03-19 12:26:59] [INFO ] Deduced a trap composed of 26 places in 720 ms of which 1 ms to minimize.
[2023-03-19 12:27:00] [INFO ] Deduced a trap composed of 25 places in 718 ms of which 6 ms to minimize.
[2023-03-19 12:27:03] [INFO ] Trap strengthening (SAT) tested/added 22/22 trap constraints in 21261 ms
[2023-03-19 12:27:03] [INFO ] [Real]Absence check using 23 positive place invariants in 25 ms returned sat
[2023-03-19 12:27:03] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-19 12:27:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:27:04] [INFO ] [Real]Absence check using state equation in 644 ms returned sat
[2023-03-19 12:27:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:27:04] [INFO ] [Nat]Absence check using 23 positive place invariants in 36 ms returned sat
[2023-03-19 12:27:04] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-19 12:27:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:27:05] [INFO ] [Nat]Absence check using state equation in 701 ms returned sat
[2023-03-19 12:27:05] [INFO ] [Nat]Added 497 Read/Feed constraints in 162 ms returned sat
[2023-03-19 12:27:06] [INFO ] Deduced a trap composed of 12 places in 522 ms of which 1 ms to minimize.
[2023-03-19 12:27:06] [INFO ] Deduced a trap composed of 13 places in 567 ms of which 1 ms to minimize.
[2023-03-19 12:27:07] [INFO ] Deduced a trap composed of 14 places in 519 ms of which 0 ms to minimize.
[2023-03-19 12:27:07] [INFO ] Deduced a trap composed of 17 places in 545 ms of which 1 ms to minimize.
[2023-03-19 12:27:08] [INFO ] Deduced a trap composed of 13 places in 605 ms of which 1 ms to minimize.
[2023-03-19 12:27:09] [INFO ] Deduced a trap composed of 13 places in 520 ms of which 1 ms to minimize.
[2023-03-19 12:27:09] [INFO ] Deduced a trap composed of 15 places in 741 ms of which 2 ms to minimize.
[2023-03-19 12:27:10] [INFO ] Deduced a trap composed of 12 places in 744 ms of which 1 ms to minimize.
[2023-03-19 12:27:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 5250 ms
[2023-03-19 12:27:11] [INFO ] [Real]Absence check using 23 positive place invariants in 35 ms returned sat
[2023-03-19 12:27:11] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-19 12:27:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:27:11] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2023-03-19 12:27:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:27:11] [INFO ] [Nat]Absence check using 23 positive place invariants in 34 ms returned sat
[2023-03-19 12:27:11] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-19 12:27:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:27:12] [INFO ] [Nat]Absence check using state equation in 642 ms returned sat
[2023-03-19 12:27:12] [INFO ] [Nat]Added 497 Read/Feed constraints in 211 ms returned sat
[2023-03-19 12:27:13] [INFO ] Deduced a trap composed of 12 places in 495 ms of which 2 ms to minimize.
[2023-03-19 12:27:14] [INFO ] Deduced a trap composed of 13 places in 639 ms of which 1 ms to minimize.
[2023-03-19 12:27:14] [INFO ] Deduced a trap composed of 14 places in 745 ms of which 2 ms to minimize.
[2023-03-19 12:27:15] [INFO ] Deduced a trap composed of 17 places in 768 ms of which 1 ms to minimize.
[2023-03-19 12:27:16] [INFO ] Deduced a trap composed of 13 places in 520 ms of which 1 ms to minimize.
[2023-03-19 12:27:17] [INFO ] Deduced a trap composed of 13 places in 743 ms of which 1 ms to minimize.
[2023-03-19 12:27:17] [INFO ] Deduced a trap composed of 15 places in 752 ms of which 1 ms to minimize.
[2023-03-19 12:27:18] [INFO ] Deduced a trap composed of 12 places in 620 ms of which 1 ms to minimize.
[2023-03-19 12:27:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 5840 ms
[2023-03-19 12:27:18] [INFO ] [Real]Absence check using 23 positive place invariants in 23 ms returned sat
[2023-03-19 12:27:18] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-19 12:27:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:27:19] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2023-03-19 12:27:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:27:19] [INFO ] [Nat]Absence check using 23 positive place invariants in 26 ms returned sat
[2023-03-19 12:27:19] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-19 12:27:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:27:20] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2023-03-19 12:27:20] [INFO ] [Nat]Added 497 Read/Feed constraints in 81 ms returned sat
[2023-03-19 12:27:20] [INFO ] Computed and/alt/rep : 1357/4557/1357 causal constraints (skipped 112 transitions) in 148 ms.
[2023-03-19 12:27:23] [INFO ] Deduced a trap composed of 24 places in 659 ms of which 1 ms to minimize.
[2023-03-19 12:27:24] [INFO ] Deduced a trap composed of 15 places in 625 ms of which 1 ms to minimize.
[2023-03-19 12:27:25] [INFO ] Deduced a trap composed of 13 places in 636 ms of which 1 ms to minimize.
[2023-03-19 12:27:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2487 ms
[2023-03-19 12:27:25] [INFO ] Added : 88 causal constraints over 18 iterations in 5245 ms. Result :sat
Minimization took 478 ms.
[2023-03-19 12:27:26] [INFO ] [Real]Absence check using 23 positive place invariants in 31 ms returned sat
[2023-03-19 12:27:26] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-19 12:27:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:27:26] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2023-03-19 12:27:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:27:27] [INFO ] [Nat]Absence check using 23 positive place invariants in 35 ms returned sat
[2023-03-19 12:27:27] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-19 12:27:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:27:27] [INFO ] [Nat]Absence check using state equation in 517 ms returned sat
[2023-03-19 12:27:27] [INFO ] [Nat]Added 497 Read/Feed constraints in 65 ms returned sat
[2023-03-19 12:27:27] [INFO ] Computed and/alt/rep : 1357/4557/1357 causal constraints (skipped 112 transitions) in 104 ms.
[2023-03-19 12:27:28] [INFO ] Added : 6 causal constraints over 2 iterations in 435 ms. Result :sat
Minimization took 145 ms.
[2023-03-19 12:27:28] [INFO ] [Real]Absence check using 23 positive place invariants in 21 ms returned sat
[2023-03-19 12:27:28] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-19 12:27:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:27:28] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2023-03-19 12:27:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:27:29] [INFO ] [Nat]Absence check using 23 positive place invariants in 36 ms returned sat
[2023-03-19 12:27:29] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-19 12:27:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:27:29] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2023-03-19 12:27:29] [INFO ] [Nat]Added 497 Read/Feed constraints in 97 ms returned sat
[2023-03-19 12:27:30] [INFO ] Computed and/alt/rep : 1357/4557/1357 causal constraints (skipped 112 transitions) in 302 ms.
[2023-03-19 12:27:31] [INFO ] Added : 20 causal constraints over 4 iterations in 1083 ms. Result :sat
Minimization took 277 ms.
Current structural bounds on expressions (after SMT) : [8, 7, 7, 1, 1, 1] Max seen :[1, 7, 7, 0, 0, 0]
FORMULA Peterson-PT-7-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-7-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-7-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 10 out of 709 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 709/709 places, 1813/1813 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 709 transition count 1812
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 708 transition count 1812
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 2 place count 708 transition count 1763
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 100 place count 659 transition count 1763
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 212 place count 603 transition count 1707
Applied a total of 212 rules in 148 ms. Remains 603 /709 variables (removed 106) and now considering 1707/1813 (removed 106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 603/709 places, 1707/1813 transitions.
Normalized transition count is 1371 out of 1707 initially.
// Phase 1: matrix 1371 rows 603 cols
[2023-03-19 12:27:32] [INFO ] Computed 31 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2617 ms. (steps per millisecond=382 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 860 ms. (steps per millisecond=1162 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 681 ms. (steps per millisecond=1468 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 685 ms. (steps per millisecond=1459 ) properties (out of 3) seen :1
[2023-03-19 12:27:37] [INFO ] Flow matrix only has 1371 transitions (discarded 336 similar events)
// Phase 1: matrix 1371 rows 603 cols
[2023-03-19 12:27:37] [INFO ] Computed 31 place invariants in 5 ms
[2023-03-19 12:27:37] [INFO ] [Real]Absence check using 23 positive place invariants in 29 ms returned sat
[2023-03-19 12:27:37] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-19 12:27:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:27:38] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2023-03-19 12:27:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:27:38] [INFO ] [Nat]Absence check using 23 positive place invariants in 20 ms returned sat
[2023-03-19 12:27:38] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2023-03-19 12:27:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:27:38] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2023-03-19 12:27:38] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-19 12:27:38] [INFO ] [Nat]Added 497 Read/Feed constraints in 202 ms returned sat
[2023-03-19 12:27:39] [INFO ] Deduced a trap composed of 15 places in 331 ms of which 1 ms to minimize.
[2023-03-19 12:27:39] [INFO ] Deduced a trap composed of 24 places in 422 ms of which 1 ms to minimize.
[2023-03-19 12:27:40] [INFO ] Deduced a trap composed of 24 places in 619 ms of which 1 ms to minimize.
[2023-03-19 12:27:41] [INFO ] Deduced a trap composed of 24 places in 655 ms of which 1 ms to minimize.
[2023-03-19 12:27:42] [INFO ] Deduced a trap composed of 14 places in 564 ms of which 1 ms to minimize.
[2023-03-19 12:27:42] [INFO ] Deduced a trap composed of 13 places in 588 ms of which 1 ms to minimize.
[2023-03-19 12:27:43] [INFO ] Deduced a trap composed of 14 places in 667 ms of which 3 ms to minimize.
[2023-03-19 12:27:44] [INFO ] Deduced a trap composed of 22 places in 599 ms of which 1 ms to minimize.
[2023-03-19 12:27:44] [INFO ] Deduced a trap composed of 41 places in 465 ms of which 1 ms to minimize.
[2023-03-19 12:27:45] [INFO ] Deduced a trap composed of 56 places in 448 ms of which 1 ms to minimize.
[2023-03-19 12:27:45] [INFO ] Deduced a trap composed of 40 places in 512 ms of which 2 ms to minimize.
[2023-03-19 12:27:46] [INFO ] Deduced a trap composed of 23 places in 371 ms of which 1 ms to minimize.
[2023-03-19 12:27:46] [INFO ] Deduced a trap composed of 23 places in 477 ms of which 2 ms to minimize.
[2023-03-19 12:27:47] [INFO ] Deduced a trap composed of 24 places in 396 ms of which 1 ms to minimize.
[2023-03-19 12:27:48] [INFO ] Deduced a trap composed of 23 places in 551 ms of which 2 ms to minimize.
[2023-03-19 12:27:51] [INFO ] Deduced a trap composed of 11 places in 546 ms of which 1 ms to minimize.
[2023-03-19 12:27:51] [INFO ] Deduced a trap composed of 14 places in 417 ms of which 2 ms to minimize.
[2023-03-19 12:27:52] [INFO ] Deduced a trap composed of 23 places in 661 ms of which 1 ms to minimize.
[2023-03-19 12:27:53] [INFO ] Deduced a trap composed of 20 places in 671 ms of which 2 ms to minimize.
[2023-03-19 12:27:54] [INFO ] Deduced a trap composed of 32 places in 638 ms of which 2 ms to minimize.
[2023-03-19 12:27:55] [INFO ] Deduced a trap composed of 20 places in 557 ms of which 5 ms to minimize.
[2023-03-19 12:27:55] [INFO ] Deduced a trap composed of 50 places in 294 ms of which 1 ms to minimize.
[2023-03-19 12:27:56] [INFO ] Deduced a trap composed of 51 places in 559 ms of which 2 ms to minimize.
[2023-03-19 12:27:57] [INFO ] Deduced a trap composed of 51 places in 570 ms of which 1 ms to minimize.
[2023-03-19 12:27:57] [INFO ] Deduced a trap composed of 42 places in 466 ms of which 2 ms to minimize.
[2023-03-19 12:27:58] [INFO ] Deduced a trap composed of 33 places in 596 ms of which 1 ms to minimize.
[2023-03-19 12:27:59] [INFO ] Deduced a trap composed of 47 places in 528 ms of which 1 ms to minimize.
[2023-03-19 12:28:01] [INFO ] Deduced a trap composed of 47 places in 532 ms of which 1 ms to minimize.
[2023-03-19 12:28:02] [INFO ] Deduced a trap composed of 11 places in 503 ms of which 2 ms to minimize.
[2023-03-19 12:28:02] [INFO ] Deduced a trap composed of 29 places in 636 ms of which 1 ms to minimize.
[2023-03-19 12:28:03] [INFO ] Deduced a trap composed of 11 places in 609 ms of which 1 ms to minimize.
[2023-03-19 12:28:04] [INFO ] Deduced a trap composed of 48 places in 588 ms of which 1 ms to minimize.
[2023-03-19 12:28:05] [INFO ] Deduced a trap composed of 33 places in 586 ms of which 2 ms to minimize.
[2023-03-19 12:28:05] [INFO ] Deduced a trap composed of 29 places in 571 ms of which 2 ms to minimize.
[2023-03-19 12:28:09] [INFO ] Deduced a trap composed of 42 places in 525 ms of which 1 ms to minimize.
[2023-03-19 12:28:09] [INFO ] Deduced a trap composed of 33 places in 568 ms of which 2 ms to minimize.
[2023-03-19 12:28:10] [INFO ] Deduced a trap composed of 50 places in 586 ms of which 1 ms to minimize.
[2023-03-19 12:28:11] [INFO ] Deduced a trap composed of 41 places in 532 ms of which 1 ms to minimize.
[2023-03-19 12:28:12] [INFO ] Deduced a trap composed of 60 places in 476 ms of which 1 ms to minimize.
[2023-03-19 12:28:12] [INFO ] Deduced a trap composed of 67 places in 515 ms of which 1 ms to minimize.
[2023-03-19 12:28:13] [INFO ] Deduced a trap composed of 33 places in 396 ms of which 1 ms to minimize.
[2023-03-19 12:28:13] [INFO ] Deduced a trap composed of 51 places in 490 ms of which 1 ms to minimize.
[2023-03-19 12:28:14] [INFO ] Deduced a trap composed of 60 places in 567 ms of which 2 ms to minimize.
[2023-03-19 12:28:15] [INFO ] Deduced a trap composed of 32 places in 524 ms of which 1 ms to minimize.
[2023-03-19 12:28:17] [INFO ] Deduced a trap composed of 31 places in 575 ms of which 1 ms to minimize.
[2023-03-19 12:28:17] [INFO ] Deduced a trap composed of 21 places in 573 ms of which 2 ms to minimize.
[2023-03-19 12:28:19] [INFO ] Deduced a trap composed of 29 places in 466 ms of which 1 ms to minimize.
[2023-03-19 12:28:22] [INFO ] Trap strengthening (SAT) tested/added 47/47 trap constraints in 43632 ms
[2023-03-19 12:28:22] [INFO ] [Real]Absence check using 23 positive place invariants in 60 ms returned sat
[2023-03-19 12:28:22] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-19 12:28:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:28:23] [INFO ] [Real]Absence check using state equation in 595 ms returned sat
[2023-03-19 12:28:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:28:23] [INFO ] [Nat]Absence check using 23 positive place invariants in 20 ms returned sat
[2023-03-19 12:28:23] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-19 12:28:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:28:24] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2023-03-19 12:28:24] [INFO ] [Nat]Added 497 Read/Feed constraints in 141 ms returned sat
[2023-03-19 12:28:24] [INFO ] Computed and/alt/rep : 1251/4787/1251 causal constraints (skipped 112 transitions) in 144 ms.
[2023-03-19 12:28:27] [INFO ] Deduced a trap composed of 14 places in 670 ms of which 1 ms to minimize.
[2023-03-19 12:28:28] [INFO ] Deduced a trap composed of 15 places in 501 ms of which 1 ms to minimize.
[2023-03-19 12:28:28] [INFO ] Deduced a trap composed of 12 places in 606 ms of which 2 ms to minimize.
[2023-03-19 12:28:29] [INFO ] Deduced a trap composed of 30 places in 585 ms of which 1 ms to minimize.
[2023-03-19 12:28:30] [INFO ] Deduced a trap composed of 48 places in 591 ms of which 1 ms to minimize.
[2023-03-19 12:28:30] [INFO ] Deduced a trap composed of 39 places in 553 ms of which 1 ms to minimize.
[2023-03-19 12:28:31] [INFO ] Deduced a trap composed of 24 places in 349 ms of which 1 ms to minimize.
[2023-03-19 12:28:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4779 ms
[2023-03-19 12:28:31] [INFO ] Added : 105 causal constraints over 22 iterations in 7670 ms. Result :sat
Minimization took 315 ms.
[2023-03-19 12:28:32] [INFO ] [Real]Absence check using 23 positive place invariants in 28 ms returned sat
[2023-03-19 12:28:32] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-19 12:28:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:28:33] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2023-03-19 12:28:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:28:33] [INFO ] [Nat]Absence check using 23 positive place invariants in 31 ms returned sat
[2023-03-19 12:28:33] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-19 12:28:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:28:34] [INFO ] [Nat]Absence check using state equation in 607 ms returned sat
[2023-03-19 12:28:34] [INFO ] [Nat]Added 497 Read/Feed constraints in 125 ms returned sat
[2023-03-19 12:28:34] [INFO ] Computed and/alt/rep : 1251/4787/1251 causal constraints (skipped 112 transitions) in 154 ms.
[2023-03-19 12:28:37] [INFO ] Deduced a trap composed of 15 places in 709 ms of which 1 ms to minimize.
[2023-03-19 12:28:38] [INFO ] Deduced a trap composed of 13 places in 706 ms of which 1 ms to minimize.
[2023-03-19 12:28:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1747 ms
[2023-03-19 12:28:39] [INFO ] Added : 106 causal constraints over 23 iterations in 5077 ms. Result :sat
Minimization took 358 ms.
Current structural bounds on expressions (after SMT) : [8, 1, 1] Max seen :[1, 0, 0]
Support contains 10 out of 603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 603/603 places, 1707/1707 transitions.
Applied a total of 0 rules in 40 ms. Remains 603 /603 variables (removed 0) and now considering 1707/1707 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 603/603 places, 1707/1707 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 603/603 places, 1707/1707 transitions.
Applied a total of 0 rules in 59 ms. Remains 603 /603 variables (removed 0) and now considering 1707/1707 (removed 0) transitions.
[2023-03-19 12:28:40] [INFO ] Flow matrix only has 1371 transitions (discarded 336 similar events)
[2023-03-19 12:28:40] [INFO ] Invariant cache hit.
[2023-03-19 12:28:41] [INFO ] Implicit Places using invariants in 985 ms returned [587, 588, 589, 590, 591, 600, 601, 602]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 993 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 595/603 places, 1707/1707 transitions.
Applied a total of 0 rules in 54 ms. Remains 595 /595 variables (removed 0) and now considering 1707/1707 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1109 ms. Remains : 595/603 places, 1707/1707 transitions.
Normalized transition count is 1371 out of 1707 initially.
// Phase 1: matrix 1371 rows 595 cols
[2023-03-19 12:28:41] [INFO ] Computed 23 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3176 ms. (steps per millisecond=314 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 883 ms. (steps per millisecond=1132 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 700 ms. (steps per millisecond=1428 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 705 ms. (steps per millisecond=1418 ) properties (out of 3) seen :1
[2023-03-19 12:28:47] [INFO ] Flow matrix only has 1371 transitions (discarded 336 similar events)
// Phase 1: matrix 1371 rows 595 cols
[2023-03-19 12:28:47] [INFO ] Computed 23 place invariants in 8 ms
[2023-03-19 12:28:47] [INFO ] [Real]Absence check using 23 positive place invariants in 29 ms returned sat
[2023-03-19 12:28:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:28:47] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2023-03-19 12:28:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:28:48] [INFO ] [Nat]Absence check using 23 positive place invariants in 24 ms returned sat
[2023-03-19 12:28:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:28:48] [INFO ] [Nat]Absence check using state equation in 509 ms returned sat
[2023-03-19 12:28:48] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-19 12:28:48] [INFO ] [Nat]Added 497 Read/Feed constraints in 220 ms returned sat
[2023-03-19 12:28:49] [INFO ] Deduced a trap composed of 15 places in 582 ms of which 1 ms to minimize.
[2023-03-19 12:28:49] [INFO ] Deduced a trap composed of 15 places in 391 ms of which 0 ms to minimize.
[2023-03-19 12:28:50] [INFO ] Deduced a trap composed of 39 places in 678 ms of which 1 ms to minimize.
[2023-03-19 12:28:51] [INFO ] Deduced a trap composed of 84 places in 644 ms of which 1 ms to minimize.
[2023-03-19 12:28:52] [INFO ] Deduced a trap composed of 14 places in 681 ms of which 1 ms to minimize.
[2023-03-19 12:28:53] [INFO ] Deduced a trap composed of 38 places in 723 ms of which 1 ms to minimize.
[2023-03-19 12:28:53] [INFO ] Deduced a trap composed of 47 places in 685 ms of which 1 ms to minimize.
[2023-03-19 12:28:54] [INFO ] Deduced a trap composed of 41 places in 687 ms of which 1 ms to minimize.
[2023-03-19 12:28:55] [INFO ] Deduced a trap composed of 29 places in 665 ms of which 1 ms to minimize.
[2023-03-19 12:28:56] [INFO ] Deduced a trap composed of 24 places in 684 ms of which 1 ms to minimize.
[2023-03-19 12:28:56] [INFO ] Deduced a trap composed of 23 places in 628 ms of which 1 ms to minimize.
[2023-03-19 12:28:57] [INFO ] Deduced a trap composed of 32 places in 574 ms of which 1 ms to minimize.
[2023-03-19 12:28:58] [INFO ] Deduced a trap composed of 20 places in 561 ms of which 1 ms to minimize.
[2023-03-19 12:28:59] [INFO ] Deduced a trap composed of 42 places in 633 ms of which 1 ms to minimize.
[2023-03-19 12:29:00] [INFO ] Deduced a trap composed of 42 places in 649 ms of which 1 ms to minimize.
[2023-03-19 12:29:00] [INFO ] Deduced a trap composed of 11 places in 650 ms of which 1 ms to minimize.
[2023-03-19 12:29:01] [INFO ] Deduced a trap composed of 33 places in 480 ms of which 2 ms to minimize.
[2023-03-19 12:29:01] [INFO ] Deduced a trap composed of 29 places in 477 ms of which 1 ms to minimize.
[2023-03-19 12:29:04] [INFO ] Trap strengthening (SAT) tested/added 18/18 trap constraints in 16189 ms
[2023-03-19 12:29:05] [INFO ] [Real]Absence check using 23 positive place invariants in 28 ms returned sat
[2023-03-19 12:29:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:29:05] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2023-03-19 12:29:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:29:06] [INFO ] [Nat]Absence check using 23 positive place invariants in 32 ms returned sat
[2023-03-19 12:29:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:29:06] [INFO ] [Nat]Absence check using state equation in 586 ms returned sat
[2023-03-19 12:29:06] [INFO ] [Nat]Added 497 Read/Feed constraints in 123 ms returned sat
[2023-03-19 12:29:07] [INFO ] Computed and/alt/rep : 1251/4787/1251 causal constraints (skipped 112 transitions) in 159 ms.
[2023-03-19 12:29:10] [INFO ] Deduced a trap composed of 11 places in 623 ms of which 1 ms to minimize.
[2023-03-19 12:29:11] [INFO ] Deduced a trap composed of 15 places in 542 ms of which 1 ms to minimize.
[2023-03-19 12:29:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1503 ms
[2023-03-19 12:29:11] [INFO ] Added : 119 causal constraints over 24 iterations in 5059 ms. Result :sat
Minimization took 405 ms.
[2023-03-19 12:29:12] [INFO ] [Real]Absence check using 23 positive place invariants in 30 ms returned sat
[2023-03-19 12:29:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:29:13] [INFO ] [Real]Absence check using state equation in 608 ms returned sat
[2023-03-19 12:29:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:29:13] [INFO ] [Nat]Absence check using 23 positive place invariants in 27 ms returned sat
[2023-03-19 12:29:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:29:14] [INFO ] [Nat]Absence check using state equation in 535 ms returned sat
[2023-03-19 12:29:14] [INFO ] [Nat]Added 497 Read/Feed constraints in 92 ms returned sat
[2023-03-19 12:29:14] [INFO ] Computed and/alt/rep : 1251/4787/1251 causal constraints (skipped 112 transitions) in 133 ms.
[2023-03-19 12:29:17] [INFO ] Deduced a trap composed of 14 places in 617 ms of which 1 ms to minimize.
[2023-03-19 12:29:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 826 ms
[2023-03-19 12:29:18] [INFO ] Added : 103 causal constraints over 22 iterations in 3903 ms. Result :sat
Minimization took 300 ms.
Current structural bounds on expressions (after SMT) : [8, 1, 1] Max seen :[1, 0, 0]
Support contains 10 out of 595 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 1707/1707 transitions.
Applied a total of 0 rules in 50 ms. Remains 595 /595 variables (removed 0) and now considering 1707/1707 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 595/595 places, 1707/1707 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 1707/1707 transitions.
Applied a total of 0 rules in 49 ms. Remains 595 /595 variables (removed 0) and now considering 1707/1707 (removed 0) transitions.
[2023-03-19 12:29:18] [INFO ] Flow matrix only has 1371 transitions (discarded 336 similar events)
[2023-03-19 12:29:18] [INFO ] Invariant cache hit.
[2023-03-19 12:29:19] [INFO ] Implicit Places using invariants in 1017 ms returned []
[2023-03-19 12:29:19] [INFO ] Flow matrix only has 1371 transitions (discarded 336 similar events)
[2023-03-19 12:29:19] [INFO ] Invariant cache hit.
[2023-03-19 12:29:20] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-19 12:29:26] [INFO ] Implicit Places using invariants and state equation in 6835 ms returned []
Implicit Place search using SMT with State Equation took 7860 ms to find 0 implicit places.
[2023-03-19 12:29:27] [INFO ] Redundant transitions in 297 ms returned []
[2023-03-19 12:29:27] [INFO ] Flow matrix only has 1371 transitions (discarded 336 similar events)
[2023-03-19 12:29:27] [INFO ] Invariant cache hit.
[2023-03-19 12:29:28] [INFO ] Dead Transitions using invariants and state equation in 1674 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9900 ms. Remains : 595/595 places, 1707/1707 transitions.
Starting property specific reduction for Peterson-PT-7-UpperBounds-00
Normalized transition count is 1371 out of 1707 initially.
// Phase 1: matrix 1371 rows 595 cols
[2023-03-19 12:29:28] [INFO ] Computed 23 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :1
[2023-03-19 12:29:28] [INFO ] Flow matrix only has 1371 transitions (discarded 336 similar events)
// Phase 1: matrix 1371 rows 595 cols
[2023-03-19 12:29:28] [INFO ] Computed 23 place invariants in 9 ms
[2023-03-19 12:29:29] [INFO ] [Real]Absence check using 23 positive place invariants in 28 ms returned sat
[2023-03-19 12:29:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:29:29] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2023-03-19 12:29:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:29:30] [INFO ] [Nat]Absence check using 23 positive place invariants in 26 ms returned sat
[2023-03-19 12:29:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:29:30] [INFO ] [Nat]Absence check using state equation in 486 ms returned sat
[2023-03-19 12:29:30] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-19 12:29:30] [INFO ] [Nat]Added 497 Read/Feed constraints in 222 ms returned sat
[2023-03-19 12:29:31] [INFO ] Deduced a trap composed of 15 places in 632 ms of which 1 ms to minimize.
[2023-03-19 12:29:31] [INFO ] Deduced a trap composed of 15 places in 483 ms of which 1 ms to minimize.
[2023-03-19 12:29:32] [INFO ] Deduced a trap composed of 39 places in 490 ms of which 1 ms to minimize.
[2023-03-19 12:29:33] [INFO ] Deduced a trap composed of 84 places in 500 ms of which 1 ms to minimize.
[2023-03-19 12:29:33] [INFO ] Deduced a trap composed of 14 places in 516 ms of which 1 ms to minimize.
[2023-03-19 12:29:34] [INFO ] Deduced a trap composed of 38 places in 401 ms of which 1 ms to minimize.
[2023-03-19 12:29:35] [INFO ] Deduced a trap composed of 47 places in 566 ms of which 1 ms to minimize.
[2023-03-19 12:29:35] [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) : [8] Max seen :[1]
Support contains 8 out of 595 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 1707/1707 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 595 transition count 1706
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 594 transition count 1706
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 594 transition count 1704
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 592 transition count 1704
Applied a total of 6 rules in 69 ms. Remains 592 /595 variables (removed 3) and now considering 1704/1707 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 592/595 places, 1704/1707 transitions.
Normalized transition count is 1368 out of 1704 initially.
// Phase 1: matrix 1368 rows 592 cols
[2023-03-19 12:29:35] [INFO ] Computed 23 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3065 ms. (steps per millisecond=326 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1054 ms. (steps per millisecond=948 ) properties (out of 1) seen :1
[2023-03-19 12:29:39] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2023-03-19 12:29:39] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-19 12:29:39] [INFO ] [Real]Absence check using 23 positive place invariants in 24 ms returned sat
[2023-03-19 12:29:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:29:39] [INFO ] [Real]Absence check using state equation in 479 ms returned sat
[2023-03-19 12:29:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:29:40] [INFO ] [Nat]Absence check using 23 positive place invariants in 31 ms returned sat
[2023-03-19 12:29:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:29:40] [INFO ] [Nat]Absence check using state equation in 600 ms returned sat
[2023-03-19 12:29:40] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-19 12:29:40] [INFO ] [Nat]Added 497 Read/Feed constraints in 178 ms returned sat
[2023-03-19 12:29:41] [INFO ] Deduced a trap composed of 29 places in 480 ms of which 1 ms to minimize.
[2023-03-19 12:29:42] [INFO ] Deduced a trap composed of 20 places in 639 ms of which 1 ms to minimize.
[2023-03-19 12:29:42] [INFO ] Deduced a trap composed of 47 places in 551 ms of which 1 ms to minimize.
[2023-03-19 12:29:43] [INFO ] Deduced a trap composed of 20 places in 604 ms of which 1 ms to minimize.
[2023-03-19 12:29:44] [INFO ] Deduced a trap composed of 16 places in 527 ms of which 1 ms to minimize.
[2023-03-19 12:29:44] [INFO ] Deduced a trap composed of 38 places in 575 ms of which 0 ms to minimize.
[2023-03-19 12:29:45] [INFO ] Deduced a trap composed of 11 places in 540 ms of which 1 ms to minimize.
[2023-03-19 12:29:45] [INFO ] Deduced a trap composed of 12 places in 412 ms of which 1 ms to minimize.
[2023-03-19 12:29:46] [INFO ] Deduced a trap composed of 56 places in 631 ms of which 2 ms to minimize.
[2023-03-19 12:29:47] [INFO ] Deduced a trap composed of 29 places in 632 ms of which 1 ms to minimize.
[2023-03-19 12:29:48] [INFO ] Deduced a trap composed of 81 places in 430 ms of which 1 ms to minimize.
[2023-03-19 12:29:48] [INFO ] Deduced a trap composed of 81 places in 470 ms of which 1 ms to minimize.
[2023-03-19 12:29:49] [INFO ] Deduced a trap composed of 38 places in 611 ms of which 1 ms to minimize.
[2023-03-19 12:29:50] [INFO ] Deduced a trap composed of 81 places in 652 ms of which 1 ms to minimize.
[2023-03-19 12:29:50] [INFO ] Deduced a trap composed of 38 places in 663 ms of which 5 ms to minimize.
[2023-03-19 12:29:51] [INFO ] Deduced a trap composed of 56 places in 621 ms of which 1 ms to minimize.
[2023-03-19 12:29:52] [INFO ] Deduced a trap composed of 21 places in 595 ms of which 2 ms to minimize.
[2023-03-19 12:29:55] [INFO ] Deduced a trap composed of 57 places in 443 ms of which 1 ms to minimize.
[2023-03-19 12:29:55] [INFO ] Deduced a trap composed of 39 places in 561 ms of which 0 ms to minimize.
[2023-03-19 12:29:57] [INFO ] Deduced a trap composed of 29 places in 519 ms of which 1 ms to minimize.
[2023-03-19 12:29:58] [INFO ] Deduced a trap composed of 43 places in 631 ms of which 2 ms to minimize.
[2023-03-19 12:29:58] [INFO ] Deduced a trap composed of 56 places in 608 ms of which 2 ms to minimize.
[2023-03-19 12:29:59] [INFO ] Deduced a trap composed of 52 places in 538 ms of which 1 ms to minimize.
[2023-03-19 12:29:59] [INFO ] Deduced a trap composed of 61 places in 555 ms of which 2 ms to minimize.
[2023-03-19 12:30:00] [INFO ] Deduced a trap composed of 70 places in 628 ms of which 2 ms to minimize.
[2023-03-19 12:30:01] [INFO ] Deduced a trap composed of 43 places in 633 ms of which 2 ms to minimize.
[2023-03-19 12:30:04] [INFO ] Trap strengthening (SAT) tested/added 26/26 trap constraints in 23390 ms
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 30 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 592/592 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 29 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-19 12:30:04] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2023-03-19 12:30:04] [INFO ] Invariant cache hit.
[2023-03-19 12:30:05] [INFO ] Implicit Places using invariants in 997 ms returned []
[2023-03-19 12:30:05] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2023-03-19 12:30:05] [INFO ] Invariant cache hit.
[2023-03-19 12:30:06] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-19 12:30:11] [INFO ] Implicit Places using invariants and state equation in 5964 ms returned []
Implicit Place search using SMT with State Equation took 6964 ms to find 0 implicit places.
[2023-03-19 12:30:11] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-19 12:30:11] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2023-03-19 12:30:11] [INFO ] Invariant cache hit.
[2023-03-19 12:30:13] [INFO ] Dead Transitions using invariants and state equation in 1692 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8756 ms. Remains : 592/592 places, 1704/1704 transitions.
Ending property specific reduction for Peterson-PT-7-UpperBounds-00 in 44329 ms.
Starting property specific reduction for Peterson-PT-7-UpperBounds-09
Normalized transition count is 1371 out of 1707 initially.
// Phase 1: matrix 1371 rows 595 cols
[2023-03-19 12:30:13] [INFO ] Computed 23 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-19 12:30:13] [INFO ] Flow matrix only has 1371 transitions (discarded 336 similar events)
// Phase 1: matrix 1371 rows 595 cols
[2023-03-19 12:30:13] [INFO ] Computed 23 place invariants in 6 ms
[2023-03-19 12:30:13] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2023-03-19 12:30:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:30:13] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2023-03-19 12:30:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:30:14] [INFO ] [Nat]Absence check using 23 positive place invariants in 32 ms returned sat
[2023-03-19 12:30:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:30:14] [INFO ] [Nat]Absence check using state equation in 563 ms returned sat
[2023-03-19 12:30:14] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-19 12:30:14] [INFO ] [Nat]Added 497 Read/Feed constraints in 108 ms returned sat
[2023-03-19 12:30:15] [INFO ] Computed and/alt/rep : 1251/4787/1251 causal constraints (skipped 112 transitions) in 123 ms.
[2023-03-19 12:30:18] [INFO ] Deduced a trap composed of 11 places in 720 ms of which 2 ms to minimize.
[2023-03-19 12:30:19] [INFO ] Deduced a trap composed of 15 places in 675 ms of which 1 ms to minimize.
[2023-03-19 12:30:19] [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 595 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 1706/1706 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 594 transition count 1704
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 593 transition count 1702
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 592 transition count 1700
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 591 transition count 1698
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 4 place count 591 transition count 1689
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 22 place count 582 transition count 1689
Applied a total of 22 rules in 90 ms. Remains 582 /595 variables (removed 13) and now considering 1689/1706 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 582/595 places, 1689/1706 transitions.
Normalized transition count is 1353 out of 1689 initially.
// Phase 1: matrix 1353 rows 582 cols
[2023-03-19 12:30:19] [INFO ] Computed 23 place invariants in 36 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3065 ms. (steps per millisecond=326 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 679 ms. (steps per millisecond=1472 ) properties (out of 1) seen :0
[2023-03-19 12:30:23] [INFO ] Flow matrix only has 1353 transitions (discarded 336 similar events)
// Phase 1: matrix 1353 rows 582 cols
[2023-03-19 12:30:23] [INFO ] Computed 23 place invariants in 9 ms
[2023-03-19 12:30:23] [INFO ] [Real]Absence check using 23 positive place invariants in 28 ms returned sat
[2023-03-19 12:30:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:30:24] [INFO ] [Real]Absence check using state equation in 569 ms returned sat
[2023-03-19 12:30:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:30:24] [INFO ] [Nat]Absence check using 23 positive place invariants in 31 ms returned sat
[2023-03-19 12:30:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:30:25] [INFO ] [Nat]Absence check using state equation in 586 ms returned sat
[2023-03-19 12:30:25] [INFO ] State equation strengthened by 493 read => feed constraints.
[2023-03-19 12:30:25] [INFO ] [Nat]Added 493 Read/Feed constraints in 88 ms returned sat
[2023-03-19 12:30:25] [INFO ] Computed and/alt/rep : 1233/4757/1233 causal constraints (skipped 112 transitions) in 142 ms.
[2023-03-19 12:30:28] [INFO ] Deduced a trap composed of 38 places in 654 ms of which 1 ms to minimize.
[2023-03-19 12:30:29] [INFO ] Deduced a trap composed of 56 places in 653 ms of which 2 ms to minimize.
[2023-03-19 12:30:30] [INFO ] Deduced a trap composed of 20 places in 647 ms of which 1 ms to minimize.
[2023-03-19 12:30:31] [INFO ] Deduced a trap composed of 20 places in 638 ms of which 1 ms to minimize.
[2023-03-19 12:30:32] [INFO ] Deduced a trap composed of 11 places in 559 ms of which 1 ms to minimize.
[2023-03-19 12:30:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3927 ms
[2023-03-19 12:30:32] [INFO ] Added : 120 causal constraints over 26 iterations in 7513 ms. Result :sat
Minimization took 474 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 1689/1689 transitions.
Applied a total of 0 rules in 46 ms. Remains 582 /582 variables (removed 0) and now considering 1689/1689 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 582/582 places, 1689/1689 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 1689/1689 transitions.
Applied a total of 0 rules in 44 ms. Remains 582 /582 variables (removed 0) and now considering 1689/1689 (removed 0) transitions.
[2023-03-19 12:30:33] [INFO ] Flow matrix only has 1353 transitions (discarded 336 similar events)
[2023-03-19 12:30:33] [INFO ] Invariant cache hit.
[2023-03-19 12:30:34] [INFO ] Implicit Places using invariants in 936 ms returned []
[2023-03-19 12:30:34] [INFO ] Flow matrix only has 1353 transitions (discarded 336 similar events)
[2023-03-19 12:30:34] [INFO ] Invariant cache hit.
[2023-03-19 12:30:35] [INFO ] State equation strengthened by 493 read => feed constraints.
[2023-03-19 12:30:40] [INFO ] Implicit Places using invariants and state equation in 5297 ms returned []
Implicit Place search using SMT with State Equation took 6238 ms to find 0 implicit places.
[2023-03-19 12:30:40] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-19 12:30:40] [INFO ] Flow matrix only has 1353 transitions (discarded 336 similar events)
[2023-03-19 12:30:40] [INFO ] Invariant cache hit.
[2023-03-19 12:30:41] [INFO ] Dead Transitions using invariants and state equation in 1796 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8133 ms. Remains : 582/582 places, 1689/1689 transitions.
Ending property specific reduction for Peterson-PT-7-UpperBounds-09 in 28813 ms.
Starting property specific reduction for Peterson-PT-7-UpperBounds-11
Normalized transition count is 1371 out of 1707 initially.
// Phase 1: matrix 1371 rows 595 cols
[2023-03-19 12:30:41] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) 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 12:30:42] [INFO ] Flow matrix only has 1371 transitions (discarded 336 similar events)
// Phase 1: matrix 1371 rows 595 cols
[2023-03-19 12:30:42] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-19 12:30:42] [INFO ] [Real]Absence check using 23 positive place invariants in 29 ms returned sat
[2023-03-19 12:30:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:30:42] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2023-03-19 12:30:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:30:43] [INFO ] [Nat]Absence check using 23 positive place invariants in 32 ms returned sat
[2023-03-19 12:30:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:30:43] [INFO ] [Nat]Absence check using state equation in 565 ms returned sat
[2023-03-19 12:30:43] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-19 12:30:43] [INFO ] [Nat]Added 497 Read/Feed constraints in 105 ms returned sat
[2023-03-19 12:30:44] [INFO ] Computed and/alt/rep : 1251/4787/1251 causal constraints (skipped 112 transitions) in 153 ms.
[2023-03-19 12:30:47] [INFO ] Deduced a trap composed of 14 places in 661 ms of which 3 ms to minimize.
[2023-03-19 12:30:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 882 ms
[2023-03-19 12:30:48] [INFO ] Deduced a trap composed of 2 places in 791 ms of which 1 ms to minimize.
[2023-03-19 12:30:48] [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 595 places. Attempting structural reductions.
Drop transitions removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 1705/1705 transitions.
Reduce places removed 1 places and 2 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 2 rules applied. Total rules applied 2 place count 594 transition count 1702
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 592 transition count 1700
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 4 place count 592 transition count 1691
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 22 place count 583 transition count 1691
Applied a total of 22 rules in 69 ms. Remains 583 /595 variables (removed 12) and now considering 1691/1705 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 583/595 places, 1691/1705 transitions.
Normalized transition count is 1355 out of 1691 initially.
// Phase 1: matrix 1355 rows 583 cols
[2023-03-19 12:30:48] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2820 ms. (steps per millisecond=354 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 874 ms. (steps per millisecond=1144 ) properties (out of 1) seen :0
[2023-03-19 12:30:52] [INFO ] Flow matrix only has 1355 transitions (discarded 336 similar events)
// Phase 1: matrix 1355 rows 583 cols
[2023-03-19 12:30:52] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-19 12:30:52] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2023-03-19 12:30:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:30:53] [INFO ] [Real]Absence check using state equation in 482 ms returned sat
[2023-03-19 12:30:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:30:53] [INFO ] [Nat]Absence check using 23 positive place invariants in 31 ms returned sat
[2023-03-19 12:30:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:30:54] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2023-03-19 12:30:54] [INFO ] State equation strengthened by 494 read => feed constraints.
[2023-03-19 12:30:54] [INFO ] [Nat]Added 494 Read/Feed constraints in 128 ms returned sat
[2023-03-19 12:30:54] [INFO ] Computed and/alt/rep : 1235/4760/1235 causal constraints (skipped 112 transitions) in 149 ms.
[2023-03-19 12:30:57] [INFO ] Deduced a trap composed of 11 places in 663 ms of which 1 ms to minimize.
[2023-03-19 12:30:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 874 ms
[2023-03-19 12:30:58] [INFO ] Added : 109 causal constraints over 23 iterations in 4173 ms. Result :sat
Minimization took 323 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 583 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 1691/1691 transitions.
Applied a total of 0 rules in 43 ms. Remains 583 /583 variables (removed 0) and now considering 1691/1691 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 583/583 places, 1691/1691 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 1691/1691 transitions.
Applied a total of 0 rules in 42 ms. Remains 583 /583 variables (removed 0) and now considering 1691/1691 (removed 0) transitions.
[2023-03-19 12:30:58] [INFO ] Flow matrix only has 1355 transitions (discarded 336 similar events)
[2023-03-19 12:30:58] [INFO ] Invariant cache hit.
[2023-03-19 12:30:59] [INFO ] Implicit Places using invariants in 1010 ms returned []
[2023-03-19 12:30:59] [INFO ] Flow matrix only has 1355 transitions (discarded 336 similar events)
[2023-03-19 12:30:59] [INFO ] Invariant cache hit.
[2023-03-19 12:31:00] [INFO ] State equation strengthened by 494 read => feed constraints.
[2023-03-19 12:31:05] [INFO ] Implicit Places using invariants and state equation in 5016 ms returned []
Implicit Place search using SMT with State Equation took 6052 ms to find 0 implicit places.
[2023-03-19 12:31:05] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-19 12:31:05] [INFO ] Flow matrix only has 1355 transitions (discarded 336 similar events)
[2023-03-19 12:31:05] [INFO ] Invariant cache hit.
[2023-03-19 12:31:07] [INFO ] Dead Transitions using invariants and state equation in 1998 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8158 ms. Remains : 583/583 places, 1691/1691 transitions.
Ending property specific reduction for Peterson-PT-7-UpperBounds-11 in 25113 ms.
[2023-03-19 12:31:07] [INFO ] Flatten gal took : 282 ms
[2023-03-19 12:31:07] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-19 12:31:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 595 places, 1707 transitions and 6790 arcs took 13 ms.
Total runtime 333794 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_7
(NrP: 595 NrTr: 1707 NrArc: 6790)

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

net check time: 0m 0.008sec

init dd package: 0m 3.528sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8347688 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16086636 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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.020sec

76359 100897 123490 334245 454362 498744 547854 563941 631633 697367 737498 773611 811005 813527 819942 791635 812462 839952 831122 854986 884357 932255 925899 971992 992082 990198 988573 978315 978299 970938 968320 989173 997793 1003610

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-7"
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-7, 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-167863541200645"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-7.tgz
mv Peterson-PT-7 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 ;