Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r476-tall-171620505200141.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is CANInsertWithFailure-PT-060, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505200141
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 23M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 188K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 09:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 09:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 22M May 18 16:42 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 CANInsertWithFailure-PT-060-UpperBounds-00
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-01
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-02
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-03
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-04
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-05
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-06
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-07
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-08
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-09
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-10
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-11
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-12
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-13
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-14
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717192442270

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-060
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:54:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 21:54:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:54:04] [INFO ] Load time of PNML (sax parser for PT used): 739 ms
[2024-05-31 21:54:04] [INFO ] Transformed 7924 places.
[2024-05-31 21:54:04] [INFO ] Transformed 21960 transitions.
[2024-05-31 21:54:04] [INFO ] Parsed PT model containing 7924 places and 21960 transitions and 58800 arcs in 934 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 21960 rows 7924 cols
[2024-05-31 21:54:07] [INFO ] Computed 63 invariants in 2948 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[60, 60, 1, 60, 60, 60, 1, 60, 60, 60, 60, 60, 60, 60, 60, 60]
RANDOM walk for 10000 steps (7 resets) in 179 ms. (55 steps per ms)
FORMULA CANInsertWithFailure-PT-060-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-060-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 140014 steps (28 resets) in 198 ms. (703 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0] Max Struct:[60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60]
[2024-05-31 21:54:08] [INFO ] Invariant cache hit.
[2024-05-31 21:54:09] [INFO ] [Real]Absence check using 61 positive place invariants in 199 ms returned sat
[2024-05-31 21:54:09] [INFO ] [Real]Absence check using 61 positive and 2 generalized place invariants in 76 ms returned sat
[2024-05-31 21:54:12] [INFO ] [Real]Absence check using state equation in 2673 ms returned sat
[2024-05-31 21:54:12] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2024-05-31 21:54:13] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 21:54:13] [INFO ] [Real]Added 7140 Read/Feed constraints in 402 ms returned unknown
[2024-05-31 21:54:14] [INFO ] [Real]Absence check using 61 positive place invariants in 193 ms returned sat
[2024-05-31 21:54:14] [INFO ] [Real]Absence check using 61 positive and 2 generalized place invariants in 76 ms returned sat
[2024-05-31 21:54:16] [INFO ] [Real]Absence check using state equation in 2784 ms returned sat
[2024-05-31 21:54:17] [INFO ] [Real]Added 7140 Read/Feed constraints in 501 ms returned sat
0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
[2024-05-31 21:54:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:54:19] [INFO ] [Nat]Absence check using 61 positive place invariants in 197 ms returned sat
[2024-05-31 21:54:19] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 68 ms returned sat
[2024-05-31 21:54:21] [INFO ] [Nat]Absence check using state equation in 2624 ms returned sat
[2024-05-31 21:54:22] [INFO ] [Nat]Added 7140 Read/Feed constraints in 509 ms returned sat
[2024-05-31 21:54:33] [INFO ] Deduced a trap composed of 9 places in 10700 ms of which 299 ms to minimize.
[2024-05-31 21:54:33] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 21:54:34] [INFO ] [Real]Absence check using 61 positive place invariants in 179 ms returned sat
[2024-05-31 21:54:34] [INFO ] [Real]Absence check using 61 positive and 2 generalized place invariants in 71 ms returned sat
[2024-05-31 21:54:37] [INFO ] [Real]Absence check using state equation in 2563 ms returned sat
[2024-05-31 21:54:37] [INFO ] [Real]Added 7140 Read/Feed constraints in 467 ms returned sat
[2024-05-31 21:54:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:54:39] [INFO ] [Nat]Absence check using 61 positive place invariants in 197 ms returned sat
[2024-05-31 21:54:39] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 66 ms returned sat
[2024-05-31 21:54:41] [INFO ] [Nat]Absence check using state equation in 2556 ms returned sat
[2024-05-31 21:54:42] [INFO ] [Nat]Added 7140 Read/Feed constraints in 490 ms returned sat
[2024-05-31 21:54:52] [INFO ] Deduced a trap composed of 42 places in 10022 ms of which 43 ms to minimize.
[2024-05-31 21:54:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 21:54:53] [INFO ] [Real]Absence check using 61 positive place invariants in 166 ms returned sat
[2024-05-31 21:54:53] [INFO ] [Real]Absence check using 61 positive and 2 generalized place invariants in 68 ms returned sat
[2024-05-31 21:54:56] [INFO ] [Real]Absence check using state equation in 2604 ms returned sat
[2024-05-31 21:54:57] [INFO ] [Real]Added 7140 Read/Feed constraints in 488 ms returned sat
[2024-05-31 21:54:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:54:58] [INFO ] [Nat]Absence check using 61 positive place invariants in 178 ms returned sat
[2024-05-31 21:54:58] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 68 ms returned sat
[2024-05-31 21:55:01] [INFO ] [Nat]Absence check using state equation in 2655 ms returned sat
[2024-05-31 21:55:01] [INFO ] [Nat]Added 7140 Read/Feed constraints in 493 ms returned sat
[2024-05-31 21:55:12] [INFO ] Deduced a trap composed of 42 places in 10139 ms of which 46 ms to minimize.
[2024-05-31 21:55:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 21:55:13] [INFO ] [Real]Absence check using 61 positive place invariants in 166 ms returned sat
[2024-05-31 21:55:13] [INFO ] [Real]Absence check using 61 positive and 2 generalized place invariants in 69 ms returned sat
[2024-05-31 21:55:15] [INFO ] [Real]Absence check using state equation in 2574 ms returned sat
[2024-05-31 21:55:16] [INFO ] [Real]Added 7140 Read/Feed constraints in 458 ms returned sat
[2024-05-31 21:55:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:55:17] [INFO ] [Nat]Absence check using 61 positive place invariants in 173 ms returned sat
[2024-05-31 21:55:17] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 68 ms returned sat
[2024-05-31 21:55:20] [INFO ] [Nat]Absence check using state equation in 2522 ms returned sat
[2024-05-31 21:55:20] [INFO ] [Nat]Added 7140 Read/Feed constraints in 460 ms returned sat
[2024-05-31 21:55:31] [INFO ] Deduced a trap composed of 9 places in 10744 ms of which 41 ms to minimize.
[2024-05-31 21:55:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 21:55:32] [INFO ] [Real]Absence check using 61 positive place invariants in 164 ms returned sat
[2024-05-31 21:55:32] [INFO ] [Real]Absence check using 61 positive and 2 generalized place invariants in 69 ms returned sat
[2024-05-31 21:55:35] [INFO ] [Real]Absence check using state equation in 2377 ms returned sat
[2024-05-31 21:55:36] [INFO ] [Real]Added 7140 Read/Feed constraints in 447 ms returned sat
[2024-05-31 21:55:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:55:37] [INFO ] [Nat]Absence check using 61 positive place invariants in 174 ms returned sat
[2024-05-31 21:55:37] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 66 ms returned sat
[2024-05-31 21:55:39] [INFO ] [Nat]Absence check using state equation in 2421 ms returned sat
[2024-05-31 21:55:40] [INFO ] [Nat]Added 7140 Read/Feed constraints in 439 ms returned sat
[2024-05-31 21:55:50] [INFO ] Deduced a trap composed of 42 places in 9903 ms of which 42 ms to minimize.
[2024-05-31 21:55: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 5
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 21:55:51] [INFO ] [Real]Absence check using 61 positive place invariants in 159 ms returned sat
[2024-05-31 21:55:51] [INFO ] [Real]Absence check using 61 positive and 2 generalized place invariants in 68 ms returned sat
[2024-05-31 21:55:53] [INFO ] [Real]Absence check using state equation in 2448 ms returned sat
[2024-05-31 21:55:54] [INFO ] [Real]Added 7140 Read/Feed constraints in 471 ms returned sat
[2024-05-31 21:55:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:55:55] [INFO ] [Nat]Absence check using 61 positive place invariants in 173 ms returned sat
[2024-05-31 21:55:55] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 65 ms returned sat
[2024-05-31 21:55:58] [INFO ] [Nat]Absence check using state equation in 2560 ms returned sat
[2024-05-31 21:55:58] [INFO ] [Nat]Added 7140 Read/Feed constraints in 439 ms returned sat
[2024-05-31 21:56:09] [INFO ] Deduced a trap composed of 9 places in 10587 ms of which 38 ms to minimize.
[2024-05-31 21:56:09] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 21:56:10] [INFO ] [Real]Absence check using 61 positive place invariants in 166 ms returned sat
[2024-05-31 21:56:10] [INFO ] [Real]Absence check using 61 positive and 2 generalized place invariants in 67 ms returned sat
[2024-05-31 21:56:13] [INFO ] [Real]Absence check using state equation in 2536 ms returned sat
[2024-05-31 21:56:14] [INFO ] [Real]Added 7140 Read/Feed constraints in 492 ms returned sat
[2024-05-31 21:56:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:56:15] [INFO ] [Nat]Absence check using 61 positive place invariants in 176 ms returned sat
[2024-05-31 21:56:15] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 67 ms returned sat
[2024-05-31 21:56:18] [INFO ] [Nat]Absence check using state equation in 2549 ms returned sat
[2024-05-31 21:56:18] [INFO ] [Nat]Added 7140 Read/Feed constraints in 479 ms returned sat
[2024-05-31 21:56:29] [INFO ] Deduced a trap composed of 5 places in 10389 ms of which 41 ms to minimize.
[2024-05-31 21:56:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 21:56:30] [INFO ] [Real]Absence check using 61 positive place invariants in 159 ms returned sat
[2024-05-31 21:56:30] [INFO ] [Real]Absence check using 61 positive and 2 generalized place invariants in 67 ms returned sat
[2024-05-31 21:56:32] [INFO ] [Real]Absence check using state equation in 2332 ms returned sat
[2024-05-31 21:56:33] [INFO ] [Real]Added 7140 Read/Feed constraints in 448 ms returned sat
[2024-05-31 21:56:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:56:34] [INFO ] [Nat]Absence check using 61 positive place invariants in 168 ms returned sat
[2024-05-31 21:56:34] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 62 ms returned sat
[2024-05-31 21:56:37] [INFO ] [Nat]Absence check using state equation in 2493 ms returned sat
[2024-05-31 21:56:37] [INFO ] [Nat]Added 7140 Read/Feed constraints in 452 ms returned sat
[2024-05-31 21:56:47] [INFO ] Deduced a trap composed of 13 places in 9411 ms of which 37 ms to minimize.
[2024-05-31 21:56:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 21:56:48] [INFO ] [Real]Absence check using 61 positive place invariants in 161 ms returned sat
[2024-05-31 21:56:48] [INFO ] [Real]Absence check using 61 positive and 2 generalized place invariants in 66 ms returned sat
[2024-05-31 21:56:51] [INFO ] [Real]Absence check using state equation in 2610 ms returned sat
[2024-05-31 21:56:51] [INFO ] [Real]Added 7140 Read/Feed constraints in 483 ms returned sat
[2024-05-31 21:56:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:56:53] [INFO ] [Nat]Absence check using 61 positive place invariants in 172 ms returned sat
[2024-05-31 21:56:53] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 65 ms returned sat
[2024-05-31 21:56:55] [INFO ] [Nat]Absence check using state equation in 2599 ms returned sat
[2024-05-31 21:56:56] [INFO ] [Nat]Added 7140 Read/Feed constraints in 473 ms returned sat
[2024-05-31 21:57:06] [INFO ] Deduced a trap composed of 42 places in 10012 ms of which 39 ms to minimize.
[2024-05-31 21:57:06] [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 9
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 21:57:07] [INFO ] [Real]Absence check using 61 positive place invariants in 162 ms returned sat
[2024-05-31 21:57:07] [INFO ] [Real]Absence check using 61 positive and 2 generalized place invariants in 65 ms returned sat
[2024-05-31 21:57:09] [INFO ] [Real]Absence check using state equation in 2388 ms returned sat
[2024-05-31 21:57:10] [INFO ] [Real]Added 7140 Read/Feed constraints in 458 ms returned sat
[2024-05-31 21:57:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:57:12] [INFO ] [Nat]Absence check using 61 positive place invariants in 168 ms returned sat
[2024-05-31 21:57:12] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 62 ms returned sat
[2024-05-31 21:57:14] [INFO ] [Nat]Absence check using state equation in 2598 ms returned sat
[2024-05-31 21:57:15] [INFO ] [Nat]Added 7140 Read/Feed constraints in 467 ms returned sat
[2024-05-31 21:57:25] [INFO ] Deduced a trap composed of 42 places in 9873 ms of which 35 ms to minimize.
[2024-05-31 21:57:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 21:57:26] [INFO ] [Real]Absence check using 61 positive place invariants in 163 ms returned sat
[2024-05-31 21:57:26] [INFO ] [Real]Absence check using 61 positive and 2 generalized place invariants in 66 ms returned sat
[2024-05-31 21:57:28] [INFO ] [Real]Absence check using state equation in 2401 ms returned sat
[2024-05-31 21:57:29] [INFO ] [Real]Added 7140 Read/Feed constraints in 487 ms returned sat
[2024-05-31 21:57:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:57:30] [INFO ] [Nat]Absence check using 61 positive place invariants in 170 ms returned sat
[2024-05-31 21:57:30] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 63 ms returned sat
[2024-05-31 21:57:33] [INFO ] [Nat]Absence check using state equation in 2554 ms returned sat
[2024-05-31 21:57:33] [INFO ] [Nat]Added 7140 Read/Feed constraints in 450 ms returned sat
[2024-05-31 21:57:44] [INFO ] Deduced a trap composed of 42 places in 10125 ms of which 43 ms to minimize.
[2024-05-31 21:57:44] [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 11
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 21:57:45] [INFO ] [Real]Absence check using 61 positive place invariants in 174 ms returned sat
[2024-05-31 21:57:45] [INFO ] [Real]Absence check using 61 positive and 2 generalized place invariants in 69 ms returned sat
[2024-05-31 21:57:47] [INFO ] [Real]Absence check using state equation in 2456 ms returned sat
[2024-05-31 21:57:48] [INFO ] [Real]Added 7140 Read/Feed constraints in 452 ms returned sat
[2024-05-31 21:57:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:57:49] [INFO ] [Nat]Absence check using 61 positive place invariants in 175 ms returned sat
[2024-05-31 21:57:49] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 66 ms returned sat
[2024-05-31 21:57:52] [INFO ] [Nat]Absence check using state equation in 2590 ms returned sat
[2024-05-31 21:57:53] [INFO ] [Nat]Added 7140 Read/Feed constraints in 474 ms returned sat
[2024-05-31 21:58:03] [INFO ] Deduced a trap composed of 42 places in 9861 ms of which 39 ms to minimize.
[2024-05-31 21:58:03] [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 12
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 21:58:04] [INFO ] [Real]Absence check using 61 positive place invariants in 160 ms returned sat
[2024-05-31 21:58:04] [INFO ] [Real]Absence check using 61 positive and 2 generalized place invariants in 70 ms returned sat
[2024-05-31 21:58:06] [INFO ] [Real]Absence check using state equation in 2384 ms returned sat
[2024-05-31 21:58:07] [INFO ] [Real]Added 7140 Read/Feed constraints in 477 ms returned sat
[2024-05-31 21:58:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:58:08] [INFO ] [Nat]Absence check using 61 positive place invariants in 172 ms returned sat
[2024-05-31 21:58:08] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 65 ms returned sat
[2024-05-31 21:58:11] [INFO ] [Nat]Absence check using state equation in 2530 ms returned sat
[2024-05-31 21:58:11] [INFO ] [Nat]Added 7140 Read/Feed constraints in 476 ms returned sat
[2024-05-31 21:58:22] [INFO ] Deduced a trap composed of 46 places in 9991 ms of which 42 ms to minimize.
[2024-05-31 21:58: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 13
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0] Max Struct:[60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0] Max Struct:[60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60]
Support contains 14 out of 7924 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7924/7924 places, 21960/21960 transitions.
Graph (complete) has 29701 edges and 7924 vertex of which 7923 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.32 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 421 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 841 place count 7503 transition count 21540
Performed 3535 Post agglomeration using F-continuation condition.Transition count delta: 3535
Deduced a syphon composed of 3535 places in 7 ms
Reduce places removed 3535 places and 0 transitions.
Iterating global reduction 2 with 7070 rules applied. Total rules applied 7911 place count 3968 transition count 18005
Drop transitions (Redundant composition of simpler transitions.) removed 3417 transitions
Redundant transition composition rules discarded 3417 transitions
Iterating global reduction 2 with 3417 rules applied. Total rules applied 11328 place count 3968 transition count 14588
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11329 place count 3968 transition count 14587
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11330 place count 3967 transition count 14587
Partial Free-agglomeration rule applied 3652 times.
Drop transitions (Partial Free agglomeration) removed 3652 transitions
Iterating global reduction 3 with 3652 rules applied. Total rules applied 14982 place count 3967 transition count 14587
Applied a total of 14982 rules in 6726 ms. Remains 3967 /7924 variables (removed 3957) and now considering 14587/21960 (removed 7373) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6737 ms. Remains : 3967/7924 places, 14587/21960 transitions.
// Phase 1: matrix 14587 rows 3967 cols
[2024-05-31 21:58:29] [INFO ] Computed 62 invariants in 608 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0] Max Struct:[60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60]
RANDOM walk for 1000000 steps (3637 resets) in 19190 ms. (52 steps per ms)
BEST_FIRST walk for 14000014 steps (658 resets) in 24877 ms. (562 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60]
[2024-05-31 21:59:13] [INFO ] Invariant cache hit.
[2024-05-31 21:59:13] [INFO ] [Real]Absence check using 60 positive place invariants in 62 ms returned sat
[2024-05-31 21:59:14] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-31 21:59:17] [INFO ] [Real]Absence check using state equation in 3310 ms returned sat
[2024-05-31 21:59:17] [INFO ] State equation strengthened by 14384 read => feed constraints.
[2024-05-31 21:59:18] [INFO ] [Real]Added 14384 Read/Feed constraints in 1244 ms returned sat
[2024-05-31 21:59:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:59:19] [INFO ] [Nat]Absence check using 60 positive place invariants in 71 ms returned sat
[2024-05-31 21:59:19] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 29 ms returned sat
[2024-05-31 21:59:23] [INFO ] [Nat]Absence check using state equation in 3300 ms returned sat
[2024-05-31 21:59:24] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1343 ms returned sat
[2024-05-31 21:59:25] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 903 ms.
Minimization took 6090 ms.
[2024-05-31 21:59:32] [INFO ] [Real]Absence check using 60 positive place invariants in 64 ms returned sat
[2024-05-31 21:59:32] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 39 ms returned sat
[2024-05-31 21:59:35] [INFO ] [Real]Absence check using state equation in 3333 ms returned sat
[2024-05-31 21:59:37] [INFO ] [Real]Added 14384 Read/Feed constraints in 1262 ms returned sat
[2024-05-31 21:59:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:59:37] [INFO ] [Nat]Absence check using 60 positive place invariants in 74 ms returned sat
[2024-05-31 21:59:37] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-31 21:59:41] [INFO ] [Nat]Absence check using state equation in 3340 ms returned sat
[2024-05-31 21:59:42] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1367 ms returned sat
[2024-05-31 21:59:43] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 846 ms.
Minimization took 5940 ms.
[2024-05-31 21:59:49] [INFO ] [Real]Absence check using 60 positive place invariants in 64 ms returned sat
[2024-05-31 21:59:50] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-31 21:59:53] [INFO ] [Real]Absence check using state equation in 3300 ms returned sat
[2024-05-31 21:59:54] [INFO ] [Real]Added 14384 Read/Feed constraints in 1307 ms returned sat
[2024-05-31 21:59:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:59:55] [INFO ] [Nat]Absence check using 60 positive place invariants in 72 ms returned sat
[2024-05-31 21:59:55] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-31 21:59:59] [INFO ] [Nat]Absence check using state equation in 3426 ms returned sat
[2024-05-31 22:00:00] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1470 ms returned sat
[2024-05-31 22:00:01] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 757 ms.
Minimization took 5977 ms.
[2024-05-31 22:00:08] [INFO ] [Real]Absence check using 60 positive place invariants in 64 ms returned sat
[2024-05-31 22:00:08] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 37 ms returned sat
[2024-05-31 22:00:11] [INFO ] [Real]Absence check using state equation in 3470 ms returned sat
[2024-05-31 22:00:13] [INFO ] [Real]Added 14384 Read/Feed constraints in 1290 ms returned sat
[2024-05-31 22:00:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:00:13] [INFO ] [Nat]Absence check using 60 positive place invariants in 76 ms returned sat
[2024-05-31 22:00:13] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-31 22:00:17] [INFO ] [Nat]Absence check using state equation in 3347 ms returned sat
[2024-05-31 22:00:18] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1480 ms returned sat
[2024-05-31 22:00:19] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 763 ms.
Minimization took 5903 ms.
[2024-05-31 22:00:26] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2024-05-31 22:00:26] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-31 22:00:29] [INFO ] [Real]Absence check using state equation in 3185 ms returned sat
[2024-05-31 22:00:30] [INFO ] [Real]Added 14384 Read/Feed constraints in 1234 ms returned sat
[2024-05-31 22:00:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:00:31] [INFO ] [Nat]Absence check using 60 positive place invariants in 74 ms returned sat
[2024-05-31 22:00:31] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-31 22:00:34] [INFO ] [Nat]Absence check using state equation in 3181 ms returned sat
[2024-05-31 22:00:36] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1395 ms returned sat
[2024-05-31 22:00:37] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 785 ms.
Minimization took 5934 ms.
[2024-05-31 22:00:43] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2024-05-31 22:00:43] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-31 22:00:47] [INFO ] [Real]Absence check using state equation in 3331 ms returned sat
[2024-05-31 22:00:48] [INFO ] [Real]Added 14384 Read/Feed constraints in 1326 ms returned sat
[2024-05-31 22:00:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:00:49] [INFO ] [Nat]Absence check using 60 positive place invariants in 72 ms returned sat
[2024-05-31 22:00:49] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-31 22:00:52] [INFO ] [Nat]Absence check using state equation in 3234 ms returned sat
[2024-05-31 22:00:53] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1370 ms returned sat
[2024-05-31 22:00:55] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 862 ms.
Minimization took 7404 ms.
[2024-05-31 22:01:03] [INFO ] [Real]Absence check using 60 positive place invariants in 70 ms returned sat
[2024-05-31 22:01:03] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-31 22:01:06] [INFO ] [Real]Absence check using state equation in 3595 ms returned sat
[2024-05-31 22:01:08] [INFO ] [Real]Added 14384 Read/Feed constraints in 1327 ms returned sat
[2024-05-31 22:01:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:01:09] [INFO ] [Nat]Absence check using 60 positive place invariants in 81 ms returned sat
[2024-05-31 22:01:09] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-31 22:01:12] [INFO ] [Nat]Absence check using state equation in 3599 ms returned sat
[2024-05-31 22:01:14] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1541 ms returned sat
[2024-05-31 22:01:15] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 887 ms.
Minimization took 6377 ms.
[2024-05-31 22:01:22] [INFO ] [Real]Absence check using 60 positive place invariants in 68 ms returned sat
[2024-05-31 22:01:22] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-31 22:01:25] [INFO ] [Real]Absence check using state equation in 3383 ms returned sat
[2024-05-31 22:01:27] [INFO ] [Real]Added 14384 Read/Feed constraints in 1265 ms returned sat
[2024-05-31 22:01:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:01:28] [INFO ] [Nat]Absence check using 60 positive place invariants in 78 ms returned sat
[2024-05-31 22:01:28] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-31 22:01:31] [INFO ] [Nat]Absence check using state equation in 3532 ms returned sat
[2024-05-31 22:01:32] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1400 ms returned sat
[2024-05-31 22:01:34] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 754 ms.
Minimization took 7792 ms.
[2024-05-31 22:01:42] [INFO ] [Real]Absence check using 60 positive place invariants in 68 ms returned sat
[2024-05-31 22:01:42] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 34 ms returned sat
[2024-05-31 22:01:45] [INFO ] [Real]Absence check using state equation in 3369 ms returned sat
[2024-05-31 22:01:47] [INFO ] [Real]Added 14384 Read/Feed constraints in 1272 ms returned sat
[2024-05-31 22:01:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:01:47] [INFO ] [Nat]Absence check using 60 positive place invariants in 75 ms returned sat
[2024-05-31 22:01:48] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-31 22:01:51] [INFO ] [Nat]Absence check using state equation in 3468 ms returned sat
[2024-05-31 22:01:52] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1484 ms returned sat
[2024-05-31 22:01:54] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 749 ms.
Minimization took 7756 ms.
[2024-05-31 22:02:02] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2024-05-31 22:02:02] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-31 22:02:05] [INFO ] [Real]Absence check using state equation in 3222 ms returned sat
[2024-05-31 22:02:07] [INFO ] [Real]Added 14384 Read/Feed constraints in 1202 ms returned sat
[2024-05-31 22:02:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:02:07] [INFO ] [Nat]Absence check using 60 positive place invariants in 79 ms returned sat
[2024-05-31 22:02:07] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-31 22:02:11] [INFO ] [Nat]Absence check using state equation in 3521 ms returned sat
[2024-05-31 22:02:12] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1389 ms returned sat
[2024-05-31 22:02:13] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 789 ms.
Minimization took 7821 ms.
[2024-05-31 22:02:22] [INFO ] [Real]Absence check using 60 positive place invariants in 68 ms returned sat
[2024-05-31 22:02:22] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-31 22:02:25] [INFO ] [Real]Absence check using state equation in 3528 ms returned sat
[2024-05-31 22:02:27] [INFO ] [Real]Added 14384 Read/Feed constraints in 1331 ms returned sat
[2024-05-31 22:02:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:02:28] [INFO ] [Nat]Absence check using 60 positive place invariants in 87 ms returned sat
[2024-05-31 22:02:28] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 34 ms returned sat
[2024-05-31 22:02:31] [INFO ] [Nat]Absence check using state equation in 3671 ms returned sat
[2024-05-31 22:02:33] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1623 ms returned sat
[2024-05-31 22:02:34] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 709 ms.
Minimization took 7702 ms.
[2024-05-31 22:02:42] [INFO ] [Real]Absence check using 60 positive place invariants in 64 ms returned sat
[2024-05-31 22:02:42] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-31 22:02:46] [INFO ] [Real]Absence check using state equation in 3368 ms returned sat
[2024-05-31 22:02:47] [INFO ] [Real]Added 14384 Read/Feed constraints in 1278 ms returned sat
[2024-05-31 22:02:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:02:48] [INFO ] [Nat]Absence check using 60 positive place invariants in 77 ms returned sat
[2024-05-31 22:02:48] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-31 22:02:51] [INFO ] [Nat]Absence check using state equation in 3189 ms returned sat
[2024-05-31 22:02:53] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1828 ms returned sat
[2024-05-31 22:02:54] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 836 ms.
Minimization took 6675 ms.
[2024-05-31 22:03:01] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2024-05-31 22:03:01] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 34 ms returned sat
[2024-05-31 22:03:05] [INFO ] [Real]Absence check using state equation in 3327 ms returned sat
[2024-05-31 22:03:06] [INFO ] [Real]Added 14384 Read/Feed constraints in 1251 ms returned sat
[2024-05-31 22:03:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:03:07] [INFO ] [Nat]Absence check using 60 positive place invariants in 82 ms returned sat
[2024-05-31 22:03:07] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-31 22:03:11] [INFO ] [Nat]Absence check using state equation in 3806 ms returned sat
[2024-05-31 22:03:12] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1630 ms returned sat
[2024-05-31 22:03:14] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 772 ms.
Minimization took 7196 ms.
[2024-05-31 22:03:21] [INFO ] [Real]Absence check using 60 positive place invariants in 68 ms returned sat
[2024-05-31 22:03:21] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-31 22:03:25] [INFO ] [Real]Absence check using state equation in 3576 ms returned sat
[2024-05-31 22:03:26] [INFO ] [Real]Added 14384 Read/Feed constraints in 1354 ms returned sat
[2024-05-31 22:03:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:03:27] [INFO ] [Nat]Absence check using 60 positive place invariants in 80 ms returned sat
[2024-05-31 22:03:27] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-31 22:03:31] [INFO ] [Nat]Absence check using state equation in 3503 ms returned sat
[2024-05-31 22:03:32] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1492 ms returned sat
[2024-05-31 22:03:33] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 714 ms.
Minimization took 6522 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60]
Support contains 14 out of 3967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Applied a total of 0 rules in 802 ms. Remains 3967 /3967 variables (removed 0) and now considering 14587/14587 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 802 ms. Remains : 3967/3967 places, 14587/14587 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Applied a total of 0 rules in 768 ms. Remains 3967 /3967 variables (removed 0) and now considering 14587/14587 (removed 0) transitions.
[2024-05-31 22:03:41] [INFO ] Invariant cache hit.
[2024-05-31 22:03:48] [INFO ] Implicit Places using invariants in 6451 ms returned []
Implicit Place search using SMT only with invariants took 6454 ms to find 0 implicit places.
Running 14527 sub problems to find dead transitions.
[2024-05-31 22:03:48] [INFO ] Invariant cache hit.
[2024-05-31 22:03:48] [INFO ] State equation strengthened by 14384 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3966 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14527 unsolved
SMT process timed out in 57386ms, After SMT, problems are : Problem set: 0 solved, 14527 unsolved
Search for dead transitions found 0 dead transitions in 57553ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64835 ms. Remains : 3967/3967 places, 14587/14587 transitions.
[2024-05-31 22:04:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60]
RANDOM walk for 1000000 steps (3634 resets) in 19307 ms. (51 steps per ms)
BEST_FIRST walk for 14000013 steps (655 resets) in 25084 ms. (558 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60]
[2024-05-31 22:05:30] [INFO ] Invariant cache hit.
[2024-05-31 22:05:30] [INFO ] [Real]Absence check using 60 positive place invariants in 65 ms returned sat
[2024-05-31 22:05:30] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-31 22:05:34] [INFO ] [Real]Absence check using state equation in 3512 ms returned sat
[2024-05-31 22:05:34] [INFO ] State equation strengthened by 14384 read => feed constraints.
[2024-05-31 22:05:36] [INFO ] [Real]Added 14384 Read/Feed constraints in 1250 ms returned sat
[2024-05-31 22:05:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:05:36] [INFO ] [Nat]Absence check using 60 positive place invariants in 77 ms returned sat
[2024-05-31 22:05:36] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-31 22:05:40] [INFO ] [Nat]Absence check using state equation in 3275 ms returned sat
[2024-05-31 22:05:41] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1400 ms returned sat
[2024-05-31 22:05:42] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 708 ms.
Minimization took 6073 ms.
[2024-05-31 22:05:49] [INFO ] [Real]Absence check using 60 positive place invariants in 64 ms returned sat
[2024-05-31 22:05:49] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-31 22:05:52] [INFO ] [Real]Absence check using state equation in 3267 ms returned sat
[2024-05-31 22:05:53] [INFO ] [Real]Added 14384 Read/Feed constraints in 1307 ms returned sat
[2024-05-31 22:05:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:05:54] [INFO ] [Nat]Absence check using 60 positive place invariants in 74 ms returned sat
[2024-05-31 22:05:54] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-31 22:05:58] [INFO ] [Nat]Absence check using state equation in 3391 ms returned sat
[2024-05-31 22:05:59] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1592 ms returned sat
[2024-05-31 22:06:00] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 745 ms.
Minimization took 6041 ms.
[2024-05-31 22:06:07] [INFO ] [Real]Absence check using 60 positive place invariants in 77 ms returned sat
[2024-05-31 22:06:07] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-31 22:06:10] [INFO ] [Real]Absence check using state equation in 3358 ms returned sat
[2024-05-31 22:06:12] [INFO ] [Real]Added 14384 Read/Feed constraints in 1395 ms returned sat
[2024-05-31 22:06:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:06:13] [INFO ] [Nat]Absence check using 60 positive place invariants in 76 ms returned sat
[2024-05-31 22:06:13] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-31 22:06:16] [INFO ] [Nat]Absence check using state equation in 3504 ms returned sat
[2024-05-31 22:06:18] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1403 ms returned sat
[2024-05-31 22:06:19] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 746 ms.
Minimization took 6079 ms.
[2024-05-31 22:06:25] [INFO ] [Real]Absence check using 60 positive place invariants in 68 ms returned sat
[2024-05-31 22:06:25] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-31 22:06:29] [INFO ] [Real]Absence check using state equation in 3488 ms returned sat
[2024-05-31 22:06:30] [INFO ] [Real]Added 14384 Read/Feed constraints in 1324 ms returned sat
[2024-05-31 22:06:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:06:31] [INFO ] [Nat]Absence check using 60 positive place invariants in 74 ms returned sat
[2024-05-31 22:06:31] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-31 22:06:34] [INFO ] [Nat]Absence check using state equation in 3429 ms returned sat
[2024-05-31 22:06:36] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1575 ms returned sat
[2024-05-31 22:06:37] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 753 ms.
Minimization took 5867 ms.
[2024-05-31 22:06:43] [INFO ] [Real]Absence check using 60 positive place invariants in 67 ms returned sat
[2024-05-31 22:06:43] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 35 ms returned sat
[2024-05-31 22:06:47] [INFO ] [Real]Absence check using state equation in 3398 ms returned sat
[2024-05-31 22:06:48] [INFO ] [Real]Added 14384 Read/Feed constraints in 1278 ms returned sat
[2024-05-31 22:06:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:06:49] [INFO ] [Nat]Absence check using 60 positive place invariants in 77 ms returned sat
[2024-05-31 22:06:49] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-31 22:06:53] [INFO ] [Nat]Absence check using state equation in 3355 ms returned sat
[2024-05-31 22:06:54] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1310 ms returned sat
[2024-05-31 22:06:55] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 839 ms.
Minimization took 5937 ms.
[2024-05-31 22:07:01] [INFO ] [Real]Absence check using 60 positive place invariants in 67 ms returned sat
[2024-05-31 22:07:01] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-31 22:07:05] [INFO ] [Real]Absence check using state equation in 3301 ms returned sat
[2024-05-31 22:07:06] [INFO ] [Real]Added 14384 Read/Feed constraints in 1359 ms returned sat
[2024-05-31 22:07:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:07:07] [INFO ] [Nat]Absence check using 60 positive place invariants in 77 ms returned sat
[2024-05-31 22:07:07] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-31 22:07:11] [INFO ] [Nat]Absence check using state equation in 3399 ms returned sat
[2024-05-31 22:07:12] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1286 ms returned sat
[2024-05-31 22:07:13] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 703 ms.
Minimization took 5959 ms.
[2024-05-31 22:07:19] [INFO ] [Real]Absence check using 60 positive place invariants in 65 ms returned sat
[2024-05-31 22:07:19] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-31 22:07:23] [INFO ] [Real]Absence check using state equation in 3260 ms returned sat
[2024-05-31 22:07:24] [INFO ] [Real]Added 14384 Read/Feed constraints in 1259 ms returned sat
[2024-05-31 22:07:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:07:25] [INFO ] [Nat]Absence check using 60 positive place invariants in 71 ms returned sat
[2024-05-31 22:07:25] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-31 22:07:28] [INFO ] [Nat]Absence check using state equation in 3404 ms returned sat
[2024-05-31 22:07:30] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1376 ms returned sat
[2024-05-31 22:07:31] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 767 ms.
Minimization took 5893 ms.
[2024-05-31 22:07:37] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2024-05-31 22:07:37] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-31 22:07:40] [INFO ] [Real]Absence check using state equation in 3316 ms returned sat
[2024-05-31 22:07:42] [INFO ] [Real]Added 14384 Read/Feed constraints in 1152 ms returned sat
[2024-05-31 22:07:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:07:42] [INFO ] [Nat]Absence check using 60 positive place invariants in 73 ms returned sat
[2024-05-31 22:07:43] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-31 22:07:46] [INFO ] [Nat]Absence check using state equation in 3398 ms returned sat
[2024-05-31 22:07:47] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1385 ms returned sat
[2024-05-31 22:07:48] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 735 ms.
Minimization took 5936 ms.
[2024-05-31 22:07:55] [INFO ] [Real]Absence check using 60 positive place invariants in 74 ms returned sat
[2024-05-31 22:07:55] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-31 22:07:58] [INFO ] [Real]Absence check using state equation in 3408 ms returned sat
[2024-05-31 22:08:00] [INFO ] [Real]Added 14384 Read/Feed constraints in 1254 ms returned sat
[2024-05-31 22:08:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:08:00] [INFO ] [Nat]Absence check using 60 positive place invariants in 73 ms returned sat
[2024-05-31 22:08:00] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-31 22:08:04] [INFO ] [Nat]Absence check using state equation in 3325 ms returned sat
[2024-05-31 22:08:05] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1371 ms returned sat
[2024-05-31 22:08:06] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 753 ms.
Minimization took 5932 ms.
[2024-05-31 22:08:13] [INFO ] [Real]Absence check using 60 positive place invariants in 62 ms returned sat
[2024-05-31 22:08:13] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-31 22:08:16] [INFO ] [Real]Absence check using state equation in 3229 ms returned sat
[2024-05-31 22:08:17] [INFO ] [Real]Added 14384 Read/Feed constraints in 1206 ms returned sat
[2024-05-31 22:08:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:08:18] [INFO ] [Nat]Absence check using 60 positive place invariants in 73 ms returned sat
[2024-05-31 22:08:18] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 29 ms returned sat
[2024-05-31 22:08:21] [INFO ] [Nat]Absence check using state equation in 3367 ms returned sat
[2024-05-31 22:08:23] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1376 ms returned sat
[2024-05-31 22:08:24] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 705 ms.
Minimization took 6002 ms.
[2024-05-31 22:08:30] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2024-05-31 22:08:30] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-31 22:08:34] [INFO ] [Real]Absence check using state equation in 3367 ms returned sat
[2024-05-31 22:08:35] [INFO ] [Real]Added 14384 Read/Feed constraints in 1331 ms returned sat
[2024-05-31 22:08:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:08:36] [INFO ] [Nat]Absence check using 60 positive place invariants in 77 ms returned sat
[2024-05-31 22:08:36] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-31 22:08:39] [INFO ] [Nat]Absence check using state equation in 3383 ms returned sat
[2024-05-31 22:08:41] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1584 ms returned sat
[2024-05-31 22:08:42] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 768 ms.
Minimization took 5943 ms.
[2024-05-31 22:08:48] [INFO ] [Real]Absence check using 60 positive place invariants in 64 ms returned sat
[2024-05-31 22:08:48] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-31 22:08:52] [INFO ] [Real]Absence check using state equation in 3443 ms returned sat
[2024-05-31 22:08:54] [INFO ] [Real]Added 14384 Read/Feed constraints in 1357 ms returned sat
[2024-05-31 22:08:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:08:54] [INFO ] [Nat]Absence check using 60 positive place invariants in 75 ms returned sat
[2024-05-31 22:08:54] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-31 22:08:58] [INFO ] [Nat]Absence check using state equation in 3319 ms returned sat
[2024-05-31 22:08:59] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1737 ms returned sat
[2024-05-31 22:09:00] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 726 ms.
Minimization took 5975 ms.
[2024-05-31 22:09:07] [INFO ] [Real]Absence check using 60 positive place invariants in 62 ms returned sat
[2024-05-31 22:09:07] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-31 22:09:10] [INFO ] [Real]Absence check using state equation in 3416 ms returned sat
[2024-05-31 22:09:12] [INFO ] [Real]Added 14384 Read/Feed constraints in 1173 ms returned sat
[2024-05-31 22:09:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:09:12] [INFO ] [Nat]Absence check using 60 positive place invariants in 72 ms returned sat
[2024-05-31 22:09:12] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-31 22:09:16] [INFO ] [Nat]Absence check using state equation in 3507 ms returned sat
[2024-05-31 22:09:17] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1498 ms returned sat
[2024-05-31 22:09:19] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 761 ms.
Minimization took 5953 ms.
[2024-05-31 22:09:25] [INFO ] [Real]Absence check using 60 positive place invariants in 65 ms returned sat
[2024-05-31 22:09:25] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-31 22:09:28] [INFO ] [Real]Absence check using state equation in 3409 ms returned sat
[2024-05-31 22:09:30] [INFO ] [Real]Added 14384 Read/Feed constraints in 1276 ms returned sat
[2024-05-31 22:09:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:09:31] [INFO ] [Nat]Absence check using 60 positive place invariants in 75 ms returned sat
[2024-05-31 22:09:31] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 29 ms returned sat
[2024-05-31 22:09:34] [INFO ] [Nat]Absence check using state equation in 3398 ms returned sat
[2024-05-31 22:09:36] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1460 ms returned sat
[2024-05-31 22:09:37] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 742 ms.
Minimization took 5945 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60]
Support contains 14 out of 3967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Applied a total of 0 rules in 785 ms. Remains 3967 /3967 variables (removed 0) and now considering 14587/14587 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 785 ms. Remains : 3967/3967 places, 14587/14587 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Applied a total of 0 rules in 775 ms. Remains 3967 /3967 variables (removed 0) and now considering 14587/14587 (removed 0) transitions.
[2024-05-31 22:09:44] [INFO ] Invariant cache hit.
[2024-05-31 22:09:51] [INFO ] Implicit Places using invariants in 6455 ms returned []
Implicit Place search using SMT only with invariants took 6457 ms to find 0 implicit places.
Running 14527 sub problems to find dead transitions.
[2024-05-31 22:09:51] [INFO ] Invariant cache hit.
[2024-05-31 22:09:51] [INFO ] State equation strengthened by 14384 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3966 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14527 unsolved
SMT process timed out in 55729ms, After SMT, problems are : Problem set: 0 solved, 14527 unsolved
Search for dead transitions found 0 dead transitions in 55848ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63110 ms. Remains : 3967/3967 places, 14587/14587 transitions.
RANDOM walk for 40000 steps (142 resets) in 2270 ms. (17 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
Interrupted probabilistic random walk after 59376 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 28
Probabilistic random walk after 59376 steps, saw 30299 distinct states, run finished after 3008 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-31 22:10:50] [INFO ] Invariant cache hit.
[2024-05-31 22:10:51] [INFO ] State equation strengthened by 14384 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 3831/3845 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-05-31 22:10:51] [INFO ] Deduced a trap composed of 2 places in 90 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
[2024-05-31 22:10:52] [INFO ] Deduced a trap composed of 2 places in 90 ms of which 1 ms to minimize.
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
Problem MAX6 is UNSAT
Problem MAX7 is UNSAT
Problem MAX8 is UNSAT
Problem MAX9 is UNSAT
Problem MAX10 is UNSAT
Problem MAX11 is UNSAT
Problem MAX12 is UNSAT
Problem MAX13 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/3845 variables, 2/3 constraints. Problems are: Problem set: 14 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3845 variables, 0/3 constraints. Problems are: Problem set: 14 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 118/3963 variables, 59/62 constraints. Problems are: Problem set: 14 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3963/18554 variables, and 62 constraints, problems are : Problem set: 14 solved, 14 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/3967 constraints, ReadFeed: 0/14384 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 14 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 14 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 3831/3845 variables, 1/1 constraints. Problems are: Problem set: 14 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3845 variables, 2/3 constraints. Problems are: Problem set: 14 solved, 14 unsolved
[2024-05-31 22:10:56] [INFO ] Deduced a trap composed of 2 places in 100 ms of which 1 ms to minimize.
[2024-05-31 22:10:56] [INFO ] Deduced a trap composed of 2 places in 98 ms of which 1 ms to minimize.
[2024-05-31 22:10:57] [INFO ] Deduced a trap composed of 2 places in 96 ms of which 2 ms to minimize.
[2024-05-31 22:10:57] [INFO ] Deduced a trap composed of 2 places in 96 ms of which 1 ms to minimize.
[2024-05-31 22:10:57] [INFO ] Deduced a trap composed of 2 places in 95 ms of which 1 ms to minimize.
[2024-05-31 22:10:57] [INFO ] Deduced a trap composed of 2 places in 97 ms of which 1 ms to minimize.
[2024-05-31 22:10:57] [INFO ] Deduced a trap composed of 2 places in 91 ms of which 1 ms to minimize.
[2024-05-31 22:10:57] [INFO ] Deduced a trap composed of 2 places in 97 ms of which 1 ms to minimize.
[2024-05-31 22:10:57] [INFO ] Deduced a trap composed of 2 places in 95 ms of which 1 ms to minimize.
[2024-05-31 22:10:58] [INFO ] Deduced a trap composed of 2 places in 95 ms of which 1 ms to minimize.
[2024-05-31 22:10:58] [INFO ] Deduced a trap composed of 2 places in 92 ms of which 1 ms to minimize.
[2024-05-31 22:10:58] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 1 ms to minimize.
[2024-05-31 22:10:58] [INFO ] Deduced a trap composed of 2 places in 95 ms of which 1 ms to minimize.
[2024-05-31 22:10:58] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 1 ms to minimize.
[2024-05-31 22:10:58] [INFO ] Deduced a trap composed of 2 places in 94 ms of which 1 ms to minimize.
[2024-05-31 22:10:58] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 1 ms to minimize.
[2024-05-31 22:10:58] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 1 ms to minimize.
[2024-05-31 22:10:59] [INFO ] Deduced a trap composed of 2 places in 89 ms of which 1 ms to minimize.
[2024-05-31 22:10:59] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 1 ms to minimize.
[2024-05-31 22:10:59] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/3845 variables, 20/23 constraints. Problems are: Problem set: 14 solved, 14 unsolved
[2024-05-31 22:10:59] [INFO ] Deduced a trap composed of 2 places in 89 ms of which 1 ms to minimize.
[2024-05-31 22:10:59] [INFO ] Deduced a trap composed of 2 places in 92 ms of which 1 ms to minimize.
[2024-05-31 22:10:59] [INFO ] Deduced a trap composed of 2 places in 91 ms of which 1 ms to minimize.
[2024-05-31 22:10:59] [INFO ] Deduced a trap composed of 2 places in 98 ms of which 1 ms to minimize.
[2024-05-31 22:11:00] [INFO ] Deduced a trap composed of 2 places in 92 ms of which 2 ms to minimize.
[2024-05-31 22:11:00] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
[2024-05-31 22:11:00] [INFO ] Deduced a trap composed of 2 places in 89 ms of which 1 ms to minimize.
[2024-05-31 22:11:00] [INFO ] Deduced a trap composed of 2 places in 92 ms of which 1 ms to minimize.
[2024-05-31 22:11:00] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 0 ms to minimize.
[2024-05-31 22:11:00] [INFO ] Deduced a trap composed of 2 places in 90 ms of which 1 ms to minimize.
[2024-05-31 22:11:00] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 1 ms to minimize.
[2024-05-31 22:11:01] [INFO ] Deduced a trap composed of 2 places in 89 ms of which 1 ms to minimize.
[2024-05-31 22:11:01] [INFO ] Deduced a trap composed of 2 places in 90 ms of which 0 ms to minimize.
SMT process timed out in 10334ms, After SMT, problems are : Problem set: 14 solved, 14 unsolved
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 14 out of 3967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Applied a total of 0 rules in 736 ms. Remains 3967 /3967 variables (removed 0) and now considering 14587/14587 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 740 ms. Remains : 3967/3967 places, 14587/14587 transitions.
RANDOM walk for 40000 steps (144 resets) in 1130 ms. (35 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 61980 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 14
Probabilistic random walk after 61980 steps, saw 30628 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
[2024-05-31 22:11:05] [INFO ] Invariant cache hit.
[2024-05-31 22:11:05] [INFO ] State equation strengthened by 14384 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 3831/3845 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 22:11:06] [INFO ] Deduced a trap composed of 2 places in 96 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3845 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3845 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 118/3963 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3963 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 2/3965 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 22:11:16] [INFO ] Deduced a trap composed of 71 places in 5202 ms of which 26 ms to minimize.
[2024-05-31 22:11:21] [INFO ] Deduced a trap composed of 72 places in 5044 ms of which 25 ms to minimize.
[2024-05-31 22:11:26] [INFO ] Deduced a trap composed of 70 places in 5022 ms of which 24 ms to minimize.
[2024-05-31 22:11:31] [INFO ] Deduced a trap composed of 101 places in 5177 ms of which 25 ms to minimize.
[2024-05-31 22:11:36] [INFO ] Deduced a trap composed of 68 places in 5020 ms of which 24 ms to minimize.
[2024-05-31 22:11:41] [INFO ] Deduced a trap composed of 75 places in 4921 ms of which 24 ms to minimize.
[2024-05-31 22:11:46] [INFO ] Deduced a trap composed of 67 places in 5042 ms of which 23 ms to minimize.
[2024-05-31 22:11:51] [INFO ] Deduced a trap composed of 86 places in 4992 ms of which 25 ms to minimize.
SMT process timed out in 46372ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 14 out of 3967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Applied a total of 0 rules in 769 ms. Remains 3967 /3967 variables (removed 0) and now considering 14587/14587 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 769 ms. Remains : 3967/3967 places, 14587/14587 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Applied a total of 0 rules in 766 ms. Remains 3967 /3967 variables (removed 0) and now considering 14587/14587 (removed 0) transitions.
[2024-05-31 22:11:53] [INFO ] Invariant cache hit.
[2024-05-31 22:11:59] [INFO ] Implicit Places using invariants in 6372 ms returned []
Implicit Place search using SMT only with invariants took 6373 ms to find 0 implicit places.
Running 14527 sub problems to find dead transitions.
[2024-05-31 22:12:00] [INFO ] Invariant cache hit.
[2024-05-31 22:12:00] [INFO ] State equation strengthened by 14384 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3966 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14527 unsolved
SMT process timed out in 57821ms, After SMT, problems are : Problem set: 0 solved, 14527 unsolved
Search for dead transitions found 0 dead transitions in 57954ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65125 ms. Remains : 3967/3967 places, 14587/14587 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60]
Starting property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[60]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[60]
[2024-05-31 22:12:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[60]
RANDOM walk for 10000 steps (35 resets) in 192 ms. (51 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 19 ms. (500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-31 22:12:58] [INFO ] Invariant cache hit.
[2024-05-31 22:12:58] [INFO ] [Real]Absence check using 60 positive place invariants in 65 ms returned sat
[2024-05-31 22:12:58] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-31 22:13:02] [INFO ] [Real]Absence check using state equation in 3426 ms returned sat
[2024-05-31 22:13:02] [INFO ] State equation strengthened by 14384 read => feed constraints.
[2024-05-31 22:13:03] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 22:13:03] [INFO ] [Real]Added 14384 Read/Feed constraints in 692 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 3962 transition count 14582
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 3962 transition count 14582
Applied a total of 18 rules in 2008 ms. Remains 3962 /3967 variables (removed 5) and now considering 14582/14587 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2009 ms. Remains : 3962/3967 places, 14582/14587 transitions.
// Phase 1: matrix 14582 rows 3962 cols
[2024-05-31 22:13:05] [INFO ] Computed 62 invariants in 565 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[60]
RANDOM walk for 1000000 steps (3640 resets) in 19353 ms. (51 steps per ms)
BEST_FIRST walk for 1000001 steps (48 resets) in 1765 ms. (566 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-31 22:13:26] [INFO ] Invariant cache hit.
[2024-05-31 22:13:27] [INFO ] [Real]Absence check using 60 positive place invariants in 68 ms returned sat
[2024-05-31 22:13:27] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 35 ms returned sat
[2024-05-31 22:13:30] [INFO ] [Real]Absence check using state equation in 3337 ms returned sat
[2024-05-31 22:13:31] [INFO ] State equation strengthened by 14402 read => feed constraints.
[2024-05-31 22:13:32] [INFO ] [Real]Added 14402 Read/Feed constraints in 1202 ms returned sat
[2024-05-31 22:13:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:13:32] [INFO ] [Nat]Absence check using 60 positive place invariants in 74 ms returned sat
[2024-05-31 22:13:33] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 33 ms returned sat
[2024-05-31 22:13:36] [INFO ] [Nat]Absence check using state equation in 3364 ms returned sat
[2024-05-31 22:13:37] [INFO ] [Nat]Added 14402 Read/Feed constraints in 1307 ms returned sat
[2024-05-31 22:13:38] [INFO ] Computed and/alt/rep : 10628/28280/10628 causal constraints (skipped 3894 transitions) in 712 ms.
Minimization took 6041 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 773 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 773 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 776 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
[2024-05-31 22:13:46] [INFO ] Invariant cache hit.
[2024-05-31 22:13:52] [INFO ] Implicit Places using invariants in 6432 ms returned []
Implicit Place search using SMT only with invariants took 6435 ms to find 0 implicit places.
Running 14522 sub problems to find dead transitions.
[2024-05-31 22:13:52] [INFO ] Invariant cache hit.
[2024-05-31 22:13:53] [INFO ] State equation strengthened by 14402 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3961 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14522 unsolved
SMT process timed out in 58851ms, After SMT, problems are : Problem set: 0 solved, 14522 unsolved
Search for dead transitions found 0 dead transitions in 58984ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66228 ms. Remains : 3962/3962 places, 14582/14582 transitions.
RANDOM walk for 40000 steps (143 resets) in 955 ms. (41 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 66140 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 2
Probabilistic random walk after 66140 steps, saw 31182 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-31 22:14:55] [INFO ] Invariant cache hit.
[2024-05-31 22:14:55] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3839/3840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:14:55] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/3840 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3840 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/3958 variables, 59/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3958 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3960 variables, 2/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 22:15:01] [INFO ] Deduced a trap composed of 76 places in 5451 ms of which 25 ms to minimize.
SMT process timed out in 6621ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 748 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 749 ms. Remains : 3962/3962 places, 14582/14582 transitions.
RANDOM walk for 40000 steps (143 resets) in 996 ms. (40 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 69617 steps, run timeout after 3005 ms. (steps per millisecond=23 ) properties seen :0 out of 1
Probabilistic random walk after 69617 steps, saw 31579 distinct states, run finished after 3005 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-31 22:15:05] [INFO ] Invariant cache hit.
[2024-05-31 22:15:06] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3839/3840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:15:06] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3840 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3840 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/3958 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3958 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3960 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:15:12] [INFO ] Deduced a trap composed of 65 places in 5551 ms of which 26 ms to minimize.
[2024-05-31 22:15:12] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 2 ms to minimize.
[2024-05-31 22:15:13] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 2 ms to minimize.
[2024-05-31 22:15:13] [INFO ] Deduced a trap composed of 75 places in 106 ms of which 3 ms to minimize.
[2024-05-31 22:15:13] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 2 ms to minimize.
[2024-05-31 22:15:13] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3960 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3960 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 14582/18542 variables, 3960/4029 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/18542 variables, 14402/18431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/18542 variables, 0/18431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/18544 variables, 2/18433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/18544 variables, 0/18433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/18544 variables, 0/18433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18544/18544 variables, and 18433 constraints, problems are : Problem set: 0 solved, 1 unsolved in 17752 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 3962/3962 constraints, ReadFeed: 14402/14402 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3839/3840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3840 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:15:24] [INFO ] Deduced a trap composed of 2 places in 90 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/3840 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3840 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/3958 variables, 59/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3958 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3960 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3960 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:15:30] [INFO ] Deduced a trap composed of 87 places in 5463 ms of which 27 ms to minimize.
[2024-05-31 22:15:30] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 2 ms to minimize.
[2024-05-31 22:15:30] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/3960 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3960 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14582/18542 variables, 3960/4033 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/18542 variables, 14402/18435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/18542 variables, 1/18436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/18542 variables, 0/18436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/18544 variables, 2/18438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/18544 variables, 0/18438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/18544 variables, 0/18438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18544/18544 variables, and 18438 constraints, problems are : Problem set: 0 solved, 1 unsolved in 20778 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 3962/3962 constraints, ReadFeed: 14402/14402 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 38690ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 64 ms.
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 770 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 770 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 776 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
[2024-05-31 22:15:46] [INFO ] Invariant cache hit.
[2024-05-31 22:15:52] [INFO ] Implicit Places using invariants in 6518 ms returned []
Implicit Place search using SMT only with invariants took 6520 ms to find 0 implicit places.
Running 14522 sub problems to find dead transitions.
[2024-05-31 22:15:52] [INFO ] Invariant cache hit.
[2024-05-31 22:15:53] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3961 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14522 unsolved
SMT process timed out in 56992ms, After SMT, problems are : Problem set: 0 solved, 14522 unsolved
Search for dead transitions found 0 dead transitions in 57113ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64435 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[60]
Ending property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-00 in 232058 ms.
Starting property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[60]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[60]
// Phase 1: matrix 14587 rows 3967 cols
[2024-05-31 22:16:50] [INFO ] Computed 62 invariants in 536 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[60]
RANDOM walk for 10000 steps (36 resets) in 254 ms. (39 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 22 ms. (434 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-31 22:16:50] [INFO ] Invariant cache hit.
[2024-05-31 22:16:51] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2024-05-31 22:16:51] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-31 22:16:54] [INFO ] [Real]Absence check using state equation in 3511 ms returned sat
[2024-05-31 22:16:55] [INFO ] State equation strengthened by 14384 read => feed constraints.
[2024-05-31 22:16:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: 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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 3962 transition count 14582
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 3962 transition count 14582
Applied a total of 18 rules in 2124 ms. Remains 3962 /3967 variables (removed 5) and now considering 14582/14587 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2125 ms. Remains : 3962/3967 places, 14582/14587 transitions.
// Phase 1: matrix 14582 rows 3962 cols
[2024-05-31 22:16:58] [INFO ] Computed 62 invariants in 559 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[60]
RANDOM walk for 1000000 steps (3635 resets) in 21623 ms. (46 steps per ms)
BEST_FIRST walk for 1000001 steps (48 resets) in 1886 ms. (529 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-31 22:17:22] [INFO ] Invariant cache hit.
[2024-05-31 22:17:22] [INFO ] [Real]Absence check using 60 positive place invariants in 62 ms returned sat
[2024-05-31 22:17:22] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 29 ms returned sat
[2024-05-31 22:17:25] [INFO ] [Real]Absence check using state equation in 3291 ms returned sat
[2024-05-31 22:17:26] [INFO ] State equation strengthened by 14402 read => feed constraints.
[2024-05-31 22:17:27] [INFO ] [Real]Added 14402 Read/Feed constraints in 1184 ms returned sat
[2024-05-31 22:17:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:17:28] [INFO ] [Nat]Absence check using 60 positive place invariants in 73 ms returned sat
[2024-05-31 22:17:28] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 29 ms returned sat
[2024-05-31 22:17:31] [INFO ] [Nat]Absence check using state equation in 3379 ms returned sat
[2024-05-31 22:17:32] [INFO ] [Nat]Added 14402 Read/Feed constraints in 1422 ms returned sat
[2024-05-31 22:17:34] [INFO ] Computed and/alt/rep : 10628/28280/10628 causal constraints (skipped 3894 transitions) in 764 ms.
Minimization took 7209 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 772 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 772 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 783 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
[2024-05-31 22:17:42] [INFO ] Invariant cache hit.
[2024-05-31 22:17:49] [INFO ] Implicit Places using invariants in 6437 ms returned []
Implicit Place search using SMT only with invariants took 6441 ms to find 0 implicit places.
Running 14522 sub problems to find dead transitions.
[2024-05-31 22:17:49] [INFO ] Invariant cache hit.
[2024-05-31 22:17:49] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3961 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14522 unsolved
SMT process timed out in 59959ms, After SMT, problems are : Problem set: 0 solved, 14522 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67331 ms. Remains : 3962/3962 places, 14582/14582 transitions.
RANDOM walk for 40000 steps (144 resets) in 1186 ms. (33 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 65650 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 2
Probabilistic random walk after 65650 steps, saw 31107 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-31 22:18:52] [INFO ] Invariant cache hit.
[2024-05-31 22:18:52] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3839/3840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:18:53] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/3840 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3840 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/3958 variables, 59/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3958 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3960 variables, 2/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 22:18:59] [INFO ] Deduced a trap composed of 76 places in 5622 ms of which 26 ms to minimize.
SMT process timed out in 6790ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 1073 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1073 ms. Remains : 3962/3962 places, 14582/14582 transitions.
RANDOM walk for 40000 steps (142 resets) in 1058 ms. (37 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 69427 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 1
Probabilistic random walk after 69427 steps, saw 31556 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-31 22:19:04] [INFO ] Invariant cache hit.
[2024-05-31 22:19:04] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3839/3840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:19:04] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3840 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3840 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/3958 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3958 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3960 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:19:10] [INFO ] Deduced a trap composed of 67 places in 5336 ms of which 25 ms to minimize.
[2024-05-31 22:19:15] [INFO ] Deduced a trap composed of 69 places in 5118 ms of which 25 ms to minimize.
[2024-05-31 22:19:21] [INFO ] Deduced a trap composed of 89 places in 5246 ms of which 24 ms to minimize.
[2024-05-31 22:19:26] [INFO ] Deduced a trap composed of 78 places in 5240 ms of which 26 ms to minimize.
[2024-05-31 22:19:31] [INFO ] Deduced a trap composed of 82 places in 5224 ms of which 26 ms to minimize.
[2024-05-31 22:19:36] [INFO ] Deduced a trap composed of 73 places in 5065 ms of which 26 ms to minimize.
[2024-05-31 22:19:42] [INFO ] Deduced a trap composed of 87 places in 5240 ms of which 25 ms to minimize.
[2024-05-31 22:19:47] [INFO ] Deduced a trap composed of 92 places in 5015 ms of which 25 ms to minimize.
[2024-05-31 22:19:52] [INFO ] Deduced a trap composed of 88 places in 5120 ms of which 23 ms to minimize.
SMT process timed out in 48209ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 736 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 736 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 764 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
[2024-05-31 22:19:53] [INFO ] Invariant cache hit.
[2024-05-31 22:20:00] [INFO ] Implicit Places using invariants in 6304 ms returned []
Implicit Place search using SMT only with invariants took 6304 ms to find 0 implicit places.
Running 14522 sub problems to find dead transitions.
[2024-05-31 22:20:00] [INFO ] Invariant cache hit.
[2024-05-31 22:20:00] [INFO ] State equation strengthened by 14402 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3961 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14522 unsolved
SMT process timed out in 56718ms, After SMT, problems are : Problem set: 0 solved, 14522 unsolved
Search for dead transitions found 0 dead transitions in 56839ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63934 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[60]
Ending property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-01 in 247062 ms.
Starting property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[60]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[60]
// Phase 1: matrix 14587 rows 3967 cols
[2024-05-31 22:20:57] [INFO ] Computed 62 invariants in 547 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[60]
RANDOM walk for 10000 steps (37 resets) in 234 ms. (42 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 22 ms. (434 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-31 22:20:57] [INFO ] Invariant cache hit.
[2024-05-31 22:20:58] [INFO ] [Real]Absence check using 60 positive place invariants in 67 ms returned sat
[2024-05-31 22:20:58] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-31 22:21:01] [INFO ] [Real]Absence check using state equation in 3388 ms returned sat
[2024-05-31 22:21:02] [INFO ] State equation strengthened by 14384 read => feed constraints.
[2024-05-31 22:21:02] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 22:21:02] [INFO ] [Real]Added 14384 Read/Feed constraints in 702 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 3963 transition count 14583
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 17 place count 3963 transition count 14583
Applied a total of 17 rules in 2113 ms. Remains 3963 /3967 variables (removed 4) and now considering 14583/14587 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2113 ms. Remains : 3963/3967 places, 14583/14587 transitions.
// Phase 1: matrix 14583 rows 3963 cols
[2024-05-31 22:21:05] [INFO ] Computed 62 invariants in 541 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[60]
RANDOM walk for 1000000 steps (3639 resets) in 19405 ms. (51 steps per ms)
BEST_FIRST walk for 1000001 steps (47 resets) in 1768 ms. (565 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-31 22:21:26] [INFO ] Invariant cache hit.
[2024-05-31 22:21:27] [INFO ] [Real]Absence check using 60 positive place invariants in 63 ms returned sat
[2024-05-31 22:21:27] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-31 22:21:30] [INFO ] [Real]Absence check using state equation in 3199 ms returned sat
[2024-05-31 22:21:30] [INFO ] State equation strengthened by 14401 read => feed constraints.
[2024-05-31 22:21:32] [INFO ] [Real]Added 14401 Read/Feed constraints in 1646 ms returned sat
[2024-05-31 22:21:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:21:33] [INFO ] [Nat]Absence check using 60 positive place invariants in 76 ms returned sat
[2024-05-31 22:21:33] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 33 ms returned sat
[2024-05-31 22:21:36] [INFO ] [Nat]Absence check using state equation in 3293 ms returned sat
[2024-05-31 22:21:38] [INFO ] [Nat]Added 14401 Read/Feed constraints in 1918 ms returned sat
[2024-05-31 22:21:39] [INFO ] Computed and/alt/rep : 10629/28278/10629 causal constraints (skipped 3894 transitions) in 779 ms.
Minimization took 6360 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 760 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 760 ms. Remains : 3963/3963 places, 14583/14583 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 757 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
[2024-05-31 22:21:47] [INFO ] Invariant cache hit.
[2024-05-31 22:21:53] [INFO ] Implicit Places using invariants in 6536 ms returned []
Implicit Place search using SMT only with invariants took 6537 ms to find 0 implicit places.
Running 14523 sub problems to find dead transitions.
[2024-05-31 22:21:54] [INFO ] Invariant cache hit.
[2024-05-31 22:21:54] [INFO ] State equation strengthened by 14401 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3962 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14523 unsolved
SMT process timed out in 57112ms, After SMT, problems are : Problem set: 0 solved, 14523 unsolved
Search for dead transitions found 0 dead transitions in 57238ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64550 ms. Remains : 3963/3963 places, 14583/14583 transitions.
RANDOM walk for 40000 steps (144 resets) in 1084 ms. (36 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 64921 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 2
Probabilistic random walk after 64921 steps, saw 31031 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-31 22:22:54] [INFO ] Invariant cache hit.
[2024-05-31 22:22:54] [INFO ] State equation strengthened by 14401 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3840/3841 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:22:55] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/3841 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3841 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/3959 variables, 59/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3959 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3961 variables, 2/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 22:23:01] [INFO ] Deduced a trap composed of 77 places in 5480 ms of which 26 ms to minimize.
SMT process timed out in 6666ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 747 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 747 ms. Remains : 3963/3963 places, 14583/14583 transitions.
RANDOM walk for 40000 steps (142 resets) in 871 ms. (45 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 70070 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 1
Probabilistic random walk after 70070 steps, saw 31616 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-31 22:23:05] [INFO ] Invariant cache hit.
[2024-05-31 22:23:05] [INFO ] State equation strengthened by 14401 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3840/3841 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:23:06] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 1 ms to minimize.
[2024-05-31 22:23:06] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:23:06] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
[2024-05-31 22:23:06] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 1 ms to minimize.
[2024-05-31 22:23:06] [INFO ] Deduced a trap composed of 2 places in 104 ms of which 1 ms to minimize.
[2024-05-31 22:23:06] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 1 ms to minimize.
[2024-05-31 22:23:06] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
[2024-05-31 22:23:06] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 1 ms to minimize.
[2024-05-31 22:23:07] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 1 ms to minimize.
[2024-05-31 22:23:07] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 1 ms to minimize.
[2024-05-31 22:23:07] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:23:07] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
[2024-05-31 22:23:07] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 1 ms to minimize.
[2024-05-31 22:23:07] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 1 ms to minimize.
[2024-05-31 22:23:07] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:23:08] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:23:08] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 1 ms to minimize.
[2024-05-31 22:23:08] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 0 ms to minimize.
[2024-05-31 22:23:08] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
[2024-05-31 22:23:08] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3841 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:23:08] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 1 ms to minimize.
[2024-05-31 22:23:08] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:23:08] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:23:09] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:23:09] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:23:09] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:23:09] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 1 ms to minimize.
[2024-05-31 22:23:09] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 1 ms to minimize.
[2024-05-31 22:23:09] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 1 ms to minimize.
[2024-05-31 22:23:09] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:23:09] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:23:10] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:23:10] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 0 ms to minimize.
[2024-05-31 22:23:10] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:23:10] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:23:10] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:23:10] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:23:10] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:23:10] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:23:11] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/3841 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:23:11] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:23:11] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 0 ms to minimize.
[2024-05-31 22:23:11] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:23:11] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 0 ms to minimize.
[2024-05-31 22:23:11] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:23:11] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:23:12] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:23:12] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:23:12] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:23:12] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:23:12] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 0 ms to minimize.
[2024-05-31 22:23:12] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 0 ms to minimize.
[2024-05-31 22:23:12] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 0 ms to minimize.
[2024-05-31 22:23:12] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 1 ms to minimize.
[2024-05-31 22:23:13] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:23:13] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/3841 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3841 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 118/3959 variables, 59/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3959 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3961 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3961 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14583/18544 variables, 3961/4079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 18544/18546 variables, and 18480 constraints, problems are : Problem set: 0 solved, 1 unsolved in 17551 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 3961/3963 constraints, ReadFeed: 14401/14401 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3840/3841 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3841 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:23:23] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 0 ms to minimize.
[2024-05-31 22:23:23] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:23:23] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/3841 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3841 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/3959 variables, 59/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3959 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3961 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:23:29] [INFO ] Deduced a trap composed of 80 places in 5388 ms of which 27 ms to minimize.
[2024-05-31 22:23:35] [INFO ] Deduced a trap composed of 66 places in 5409 ms of which 27 ms to minimize.
[2024-05-31 22:23:40] [INFO ] Deduced a trap composed of 72 places in 5585 ms of which 27 ms to minimize.
[2024-05-31 22:23:46] [INFO ] Deduced a trap composed of 100 places in 5416 ms of which 25 ms to minimize.
[2024-05-31 22:23:51] [INFO ] Deduced a trap composed of 65 places in 5197 ms of which 24 ms to minimize.
[2024-05-31 22:23:57] [INFO ] Deduced a trap composed of 68 places in 5516 ms of which 25 ms to minimize.
[2024-05-31 22:24:02] [INFO ] Deduced a trap composed of 90 places in 5459 ms of which 24 ms to minimize.
[2024-05-31 22:24:08] [INFO ] Deduced a trap composed of 83 places in 5551 ms of which 24 ms to minimize.
SMT process timed out in 62985ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 744 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 744 ms. Remains : 3963/3963 places, 14583/14583 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 762 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
[2024-05-31 22:24:09] [INFO ] Invariant cache hit.
[2024-05-31 22:24:16] [INFO ] Implicit Places using invariants in 6216 ms returned []
Implicit Place search using SMT only with invariants took 6218 ms to find 0 implicit places.
Running 14523 sub problems to find dead transitions.
[2024-05-31 22:24:16] [INFO ] Invariant cache hit.
[2024-05-31 22:24:16] [INFO ] State equation strengthened by 14401 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3962 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14523 unsolved
SMT process timed out in 57210ms, After SMT, problems are : Problem set: 0 solved, 14523 unsolved
Search for dead transitions found 0 dead transitions in 57326ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64323 ms. Remains : 3963/3963 places, 14583/14583 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[60]
Ending property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-03 in 256367 ms.
Starting property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[60]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[60]
// Phase 1: matrix 14587 rows 3967 cols
[2024-05-31 22:25:13] [INFO ] Computed 62 invariants in 529 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[60]
RANDOM walk for 10000 steps (36 resets) in 193 ms. (51 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 19 ms. (500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[60]
[2024-05-31 22:25:14] [INFO ] Invariant cache hit.
[2024-05-31 22:25:14] [INFO ] [Real]Absence check using 60 positive place invariants in 68 ms returned sat
[2024-05-31 22:25:14] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-31 22:25:18] [INFO ] [Real]Absence check using state equation in 3417 ms returned sat
[2024-05-31 22:25:18] [INFO ] State equation strengthened by 14384 read => feed constraints.
[2024-05-31 22:25:19] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 22:25:19] [INFO ] [Real]Added 14384 Read/Feed constraints in 728 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[60]
Support contains 1 out of 3967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 3963 transition count 14583
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 17 place count 3963 transition count 14583
Applied a total of 17 rules in 2180 ms. Remains 3963 /3967 variables (removed 4) and now considering 14583/14587 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2180 ms. Remains : 3963/3967 places, 14583/14587 transitions.
// Phase 1: matrix 14583 rows 3963 cols
[2024-05-31 22:25:21] [INFO ] Computed 62 invariants in 547 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[60]
RANDOM walk for 1000000 steps (3635 resets) in 18793 ms. (53 steps per ms)
BEST_FIRST walk for 1000001 steps (46 resets) in 1758 ms. (568 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-31 22:25:42] [INFO ] Invariant cache hit.
[2024-05-31 22:25:42] [INFO ] [Real]Absence check using 60 positive place invariants in 63 ms returned sat
[2024-05-31 22:25:42] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-31 22:25:46] [INFO ] [Real]Absence check using state equation in 3197 ms returned sat
[2024-05-31 22:25:46] [INFO ] State equation strengthened by 14401 read => feed constraints.
[2024-05-31 22:25:47] [INFO ] [Real]Added 14401 Read/Feed constraints in 1308 ms returned sat
[2024-05-31 22:25:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:25:48] [INFO ] [Nat]Absence check using 60 positive place invariants in 75 ms returned sat
[2024-05-31 22:25:48] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-31 22:25:51] [INFO ] [Nat]Absence check using state equation in 3358 ms returned sat
[2024-05-31 22:25:53] [INFO ] [Nat]Added 14401 Read/Feed constraints in 1392 ms returned sat
[2024-05-31 22:25:54] [INFO ] Computed and/alt/rep : 10629/28278/10629 causal constraints (skipped 3894 transitions) in 745 ms.
Minimization took 6490 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 750 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 750 ms. Remains : 3963/3963 places, 14583/14583 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 746 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
[2024-05-31 22:26:02] [INFO ] Invariant cache hit.
[2024-05-31 22:26:08] [INFO ] Implicit Places using invariants in 6378 ms returned []
Implicit Place search using SMT only with invariants took 6380 ms to find 0 implicit places.
Running 14523 sub problems to find dead transitions.
[2024-05-31 22:26:08] [INFO ] Invariant cache hit.
[2024-05-31 22:26:09] [INFO ] State equation strengthened by 14401 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3962 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14523 unsolved
SMT process timed out in 57751ms, After SMT, problems are : Problem set: 0 solved, 14523 unsolved
Search for dead transitions found 0 dead transitions in 57862ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65004 ms. Remains : 3963/3963 places, 14583/14583 transitions.
[2024-05-31 22:27:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[60]
RANDOM walk for 1000000 steps (3639 resets) in 24274 ms. (41 steps per ms)
BEST_FIRST walk for 1000001 steps (48 resets) in 2098 ms. (476 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-31 22:27:33] [INFO ] Invariant cache hit.
[2024-05-31 22:27:33] [INFO ] [Real]Absence check using 60 positive place invariants in 74 ms returned sat
[2024-05-31 22:27:33] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 37 ms returned sat
[2024-05-31 22:27:37] [INFO ] [Real]Absence check using state equation in 3816 ms returned sat
[2024-05-31 22:27:37] [INFO ] State equation strengthened by 14401 read => feed constraints.
[2024-05-31 22:27:39] [INFO ] [Real]Added 14401 Read/Feed constraints in 1379 ms returned sat
[2024-05-31 22:27:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:27:40] [INFO ] [Nat]Absence check using 60 positive place invariants in 88 ms returned sat
[2024-05-31 22:27:40] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 35 ms returned sat
[2024-05-31 22:27:43] [INFO ] [Nat]Absence check using state equation in 3912 ms returned sat
[2024-05-31 22:27:45] [INFO ] [Nat]Added 14401 Read/Feed constraints in 1613 ms returned sat
[2024-05-31 22:27:46] [INFO ] Computed and/alt/rep : 10629/28278/10629 causal constraints (skipped 3894 transitions) in 916 ms.
Minimization took 8021 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 809 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 809 ms. Remains : 3963/3963 places, 14583/14583 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 781 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
[2024-05-31 22:27:56] [INFO ] Invariant cache hit.
[2024-05-31 22:28:02] [INFO ] Implicit Places using invariants in 6481 ms returned []
Implicit Place search using SMT only with invariants took 6482 ms to find 0 implicit places.
Running 14523 sub problems to find dead transitions.
[2024-05-31 22:28:03] [INFO ] Invariant cache hit.
[2024-05-31 22:28:03] [INFO ] State equation strengthened by 14401 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3962 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14523 unsolved
SMT process timed out in 56485ms, After SMT, problems are : Problem set: 0 solved, 14523 unsolved
Search for dead transitions found 0 dead transitions in 56638ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63918 ms. Remains : 3963/3963 places, 14583/14583 transitions.
RANDOM walk for 40000 steps (144 resets) in 847 ms. (47 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 63169 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 2
Probabilistic random walk after 63169 steps, saw 30806 distinct states, run finished after 3003 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-31 22:29:02] [INFO ] Invariant cache hit.
[2024-05-31 22:29:03] [INFO ] State equation strengthened by 14401 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3840/3841 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:29:03] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/3841 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3841 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/3959 variables, 59/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3959 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3961 variables, 2/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 22:29:09] [INFO ] Deduced a trap composed of 67 places in 5435 ms of which 26 ms to minimize.
SMT process timed out in 6696ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 749 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 749 ms. Remains : 3963/3963 places, 14583/14583 transitions.
RANDOM walk for 40000 steps (144 resets) in 845 ms. (47 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 70214 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 1
Probabilistic random walk after 70214 steps, saw 31672 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-31 22:29:13] [INFO ] Invariant cache hit.
[2024-05-31 22:29:13] [INFO ] State equation strengthened by 14401 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3840/3841 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:29:14] [INFO ] Deduced a trap composed of 2 places in 90 ms of which 2 ms to minimize.
[2024-05-31 22:29:14] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 1 ms to minimize.
[2024-05-31 22:29:14] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 1 ms to minimize.
[2024-05-31 22:29:14] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 1 ms to minimize.
[2024-05-31 22:29:14] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 1 ms to minimize.
[2024-05-31 22:29:15] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 1 ms to minimize.
[2024-05-31 22:29:15] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 1 ms to minimize.
[2024-05-31 22:29:15] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:29:15] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 1 ms to minimize.
[2024-05-31 22:29:15] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 1 ms to minimize.
[2024-05-31 22:29:15] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 1 ms to minimize.
[2024-05-31 22:29:15] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 2 ms to minimize.
[2024-05-31 22:29:16] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 1 ms to minimize.
[2024-05-31 22:29:16] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 1 ms to minimize.
[2024-05-31 22:29:16] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 1 ms to minimize.
[2024-05-31 22:29:16] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:29:16] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
[2024-05-31 22:29:16] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:29:16] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 1 ms to minimize.
[2024-05-31 22:29:16] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3841 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:29:17] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 1 ms to minimize.
[2024-05-31 22:29:17] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:29:17] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 1 ms to minimize.
[2024-05-31 22:29:17] [INFO ] Deduced a trap composed of 2 places in 96 ms of which 1 ms to minimize.
[2024-05-31 22:29:17] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:29:17] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:29:17] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:29:17] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:29:18] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:29:18] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:29:18] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:29:18] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 0 ms to minimize.
[2024-05-31 22:29:18] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:29:18] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 0 ms to minimize.
[2024-05-31 22:29:18] [INFO ] Deduced a trap composed of 2 places in 177 ms of which 1 ms to minimize.
[2024-05-31 22:29:19] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 0 ms to minimize.
[2024-05-31 22:29:19] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:29:19] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 0 ms to minimize.
[2024-05-31 22:29:19] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:29:19] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/3841 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:29:19] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:29:19] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 0 ms to minimize.
[2024-05-31 22:29:19] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:29:20] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:29:20] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:29:20] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:29:20] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:29:20] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 0 ms to minimize.
[2024-05-31 22:29:20] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:29:20] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:29:20] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 0 ms to minimize.
[2024-05-31 22:29:21] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 0 ms to minimize.
[2024-05-31 22:29:21] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:29:21] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:29:21] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:29:21] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/3841 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3841 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 118/3959 variables, 59/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3959 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3961 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3961 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14583/18544 variables, 3961/4079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/18544 variables, 14401/18480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/18544 variables, 0/18480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/18546 variables, 2/18482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/18546 variables, 0/18482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/18546 variables, 0/18482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18546/18546 variables, and 18482 constraints, problems are : Problem set: 0 solved, 1 unsolved in 16253 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 3963/3963 constraints, ReadFeed: 14401/14401 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3840/3841 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3841 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:29:30] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:29:30] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 0 ms to minimize.
[2024-05-31 22:29:30] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/3841 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3841 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/3959 variables, 59/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3959 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3961 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:29:36] [INFO ] Deduced a trap composed of 66 places in 5281 ms of which 25 ms to minimize.
[2024-05-31 22:29:42] [INFO ] Deduced a trap composed of 65 places in 5239 ms of which 22 ms to minimize.
[2024-05-31 22:29:47] [INFO ] Deduced a trap composed of 100 places in 5432 ms of which 26 ms to minimize.
[2024-05-31 22:29:53] [INFO ] Deduced a trap composed of 107 places in 5503 ms of which 24 ms to minimize.
[2024-05-31 22:29:58] [INFO ] Deduced a trap composed of 65 places in 5375 ms of which 27 ms to minimize.
[2024-05-31 22:30:03] [INFO ] Deduced a trap composed of 76 places in 5316 ms of which 25 ms to minimize.
[2024-05-31 22:30:09] [INFO ] Deduced a trap composed of 80 places in 5578 ms of which 26 ms to minimize.
[2024-05-31 22:30:14] [INFO ] Deduced a trap composed of 66 places in 5318 ms of which 25 ms to minimize.
[2024-05-31 22:30:20] [INFO ] Deduced a trap composed of 75 places in 5450 ms of which 23 ms to minimize.
SMT process timed out in 66800ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 787 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 789 ms. Remains : 3963/3963 places, 14583/14583 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 795 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
[2024-05-31 22:30:22] [INFO ] Invariant cache hit.
[2024-05-31 22:30:28] [INFO ] Implicit Places using invariants in 6343 ms returned []
Implicit Place search using SMT only with invariants took 6345 ms to find 0 implicit places.
Running 14523 sub problems to find dead transitions.
[2024-05-31 22:30:28] [INFO ] Invariant cache hit.
[2024-05-31 22:30:28] [INFO ] State equation strengthened by 14401 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3962 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14523 unsolved
SMT process timed out in 56083ms, After SMT, problems are : Problem set: 0 solved, 14523 unsolved
Search for dead transitions found 0 dead transitions in 56197ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63355 ms. Remains : 3963/3963 places, 14583/14583 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[60]
Ending property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-04 in 371284 ms.
Starting property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[60]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[60]
// Phase 1: matrix 14587 rows 3967 cols
[2024-05-31 22:31:25] [INFO ] Computed 62 invariants in 565 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[60]
RANDOM walk for 10000 steps (36 resets) in 186 ms. (53 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 18 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-31 22:31:25] [INFO ] Invariant cache hit.
[2024-05-31 22:31:25] [INFO ] [Real]Absence check using 60 positive place invariants in 64 ms returned sat
[2024-05-31 22:31:25] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-31 22:31:29] [INFO ] [Real]Absence check using state equation in 3199 ms returned sat
[2024-05-31 22:31:29] [INFO ] State equation strengthened by 14384 read => feed constraints.
[2024-05-31 22:31:30] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 22:31:30] [INFO ] [Real]Added 14384 Read/Feed constraints in 954 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 3962 transition count 14582
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 3962 transition count 14582
Applied a total of 18 rules in 2083 ms. Remains 3962 /3967 variables (removed 5) and now considering 14582/14587 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2084 ms. Remains : 3962/3967 places, 14582/14587 transitions.
// Phase 1: matrix 14582 rows 3962 cols
[2024-05-31 22:31:33] [INFO ] Computed 62 invariants in 540 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[60]
RANDOM walk for 1000000 steps (3641 resets) in 21410 ms. (46 steps per ms)
BEST_FIRST walk for 1000001 steps (48 resets) in 1878 ms. (532 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-31 22:31:56] [INFO ] Invariant cache hit.
[2024-05-31 22:31:56] [INFO ] [Real]Absence check using 60 positive place invariants in 65 ms returned sat
[2024-05-31 22:31:56] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-31 22:32:00] [INFO ] [Real]Absence check using state equation in 3441 ms returned sat
[2024-05-31 22:32:00] [INFO ] State equation strengthened by 14402 read => feed constraints.
[2024-05-31 22:32:02] [INFO ] [Real]Added 14402 Read/Feed constraints in 1279 ms returned sat
[2024-05-31 22:32:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:32:02] [INFO ] [Nat]Absence check using 60 positive place invariants in 77 ms returned sat
[2024-05-31 22:32:02] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 33 ms returned sat
[2024-05-31 22:32:06] [INFO ] [Nat]Absence check using state equation in 3439 ms returned sat
[2024-05-31 22:32:07] [INFO ] [Nat]Added 14402 Read/Feed constraints in 1412 ms returned sat
[2024-05-31 22:32:08] [INFO ] Computed and/alt/rep : 10628/28280/10628 causal constraints (skipped 3894 transitions) in 837 ms.
Minimization took 6210 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 770 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 770 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 786 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
[2024-05-31 22:32:16] [INFO ] Invariant cache hit.
[2024-05-31 22:32:23] [INFO ] Implicit Places using invariants in 6519 ms returned []
Implicit Place search using SMT only with invariants took 6520 ms to find 0 implicit places.
Running 14522 sub problems to find dead transitions.
[2024-05-31 22:32:23] [INFO ] Invariant cache hit.
[2024-05-31 22:32:23] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3961 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14522 unsolved
SMT process timed out in 57441ms, After SMT, problems are : Problem set: 0 solved, 14522 unsolved
Search for dead transitions found 0 dead transitions in 57587ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64911 ms. Remains : 3962/3962 places, 14582/14582 transitions.
RANDOM walk for 40000 steps (143 resets) in 1822 ms. (21 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 63686 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 2
Probabilistic random walk after 63686 steps, saw 30864 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-31 22:33:24] [INFO ] Invariant cache hit.
[2024-05-31 22:33:24] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3839/3840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:33:25] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/3840 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3840 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/3958 variables, 59/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3958 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3960 variables, 2/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 22:33:31] [INFO ] Deduced a trap composed of 69 places in 5560 ms of which 27 ms to minimize.
SMT process timed out in 6738ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 805 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 806 ms. Remains : 3962/3962 places, 14582/14582 transitions.
RANDOM walk for 40000 steps (144 resets) in 1271 ms. (31 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 65905 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 1
Probabilistic random walk after 65905 steps, saw 31155 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-31 22:33:35] [INFO ] Invariant cache hit.
[2024-05-31 22:33:35] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3839/3840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:33:36] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3840 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3840 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/3958 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3958 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3960 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:33:41] [INFO ] Deduced a trap composed of 66 places in 5225 ms of which 27 ms to minimize.
[2024-05-31 22:33:47] [INFO ] Deduced a trap composed of 69 places in 5183 ms of which 24 ms to minimize.
[2024-05-31 22:33:52] [INFO ] Deduced a trap composed of 73 places in 4948 ms of which 23 ms to minimize.
[2024-05-31 22:33:56] [INFO ] Deduced a trap composed of 72 places in 4767 ms of which 21 ms to minimize.
[2024-05-31 22:34:01] [INFO ] Deduced a trap composed of 73 places in 4568 ms of which 22 ms to minimize.
[2024-05-31 22:34:06] [INFO ] Deduced a trap composed of 68 places in 4687 ms of which 23 ms to minimize.
[2024-05-31 22:34:11] [INFO ] Deduced a trap composed of 75 places in 4974 ms of which 24 ms to minimize.
[2024-05-31 22:34:16] [INFO ] Deduced a trap composed of 69 places in 4827 ms of which 26 ms to minimize.
[2024-05-31 22:34:21] [INFO ] Deduced a trap composed of 69 places in 4872 ms of which 23 ms to minimize.
SMT process timed out in 45757ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 741 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 742 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 875 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
[2024-05-31 22:34:22] [INFO ] Invariant cache hit.
[2024-05-31 22:34:29] [INFO ] Implicit Places using invariants in 6523 ms returned []
Implicit Place search using SMT only with invariants took 6525 ms to find 0 implicit places.
Running 14522 sub problems to find dead transitions.
[2024-05-31 22:34:29] [INFO ] Invariant cache hit.
[2024-05-31 22:34:29] [INFO ] State equation strengthened by 14402 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3961 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14522 unsolved
SMT process timed out in 57234ms, After SMT, problems are : Problem set: 0 solved, 14522 unsolved
Search for dead transitions found 0 dead transitions in 57352ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64769 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[60]
Ending property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-05 in 242035 ms.
Starting property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[60]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[60]
// Phase 1: matrix 14587 rows 3967 cols
[2024-05-31 22:35:27] [INFO ] Computed 62 invariants in 544 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[60]
RANDOM walk for 10000 steps (36 resets) in 196 ms. (50 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 19 ms. (500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[60]
[2024-05-31 22:35:27] [INFO ] Invariant cache hit.
[2024-05-31 22:35:27] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2024-05-31 22:35:27] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 33 ms returned sat
[2024-05-31 22:35:31] [INFO ] [Real]Absence check using state equation in 3568 ms returned sat
[2024-05-31 22:35:31] [INFO ] State equation strengthened by 14384 read => feed constraints.
[2024-05-31 22:35:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[60]
Support contains 1 out of 3967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 3963 transition count 14583
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 17 place count 3963 transition count 14583
Applied a total of 17 rules in 1992 ms. Remains 3963 /3967 variables (removed 4) and now considering 14583/14587 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1992 ms. Remains : 3963/3967 places, 14583/14587 transitions.
// Phase 1: matrix 14583 rows 3963 cols
[2024-05-31 22:35:35] [INFO ] Computed 62 invariants in 616 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[60]
RANDOM walk for 1000000 steps (3644 resets) in 20508 ms. (48 steps per ms)
BEST_FIRST walk for 1000001 steps (47 resets) in 1912 ms. (522 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-31 22:35:57] [INFO ] Invariant cache hit.
[2024-05-31 22:35:57] [INFO ] [Real]Absence check using 60 positive place invariants in 67 ms returned sat
[2024-05-31 22:35:57] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-31 22:36:01] [INFO ] [Real]Absence check using state equation in 3324 ms returned sat
[2024-05-31 22:36:01] [INFO ] State equation strengthened by 14401 read => feed constraints.
[2024-05-31 22:36:03] [INFO ] [Real]Added 14401 Read/Feed constraints in 1388 ms returned sat
[2024-05-31 22:36:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:36:03] [INFO ] [Nat]Absence check using 60 positive place invariants in 78 ms returned sat
[2024-05-31 22:36:03] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-31 22:36:07] [INFO ] [Nat]Absence check using state equation in 3754 ms returned sat
[2024-05-31 22:36:09] [INFO ] [Nat]Added 14401 Read/Feed constraints in 1802 ms returned sat
[2024-05-31 22:36:10] [INFO ] Computed and/alt/rep : 10629/28278/10629 causal constraints (skipped 3894 transitions) in 779 ms.
Minimization took 6231 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 792 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 792 ms. Remains : 3963/3963 places, 14583/14583 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 784 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
[2024-05-31 22:36:18] [INFO ] Invariant cache hit.
[2024-05-31 22:36:25] [INFO ] Implicit Places using invariants in 6680 ms returned []
Implicit Place search using SMT only with invariants took 6689 ms to find 0 implicit places.
Running 14523 sub problems to find dead transitions.
[2024-05-31 22:36:25] [INFO ] Invariant cache hit.
[2024-05-31 22:36:25] [INFO ] State equation strengthened by 14401 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3962 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14523 unsolved
SMT process timed out in 57404ms, After SMT, problems are : Problem set: 0 solved, 14523 unsolved
Search for dead transitions found 0 dead transitions in 57526ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65021 ms. Remains : 3963/3963 places, 14583/14583 transitions.
[2024-05-31 22:37:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[60]
RANDOM walk for 1000000 steps (3640 resets) in 19400 ms. (51 steps per ms)
BEST_FIRST walk for 1000001 steps (48 resets) in 1837 ms. (544 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-31 22:37:43] [INFO ] Invariant cache hit.
[2024-05-31 22:37:44] [INFO ] [Real]Absence check using 60 positive place invariants in 67 ms returned sat
[2024-05-31 22:37:44] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-31 22:37:48] [INFO ] [Real]Absence check using state equation in 3632 ms returned sat
[2024-05-31 22:37:48] [INFO ] State equation strengthened by 14401 read => feed constraints.
[2024-05-31 22:37:49] [INFO ] [Real]Added 14401 Read/Feed constraints in 1406 ms returned sat
[2024-05-31 22:37:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:37:50] [INFO ] [Nat]Absence check using 60 positive place invariants in 78 ms returned sat
[2024-05-31 22:37:50] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 33 ms returned sat
[2024-05-31 22:37:54] [INFO ] [Nat]Absence check using state equation in 4141 ms returned sat
[2024-05-31 22:37:56] [INFO ] [Nat]Added 14401 Read/Feed constraints in 1844 ms returned sat
[2024-05-31 22:37:57] [INFO ] Computed and/alt/rep : 10629/28278/10629 causal constraints (skipped 3894 transitions) in 775 ms.
Minimization took 6257 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 766 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 767 ms. Remains : 3963/3963 places, 14583/14583 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 762 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
[2024-05-31 22:38:05] [INFO ] Invariant cache hit.
[2024-05-31 22:38:12] [INFO ] Implicit Places using invariants in 6759 ms returned []
Implicit Place search using SMT only with invariants took 6760 ms to find 0 implicit places.
Running 14523 sub problems to find dead transitions.
[2024-05-31 22:38:12] [INFO ] Invariant cache hit.
[2024-05-31 22:38:12] [INFO ] State equation strengthened by 14401 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3962 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14523 unsolved
SMT process timed out in 58049ms, After SMT, problems are : Problem set: 0 solved, 14523 unsolved
Search for dead transitions found 0 dead transitions in 58172ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65712 ms. Remains : 3963/3963 places, 14583/14583 transitions.
RANDOM walk for 40000 steps (144 resets) in 1205 ms. (33 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 63772 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 2
Probabilistic random walk after 63772 steps, saw 30880 distinct states, run finished after 3002 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-31 22:39:13] [INFO ] Invariant cache hit.
[2024-05-31 22:39:14] [INFO ] State equation strengthened by 14401 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3840/3841 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:39:14] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/3841 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3841 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/3959 variables, 59/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3959 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3961 variables, 2/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 22:39:20] [INFO ] Deduced a trap composed of 80 places in 5720 ms of which 25 ms to minimize.
SMT process timed out in 6965ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 755 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 755 ms. Remains : 3963/3963 places, 14583/14583 transitions.
RANDOM walk for 40000 steps (143 resets) in 1334 ms. (29 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 66481 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 1
Probabilistic random walk after 66481 steps, saw 31223 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-31 22:39:25] [INFO ] Invariant cache hit.
[2024-05-31 22:39:25] [INFO ] State equation strengthened by 14401 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3840/3841 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:39:25] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:39:25] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 1 ms to minimize.
[2024-05-31 22:39:26] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 1 ms to minimize.
[2024-05-31 22:39:26] [INFO ] Deduced a trap composed of 2 places in 163 ms of which 1 ms to minimize.
[2024-05-31 22:39:26] [INFO ] Deduced a trap composed of 2 places in 89 ms of which 1 ms to minimize.
[2024-05-31 22:39:26] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 1 ms to minimize.
[2024-05-31 22:39:26] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 1 ms to minimize.
[2024-05-31 22:39:26] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 1 ms to minimize.
[2024-05-31 22:39:27] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
[2024-05-31 22:39:27] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 1 ms to minimize.
[2024-05-31 22:39:27] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
[2024-05-31 22:39:27] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 1 ms to minimize.
[2024-05-31 22:39:27] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 1 ms to minimize.
[2024-05-31 22:39:27] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 3 ms to minimize.
[2024-05-31 22:39:27] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 1 ms to minimize.
[2024-05-31 22:39:28] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 1 ms to minimize.
[2024-05-31 22:39:28] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:39:28] [INFO ] Deduced a trap composed of 2 places in 109 ms of which 1 ms to minimize.
[2024-05-31 22:39:28] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:39:28] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3841 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:39:28] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 1 ms to minimize.
[2024-05-31 22:39:28] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 1 ms to minimize.
[2024-05-31 22:39:29] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:39:29] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:39:29] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:39:29] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 1 ms to minimize.
[2024-05-31 22:39:29] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 0 ms to minimize.
[2024-05-31 22:39:29] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:39:29] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 0 ms to minimize.
[2024-05-31 22:39:29] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 1 ms to minimize.
[2024-05-31 22:39:30] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:39:30] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 0 ms to minimize.
[2024-05-31 22:39:30] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 1 ms to minimize.
[2024-05-31 22:39:30] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:39:30] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:39:30] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:39:30] [INFO ] Deduced a trap composed of 2 places in 89 ms of which 1 ms to minimize.
[2024-05-31 22:39:31] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:39:31] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:39:31] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/3841 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:39:31] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:39:31] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 0 ms to minimize.
[2024-05-31 22:39:31] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 0 ms to minimize.
[2024-05-31 22:39:31] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 0 ms to minimize.
[2024-05-31 22:39:32] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:39:32] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:39:32] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 0 ms to minimize.
[2024-05-31 22:39:32] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:39:32] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 0 ms to minimize.
[2024-05-31 22:39:32] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 1 ms to minimize.
[2024-05-31 22:39:33] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 0 ms to minimize.
[2024-05-31 22:39:33] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 0 ms to minimize.
[2024-05-31 22:39:33] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 0 ms to minimize.
[2024-05-31 22:39:33] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:39:33] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:39:33] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/3841 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3841 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 118/3959 variables, 59/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3959 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3961 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3961 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14583/18544 variables, 3961/4079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 18544/18546 variables, and 18480 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27120 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 3961/3963 constraints, ReadFeed: 14401/14401 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3840/3841 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3841 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:39:52] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:39:53] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:39:53] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/3841 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3841 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/3959 variables, 59/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3959 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3961 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:39:59] [INFO ] Deduced a trap composed of 75 places in 5479 ms of which 25 ms to minimize.
[2024-05-31 22:40:04] [INFO ] Deduced a trap composed of 100 places in 5313 ms of which 22 ms to minimize.
[2024-05-31 22:40:09] [INFO ] Deduced a trap composed of 80 places in 5249 ms of which 26 ms to minimize.
[2024-05-31 22:40:15] [INFO ] Deduced a trap composed of 83 places in 5565 ms of which 26 ms to minimize.
[2024-05-31 22:40:21] [INFO ] Deduced a trap composed of 74 places in 5626 ms of which 26 ms to minimize.
[2024-05-31 22:40:26] [INFO ] Deduced a trap composed of 67 places in 5387 ms of which 26 ms to minimize.
[2024-05-31 22:40:32] [INFO ] Deduced a trap composed of 71 places in 5525 ms of which 24 ms to minimize.
[2024-05-31 22:40:37] [INFO ] Deduced a trap composed of 76 places in 5385 ms of which 24 ms to minimize.
SMT process timed out in 72557ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 778 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 778 ms. Remains : 3963/3963 places, 14583/14583 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 800 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
[2024-05-31 22:40:39] [INFO ] Invariant cache hit.
[2024-05-31 22:40:45] [INFO ] Implicit Places using invariants in 6563 ms returned []
Implicit Place search using SMT only with invariants took 6564 ms to find 0 implicit places.
Running 14523 sub problems to find dead transitions.
[2024-05-31 22:40:46] [INFO ] Invariant cache hit.
[2024-05-31 22:40:46] [INFO ] State equation strengthened by 14401 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3962 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14523 unsolved
SMT process timed out in 58495ms, After SMT, problems are : Problem set: 0 solved, 14523 unsolved
Search for dead transitions found 0 dead transitions in 58630ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66010 ms. Remains : 3963/3963 places, 14583/14583 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[60]
Ending property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-07 in 377831 ms.
Starting property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[60]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[60]
// Phase 1: matrix 14587 rows 3967 cols
[2024-05-31 22:41:45] [INFO ] Computed 62 invariants in 533 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[60]
RANDOM walk for 10000 steps (36 resets) in 195 ms. (51 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 19 ms. (500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-31 22:41:45] [INFO ] Invariant cache hit.
[2024-05-31 22:41:45] [INFO ] [Real]Absence check using 60 positive place invariants in 63 ms returned sat
[2024-05-31 22:41:45] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-31 22:41:49] [INFO ] [Real]Absence check using state equation in 3722 ms returned sat
[2024-05-31 22:41:49] [INFO ] State equation strengthened by 14384 read => feed constraints.
[2024-05-31 22:41: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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 3962 transition count 14582
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 3962 transition count 14582
Applied a total of 18 rules in 2044 ms. Remains 3962 /3967 variables (removed 5) and now considering 14582/14587 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2045 ms. Remains : 3962/3967 places, 14582/14587 transitions.
// Phase 1: matrix 14582 rows 3962 cols
[2024-05-31 22:41:52] [INFO ] Computed 62 invariants in 585 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[60]
RANDOM walk for 1000000 steps (3640 resets) in 20504 ms. (48 steps per ms)
BEST_FIRST walk for 1000001 steps (46 resets) in 1895 ms. (527 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-31 22:42:15] [INFO ] Invariant cache hit.
[2024-05-31 22:42:15] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2024-05-31 22:42:15] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-31 22:42:19] [INFO ] [Real]Absence check using state equation in 3571 ms returned sat
[2024-05-31 22:42:19] [INFO ] State equation strengthened by 14402 read => feed constraints.
[2024-05-31 22:42:21] [INFO ] [Real]Added 14402 Read/Feed constraints in 1178 ms returned sat
[2024-05-31 22:42:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:42:21] [INFO ] [Nat]Absence check using 60 positive place invariants in 76 ms returned sat
[2024-05-31 22:42:21] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-31 22:42:25] [INFO ] [Nat]Absence check using state equation in 3499 ms returned sat
[2024-05-31 22:42:26] [INFO ] [Nat]Added 14402 Read/Feed constraints in 1402 ms returned sat
[2024-05-31 22:42:27] [INFO ] Computed and/alt/rep : 10628/28280/10628 causal constraints (skipped 3894 transitions) in 784 ms.
Minimization took 6086 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 785 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 785 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 800 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
[2024-05-31 22:42:35] [INFO ] Invariant cache hit.
[2024-05-31 22:42:42] [INFO ] Implicit Places using invariants in 6606 ms returned []
Implicit Place search using SMT only with invariants took 6606 ms to find 0 implicit places.
Running 14522 sub problems to find dead transitions.
[2024-05-31 22:42:42] [INFO ] Invariant cache hit.
[2024-05-31 22:42:42] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3961 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14522 unsolved
SMT process timed out in 57646ms, After SMT, problems are : Problem set: 0 solved, 14522 unsolved
Search for dead transitions found 0 dead transitions in 57776ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65198 ms. Remains : 3962/3962 places, 14582/14582 transitions.
RANDOM walk for 40000 steps (143 resets) in 1081 ms. (36 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 64853 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 2
Probabilistic random walk after 64853 steps, saw 31024 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-31 22:43:43] [INFO ] Invariant cache hit.
[2024-05-31 22:43:43] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3839/3840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:43:44] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/3840 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3840 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/3958 variables, 59/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3958 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3960 variables, 2/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 22:43:50] [INFO ] Deduced a trap composed of 70 places in 5497 ms of which 26 ms to minimize.
SMT process timed out in 6645ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 729 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 729 ms. Remains : 3962/3962 places, 14582/14582 transitions.
RANDOM walk for 40000 steps (145 resets) in 978 ms. (40 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 66232 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 1
Probabilistic random walk after 66232 steps, saw 31192 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-31 22:43:54] [INFO ] Invariant cache hit.
[2024-05-31 22:43:54] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3839/3840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:43:54] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3840 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3840 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/3958 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3958 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3960 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:44:00] [INFO ] Deduced a trap composed of 67 places in 5353 ms of which 26 ms to minimize.
[2024-05-31 22:44:05] [INFO ] Deduced a trap composed of 66 places in 4905 ms of which 22 ms to minimize.
[2024-05-31 22:44:11] [INFO ] Deduced a trap composed of 68 places in 5370 ms of which 24 ms to minimize.
[2024-05-31 22:44:16] [INFO ] Deduced a trap composed of 66 places in 5319 ms of which 24 ms to minimize.
[2024-05-31 22:44:21] [INFO ] Deduced a trap composed of 80 places in 5344 ms of which 25 ms to minimize.
[2024-05-31 22:44:26] [INFO ] Deduced a trap composed of 81 places in 5097 ms of which 25 ms to minimize.
[2024-05-31 22:44:32] [INFO ] Deduced a trap composed of 77 places in 5002 ms of which 24 ms to minimize.
[2024-05-31 22:44:37] [INFO ] Deduced a trap composed of 72 places in 4965 ms of which 23 ms to minimize.
[2024-05-31 22:44:42] [INFO ] Deduced a trap composed of 104 places in 4909 ms of which 23 ms to minimize.
SMT process timed out in 47871ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 750 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 750 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 754 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
[2024-05-31 22:44:43] [INFO ] Invariant cache hit.
[2024-05-31 22:44:50] [INFO ] Implicit Places using invariants in 6642 ms returned []
Implicit Place search using SMT only with invariants took 6642 ms to find 0 implicit places.
Running 14522 sub problems to find dead transitions.
[2024-05-31 22:44:50] [INFO ] Invariant cache hit.
[2024-05-31 22:44:50] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3961 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14522 unsolved
SMT process timed out in 56724ms, After SMT, problems are : Problem set: 0 solved, 14522 unsolved
Search for dead transitions found 0 dead transitions in 56838ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64252 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[60]
Ending property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-08 in 242524 ms.
Starting property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[60]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[60]
// Phase 1: matrix 14587 rows 3967 cols
[2024-05-31 22:45:47] [INFO ] Computed 62 invariants in 559 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[60]
RANDOM walk for 10000 steps (36 resets) in 193 ms. (51 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 18 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[60]
[2024-05-31 22:45:47] [INFO ] Invariant cache hit.
[2024-05-31 22:45:48] [INFO ] [Real]Absence check using 60 positive place invariants in 65 ms returned sat
[2024-05-31 22:45:48] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-31 22:45:51] [INFO ] [Real]Absence check using state equation in 3338 ms returned sat
[2024-05-31 22:45:52] [INFO ] State equation strengthened by 14384 read => feed constraints.
[2024-05-31 22:45:52] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 22:45:52] [INFO ] [Real]Added 14384 Read/Feed constraints in 780 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[60]
Support contains 1 out of 3967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 3962 transition count 14582
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 3962 transition count 14582
Applied a total of 18 rules in 2018 ms. Remains 3962 /3967 variables (removed 5) and now considering 14582/14587 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2018 ms. Remains : 3962/3967 places, 14582/14587 transitions.
// Phase 1: matrix 14582 rows 3962 cols
[2024-05-31 22:45:55] [INFO ] Computed 62 invariants in 560 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[60]
RANDOM walk for 1000000 steps (3640 resets) in 19193 ms. (52 steps per ms)
BEST_FIRST walk for 1000001 steps (47 resets) in 1797 ms. (556 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-31 22:46:16] [INFO ] Invariant cache hit.
[2024-05-31 22:46:16] [INFO ] [Real]Absence check using 60 positive place invariants in 68 ms returned sat
[2024-05-31 22:46:16] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 33 ms returned sat
[2024-05-31 22:46:20] [INFO ] [Real]Absence check using state equation in 3897 ms returned sat
[2024-05-31 22:46:21] [INFO ] State equation strengthened by 14402 read => feed constraints.
[2024-05-31 22:46:22] [INFO ] [Real]Added 14402 Read/Feed constraints in 1311 ms returned sat
[2024-05-31 22:46:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:46:23] [INFO ] [Nat]Absence check using 60 positive place invariants in 79 ms returned sat
[2024-05-31 22:46:23] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 33 ms returned sat
[2024-05-31 22:46:27] [INFO ] [Nat]Absence check using state equation in 3636 ms returned sat
[2024-05-31 22:46:28] [INFO ] [Nat]Added 14402 Read/Feed constraints in 1524 ms returned sat
[2024-05-31 22:46:29] [INFO ] Computed and/alt/rep : 10628/28280/10628 causal constraints (skipped 3894 transitions) in 781 ms.
Minimization took 6436 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 768 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 768 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 759 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
[2024-05-31 22:46:37] [INFO ] Invariant cache hit.
[2024-05-31 22:46:44] [INFO ] Implicit Places using invariants in 6621 ms returned []
Implicit Place search using SMT only with invariants took 6621 ms to find 0 implicit places.
Running 14522 sub problems to find dead transitions.
[2024-05-31 22:46:44] [INFO ] Invariant cache hit.
[2024-05-31 22:46:44] [INFO ] State equation strengthened by 14402 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3961 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14522 unsolved
SMT process timed out in 57342ms, After SMT, problems are : Problem set: 0 solved, 14522 unsolved
Search for dead transitions found 0 dead transitions in 57455ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64853 ms. Remains : 3962/3962 places, 14582/14582 transitions.
[2024-05-31 22:47:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[60]
RANDOM walk for 1000000 steps (3643 resets) in 21059 ms. (47 steps per ms)
BEST_FIRST walk for 1000001 steps (48 resets) in 1907 ms. (524 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-31 22:48:04] [INFO ] Invariant cache hit.
[2024-05-31 22:48:05] [INFO ] [Real]Absence check using 60 positive place invariants in 67 ms returned sat
[2024-05-31 22:48:05] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-31 22:48:08] [INFO ] [Real]Absence check using state equation in 3489 ms returned sat
[2024-05-31 22:48:09] [INFO ] State equation strengthened by 14402 read => feed constraints.
[2024-05-31 22:48:10] [INFO ] [Real]Added 14402 Read/Feed constraints in 1315 ms returned sat
[2024-05-31 22:48:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:48:11] [INFO ] [Nat]Absence check using 60 positive place invariants in 81 ms returned sat
[2024-05-31 22:48:11] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 33 ms returned sat
[2024-05-31 22:48:15] [INFO ] [Nat]Absence check using state equation in 4586 ms returned sat
[2024-05-31 22:48:17] [INFO ] [Nat]Added 14402 Read/Feed constraints in 1585 ms returned sat
[2024-05-31 22:48:18] [INFO ] Computed and/alt/rep : 10628/28280/10628 causal constraints (skipped 3894 transitions) in 837 ms.
Minimization took 6434 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 886 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 888 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 819 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
[2024-05-31 22:48:26] [INFO ] Invariant cache hit.
[2024-05-31 22:48:33] [INFO ] Implicit Places using invariants in 6733 ms returned []
Implicit Place search using SMT only with invariants took 6736 ms to find 0 implicit places.
Running 14522 sub problems to find dead transitions.
[2024-05-31 22:48:33] [INFO ] Invariant cache hit.
[2024-05-31 22:48:33] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3961 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14522 unsolved
SMT process timed out in 57413ms, After SMT, problems are : Problem set: 0 solved, 14522 unsolved
Search for dead transitions found 0 dead transitions in 57527ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65100 ms. Remains : 3962/3962 places, 14582/14582 transitions.
RANDOM walk for 40000 steps (144 resets) in 1522 ms. (26 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 65253 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 2
Probabilistic random walk after 65253 steps, saw 31070 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-31 22:49:34] [INFO ] Invariant cache hit.
[2024-05-31 22:49:34] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3839/3840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:49:35] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/3840 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3840 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/3958 variables, 59/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3958 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3960 variables, 2/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 22:49:41] [INFO ] Deduced a trap composed of 79 places in 5808 ms of which 26 ms to minimize.
SMT process timed out in 6989ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 931 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 931 ms. Remains : 3962/3962 places, 14582/14582 transitions.
RANDOM walk for 40000 steps (144 resets) in 1068 ms. (37 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 68040 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 1
Probabilistic random walk after 68040 steps, saw 31410 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-31 22:49:45] [INFO ] Invariant cache hit.
[2024-05-31 22:49:46] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3839/3840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:49:46] [INFO ] Deduced a trap composed of 2 places in 97 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3840 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3840 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/3958 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3958 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3960 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:49:52] [INFO ] Deduced a trap composed of 67 places in 5173 ms of which 21 ms to minimize.
[2024-05-31 22:49:57] [INFO ] Deduced a trap composed of 66 places in 5101 ms of which 25 ms to minimize.
[2024-05-31 22:50:02] [INFO ] Deduced a trap composed of 92 places in 5194 ms of which 24 ms to minimize.
[2024-05-31 22:50:08] [INFO ] Deduced a trap composed of 101 places in 5284 ms of which 23 ms to minimize.
[2024-05-31 22:50:13] [INFO ] Deduced a trap composed of 84 places in 5006 ms of which 24 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3960 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3960 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 14582/18542 variables, 3960/4028 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/18542 variables, 14402/18430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/18542 variables, 0/18430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/18544 variables, 2/18432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/18544 variables, 0/18432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/18544 variables, 0/18432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18544/18544 variables, and 18432 constraints, problems are : Problem set: 0 solved, 1 unsolved in 37374 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 3962/3962 constraints, ReadFeed: 14402/14402 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3839/3840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3840 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:50:24] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/3840 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3840 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/3958 variables, 59/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3958 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3960 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3960 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:50:30] [INFO ] Deduced a trap composed of 90 places in 5638 ms of which 26 ms to minimize.
[2024-05-31 22:50:35] [INFO ] Deduced a trap composed of 85 places in 5360 ms of which 26 ms to minimize.
[2024-05-31 22:50:41] [INFO ] Deduced a trap composed of 89 places in 5825 ms of which 22 ms to minimize.
[2024-05-31 22:50:46] [INFO ] Deduced a trap composed of 65 places in 5247 ms of which 25 ms to minimize.
[2024-05-31 22:50:51] [INFO ] Deduced a trap composed of 86 places in 5249 ms of which 24 ms to minimize.
[2024-05-31 22:50:57] [INFO ] Deduced a trap composed of 93 places in 5325 ms of which 26 ms to minimize.
[2024-05-31 22:51:02] [INFO ] Deduced a trap composed of 90 places in 5188 ms of which 22 ms to minimize.
[2024-05-31 22:51:07] [INFO ] Deduced a trap composed of 89 places in 5208 ms of which 26 ms to minimize.
[2024-05-31 22:51:12] [INFO ] Deduced a trap composed of 86 places in 5091 ms of which 26 ms to minimize.
SMT process timed out in 86993ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 742 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 742 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 809 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
[2024-05-31 22:51:14] [INFO ] Invariant cache hit.
[2024-05-31 22:51:21] [INFO ] Implicit Places using invariants in 6782 ms returned []
Implicit Place search using SMT only with invariants took 6787 ms to find 0 implicit places.
Running 14522 sub problems to find dead transitions.
[2024-05-31 22:51:21] [INFO ] Invariant cache hit.
[2024-05-31 22:51:21] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3961 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14522 unsolved
SMT process timed out in 56582ms, After SMT, problems are : Problem set: 0 solved, 14522 unsolved
Search for dead transitions found 0 dead transitions in 56699ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64311 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[60]
Ending property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-09 in 390997 ms.
Starting property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[60]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[60]
// Phase 1: matrix 14587 rows 3967 cols
[2024-05-31 22:52:18] [INFO ] Computed 62 invariants in 537 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[60]
RANDOM walk for 10000 steps (36 resets) in 201 ms. (49 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 19 ms. (500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-31 22:52:18] [INFO ] Invariant cache hit.
[2024-05-31 22:52:19] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2024-05-31 22:52:19] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-31 22:52:22] [INFO ] [Real]Absence check using state equation in 3534 ms returned sat
[2024-05-31 22:52:23] [INFO ] State equation strengthened by 14384 read => feed constraints.
[2024-05-31 22:52:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 3962 transition count 14582
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 3962 transition count 14582
Applied a total of 18 rules in 2150 ms. Remains 3962 /3967 variables (removed 5) and now considering 14582/14587 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2150 ms. Remains : 3962/3967 places, 14582/14587 transitions.
// Phase 1: matrix 14582 rows 3962 cols
[2024-05-31 22:52:26] [INFO ] Computed 62 invariants in 686 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[60]
RANDOM walk for 1000000 steps (3641 resets) in 20082 ms. (49 steps per ms)
BEST_FIRST walk for 1000001 steps (46 resets) in 1885 ms. (530 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-31 22:52:48] [INFO ] Invariant cache hit.
[2024-05-31 22:52:49] [INFO ] [Real]Absence check using 60 positive place invariants in 68 ms returned sat
[2024-05-31 22:52:49] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-31 22:52:52] [INFO ] [Real]Absence check using state equation in 3500 ms returned sat
[2024-05-31 22:52:53] [INFO ] State equation strengthened by 14402 read => feed constraints.
[2024-05-31 22:52:54] [INFO ] [Real]Added 14402 Read/Feed constraints in 1305 ms returned sat
[2024-05-31 22:52:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:52:55] [INFO ] [Nat]Absence check using 60 positive place invariants in 80 ms returned sat
[2024-05-31 22:52:55] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-31 22:52:58] [INFO ] [Nat]Absence check using state equation in 3620 ms returned sat
[2024-05-31 22:53:00] [INFO ] [Nat]Added 14402 Read/Feed constraints in 1504 ms returned sat
[2024-05-31 22:53:01] [INFO ] Computed and/alt/rep : 10628/28280/10628 causal constraints (skipped 3894 transitions) in 806 ms.
Minimization took 6546 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 797 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 798 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 804 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
[2024-05-31 22:53:09] [INFO ] Invariant cache hit.
[2024-05-31 22:53:16] [INFO ] Implicit Places using invariants in 6655 ms returned []
Implicit Place search using SMT only with invariants took 6656 ms to find 0 implicit places.
Running 14522 sub problems to find dead transitions.
[2024-05-31 22:53:16] [INFO ] Invariant cache hit.
[2024-05-31 22:53:16] [INFO ] State equation strengthened by 14402 read => feed constraints.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="CANInsertWithFailure-PT-060"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is CANInsertWithFailure-PT-060, 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 r476-tall-171620505200141"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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