About the Execution of 2022-gold for Peterson-PT-7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16215.863 | 3600000.00 | 3174082.00 | 172807.20 | ? 7 7 7 8 7 8 8 1 ? 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r287-smll-167863553800081.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 gold2022
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 r287-smll-167863553800081
=====================================================================
--------------------
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 1678926028109
Running Version 202205111006
[2023-03-16 00:20:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 00:20:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 00:20:31] [INFO ] Load time of PNML (sax parser for PT used): 449 ms
[2023-03-16 00:20:31] [INFO ] Transformed 1992 places.
[2023-03-16 00:20:31] [INFO ] Transformed 3096 transitions.
[2023-03-16 00:20:31] [INFO ] Found NUPN structural information;
[2023-03-16 00:20:31] [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-16 00:20:31] [INFO ] Parsed PT model containing 1992 places and 3096 transitions in 714 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 241 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-16 00:20:32] [INFO ] Computed 31 place invariants in 70 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 275 ms. (steps per millisecond=36 ) 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 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 9) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 9) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :28
[2023-03-16 00:20:32] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-16 00:20:32] [INFO ] Computed 31 place invariants in 28 ms
[2023-03-16 00:20:33] [INFO ] [Real]Absence check using 23 positive place invariants in 73 ms returned sat
[2023-03-16 00:20:33] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-16 00:20:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:20:35] [INFO ] [Real]Absence check using state equation in 1993 ms returned sat
[2023-03-16 00:20:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:20:36] [INFO ] [Nat]Absence check using 23 positive place invariants in 88 ms returned sat
[2023-03-16 00:20:36] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-16 00:20:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:20:38] [INFO ] [Nat]Absence check using state equation in 1657 ms returned sat
[2023-03-16 00:20:38] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 00:20:39] [INFO ] [Nat]Added 497 Read/Feed constraints in 1175 ms returned sat
[2023-03-16 00:20:42] [INFO ] Deduced a trap composed of 13 places in 2753 ms of which 13 ms to minimize.
[2023-03-16 00:20:42] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 00:20:43] [INFO ] [Real]Absence check using 23 positive place invariants in 57 ms returned sat
[2023-03-16 00:20:43] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2023-03-16 00:20:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:20:45] [INFO ] [Real]Absence check using state equation in 1684 ms returned sat
[2023-03-16 00:20:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:20:46] [INFO ] [Nat]Absence check using 23 positive place invariants in 95 ms returned sat
[2023-03-16 00:20:46] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-16 00:20:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:20:47] [INFO ] [Nat]Absence check using state equation in 1654 ms returned sat
[2023-03-16 00:20:48] [INFO ] [Nat]Added 497 Read/Feed constraints in 727 ms returned sat
[2023-03-16 00:20:50] [INFO ] Deduced a trap composed of 13 places in 1951 ms of which 7 ms to minimize.
[2023-03-16 00:20:50] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 00:20:51] [INFO ] [Real]Absence check using 23 positive place invariants in 98 ms returned unsat
[2023-03-16 00:20:51] [INFO ] [Real]Absence check using 23 positive place invariants in 59 ms returned sat
[2023-03-16 00:20:51] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-16 00:20:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:20:53] [INFO ] [Real]Absence check using state equation in 1567 ms returned sat
[2023-03-16 00:20:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:20:54] [INFO ] [Nat]Absence check using 23 positive place invariants in 78 ms returned sat
[2023-03-16 00:20:54] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-16 00:20:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:20:56] [INFO ] [Nat]Absence check using state equation in 1603 ms returned sat
[2023-03-16 00:20:57] [INFO ] [Nat]Added 497 Read/Feed constraints in 1010 ms returned sat
[2023-03-16 00:20:59] [INFO ] Deduced a trap composed of 13 places in 2473 ms of which 10 ms to minimize.
[2023-03-16 00:20:59] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 00:21:00] [INFO ] [Real]Absence check using 23 positive place invariants in 83 ms returned unsat
[2023-03-16 00:21:01] [INFO ] [Real]Absence check using 23 positive place invariants in 91 ms returned unsat
[2023-03-16 00:21:01] [INFO ] [Real]Absence check using 23 positive place invariants in 88 ms returned sat
[2023-03-16 00:21:01] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-16 00:21:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:21:03] [INFO ] [Real]Absence check using state equation in 1547 ms returned sat
[2023-03-16 00:21:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:21:04] [INFO ] [Nat]Absence check using 23 positive place invariants in 57 ms returned sat
[2023-03-16 00:21:04] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-16 00:21:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:21:05] [INFO ] [Nat]Absence check using state equation in 1323 ms returned sat
[2023-03-16 00:21:05] [INFO ] [Nat]Added 497 Read/Feed constraints in 122 ms returned sat
[2023-03-16 00:21:06] [INFO ] Computed and/alt/rep : 2640/5840/2640 causal constraints (skipped 112 transitions) in 302 ms.
[2023-03-16 00:21:08] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 00:21:09] [INFO ] [Real]Absence check using 23 positive place invariants in 61 ms returned sat
[2023-03-16 00:21:09] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-16 00:21:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:21:10] [INFO ] [Real]Absence check using state equation in 1364 ms returned sat
[2023-03-16 00:21:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:21:11] [INFO ] [Nat]Absence check using 23 positive place invariants in 80 ms returned sat
[2023-03-16 00:21:11] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-16 00:21:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:21:13] [INFO ] [Nat]Absence check using state equation in 1426 ms returned sat
[2023-03-16 00:21:13] [INFO ] [Nat]Added 497 Read/Feed constraints in 167 ms returned sat
[2023-03-16 00:21:13] [INFO ] Computed and/alt/rep : 2640/5840/2640 causal constraints (skipped 112 transitions) in 373 ms.
[2023-03-16 00:21:15] [INFO ] Added : 21 causal constraints over 5 iterations in 2329 ms. Result :sat
Minimization took 190 ms.
[2023-03-16 00:21:16] [INFO ] [Real]Absence check using 23 positive place invariants in 89 ms returned sat
[2023-03-16 00:21:16] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 9 ms returned sat
[2023-03-16 00:21:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:21:18] [INFO ] [Real]Absence check using state equation in 1422 ms returned sat
[2023-03-16 00:21:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:21:18] [INFO ] [Nat]Absence check using 23 positive place invariants in 73 ms returned sat
[2023-03-16 00:21:18] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-16 00:21:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:21:20] [INFO ] [Nat]Absence check using state equation in 1405 ms returned sat
[2023-03-16 00:21:20] [INFO ] [Nat]Added 497 Read/Feed constraints in 140 ms returned sat
[2023-03-16 00:21:21] [INFO ] Computed and/alt/rep : 2640/5840/2640 causal constraints (skipped 112 transitions) in 322 ms.
[2023-03-16 00:21:23] [INFO ] Added : 35 causal constraints over 7 iterations in 2468 ms. Result :unknown
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 SAFETY 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 10 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 633 ms. Remains 709 /1992 variables (removed 1283) and now considering 1813/3096 (removed 1283) transitions.
Finished structural reductions, in 1 iterations. 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-16 00:21:23] [INFO ] Computed 31 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5240 ms. (steps per millisecond=190 ) properties (out of 6) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1201 ms. (steps per millisecond=832 ) properties (out of 6) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1898 ms. (steps per millisecond=526 ) properties (out of 6) seen :14
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1626 ms. (steps per millisecond=615 ) properties (out of 6) seen :14
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1132 ms. (steps per millisecond=883 ) properties (out of 6) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 992 ms. (steps per millisecond=1008 ) properties (out of 6) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1090 ms. (steps per millisecond=917 ) properties (out of 6) seen :9
[2023-03-16 00:21:37] [INFO ] Flow matrix only has 1477 transitions (discarded 336 similar events)
// Phase 1: matrix 1477 rows 709 cols
[2023-03-16 00:21:37] [INFO ] Computed 31 place invariants in 6 ms
[2023-03-16 00:21:37] [INFO ] [Real]Absence check using 23 positive place invariants in 21 ms returned sat
[2023-03-16 00:21:37] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-16 00:21:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:21:37] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2023-03-16 00:21:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:21:37] [INFO ] [Nat]Absence check using 23 positive place invariants in 23 ms returned sat
[2023-03-16 00:21:37] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-16 00:21:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:21:38] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2023-03-16 00:21:38] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 00:21:38] [INFO ] [Nat]Added 497 Read/Feed constraints in 135 ms returned sat
[2023-03-16 00:21:39] [INFO ] Deduced a trap composed of 15 places in 627 ms of which 3 ms to minimize.
[2023-03-16 00:21:40] [INFO ] Deduced a trap composed of 28 places in 763 ms of which 2 ms to minimize.
[2023-03-16 00:21:40] [INFO ] Deduced a trap composed of 39 places in 730 ms of which 1 ms to minimize.
[2023-03-16 00:21:41] [INFO ] Deduced a trap composed of 26 places in 786 ms of which 2 ms to minimize.
[2023-03-16 00:21:43] [INFO ] Deduced a trap composed of 35 places in 781 ms of which 1 ms to minimize.
[2023-03-16 00:21:43] [INFO ] Deduced a trap composed of 34 places in 769 ms of which 2 ms to minimize.
[2023-03-16 00:21:44] [INFO ] Deduced a trap composed of 13 places in 743 ms of which 2 ms to minimize.
[2023-03-16 00:21:45] [INFO ] Deduced a trap composed of 50 places in 740 ms of which 1 ms to minimize.
[2023-03-16 00:21:46] [INFO ] Deduced a trap composed of 35 places in 766 ms of which 1 ms to minimize.
[2023-03-16 00:21:47] [INFO ] Deduced a trap composed of 14 places in 750 ms of which 1 ms to minimize.
[2023-03-16 00:21:48] [INFO ] Deduced a trap composed of 14 places in 756 ms of which 1 ms to minimize.
[2023-03-16 00:21:49] [INFO ] Deduced a trap composed of 24 places in 721 ms of which 1 ms to minimize.
[2023-03-16 00:21:49] [INFO ] Deduced a trap composed of 46 places in 726 ms of which 2 ms to minimize.
[2023-03-16 00:21:50] [INFO ] Deduced a trap composed of 27 places in 724 ms of which 1 ms to minimize.
[2023-03-16 00:21:51] [INFO ] Deduced a trap composed of 23 places in 762 ms of which 2 ms to minimize.
[2023-03-16 00:21:52] [INFO ] Deduced a trap composed of 26 places in 732 ms of which 1 ms to minimize.
[2023-03-16 00:21:53] [INFO ] Deduced a trap composed of 47 places in 752 ms of which 1 ms to minimize.
[2023-03-16 00:21:54] [INFO ] Deduced a trap composed of 46 places in 749 ms of which 1 ms to minimize.
[2023-03-16 00:21:55] [INFO ] Deduced a trap composed of 58 places in 745 ms of which 2 ms to minimize.
[2023-03-16 00:21:56] [INFO ] Deduced a trap composed of 57 places in 709 ms of which 1 ms to minimize.
[2023-03-16 00:21:57] [INFO ] Deduced a trap composed of 58 places in 681 ms of which 2 ms to minimize.
[2023-03-16 00:21:57] [INFO ] Deduced a trap composed of 26 places in 710 ms of which 1 ms to minimize.
[2023-03-16 00:21:58] [INFO ] Deduced a trap composed of 25 places in 746 ms of which 1 ms to minimize.
[2023-03-16 00:22:01] [INFO ] Deduced a trap composed of 27 places in 583 ms of which 1 ms to minimize.
[2023-03-16 00:22:02] [INFO ] Deduced a trap composed of 83 places in 707 ms of which 2 ms to minimize.
[2023-03-16 00:22:03] [INFO ] Deduced a trap composed of 28 places in 757 ms of which 1 ms to minimize.
[2023-03-16 00:22:03] [INFO ] Deduced a trap composed of 27 places in 679 ms of which 2 ms to minimize.
[2023-03-16 00:22:04] [INFO ] Deduced a trap composed of 60 places in 743 ms of which 1 ms to minimize.
[2023-03-16 00:22:05] [INFO ] Deduced a trap composed of 61 places in 731 ms of which 2 ms to minimize.
[2023-03-16 00:22:06] [INFO ] Deduced a trap composed of 16 places in 735 ms of which 1 ms to minimize.
[2023-03-16 00:22:07] [INFO ] Deduced a trap composed of 17 places in 747 ms of which 4 ms to minimize.
[2023-03-16 00:22:08] [INFO ] Deduced a trap composed of 49 places in 702 ms of which 5 ms to minimize.
[2023-03-16 00:22:09] [INFO ] Deduced a trap composed of 49 places in 674 ms of which 1 ms to minimize.
[2023-03-16 00:22:09] [INFO ] Deduced a trap composed of 50 places in 671 ms of which 1 ms to minimize.
[2023-03-16 00:22:10] [INFO ] Deduced a trap composed of 15 places in 751 ms of which 2 ms to minimize.
[2023-03-16 00:22:11] [INFO ] Deduced a trap composed of 38 places in 769 ms of which 1 ms to minimize.
[2023-03-16 00:22:12] [INFO ] Deduced a trap composed of 13 places in 657 ms of which 1 ms to minimize.
[2023-03-16 00:22:13] [INFO ] Deduced a trap composed of 24 places in 736 ms of which 1 ms to minimize.
[2023-03-16 00:22:14] [INFO ] Deduced a trap composed of 46 places in 678 ms of which 1 ms to minimize.
[2023-03-16 00:22:14] [INFO ] Deduced a trap composed of 35 places in 720 ms of which 1 ms to minimize.
[2023-03-16 00:22:15] [INFO ] Deduced a trap composed of 42 places in 727 ms of which 1 ms to minimize.
[2023-03-16 00:22:18] [INFO ] Deduced a trap composed of 49 places in 541 ms of which 2 ms to minimize.
[2023-03-16 00:22:21] [INFO ] Trap strengthening (SAT) tested/added 42/42 trap constraints in 43114 ms
[2023-03-16 00:22:21] [INFO ] [Real]Absence check using 23 positive place invariants in 35 ms returned sat
[2023-03-16 00:22:21] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-16 00:22:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:22:22] [INFO ] [Real]Absence check using state equation in 711 ms returned sat
[2023-03-16 00:22:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:22:23] [INFO ] [Nat]Absence check using 23 positive place invariants in 35 ms returned sat
[2023-03-16 00:22:23] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 10 ms returned sat
[2023-03-16 00:22:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:22:23] [INFO ] [Nat]Absence check using state equation in 721 ms returned sat
[2023-03-16 00:22:23] [INFO ] [Nat]Added 497 Read/Feed constraints in 177 ms returned sat
[2023-03-16 00:22:24] [INFO ] Deduced a trap composed of 12 places in 746 ms of which 2 ms to minimize.
[2023-03-16 00:22:25] [INFO ] Deduced a trap composed of 13 places in 782 ms of which 1 ms to minimize.
[2023-03-16 00:22:26] [INFO ] Deduced a trap composed of 14 places in 813 ms of which 1 ms to minimize.
[2023-03-16 00:22:27] [INFO ] Deduced a trap composed of 17 places in 748 ms of which 1 ms to minimize.
[2023-03-16 00:22:28] [INFO ] Deduced a trap composed of 13 places in 820 ms of which 2 ms to minimize.
[2023-03-16 00:22:29] [INFO ] Deduced a trap composed of 13 places in 815 ms of which 2 ms to minimize.
[2023-03-16 00:22:29] [INFO ] Deduced a trap composed of 15 places in 756 ms of which 2 ms to minimize.
[2023-03-16 00:22:30] [INFO ] Deduced a trap composed of 12 places in 788 ms of which 2 ms to minimize.
[2023-03-16 00:22:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 6883 ms
[2023-03-16 00:22:31] [INFO ] [Real]Absence check using 23 positive place invariants in 35 ms returned sat
[2023-03-16 00:22:31] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-16 00:22:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:22:31] [INFO ] [Real]Absence check using state equation in 682 ms returned sat
[2023-03-16 00:22:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:22:32] [INFO ] [Nat]Absence check using 23 positive place invariants in 33 ms returned sat
[2023-03-16 00:22:32] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-16 00:22:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:22:32] [INFO ] [Nat]Absence check using state equation in 659 ms returned sat
[2023-03-16 00:22:32] [INFO ] [Nat]Added 497 Read/Feed constraints in 159 ms returned sat
[2023-03-16 00:22:33] [INFO ] Deduced a trap composed of 12 places in 874 ms of which 1 ms to minimize.
[2023-03-16 00:22:34] [INFO ] Deduced a trap composed of 13 places in 817 ms of which 2 ms to minimize.
[2023-03-16 00:22:35] [INFO ] Deduced a trap composed of 14 places in 805 ms of which 1 ms to minimize.
[2023-03-16 00:22:36] [INFO ] Deduced a trap composed of 17 places in 821 ms of which 4 ms to minimize.
[2023-03-16 00:22:37] [INFO ] Deduced a trap composed of 13 places in 776 ms of which 1 ms to minimize.
[2023-03-16 00:22:38] [INFO ] Deduced a trap composed of 13 places in 823 ms of which 1 ms to minimize.
[2023-03-16 00:22:39] [INFO ] Deduced a trap composed of 15 places in 845 ms of which 1 ms to minimize.
[2023-03-16 00:22:40] [INFO ] Deduced a trap composed of 12 places in 818 ms of which 1 ms to minimize.
[2023-03-16 00:22:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 7187 ms
[2023-03-16 00:22:40] [INFO ] [Real]Absence check using 23 positive place invariants in 33 ms returned sat
[2023-03-16 00:22:40] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-16 00:22:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:22:41] [INFO ] [Real]Absence check using state equation in 681 ms returned sat
[2023-03-16 00:22:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:22:41] [INFO ] [Nat]Absence check using 23 positive place invariants in 37 ms returned sat
[2023-03-16 00:22:41] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-16 00:22:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:22:42] [INFO ] [Nat]Absence check using state equation in 652 ms returned sat
[2023-03-16 00:22:42] [INFO ] [Nat]Added 497 Read/Feed constraints in 92 ms returned sat
[2023-03-16 00:22:42] [INFO ] Computed and/alt/rep : 1357/4557/1357 causal constraints (skipped 112 transitions) in 179 ms.
[2023-03-16 00:22:46] [INFO ] Deduced a trap composed of 15 places in 718 ms of which 1 ms to minimize.
[2023-03-16 00:22:47] [INFO ] Deduced a trap composed of 12 places in 726 ms of which 1 ms to minimize.
[2023-03-16 00:22:48] [INFO ] Deduced a trap composed of 12 places in 740 ms of which 1 ms to minimize.
[2023-03-16 00:22:48] [INFO ] Deduced a trap composed of 26 places in 684 ms of which 1 ms to minimize.
[2023-03-16 00:22:49] [INFO ] Deduced a trap composed of 23 places in 608 ms of which 1 ms to minimize.
[2023-03-16 00:22:50] [INFO ] Deduced a trap composed of 23 places in 751 ms of which 4 ms to minimize.
[2023-03-16 00:22:51] [INFO ] Deduced a trap composed of 22 places in 768 ms of which 2 ms to minimize.
[2023-03-16 00:22:52] [INFO ] Deduced a trap composed of 45 places in 674 ms of which 1 ms to minimize.
[2023-03-16 00:22:53] [INFO ] Deduced a trap composed of 34 places in 636 ms of which 2 ms to minimize.
[2023-03-16 00:22:54] [INFO ] Deduced a trap composed of 44 places in 639 ms of which 2 ms to minimize.
[2023-03-16 00:22:54] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 9014 ms
[2023-03-16 00:22:56] [INFO ] Added : 149 causal constraints over 30 iterations in 14174 ms. Result :sat
Minimization took 610 ms.
[2023-03-16 00:22:57] [INFO ] [Real]Absence check using 23 positive place invariants in 34 ms returned sat
[2023-03-16 00:22:57] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-16 00:22:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:22:58] [INFO ] [Real]Absence check using state equation in 585 ms returned sat
[2023-03-16 00:22:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:22:58] [INFO ] [Nat]Absence check using 23 positive place invariants in 22 ms returned sat
[2023-03-16 00:22:58] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-16 00:22:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:22:58] [INFO ] [Nat]Absence check using state equation in 628 ms returned sat
[2023-03-16 00:22:58] [INFO ] [Nat]Added 497 Read/Feed constraints in 60 ms returned sat
[2023-03-16 00:22:59] [INFO ] Computed and/alt/rep : 1357/4557/1357 causal constraints (skipped 112 transitions) in 102 ms.
[2023-03-16 00:22:59] [INFO ] Added : 6 causal constraints over 2 iterations in 369 ms. Result :sat
Minimization took 237 ms.
[2023-03-16 00:22:59] [INFO ] [Real]Absence check using 23 positive place invariants in 35 ms returned sat
[2023-03-16 00:22:59] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-16 00:22:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:23:00] [INFO ] [Real]Absence check using state equation in 707 ms returned sat
[2023-03-16 00:23:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:23:01] [INFO ] [Nat]Absence check using 23 positive place invariants in 36 ms returned sat
[2023-03-16 00:23:01] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-16 00:23:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:23:01] [INFO ] [Nat]Absence check using state equation in 706 ms returned sat
[2023-03-16 00:23:01] [INFO ] [Nat]Added 497 Read/Feed constraints in 99 ms returned sat
[2023-03-16 00:23:02] [INFO ] Computed and/alt/rep : 1357/4557/1357 causal constraints (skipped 112 transitions) in 103 ms.
[2023-03-16 00:23:02] [INFO ] Added : 20 causal constraints over 4 iterations in 655 ms. Result :sat
Minimization took 296 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 SAFETY 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 3 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 5 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 266 ms. Remains 603 /709 variables (removed 106) and now considering 1707/1813 (removed 106) transitions.
Finished structural reductions, in 1 iterations. 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-16 00:23:04] [INFO ] Computed 31 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3472 ms. (steps per millisecond=288 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1284 ms. (steps per millisecond=778 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 713 ms. (steps per millisecond=1402 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 718 ms. (steps per millisecond=1392 ) properties (out of 3) seen :1
[2023-03-16 00:23:10] [INFO ] Flow matrix only has 1371 transitions (discarded 336 similar events)
// Phase 1: matrix 1371 rows 603 cols
[2023-03-16 00:23:10] [INFO ] Computed 31 place invariants in 5 ms
[2023-03-16 00:23:10] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2023-03-16 00:23:10] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-16 00:23:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:23:11] [INFO ] [Real]Absence check using state equation in 596 ms returned sat
[2023-03-16 00:23:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:23:11] [INFO ] [Nat]Absence check using 23 positive place invariants in 34 ms returned sat
[2023-03-16 00:23:11] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-16 00:23:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:23:12] [INFO ] [Nat]Absence check using state equation in 633 ms returned sat
[2023-03-16 00:23:12] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 00:23:12] [INFO ] [Nat]Added 497 Read/Feed constraints in 264 ms returned sat
[2023-03-16 00:23:13] [INFO ] Deduced a trap composed of 15 places in 669 ms of which 1 ms to minimize.
[2023-03-16 00:23:13] [INFO ] Deduced a trap composed of 24 places in 644 ms of which 1 ms to minimize.
[2023-03-16 00:23:14] [INFO ] Deduced a trap composed of 24 places in 656 ms of which 1 ms to minimize.
[2023-03-16 00:23:15] [INFO ] Deduced a trap composed of 24 places in 671 ms of which 1 ms to minimize.
[2023-03-16 00:23:16] [INFO ] Deduced a trap composed of 14 places in 697 ms of which 1 ms to minimize.
[2023-03-16 00:23:17] [INFO ] Deduced a trap composed of 13 places in 673 ms of which 1 ms to minimize.
[2023-03-16 00:23:17] [INFO ] Deduced a trap composed of 14 places in 685 ms of which 1 ms to minimize.
[2023-03-16 00:23:18] [INFO ] Deduced a trap composed of 22 places in 604 ms of which 1 ms to minimize.
[2023-03-16 00:23:19] [INFO ] Deduced a trap composed of 41 places in 628 ms of which 1 ms to minimize.
[2023-03-16 00:23:20] [INFO ] Deduced a trap composed of 56 places in 648 ms of which 1 ms to minimize.
[2023-03-16 00:23:20] [INFO ] Deduced a trap composed of 40 places in 633 ms of which 2 ms to minimize.
[2023-03-16 00:23:21] [INFO ] Deduced a trap composed of 23 places in 619 ms of which 1 ms to minimize.
[2023-03-16 00:23:22] [INFO ] Deduced a trap composed of 23 places in 635 ms of which 2 ms to minimize.
[2023-03-16 00:23:23] [INFO ] Deduced a trap composed of 24 places in 362 ms of which 0 ms to minimize.
[2023-03-16 00:23:24] [INFO ] Deduced a trap composed of 23 places in 554 ms of which 1 ms to minimize.
[2023-03-16 00:23:25] [INFO ] Deduced a trap composed of 32 places in 665 ms of which 1 ms to minimize.
[2023-03-16 00:23:26] [INFO ] Deduced a trap composed of 14 places in 625 ms of which 1 ms to minimize.
[2023-03-16 00:23:27] [INFO ] Deduced a trap composed of 41 places in 622 ms of which 1 ms to minimize.
[2023-03-16 00:23:27] [INFO ] Deduced a trap composed of 23 places in 649 ms of which 1 ms to minimize.
[2023-03-16 00:23:28] [INFO ] Deduced a trap composed of 11 places in 587 ms of which 1 ms to minimize.
[2023-03-16 00:23:29] [INFO ] Deduced a trap composed of 20 places in 643 ms of which 1 ms to minimize.
[2023-03-16 00:23:30] [INFO ] Deduced a trap composed of 20 places in 627 ms of which 1 ms to minimize.
[2023-03-16 00:23:31] [INFO ] Deduced a trap composed of 42 places in 559 ms of which 1 ms to minimize.
[2023-03-16 00:23:32] [INFO ] Deduced a trap composed of 56 places in 583 ms of which 1 ms to minimize.
[2023-03-16 00:23:32] [INFO ] Deduced a trap composed of 47 places in 593 ms of which 2 ms to minimize.
[2023-03-16 00:23:33] [INFO ] Deduced a trap composed of 38 places in 579 ms of which 1 ms to minimize.
[2023-03-16 00:23:34] [INFO ] Deduced a trap composed of 51 places in 562 ms of which 1 ms to minimize.
[2023-03-16 00:23:34] [INFO ] Deduced a trap composed of 69 places in 613 ms of which 1 ms to minimize.
[2023-03-16 00:23:35] [INFO ] Deduced a trap composed of 50 places in 615 ms of which 1 ms to minimize.
[2023-03-16 00:23:36] [INFO ] Deduced a trap composed of 42 places in 582 ms of which 1 ms to minimize.
[2023-03-16 00:23:36] [INFO ] Deduced a trap composed of 56 places in 596 ms of which 1 ms to minimize.
[2023-03-16 00:23:37] [INFO ] Deduced a trap composed of 42 places in 589 ms of which 1 ms to minimize.
[2023-03-16 00:23:38] [INFO ] Deduced a trap composed of 62 places in 587 ms of which 1 ms to minimize.
[2023-03-16 00:23:38] [INFO ] Deduced a trap composed of 33 places in 608 ms of which 1 ms to minimize.
[2023-03-16 00:23:39] [INFO ] Deduced a trap composed of 59 places in 581 ms of which 1 ms to minimize.
[2023-03-16 00:23:40] [INFO ] Deduced a trap composed of 29 places in 604 ms of which 1 ms to minimize.
[2023-03-16 00:23:40] [INFO ] Deduced a trap composed of 38 places in 610 ms of which 1 ms to minimize.
[2023-03-16 00:23:43] [INFO ] Trap strengthening (SAT) tested/added 37/37 trap constraints in 31482 ms
[2023-03-16 00:23:44] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2023-03-16 00:23:44] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-16 00:23:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:23:44] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2023-03-16 00:23:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:23:44] [INFO ] [Nat]Absence check using 23 positive place invariants in 20 ms returned sat
[2023-03-16 00:23:44] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-16 00:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:23:45] [INFO ] [Nat]Absence check using state equation in 493 ms returned sat
[2023-03-16 00:23:45] [INFO ] [Nat]Added 497 Read/Feed constraints in 149 ms returned sat
[2023-03-16 00:23:45] [INFO ] Computed and/alt/rep : 1251/4787/1251 causal constraints (skipped 112 transitions) in 164 ms.
[2023-03-16 00:23:49] [INFO ] Deduced a trap composed of 24 places in 539 ms of which 1 ms to minimize.
[2023-03-16 00:23:50] [INFO ] Deduced a trap composed of 15 places in 678 ms of which 2 ms to minimize.
[2023-03-16 00:23:51] [INFO ] Deduced a trap composed of 12 places in 606 ms of which 2 ms to minimize.
[2023-03-16 00:23:52] [INFO ] Deduced a trap composed of 24 places in 686 ms of which 2 ms to minimize.
[2023-03-16 00:23:52] [INFO ] Deduced a trap composed of 12 places in 677 ms of which 1 ms to minimize.
[2023-03-16 00:23:53] [INFO ] Deduced a trap composed of 12 places in 646 ms of which 1 ms to minimize.
[2023-03-16 00:23:54] [INFO ] Deduced a trap composed of 35 places in 642 ms of which 1 ms to minimize.
[2023-03-16 00:23:55] [INFO ] Deduced a trap composed of 39 places in 674 ms of which 2 ms to minimize.
[2023-03-16 00:23:56] [INFO ] Deduced a trap composed of 21 places in 620 ms of which 1 ms to minimize.
[2023-03-16 00:23:56] [INFO ] Deduced a trap composed of 20 places in 643 ms of which 1 ms to minimize.
[2023-03-16 00:23:57] [INFO ] Deduced a trap composed of 21 places in 615 ms of which 1 ms to minimize.
[2023-03-16 00:23:58] [INFO ] Deduced a trap composed of 48 places in 574 ms of which 1 ms to minimize.
[2023-03-16 00:23:59] [INFO ] Deduced a trap composed of 39 places in 509 ms of which 1 ms to minimize.
[2023-03-16 00:23:59] [INFO ] Deduced a trap composed of 38 places in 537 ms of which 2 ms to minimize.
[2023-03-16 00:24:00] [INFO ] Deduced a trap composed of 44 places in 575 ms of which 2 ms to minimize.
[2023-03-16 00:24:01] [INFO ] Deduced a trap composed of 41 places in 548 ms of which 1 ms to minimize.
[2023-03-16 00:24:02] [INFO ] Deduced a trap composed of 30 places in 512 ms of which 1 ms to minimize.
[2023-03-16 00:24:02] [INFO ] Deduced a trap composed of 29 places in 526 ms of which 1 ms to minimize.
[2023-03-16 00:24:02] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 13811 ms
[2023-03-16 00:24:03] [INFO ] Added : 145 causal constraints over 30 iterations in 18403 ms. Result :sat
Minimization took 388 ms.
[2023-03-16 00:24:04] [INFO ] [Real]Absence check using 23 positive place invariants in 31 ms returned sat
[2023-03-16 00:24:04] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-16 00:24:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:24:05] [INFO ] [Real]Absence check using state equation in 615 ms returned sat
[2023-03-16 00:24:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:24:05] [INFO ] [Nat]Absence check using 23 positive place invariants in 31 ms returned sat
[2023-03-16 00:24:05] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-16 00:24:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:24:06] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2023-03-16 00:24:06] [INFO ] [Nat]Added 497 Read/Feed constraints in 123 ms returned sat
[2023-03-16 00:24:06] [INFO ] Computed and/alt/rep : 1251/4787/1251 causal constraints (skipped 112 transitions) in 146 ms.
[2023-03-16 00:24:10] [INFO ] Deduced a trap composed of 15 places in 637 ms of which 1 ms to minimize.
[2023-03-16 00:24:10] [INFO ] Deduced a trap composed of 13 places in 679 ms of which 1 ms to minimize.
[2023-03-16 00:24:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1653 ms
[2023-03-16 00:24:11] [INFO ] Added : 106 causal constraints over 23 iterations in 5091 ms. Result :sat
Minimization took 374 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 SAFETY mode, iteration 0 : 603/603 places, 1707/1707 transitions.
Applied a total of 0 rules in 96 ms. Remains 603 /603 variables (removed 0) and now considering 1707/1707 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 603/603 places, 1707/1707 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 603/603 places, 1707/1707 transitions.
Applied a total of 0 rules in 71 ms. Remains 603 /603 variables (removed 0) and now considering 1707/1707 (removed 0) transitions.
[2023-03-16 00:24:12] [INFO ] Flow matrix only has 1371 transitions (discarded 336 similar events)
// Phase 1: matrix 1371 rows 603 cols
[2023-03-16 00:24:12] [INFO ] Computed 31 place invariants in 4 ms
[2023-03-16 00:24:13] [INFO ] Implicit Places using invariants in 936 ms returned [587, 588, 589, 590, 591, 600, 601, 602]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 942 ms to find 8 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 595/603 places, 1707/1707 transitions.
Applied a total of 0 rules in 57 ms. Remains 595 /595 variables (removed 0) and now considering 1707/1707 (removed 0) transitions.
Finished structural reductions, in 2 iterations. 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-16 00:24:13] [INFO ] Computed 23 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2848 ms. (steps per millisecond=351 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 812 ms. (steps per millisecond=1231 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 697 ms. (steps per millisecond=1434 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 697 ms. (steps per millisecond=1434 ) properties (out of 3) seen :1
[2023-03-16 00:24:18] [INFO ] Flow matrix only has 1371 transitions (discarded 336 similar events)
// Phase 1: matrix 1371 rows 595 cols
[2023-03-16 00:24:18] [INFO ] Computed 23 place invariants in 11 ms
[2023-03-16 00:24:18] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2023-03-16 00:24:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:24:19] [INFO ] [Real]Absence check using state equation in 488 ms returned sat
[2023-03-16 00:24:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:24:19] [INFO ] [Nat]Absence check using 23 positive place invariants in 31 ms returned sat
[2023-03-16 00:24:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:24:19] [INFO ] [Nat]Absence check using state equation in 539 ms returned sat
[2023-03-16 00:24:20] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 00:24:20] [INFO ] [Nat]Added 497 Read/Feed constraints in 187 ms returned sat
[2023-03-16 00:24:20] [INFO ] Deduced a trap composed of 15 places in 676 ms of which 2 ms to minimize.
[2023-03-16 00:24:21] [INFO ] Deduced a trap composed of 15 places in 658 ms of which 2 ms to minimize.
[2023-03-16 00:24:22] [INFO ] Deduced a trap composed of 39 places in 673 ms of which 2 ms to minimize.
[2023-03-16 00:24:23] [INFO ] Deduced a trap composed of 84 places in 680 ms of which 2 ms to minimize.
[2023-03-16 00:24:23] [INFO ] Deduced a trap composed of 14 places in 646 ms of which 1 ms to minimize.
[2023-03-16 00:24:24] [INFO ] Deduced a trap composed of 38 places in 688 ms of which 1 ms to minimize.
[2023-03-16 00:24:25] [INFO ] Deduced a trap composed of 47 places in 669 ms of which 1 ms to minimize.
[2023-03-16 00:24:26] [INFO ] Deduced a trap composed of 41 places in 676 ms of which 1 ms to minimize.
[2023-03-16 00:24:27] [INFO ] Deduced a trap composed of 29 places in 657 ms of which 1 ms to minimize.
[2023-03-16 00:24:27] [INFO ] Deduced a trap composed of 24 places in 656 ms of which 1 ms to minimize.
[2023-03-16 00:24:28] [INFO ] Deduced a trap composed of 23 places in 643 ms of which 1 ms to minimize.
[2023-03-16 00:24:29] [INFO ] Deduced a trap composed of 32 places in 659 ms of which 1 ms to minimize.
[2023-03-16 00:24:30] [INFO ] Deduced a trap composed of 20 places in 673 ms of which 1 ms to minimize.
[2023-03-16 00:24:31] [INFO ] Deduced a trap composed of 24 places in 605 ms of which 1 ms to minimize.
[2023-03-16 00:24:32] [INFO ] Deduced a trap composed of 50 places in 674 ms of which 2 ms to minimize.
[2023-03-16 00:24:33] [INFO ] Deduced a trap composed of 11 places in 641 ms of which 1 ms to minimize.
[2023-03-16 00:24:33] [INFO ] Deduced a trap composed of 38 places in 564 ms of which 1 ms to minimize.
[2023-03-16 00:24:34] [INFO ] Deduced a trap composed of 24 places in 528 ms of which 1 ms to minimize.
[2023-03-16 00:24:35] [INFO ] Deduced a trap composed of 29 places in 612 ms of which 1 ms to minimize.
[2023-03-16 00:24:35] [INFO ] Deduced a trap composed of 56 places in 622 ms of which 1 ms to minimize.
[2023-03-16 00:24:36] [INFO ] Deduced a trap composed of 20 places in 636 ms of which 1 ms to minimize.
[2023-03-16 00:24:39] [INFO ] Trap strengthening (SAT) tested/added 21/21 trap constraints in 19391 ms
[2023-03-16 00:24:39] [INFO ] [Real]Absence check using 23 positive place invariants in 29 ms returned sat
[2023-03-16 00:24:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:24:40] [INFO ] [Real]Absence check using state equation in 599 ms returned sat
[2023-03-16 00:24:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:24:40] [INFO ] [Nat]Absence check using 23 positive place invariants in 33 ms returned sat
[2023-03-16 00:24:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:24:41] [INFO ] [Nat]Absence check using state equation in 624 ms returned sat
[2023-03-16 00:24:41] [INFO ] [Nat]Added 497 Read/Feed constraints in 104 ms returned sat
[2023-03-16 00:24:41] [INFO ] Computed and/alt/rep : 1251/4787/1251 causal constraints (skipped 112 transitions) in 145 ms.
[2023-03-16 00:24:45] [INFO ] Deduced a trap composed of 11 places in 669 ms of which 1 ms to minimize.
[2023-03-16 00:24:46] [INFO ] Deduced a trap composed of 34 places in 674 ms of which 1 ms to minimize.
[2023-03-16 00:24:46] [INFO ] Deduced a trap composed of 11 places in 684 ms of which 1 ms to minimize.
[2023-03-16 00:24:47] [INFO ] Deduced a trap composed of 38 places in 672 ms of which 1 ms to minimize.
[2023-03-16 00:24:48] [INFO ] Deduced a trap composed of 11 places in 632 ms of which 1 ms to minimize.
[2023-03-16 00:24:49] [INFO ] Deduced a trap composed of 29 places in 628 ms of which 1 ms to minimize.
[2023-03-16 00:24:50] [INFO ] Deduced a trap composed of 43 places in 616 ms of which 1 ms to minimize.
[2023-03-16 00:24:50] [INFO ] Deduced a trap composed of 24 places in 593 ms of which 1 ms to minimize.
[2023-03-16 00:24:51] [INFO ] Deduced a trap composed of 48 places in 606 ms of which 1 ms to minimize.
[2023-03-16 00:24:51] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 7106 ms
[2023-03-16 00:24:52] [INFO ] Added : 142 causal constraints over 29 iterations in 11276 ms. Result :sat
Minimization took 413 ms.
[2023-03-16 00:24:53] [INFO ] [Real]Absence check using 23 positive place invariants in 29 ms returned sat
[2023-03-16 00:24:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:24:54] [INFO ] [Real]Absence check using state equation in 545 ms returned sat
[2023-03-16 00:24:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:24:54] [INFO ] [Nat]Absence check using 23 positive place invariants in 30 ms returned sat
[2023-03-16 00:24:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:24:54] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2023-03-16 00:24:55] [INFO ] [Nat]Added 497 Read/Feed constraints in 64 ms returned sat
[2023-03-16 00:24:55] [INFO ] Computed and/alt/rep : 1251/4787/1251 causal constraints (skipped 112 transitions) in 94 ms.
[2023-03-16 00:25:02] [INFO ] Deduced a trap composed of 22 places in 666 ms of which 1 ms to minimize.
[2023-03-16 00:25:03] [INFO ] Deduced a trap composed of 14 places in 657 ms of which 2 ms to minimize.
[2023-03-16 00:25:04] [INFO ] Deduced a trap composed of 62 places in 671 ms of which 1 ms to minimize.
[2023-03-16 00:25:05] [INFO ] Deduced a trap composed of 71 places in 703 ms of which 1 ms to minimize.
[2023-03-16 00:25:05] [INFO ] Deduced a trap composed of 21 places in 678 ms of which 1 ms to minimize.
[2023-03-16 00:25:06] [INFO ] Deduced a trap composed of 24 places in 648 ms of which 1 ms to minimize.
[2023-03-16 00:25:07] [INFO ] Deduced a trap composed of 14 places in 577 ms of which 1 ms to minimize.
[2023-03-16 00:25:08] [INFO ] Deduced a trap composed of 30 places in 662 ms of which 1 ms to minimize.
[2023-03-16 00:25:09] [INFO ] Deduced a trap composed of 12 places in 646 ms of which 1 ms to minimize.
[2023-03-16 00:25:09] [INFO ] Deduced a trap composed of 12 places in 665 ms of which 2 ms to minimize.
[2023-03-16 00:25:10] [INFO ] Deduced a trap composed of 39 places in 615 ms of which 2 ms to minimize.
[2023-03-16 00:25:11] [INFO ] Deduced a trap composed of 31 places in 627 ms of which 1 ms to minimize.
[2023-03-16 00:25:12] [INFO ] Deduced a trap composed of 36 places in 566 ms of which 1 ms to minimize.
[2023-03-16 00:25:12] [INFO ] Deduced a trap composed of 30 places in 608 ms of which 1 ms to minimize.
[2023-03-16 00:25:13] [INFO ] Deduced a trap composed of 11 places in 702 ms of which 1 ms to minimize.
[2023-03-16 00:25:14] [INFO ] Deduced a trap composed of 57 places in 543 ms of which 1 ms to minimize.
[2023-03-16 00:25:15] [INFO ] Deduced a trap composed of 21 places in 574 ms of which 1 ms to minimize.
[2023-03-16 00:25:16] [INFO ] Deduced a trap composed of 22 places in 626 ms of which 1 ms to minimize.
[2023-03-16 00:25:16] [INFO ] Deduced a trap composed of 31 places in 586 ms of which 1 ms to minimize.
[2023-03-16 00:25:17] [INFO ] Deduced a trap composed of 40 places in 536 ms of which 1 ms to minimize.
[2023-03-16 00:25:18] [INFO ] Deduced a trap composed of 40 places in 587 ms of which 1 ms to minimize.
[2023-03-16 00:25:18] [INFO ] Deduced a trap composed of 31 places in 594 ms of which 1 ms to minimize.
[2023-03-16 00:25:19] [INFO ] Deduced a trap composed of 81 places in 586 ms of which 1 ms to minimize.
[2023-03-16 00:25:20] [INFO ] Deduced a trap composed of 46 places in 592 ms of which 1 ms to minimize.
[2023-03-16 00:25:21] [INFO ] Deduced a trap composed of 23 places in 586 ms of which 1 ms to minimize.
[2023-03-16 00:25:22] [INFO ] Deduced a trap composed of 31 places in 711 ms of which 1 ms to minimize.
[2023-03-16 00:25:22] [INFO ] Deduced a trap composed of 40 places in 687 ms of which 1 ms to minimize.
[2023-03-16 00:25:23] [INFO ] Deduced a trap composed of 28 places in 675 ms of which 1 ms to minimize.
[2023-03-16 00:25:24] [INFO ] Deduced a trap composed of 61 places in 679 ms of which 1 ms to minimize.
[2023-03-16 00:25:24] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 22721 ms
[2023-03-16 00:25:24] [INFO ] Added : 258 causal constraints over 53 iterations in 29897 ms.(timeout) Result :sat
Minimization took 615 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 SAFETY mode, iteration 0 : 595/595 places, 1707/1707 transitions.
Applied a total of 0 rules in 52 ms. Remains 595 /595 variables (removed 0) and now considering 1707/1707 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 595/595 places, 1707/1707 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 595/595 places, 1707/1707 transitions.
Applied a total of 0 rules in 39 ms. Remains 595 /595 variables (removed 0) and now considering 1707/1707 (removed 0) transitions.
[2023-03-16 00:25:26] [INFO ] Flow matrix only has 1371 transitions (discarded 336 similar events)
// Phase 1: matrix 1371 rows 595 cols
[2023-03-16 00:25:26] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-16 00:25:27] [INFO ] Implicit Places using invariants in 792 ms returned []
[2023-03-16 00:25:27] [INFO ] Flow matrix only has 1371 transitions (discarded 336 similar events)
// Phase 1: matrix 1371 rows 595 cols
[2023-03-16 00:25:27] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-16 00:25:27] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 00:25:33] [INFO ] Implicit Places using invariants and state equation in 6490 ms returned []
Implicit Place search using SMT with State Equation took 7284 ms to find 0 implicit places.
[2023-03-16 00:25:33] [INFO ] Redundant transitions in 267 ms returned []
[2023-03-16 00:25:33] [INFO ] Flow matrix only has 1371 transitions (discarded 336 similar events)
// Phase 1: matrix 1371 rows 595 cols
[2023-03-16 00:25:33] [INFO ] Computed 23 place invariants in 12 ms
[2023-03-16 00:25:35] [INFO ] Dead Transitions using invariants and state equation in 1905 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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-16 00:25:35] [INFO ] Computed 23 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :1
[2023-03-16 00:25:35] [INFO ] Flow matrix only has 1371 transitions (discarded 336 similar events)
// Phase 1: matrix 1371 rows 595 cols
[2023-03-16 00:25:35] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-16 00:25:36] [INFO ] [Real]Absence check using 23 positive place invariants in 20 ms returned sat
[2023-03-16 00:25:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:25:36] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2023-03-16 00:25:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:25:36] [INFO ] [Nat]Absence check using 23 positive place invariants in 21 ms returned sat
[2023-03-16 00:25:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:25:37] [INFO ] [Nat]Absence check using state equation in 476 ms returned sat
[2023-03-16 00:25:37] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 00:25:37] [INFO ] [Nat]Added 497 Read/Feed constraints in 289 ms returned sat
[2023-03-16 00:25:38] [INFO ] Deduced a trap composed of 15 places in 618 ms of which 1 ms to minimize.
[2023-03-16 00:25:38] [INFO ] Deduced a trap composed of 15 places in 631 ms of which 1 ms to minimize.
[2023-03-16 00:25:39] [INFO ] Deduced a trap composed of 39 places in 553 ms of which 1 ms to minimize.
[2023-03-16 00:25:40] [INFO ] Deduced a trap composed of 84 places in 660 ms of which 2 ms to minimize.
[2023-03-16 00:25:40] [INFO ] Deduced a trap composed of 14 places in 639 ms of which 1 ms to minimize.
[2023-03-16 00:25:41] [INFO ] Deduced a trap composed of 38 places in 658 ms of which 1 ms to minimize.
[2023-03-16 00:25:41] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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 SAFETY 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 77 ms. Remains 592 /595 variables (removed 3) and now considering 1704/1707 (removed 3) transitions.
Finished structural reductions, in 1 iterations. 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-16 00:25:42] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2807 ms. (steps per millisecond=356 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 777 ms. (steps per millisecond=1287 ) properties (out of 1) seen :1
[2023-03-16 00:25:45] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2023-03-16 00:25:45] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-16 00:25:45] [INFO ] [Real]Absence check using 23 positive place invariants in 31 ms returned sat
[2023-03-16 00:25:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:25:46] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2023-03-16 00:25:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:25:46] [INFO ] [Nat]Absence check using 23 positive place invariants in 32 ms returned sat
[2023-03-16 00:25:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:25:47] [INFO ] [Nat]Absence check using state equation in 591 ms returned sat
[2023-03-16 00:25:47] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 00:25:47] [INFO ] [Nat]Added 497 Read/Feed constraints in 317 ms returned sat
[2023-03-16 00:25:48] [INFO ] Deduced a trap composed of 11 places in 656 ms of which 1 ms to minimize.
[2023-03-16 00:25:49] [INFO ] Deduced a trap composed of 20 places in 627 ms of which 1 ms to minimize.
[2023-03-16 00:25:49] [INFO ] Deduced a trap composed of 20 places in 609 ms of which 1 ms to minimize.
[2023-03-16 00:25:50] [INFO ] Deduced a trap composed of 50 places in 678 ms of which 1 ms to minimize.
[2023-03-16 00:25:51] [INFO ] Deduced a trap composed of 29 places in 608 ms of which 1 ms to minimize.
[2023-03-16 00:25:52] [INFO ] Deduced a trap composed of 57 places in 666 ms of which 1 ms to minimize.
[2023-03-16 00:25:52] [INFO ] Deduced a trap composed of 14 places in 667 ms of which 1 ms to minimize.
[2023-03-16 00:25:53] [INFO ] Deduced a trap composed of 12 places in 539 ms of which 1 ms to minimize.
[2023-03-16 00:25:54] [INFO ] Deduced a trap composed of 32 places in 607 ms of which 1 ms to minimize.
[2023-03-16 00:25:55] [INFO ] Deduced a trap composed of 23 places in 640 ms of which 1 ms to minimize.
[2023-03-16 00:25:55] [INFO ] Deduced a trap composed of 38 places in 645 ms of which 1 ms to minimize.
[2023-03-16 00:25:56] [INFO ] Deduced a trap composed of 65 places in 574 ms of which 1 ms to minimize.
[2023-03-16 00:25:56] [INFO ] Deduced a trap composed of 50 places in 376 ms of which 1 ms to minimize.
[2023-03-16 00:25:57] [INFO ] Deduced a trap composed of 11 places in 542 ms of which 0 ms to minimize.
[2023-03-16 00:25:57] [INFO ] Deduced a trap composed of 14 places in 506 ms of which 1 ms to minimize.
[2023-03-16 00:25:58] [INFO ] Deduced a trap composed of 20 places in 640 ms of which 1 ms to minimize.
[2023-03-16 00:26:00] [INFO ] Deduced a trap composed of 41 places in 562 ms of which 1 ms to minimize.
[2023-03-16 00:26:00] [INFO ] Deduced a trap composed of 41 places in 632 ms of which 1 ms to minimize.
[2023-03-16 00:26:01] [INFO ] Deduced a trap composed of 32 places in 629 ms of which 2 ms to minimize.
[2023-03-16 00:26:02] [INFO ] Deduced a trap composed of 59 places in 530 ms of which 1 ms to minimize.
[2023-03-16 00:26:02] [INFO ] Deduced a trap composed of 100 places in 612 ms of which 1 ms to minimize.
[2023-03-16 00:26:03] [INFO ] Deduced a trap composed of 30 places in 638 ms of which 2 ms to minimize.
[2023-03-16 00:26:06] [INFO ] Trap strengthening (SAT) tested/added 22/22 trap constraints in 18976 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 SAFETY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 34 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 592/592 places, 1704/1704 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 28 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-16 00:26:06] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2023-03-16 00:26:06] [INFO ] Computed 23 place invariants in 6 ms
[2023-03-16 00:26:07] [INFO ] Implicit Places using invariants in 1224 ms returned []
[2023-03-16 00:26:07] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2023-03-16 00:26:07] [INFO ] Computed 23 place invariants in 7 ms
[2023-03-16 00:26:08] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 00:26:14] [INFO ] Implicit Places using invariants and state equation in 6660 ms returned []
Implicit Place search using SMT with State Equation took 7886 ms to find 0 implicit places.
[2023-03-16 00:26:14] [INFO ] Redundant transitions in 88 ms returned []
[2023-03-16 00:26:14] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2023-03-16 00:26:14] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-16 00:26:16] [INFO ] Dead Transitions using invariants and state equation in 1926 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 592/592 places, 1704/1704 transitions.
Ending property specific reduction for Peterson-PT-7-UpperBounds-00 in 40758 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-16 00:26:16] [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-16 00:26:16] [INFO ] Flow matrix only has 1371 transitions (discarded 336 similar events)
// Phase 1: matrix 1371 rows 595 cols
[2023-03-16 00:26:16] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-16 00:26:16] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2023-03-16 00:26:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:26:17] [INFO ] [Real]Absence check using state equation in 477 ms returned sat
[2023-03-16 00:26:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:26:17] [INFO ] [Nat]Absence check using 23 positive place invariants in 26 ms returned sat
[2023-03-16 00:26:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:26:18] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2023-03-16 00:26:18] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 00:26:18] [INFO ] [Nat]Added 497 Read/Feed constraints in 119 ms returned sat
[2023-03-16 00:26:18] [INFO ] Computed and/alt/rep : 1251/4787/1251 causal constraints (skipped 112 transitions) in 146 ms.
[2023-03-16 00:26:22] [INFO ] Deduced a trap composed of 11 places in 711 ms of which 2 ms to minimize.
[2023-03-16 00:26:22] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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 SAFETY 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 91 ms. Remains 582 /595 variables (removed 13) and now considering 1689/1706 (removed 17) transitions.
Finished structural reductions, in 1 iterations. 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-16 00:26:22] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2673 ms. (steps per millisecond=374 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 681 ms. (steps per millisecond=1468 ) properties (out of 1) seen :0
[2023-03-16 00:26:25] [INFO ] Flow matrix only has 1353 transitions (discarded 336 similar events)
// Phase 1: matrix 1353 rows 582 cols
[2023-03-16 00:26:25] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-16 00:26:26] [INFO ] [Real]Absence check using 23 positive place invariants in 32 ms returned sat
[2023-03-16 00:26:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:26:26] [INFO ] [Real]Absence check using state equation in 529 ms returned sat
[2023-03-16 00:26:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:26:26] [INFO ] [Nat]Absence check using 23 positive place invariants in 32 ms returned sat
[2023-03-16 00:26:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:26:27] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2023-03-16 00:26:27] [INFO ] State equation strengthened by 493 read => feed constraints.
[2023-03-16 00:26:27] [INFO ] [Nat]Added 493 Read/Feed constraints in 84 ms returned sat
[2023-03-16 00:26:27] [INFO ] Computed and/alt/rep : 1233/4757/1233 causal constraints (skipped 112 transitions) in 169 ms.
[2023-03-16 00:26:31] [INFO ] Deduced a trap composed of 11 places in 628 ms of which 1 ms to minimize.
[2023-03-16 00:26:31] [INFO ] Deduced a trap composed of 38 places in 599 ms of which 1 ms to minimize.
[2023-03-16 00:26:32] [INFO ] Deduced a trap composed of 11 places in 668 ms of which 1 ms to minimize.
[2023-03-16 00:26:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2339 ms
[2023-03-16 00:26:33] [INFO ] Added : 102 causal constraints over 22 iterations in 5597 ms. Result :sat
Minimization took 320 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 SAFETY mode, iteration 0 : 582/582 places, 1689/1689 transitions.
Applied a total of 0 rules in 58 ms. Remains 582 /582 variables (removed 0) and now considering 1689/1689 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 582/582 places, 1689/1689 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 582/582 places, 1689/1689 transitions.
Applied a total of 0 rules in 56 ms. Remains 582 /582 variables (removed 0) and now considering 1689/1689 (removed 0) transitions.
[2023-03-16 00:26:33] [INFO ] Flow matrix only has 1353 transitions (discarded 336 similar events)
// Phase 1: matrix 1353 rows 582 cols
[2023-03-16 00:26:33] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-16 00:26:35] [INFO ] Implicit Places using invariants in 1201 ms returned []
[2023-03-16 00:26:35] [INFO ] Flow matrix only has 1353 transitions (discarded 336 similar events)
// Phase 1: matrix 1353 rows 582 cols
[2023-03-16 00:26:35] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-16 00:26:35] [INFO ] State equation strengthened by 493 read => feed constraints.
[2023-03-16 00:26:40] [INFO ] Implicit Places using invariants and state equation in 5514 ms returned []
Implicit Place search using SMT with State Equation took 6718 ms to find 0 implicit places.
[2023-03-16 00:26:40] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-16 00:26:40] [INFO ] Flow matrix only has 1353 transitions (discarded 336 similar events)
// Phase 1: matrix 1353 rows 582 cols
[2023-03-16 00:26:40] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-16 00:26:42] [INFO ] Dead Transitions using invariants and state equation in 2212 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 582/582 places, 1689/1689 transitions.
Ending property specific reduction for Peterson-PT-7-UpperBounds-09 in 26268 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-16 00:26:42] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
[2023-03-16 00:26:42] [INFO ] Flow matrix only has 1371 transitions (discarded 336 similar events)
// Phase 1: matrix 1371 rows 595 cols
[2023-03-16 00:26:42] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-16 00:26:43] [INFO ] [Real]Absence check using 23 positive place invariants in 30 ms returned sat
[2023-03-16 00:26:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:26:43] [INFO ] [Real]Absence check using state equation in 620 ms returned sat
[2023-03-16 00:26:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:26:44] [INFO ] [Nat]Absence check using 23 positive place invariants in 30 ms returned sat
[2023-03-16 00:26:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:26:44] [INFO ] [Nat]Absence check using state equation in 570 ms returned sat
[2023-03-16 00:26:44] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 00:26:44] [INFO ] [Nat]Added 497 Read/Feed constraints in 91 ms returned sat
[2023-03-16 00:26:45] [INFO ] Computed and/alt/rep : 1251/4787/1251 causal constraints (skipped 112 transitions) in 160 ms.
[2023-03-16 00:26:49] [INFO ] Deduced a trap composed of 2 places in 831 ms of which 1 ms to minimize.
[2023-03-16 00:26:49] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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 SAFETY 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 81 ms. Remains 583 /595 variables (removed 12) and now considering 1691/1705 (removed 14) transitions.
Finished structural reductions, in 1 iterations. 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-16 00:26:49] [INFO ] Computed 23 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2751 ms. (steps per millisecond=363 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 684 ms. (steps per millisecond=1461 ) properties (out of 1) seen :0
[2023-03-16 00:26:53] [INFO ] Flow matrix only has 1355 transitions (discarded 336 similar events)
// Phase 1: matrix 1355 rows 583 cols
[2023-03-16 00:26:53] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-16 00:26:53] [INFO ] [Real]Absence check using 23 positive place invariants in 29 ms returned sat
[2023-03-16 00:26:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:26:54] [INFO ] [Real]Absence check using state equation in 538 ms returned sat
[2023-03-16 00:26:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:26:54] [INFO ] [Nat]Absence check using 23 positive place invariants in 36 ms returned sat
[2023-03-16 00:26:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:26:54] [INFO ] [Nat]Absence check using state equation in 579 ms returned sat
[2023-03-16 00:26:54] [INFO ] State equation strengthened by 494 read => feed constraints.
[2023-03-16 00:26:54] [INFO ] [Nat]Added 494 Read/Feed constraints in 79 ms returned sat
[2023-03-16 00:26:55] [INFO ] Computed and/alt/rep : 1235/4760/1235 causal constraints (skipped 112 transitions) in 93 ms.
[2023-03-16 00:26:58] [INFO ] Deduced a trap composed of 11 places in 614 ms of which 1 ms to minimize.
[2023-03-16 00:26:58] [INFO ] Deduced a trap composed of 63 places in 621 ms of which 1 ms to minimize.
[2023-03-16 00:26:59] [INFO ] Deduced a trap composed of 47 places in 637 ms of which 1 ms to minimize.
[2023-03-16 00:27:00] [INFO ] Deduced a trap composed of 13 places in 660 ms of which 1 ms to minimize.
[2023-03-16 00:27:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3154 ms
[2023-03-16 00:27:01] [INFO ] Added : 101 causal constraints over 21 iterations in 6125 ms. Result :sat
Minimization took 322 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
FORMULA Peterson-PT-7-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Ending property specific reduction for Peterson-PT-7-UpperBounds-11 in 18773 ms.
[2023-03-16 00:27:02] [INFO ] Flatten gal took : 377 ms
[2023-03-16 00:27:02] [INFO ] Applying decomposition
[2023-03-16 00:27:02] [INFO ] Flatten gal took : 195 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16614755513816155319.txt' '-o' '/tmp/graph16614755513816155319.bin' '-w' '/tmp/graph16614755513816155319.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16614755513816155319.bin' '-l' '-1' '-v' '-w' '/tmp/graph16614755513816155319.weights' '-q' '0' '-e' '0.001'
[2023-03-16 00:27:03] [INFO ] Decomposing Gal with order
[2023-03-16 00:27:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 00:27:03] [INFO ] Removed a total of 2500 redundant transitions.
[2023-03-16 00:27:03] [INFO ] Flatten gal took : 376 ms
[2023-03-16 00:27:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 893 labels/synchronizations in 141 ms.
[2023-03-16 00:27:04] [INFO ] Time to serialize gal into /tmp/UpperBounds16194637729406069581.gal : 45 ms
[2023-03-16 00:27:04] [INFO ] Time to serialize properties into /tmp/UpperBounds14977623382783078864.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16194637729406069581.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14977623382783078864.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...297
Loading property file /tmp/UpperBounds14977623382783078864.prop.
Detected timeout of ITS tools.
[2023-03-16 00:49:20] [INFO ] Applying decomposition
[2023-03-16 00:49:21] [INFO ] Flatten gal took : 1218 ms
[2023-03-16 00:49:22] [INFO ] Decomposing Gal with order
[2023-03-16 00:49:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 00:49:25] [INFO ] Removed a total of 2173 redundant transitions.
[2023-03-16 00:49:25] [INFO ] Flatten gal took : 2726 ms
[2023-03-16 00:49:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 956 labels/synchronizations in 358 ms.
[2023-03-16 00:49:26] [INFO ] Time to serialize gal into /tmp/UpperBounds13895776041924408486.gal : 163 ms
[2023-03-16 00:49:26] [INFO ] Time to serialize properties into /tmp/UpperBounds11462927435032022870.prop : 32 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13895776041924408486.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11462927435032022870.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...297
Loading property file /tmp/UpperBounds11462927435032022870.prop.
Detected timeout of ITS tools.
[2023-03-16 01:11:40] [INFO ] Flatten gal took : 1348 ms
[2023-03-16 01:11:48] [INFO ] Input system was already deterministic with 1707 transitions.
[2023-03-16 01:11:48] [INFO ] Transformed 595 places.
[2023-03-16 01:11:48] [INFO ] Transformed 1707 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-16 01:11:49] [INFO ] Time to serialize gal into /tmp/UpperBounds8886142135258014078.gal : 38 ms
[2023-03-16 01:11:49] [INFO ] Time to serialize properties into /tmp/UpperBounds944642819587413705.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8886142135258014078.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds944642819587413705.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...339
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds944642819587413705.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="gold2022"
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 gold2022"
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 r287-smll-167863553800081"
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 '
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 ;