Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 984K
-rw-r--r-- 1 mcc users 7.5K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 613K Mar 5 18:22 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 JoinFreeModules-PT-0200-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679458368964

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0200
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 04:12:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 04:12:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 04:12:50] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2023-03-22 04:12:50] [INFO ] Transformed 1001 places.
[2023-03-22 04:12:50] [INFO ] Transformed 1601 transitions.
[2023-03-22 04:12:50] [INFO ] Parsed PT model containing 1001 places and 1601 transitions and 4602 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Reduce places removed 1 places and 0 transitions.
// Phase 1: matrix 1601 rows 1000 cols
[2023-03-22 04:12:50] [INFO ] Computed 200 place invariants in 40 ms
Incomplete random walk after 10117 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 16) seen :611
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 16) seen :223
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 16) seen :223
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 16) seen :211
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 16) seen :212
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 16) seen :211
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 16) seen :211
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 16) seen :211
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 16) seen :223
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 16) seen :223
[2023-03-22 04:12:52] [INFO ] Invariant cache hit.
[2023-03-22 04:12:52] [INFO ] [Real]Absence check using 200 positive place invariants in 54 ms returned sat
[2023-03-22 04:12:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:12:53] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2023-03-22 04:12:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:12:53] [INFO ] [Nat]Absence check using 200 positive place invariants in 38 ms returned sat
[2023-03-22 04:12:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:12:54] [INFO ] [Nat]Absence check using state equation in 1459 ms returned sat
[2023-03-22 04:12:54] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 04:12:55] [INFO ] [Nat]Added 200 Read/Feed constraints in 152 ms returned sat
[2023-03-22 04:12:55] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 4 ms to minimize.
[2023-03-22 04:12:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 307 ms
[2023-03-22 04:12:55] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 97 ms.
[2023-03-22 04:12:58] [INFO ] Deduced a trap composed of 3 places in 409 ms of which 2 ms to minimize.
[2023-03-22 04:12:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:12:58] [INFO ] [Real]Absence check using 200 positive place invariants in 36 ms returned sat
[2023-03-22 04:12:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:12:59] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2023-03-22 04:12:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:12:59] [INFO ] [Nat]Absence check using 200 positive place invariants in 36 ms returned sat
[2023-03-22 04:12:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:01] [INFO ] [Nat]Absence check using state equation in 1549 ms returned sat
[2023-03-22 04:13:01] [INFO ] [Nat]Added 200 Read/Feed constraints in 297 ms returned sat
[2023-03-22 04:13:01] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 84 ms.
[2023-03-22 04:13:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:13:04] [INFO ] [Real]Absence check using 200 positive place invariants in 44 ms returned sat
[2023-03-22 04:13:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:04] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2023-03-22 04:13:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:13:05] [INFO ] [Nat]Absence check using 200 positive place invariants in 37 ms returned sat
[2023-03-22 04:13:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:06] [INFO ] [Nat]Absence check using state equation in 1593 ms returned sat
[2023-03-22 04:13:06] [INFO ] [Nat]Added 200 Read/Feed constraints in 161 ms returned sat
[2023-03-22 04:13:06] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 72 ms.
[2023-03-22 04:13:10] [INFO ] Deduced a trap composed of 3 places in 415 ms of which 2 ms to minimize.
[2023-03-22 04:13:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:13:10] [INFO ] [Real]Absence check using 200 positive place invariants in 31 ms returned sat
[2023-03-22 04:13:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:10] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2023-03-22 04:13:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:13:11] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-22 04:13:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:12] [INFO ] [Nat]Absence check using state equation in 1555 ms returned sat
[2023-03-22 04:13:12] [INFO ] [Nat]Added 200 Read/Feed constraints in 132 ms returned sat
[2023-03-22 04:13:12] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 79 ms.
[2023-03-22 04:13:16] [INFO ] Deduced a trap composed of 3 places in 394 ms of which 2 ms to minimize.
[2023-03-22 04:13:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:13:16] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-22 04:13:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:16] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2023-03-22 04:13:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:13:17] [INFO ] [Nat]Absence check using 200 positive place invariants in 36 ms returned sat
[2023-03-22 04:13:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:18] [INFO ] [Nat]Absence check using state equation in 1600 ms returned sat
[2023-03-22 04:13:18] [INFO ] [Nat]Added 200 Read/Feed constraints in 132 ms returned sat
[2023-03-22 04:13:18] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 71 ms.
[2023-03-22 04:13:22] [INFO ] Deduced a trap composed of 3 places in 387 ms of which 1 ms to minimize.
[2023-03-22 04:13: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 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:13:22] [INFO ] [Real]Absence check using 200 positive place invariants in 39 ms returned sat
[2023-03-22 04:13:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:22] [INFO ] [Real]Absence check using state equation in 400 ms returned sat
[2023-03-22 04:13:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:13:23] [INFO ] [Nat]Absence check using 200 positive place invariants in 37 ms returned sat
[2023-03-22 04:13:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:24] [INFO ] [Nat]Absence check using state equation in 1587 ms returned sat
[2023-03-22 04:13:24] [INFO ] [Nat]Added 200 Read/Feed constraints in 136 ms returned sat
[2023-03-22 04:13:24] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 92 ms.
[2023-03-22 04:13:28] [INFO ] Deduced a trap composed of 3 places in 404 ms of which 1 ms to minimize.
[2023-03-22 04:13:28] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:13:28] [INFO ] [Real]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-22 04:13:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:28] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2023-03-22 04:13:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:13:28] [INFO ] [Nat]Absence check using 200 positive place invariants in 36 ms returned sat
[2023-03-22 04:13:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:32] [INFO ] [Nat]Absence check using state equation in 3794 ms returned sat
[2023-03-22 04:13:32] [INFO ] [Nat]Added 200 Read/Feed constraints in 108 ms returned sat
[2023-03-22 04:13:33] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 70 ms.
[2023-03-22 04:13:33] [INFO ] Added : 50 causal constraints over 10 iterations in 894 ms. Result :unknown
[2023-03-22 04:13:33] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-22 04:13:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:34] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2023-03-22 04:13:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:13:34] [INFO ] [Nat]Absence check using 200 positive place invariants in 37 ms returned sat
[2023-03-22 04:13:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:36] [INFO ] [Nat]Absence check using state equation in 1808 ms returned sat
[2023-03-22 04:13:36] [INFO ] [Nat]Added 200 Read/Feed constraints in 112 ms returned sat
[2023-03-22 04:13:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 04:13:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 04:13:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 04:13:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 332 ms
[2023-03-22 04:13:36] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 70 ms.
[2023-03-22 04:13:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:13:39] [INFO ] [Real]Absence check using 200 positive place invariants in 39 ms returned sat
[2023-03-22 04:13:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:39] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2023-03-22 04:13:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:13:40] [INFO ] [Nat]Absence check using 200 positive place invariants in 36 ms returned sat
[2023-03-22 04:13:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:41] [INFO ] [Nat]Absence check using state equation in 1609 ms returned sat
[2023-03-22 04:13:41] [INFO ] [Nat]Added 200 Read/Feed constraints in 113 ms returned sat
[2023-03-22 04:13:42] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 83 ms.
[2023-03-22 04:13:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:13:45] [INFO ] [Real]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-22 04:13:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:45] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2023-03-22 04:13:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:13:45] [INFO ] [Nat]Absence check using 200 positive place invariants in 37 ms returned sat
[2023-03-22 04:13:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:47] [INFO ] [Nat]Absence check using state equation in 1453 ms returned sat
[2023-03-22 04:13:47] [INFO ] [Nat]Added 200 Read/Feed constraints in 123 ms returned sat
[2023-03-22 04:13:47] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 78 ms.
[2023-03-22 04:13:51] [INFO ] Deduced a trap composed of 3 places in 414 ms of which 1 ms to minimize.
[2023-03-22 04:13:51] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:13:51] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-22 04:13:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:51] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2023-03-22 04:13:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:13:51] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-22 04:13:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:53] [INFO ] [Nat]Absence check using state equation in 1525 ms returned sat
[2023-03-22 04:13:53] [INFO ] [Nat]Added 200 Read/Feed constraints in 132 ms returned sat
[2023-03-22 04:13:53] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 76 ms.
[2023-03-22 04:13:57] [INFO ] Deduced a trap composed of 3 places in 419 ms of which 1 ms to minimize.
[2023-03-22 04:13:57] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:13:57] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-22 04:13:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:57] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2023-03-22 04:13:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:13:57] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-22 04:13:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:13:59] [INFO ] [Nat]Absence check using state equation in 1587 ms returned sat
[2023-03-22 04:13:59] [INFO ] [Nat]Added 200 Read/Feed constraints in 91 ms returned sat
[2023-03-22 04:13:59] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 04:13:59] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 04:13:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 251 ms
[2023-03-22 04:13:59] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 68 ms.
[2023-03-22 04:14:03] [INFO ] Deduced a trap composed of 3 places in 380 ms of which 1 ms to minimize.
[2023-03-22 04:14: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 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:14:03] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-22 04:14:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:14:03] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2023-03-22 04:14:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:14:03] [INFO ] [Nat]Absence check using 200 positive place invariants in 30 ms returned sat
[2023-03-22 04:14:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:14:05] [INFO ] [Nat]Absence check using state equation in 1785 ms returned sat
[2023-03-22 04:14:05] [INFO ] [Nat]Added 200 Read/Feed constraints in 118 ms returned sat
[2023-03-22 04:14:05] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 81 ms.
[2023-03-22 04:14:09] [INFO ] Deduced a trap composed of 3 places in 405 ms of which 1 ms to minimize.
[2023-03-22 04:14: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 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:14:09] [INFO ] [Real]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-22 04:14:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:14:09] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2023-03-22 04:14:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:14:09] [INFO ] [Nat]Absence check using 200 positive place invariants in 36 ms returned sat
[2023-03-22 04:14:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:14:11] [INFO ] [Nat]Absence check using state equation in 1547 ms returned sat
[2023-03-22 04:14:11] [INFO ] [Nat]Added 200 Read/Feed constraints in 134 ms returned sat
[2023-03-22 04:14:11] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 65 ms.
[2023-03-22 04:14:14] [INFO ] Added : 180 causal constraints over 36 iterations in 3108 ms. Result :unknown
[2023-03-22 04:14:14] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-22 04:14:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:14:15] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2023-03-22 04:14:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:14:15] [INFO ] [Nat]Absence check using 200 positive place invariants in 37 ms returned sat
[2023-03-22 04:14:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:14:17] [INFO ] [Nat]Absence check using state equation in 1951 ms returned sat
[2023-03-22 04:14:17] [INFO ] [Nat]Added 200 Read/Feed constraints in 88 ms returned sat
[2023-03-22 04:14:17] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 64 ms.
[2023-03-22 04:14:20] [INFO ] Added : 135 causal constraints over 27 iterations in 2752 ms. Result :unknown
[2023-03-22 04:14:20] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-22 04:14:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:14:20] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2023-03-22 04:14:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:14:20] [INFO ] [Nat]Absence check using 200 positive place invariants in 36 ms returned sat
[2023-03-22 04:14:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:14:22] [INFO ] [Nat]Absence check using state equation in 1661 ms returned sat
[2023-03-22 04:14:22] [INFO ] [Nat]Added 200 Read/Feed constraints in 129 ms returned sat
[2023-03-22 04:14:22] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 78 ms.
[2023-03-22 04:14:26] [INFO ] Deduced a trap composed of 3 places in 387 ms of which 1 ms to minimize.
[2023-03-22 04:14:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 15
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203] Max seen :[9, 201, 12, 9, 10, 12, 2, 9, 200, 2, 2, 9, 2, 12, 201, 12]
Support contains 16 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Graph (complete) has 2400 edges and 1000 vertex of which 80 are kept as prefixes of interest. Removing 920 places using SCC suffix rule.4 ms
Discarding 920 places :
Also discarding 1472 output transitions
Drop transitions removed 1472 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 128
Applied a total of 2 rules in 24 ms. Remains 80 /1000 variables (removed 920) and now considering 128/1601 (removed 1473) transitions.
// Phase 1: matrix 128 rows 80 cols
[2023-03-22 04:15:56] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-22 04:15:56] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 80/1000 places, 128/1601 transitions.
[2023-03-22 04:15:56] [INFO ] Invariant cache hit.
Incomplete random walk after 1000056 steps, including 2 resets, run finished after 1047 ms. (steps per millisecond=955 ) properties (out of 16) seen :3196
FORMULA JoinFreeModules-PT-0200-UpperBounds-15 203 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1109 ms. (steps per millisecond=901 ) properties (out of 15) seen :731
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1085 ms. (steps per millisecond=921 ) properties (out of 15) seen :702
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1102 ms. (steps per millisecond=907 ) properties (out of 15) seen :757
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1108 ms. (steps per millisecond=902 ) properties (out of 15) seen :800
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1074 ms. (steps per millisecond=931 ) properties (out of 15) seen :708
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1090 ms. (steps per millisecond=917 ) properties (out of 15) seen :769
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1092 ms. (steps per millisecond=915 ) properties (out of 15) seen :634
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1085 ms. (steps per millisecond=921 ) properties (out of 15) seen :755
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1077 ms. (steps per millisecond=928 ) properties (out of 15) seen :564
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1098 ms. (steps per millisecond=910 ) properties (out of 15) seen :630
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1093 ms. (steps per millisecond=914 ) properties (out of 15) seen :631
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1083 ms. (steps per millisecond=923 ) properties (out of 15) seen :757
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1098 ms. (steps per millisecond=910 ) properties (out of 15) seen :623
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1074 ms. (steps per millisecond=931 ) properties (out of 15) seen :774
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1058 ms. (steps per millisecond=945 ) properties (out of 15) seen :727
[2023-03-22 04:16:13] [INFO ] Invariant cache hit.
[2023-03-22 04:16:13] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 04:16:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:13] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-22 04:16:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:13] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:13] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2023-03-22 04:16:13] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-22 04:16:13] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-22 04:16:13] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 04:16:14] [INFO ] Added : 66 causal constraints over 14 iterations in 275 ms. Result :sat
Minimization took 50 ms.
[2023-03-22 04:16:14] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:14] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 04:16:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:14] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 04:16:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:14] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-22 04:16:14] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-22 04:16:14] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 04:16:14] [INFO ] Added : 46 causal constraints over 11 iterations in 122 ms. Result :sat
Minimization took 45 ms.
[2023-03-22 04:16:14] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:14] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-22 04:16:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:14] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:14] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2023-03-22 04:16:14] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-22 04:16:14] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-22 04:16:14] [INFO ] Added : 45 causal constraints over 9 iterations in 145 ms. Result :sat
Minimization took 38 ms.
[2023-03-22 04:16:15] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:15] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 04:16:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:15] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-22 04:16:15] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-22 04:16:15] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 04:16:15] [INFO ] Added : 56 causal constraints over 14 iterations in 207 ms. Result :sat
Minimization took 55 ms.
[2023-03-22 04:16:15] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 04:16:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:15] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-22 04:16:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 04:16:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:15] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-22 04:16:15] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
[2023-03-22 04:16:15] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 04:16:15] [INFO ] Added : 45 causal constraints over 10 iterations in 127 ms. Result :sat
Minimization took 50 ms.
[2023-03-22 04:16:15] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:15] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 04:16:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 04:16:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:15] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2023-03-22 04:16:15] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-22 04:16:15] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 04:16:16] [INFO ] Added : 50 causal constraints over 11 iterations in 144 ms. Result :sat
Minimization took 37 ms.
[2023-03-22 04:16:16] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 04:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:16] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-22 04:16:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:16] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 04:16:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:16] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2023-03-22 04:16:16] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-22 04:16:16] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-22 04:16:16] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 04:16:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-22 04:16:16] [INFO ] Added : 42 causal constraints over 9 iterations in 154 ms. Result :sat
Minimization took 47 ms.
[2023-03-22 04:16:16] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-22 04:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:16] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 04:16:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:16] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:16] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2023-03-22 04:16:16] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-22 04:16:16] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 04:16:16] [INFO ] Added : 54 causal constraints over 12 iterations in 155 ms. Result :sat
Minimization took 51 ms.
[2023-03-22 04:16:17] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:17] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-22 04:16:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:17] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 04:16:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:17] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2023-03-22 04:16:17] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-22 04:16:17] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 04:16:17] [INFO ] Added : 59 causal constraints over 12 iterations in 143 ms. Result :sat
Minimization took 40 ms.
[2023-03-22 04:16:17] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:17] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-22 04:16:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:17] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 04:16:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:17] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2023-03-22 04:16:17] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-22 04:16:17] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 04:16:17] [INFO ] Added : 55 causal constraints over 11 iterations in 142 ms. Result :sat
Minimization took 41 ms.
[2023-03-22 04:16:17] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:17] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 04:16:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:17] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 04:16:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:17] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-22 04:16:17] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-22 04:16:17] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 04:16:18] [INFO ] Added : 52 causal constraints over 11 iterations in 135 ms. Result :sat
Minimization took 47 ms.
[2023-03-22 04:16:18] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:18] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-22 04:16:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:18] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 04:16:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:19] [INFO ] [Nat]Absence check using state equation in 1758 ms returned sat
[2023-03-22 04:16:19] [INFO ] [Nat]Added 16 Read/Feed constraints in 15 ms returned sat
[2023-03-22 04:16:19] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-22 04:16:20] [INFO ] Added : 60 causal constraints over 13 iterations in 173 ms. Result :sat
Minimization took 66 ms.
[2023-03-22 04:16:20] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 04:16:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:20] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-22 04:16:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:20] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:20] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-22 04:16:20] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-22 04:16:20] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 04:16:20] [INFO ] Added : 53 causal constraints over 11 iterations in 129 ms. Result :sat
Minimization took 44 ms.
[2023-03-22 04:16:20] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:20] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-22 04:16:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:20] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 04:16:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:20] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-22 04:16:20] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-22 04:16:20] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 04:16:20] [INFO ] Added : 47 causal constraints over 12 iterations in 128 ms. Result :sat
Minimization took 61 ms.
[2023-03-22 04:16:20] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 04:16:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:20] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 04:16:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:21] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 04:16:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:21] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2023-03-22 04:16:21] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-22 04:16:21] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 04:16:21] [INFO ] Added : 51 causal constraints over 11 iterations in 178 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203] Max seen :[200, 201, 202, 198, 201, 202, 198, 199, 200, 195, 197, 200, 200, 201, 201]
FORMULA JoinFreeModules-PT-0200-UpperBounds-05 203 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-0200-UpperBounds-02 203 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 13 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 65 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 4 ms. Remains 65 /80 variables (removed 15) and now considering 104/128 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 65/80 places, 104/128 transitions.
// Phase 1: matrix 104 rows 65 cols
[2023-03-22 04:16:22] [INFO ] Computed 13 place invariants in 3 ms
Incomplete random walk after 1000029 steps, including 2 resets, run finished after 830 ms. (steps per millisecond=1204 ) properties (out of 13) seen :2579
FORMULA JoinFreeModules-PT-0200-UpperBounds-13 203 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 920 ms. (steps per millisecond=1086 ) properties (out of 12) seen :724
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 905 ms. (steps per millisecond=1104 ) properties (out of 12) seen :708
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 921 ms. (steps per millisecond=1085 ) properties (out of 12) seen :785
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 908 ms. (steps per millisecond=1101 ) properties (out of 12) seen :707
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 937 ms. (steps per millisecond=1067 ) properties (out of 12) seen :676
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 918 ms. (steps per millisecond=1089 ) properties (out of 12) seen :756
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 928 ms. (steps per millisecond=1077 ) properties (out of 12) seen :625
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 944 ms. (steps per millisecond=1059 ) properties (out of 12) seen :735
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 933 ms. (steps per millisecond=1071 ) properties (out of 12) seen :672
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 927 ms. (steps per millisecond=1078 ) properties (out of 12) seen :780
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 937 ms. (steps per millisecond=1067 ) properties (out of 12) seen :683
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 910 ms. (steps per millisecond=1098 ) properties (out of 12) seen :707
[2023-03-22 04:16:34] [INFO ] Invariant cache hit.
[2023-03-22 04:16:34] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-22 04:16:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:34] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 04:16:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:34] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2023-03-22 04:16:34] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-22 04:16:34] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2023-03-22 04:16:34] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 04:16:34] [INFO ] Added : 38 causal constraints over 8 iterations in 102 ms. Result :sat
Minimization took 53 ms.
[2023-03-22 04:16:34] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:34] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 04:16:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-22 04:16:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:35] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-22 04:16:35] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2023-03-22 04:16:35] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 04:16:35] [INFO ] Added : 40 causal constraints over 8 iterations in 121 ms. Result :sat
Minimization took 37 ms.
[2023-03-22 04:16:35] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:35] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 04:16:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:35] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2023-03-22 04:16:35] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-22 04:16:35] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 04:16:35] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 04:16:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-22 04:16:35] [INFO ] Added : 38 causal constraints over 10 iterations in 141 ms. Result :sat
Minimization took 38 ms.
[2023-03-22 04:16:35] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:35] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 04:16:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:35] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-22 04:16:35] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2023-03-22 04:16:35] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 04:16:35] [INFO ] Added : 49 causal constraints over 12 iterations in 120 ms. Result :sat
Minimization took 44 ms.
[2023-03-22 04:16:36] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:36] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 04:16:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-22 04:16:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:36] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-22 04:16:36] [INFO ] [Nat]Added 13 Read/Feed constraints in 1 ms returned sat
[2023-03-22 04:16:36] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-22 04:16:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 04:16:36] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:36] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 04:16:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-22 04:16:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:36] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-22 04:16:36] [INFO ] [Nat]Added 13 Read/Feed constraints in 20 ms returned sat
[2023-03-22 04:16:36] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 04:16:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 04:16:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-22 04:16:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 61 ms
[2023-03-22 04:16:36] [INFO ] Added : 36 causal constraints over 10 iterations in 144 ms. Result :sat
Minimization took 44 ms.
[2023-03-22 04:16:36] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:36] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 04:16:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:36] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-22 04:16:36] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-22 04:16:36] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 04:16:36] [INFO ] Added : 42 causal constraints over 10 iterations in 112 ms. Result :sat
Minimization took 33 ms.
[2023-03-22 04:16:36] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:36] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 04:16:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:37] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-22 04:16:37] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-22 04:16:37] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 5 ms to minimize.
[2023-03-22 04:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-22 04:16:37] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:37] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 04:16:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:37] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-22 04:16:37] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-22 04:16:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 04:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 04:16:37] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:37] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 04:16:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:37] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-22 04:16:37] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-22 04:16:37] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 04:16:37] [INFO ] Added : 35 causal constraints over 8 iterations in 91 ms. Result :sat
Minimization took 40 ms.
[2023-03-22 04:16:37] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:37] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 04:16:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:37] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-22 04:16:37] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-22 04:16:37] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-03-22 04:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 04:16:37] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:37] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 04:16:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:37] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2023-03-22 04:16:37] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2023-03-22 04:16:37] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 04:16:38] [INFO ] Added : 46 causal constraints over 10 iterations in 118 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [203, 203, 203, 203, 202, 203, 203, 202, 202, 203, 202, 203] Max seen :[200, 201, 200, 201, 202, 200, 200, 202, 202, 200, 202, 201]
FORMULA JoinFreeModules-PT-0200-UpperBounds-12 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0200-UpperBounds-10 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0200-UpperBounds-09 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0200-UpperBounds-06 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 8 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 40 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions removed 40 transitions
Applied a total of 1 rules in 5 ms. Remains 40 /65 variables (removed 25) and now considering 64/104 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 40/65 places, 64/104 transitions.
// Phase 1: matrix 64 rows 40 cols
[2023-03-22 04:16:38] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 1000012 steps, including 2 resets, run finished after 521 ms. (steps per millisecond=1919 ) properties (out of 8) seen :1596
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 586 ms. (steps per millisecond=1706 ) properties (out of 8) seen :1045
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 580 ms. (steps per millisecond=1724 ) properties (out of 8) seen :884
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 588 ms. (steps per millisecond=1700 ) properties (out of 8) seen :1045
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 560 ms. (steps per millisecond=1785 ) properties (out of 8) seen :865
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 571 ms. (steps per millisecond=1751 ) properties (out of 8) seen :1052
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 563 ms. (steps per millisecond=1776 ) properties (out of 8) seen :880
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 581 ms. (steps per millisecond=1721 ) properties (out of 8) seen :1026
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 569 ms. (steps per millisecond=1757 ) properties (out of 8) seen :882
[2023-03-22 04:16:43] [INFO ] Invariant cache hit.
[2023-03-22 04:16:43] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:43] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 04:16:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:43] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-22 04:16:43] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 04:16:43] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-22 04:16:43] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 04:16:43] [INFO ] Added : 28 causal constraints over 8 iterations in 73 ms. Result :sat
Minimization took 23 ms.
[2023-03-22 04:16:44] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:44] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-22 04:16:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:44] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-22 04:16:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-22 04:16:44] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 04:16:44] [INFO ] Added : 14 causal constraints over 4 iterations in 41 ms. Result :sat
Minimization took 21 ms.
[2023-03-22 04:16:44] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:44] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-22 04:16:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:44] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-22 04:16:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 04:16:44] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 04:16:44] [INFO ] Added : 16 causal constraints over 5 iterations in 44 ms. Result :sat
Minimization took 20 ms.
[2023-03-22 04:16:44] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:44] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-22 04:16:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:44] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-22 04:16:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-22 04:16:44] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 04:16:44] [INFO ] Added : 18 causal constraints over 4 iterations in 29 ms. Result :sat
Minimization took 15 ms.
[2023-03-22 04:16:44] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:44] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-22 04:16:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:44] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-22 04:16:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 37 ms returned sat
[2023-03-22 04:16:44] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 04:16:44] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2023-03-22 04:16:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2023-03-22 04:16:44] [INFO ] Added : 32 causal constraints over 7 iterations in 101 ms. Result :sat
Minimization took 43 ms.
[2023-03-22 04:16:45] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:45] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-22 04:16:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:45] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2023-03-22 04:16:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-22 04:16:45] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 04:16:45] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-22 04:16:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-22 04:16:45] [INFO ] Added : 17 causal constraints over 5 iterations in 63 ms. Result :sat
Minimization took 14 ms.
[2023-03-22 04:16:45] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:45] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-22 04:16:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:45] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-22 04:16:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-22 04:16:45] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 04:16:45] [INFO ] Added : 10 causal constraints over 3 iterations in 49 ms. Result :sat
Minimization took 12 ms.
[2023-03-22 04:16:45] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:45] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 04:16:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:45] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-22 04:16:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-22 04:16:45] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 04:16:45] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 04:16:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-22 04:16:45] [INFO ] Added : 21 causal constraints over 5 iterations in 89 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [203, 203, 203, 203, 203, 203, 203, 203] Max seen :[201, 201, 201, 201, 200, 200, 200, 201]
Support contains 8 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 40/40 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-22 04:16:45] [INFO ] Invariant cache hit.
[2023-03-22 04:16:46] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-22 04:16:46] [INFO ] Invariant cache hit.
[2023-03-22 04:16:46] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 04:16:46] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-22 04:16:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 04:16:46] [INFO ] Invariant cache hit.
[2023-03-22 04:16:46] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 40/40 places, 64/64 transitions.
[2023-03-22 04:16:46] [INFO ] Invariant cache hit.
Incomplete random walk after 1000085 steps, including 2 resets, run finished after 547 ms. (steps per millisecond=1828 ) properties (out of 8) seen :1598
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 606 ms. (steps per millisecond=1650 ) properties (out of 8) seen :1046
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 571 ms. (steps per millisecond=1751 ) properties (out of 8) seen :871
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 579 ms. (steps per millisecond=1727 ) properties (out of 8) seen :1054
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 578 ms. (steps per millisecond=1730 ) properties (out of 8) seen :875
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 581 ms. (steps per millisecond=1721 ) properties (out of 8) seen :1053
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 567 ms. (steps per millisecond=1763 ) properties (out of 8) seen :875
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 589 ms. (steps per millisecond=1697 ) properties (out of 8) seen :1061
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 573 ms. (steps per millisecond=1745 ) properties (out of 8) seen :883
[2023-03-22 04:16:51] [INFO ] Invariant cache hit.
[2023-03-22 04:16:51] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:51] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-22 04:16:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:51] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-22 04:16:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 04:16:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-22 04:16:51] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 04:16:51] [INFO ] Added : 28 causal constraints over 8 iterations in 72 ms. Result :sat
Minimization took 22 ms.
[2023-03-22 04:16:51] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:51] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-22 04:16:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:51] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-22 04:16:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 04:16:51] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 04:16:51] [INFO ] Added : 14 causal constraints over 4 iterations in 39 ms. Result :sat
Minimization took 21 ms.
[2023-03-22 04:16:51] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:51] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-22 04:16:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:51] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-22 04:16:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 04:16:51] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 04:16:51] [INFO ] Added : 16 causal constraints over 5 iterations in 46 ms. Result :sat
Minimization took 19 ms.
[2023-03-22 04:16:52] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:52] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-22 04:16:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:52] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-22 04:16:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-22 04:16:52] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 04:16:52] [INFO ] Added : 18 causal constraints over 4 iterations in 23 ms. Result :sat
Minimization took 15 ms.
[2023-03-22 04:16:52] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:52] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-22 04:16:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:52] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-22 04:16:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
[2023-03-22 04:16:52] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 04:16:52] [INFO ] Added : 20 causal constraints over 5 iterations in 56 ms. Result :sat
Minimization took 20 ms.
[2023-03-22 04:16:52] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:52] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-22 04:16:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:52] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2023-03-22 04:16:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-22 04:16:52] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 04:16:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 04:16:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-22 04:16:52] [INFO ] Added : 17 causal constraints over 5 iterations in 61 ms. Result :sat
Minimization took 13 ms.
[2023-03-22 04:16:52] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:52] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 04:16:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:52] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-22 04:16:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 34 ms returned sat
[2023-03-22 04:16:52] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 04:16:52] [INFO ] Added : 23 causal constraints over 6 iterations in 63 ms. Result :sat
Minimization took 23 ms.
[2023-03-22 04:16:52] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:52] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-22 04:16:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:52] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-22 04:16:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 04:16:52] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 04:16:53] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2023-03-22 04:16:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-03-22 04:16:53] [INFO ] Added : 21 causal constraints over 5 iterations in 85 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [203, 203, 203, 203, 203, 203, 203, 203] Max seen :[201, 201, 201, 201, 201, 200, 201, 201]
Support contains 8 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 40/40 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-22 04:16:53] [INFO ] Invariant cache hit.
[2023-03-22 04:16:53] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-22 04:16:53] [INFO ] Invariant cache hit.
[2023-03-22 04:16:53] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 04:16:53] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-22 04:16:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 04:16:53] [INFO ] Invariant cache hit.
[2023-03-22 04:16:53] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 40/40 places, 64/64 transitions.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-00
[2023-03-22 04:16:53] [INFO ] Invariant cache hit.
Incomplete random walk after 10034 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2006 ) properties (out of 1) seen :100
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :112
[2023-03-22 04:16:53] [INFO ] Invariant cache hit.
[2023-03-22 04:16:53] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:53] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-22 04:16:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:53] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-22 04:16:53] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 04:16:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 04:16:53] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 04:16:53] [INFO ] Added : 21 causal constraints over 5 iterations in 47 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[112]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.1 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 04:16:53] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 04:16:53] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 5/40 places, 8/64 transitions.
[2023-03-22 04:16:53] [INFO ] Invariant cache hit.
Incomplete random walk after 1000026 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=8849 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=6944 ) properties (out of 1) seen :200
[2023-03-22 04:16:54] [INFO ] Invariant cache hit.
[2023-03-22 04:16:54] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 04:16:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:54] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 04:16:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:54] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 04:16:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 04:16:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 04:16:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 04:16:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-03-22 04:16:54] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 04:16:54] [INFO ] Added : 5 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-22 04:16:54] [INFO ] Invariant cache hit.
[2023-03-22 04:16:54] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-22 04:16:54] [INFO ] Invariant cache hit.
[2023-03-22 04:16:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 04:16:54] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-22 04:16:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 04:16:54] [INFO ] Invariant cache hit.
[2023-03-22 04:16:54] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 5/5 places, 8/8 transitions.
[2023-03-22 04:16:54] [INFO ] Invariant cache hit.
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=8928 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=7575 ) properties (out of 1) seen :200
[2023-03-22 04:16:54] [INFO ] Invariant cache hit.
[2023-03-22 04:16:54] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 04:16:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:54] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-22 04:16:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 04:16:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:54] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 04:16:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 04:16:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 04:16:54] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2023-03-22 04:16:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2023-03-22 04:16:54] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 04:16:54] [INFO ] Added : 5 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-22 04:16:54] [INFO ] Invariant cache hit.
[2023-03-22 04:16:54] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-22 04:16:54] [INFO ] Invariant cache hit.
[2023-03-22 04:16:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 04:16:54] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-22 04:16:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 04:16:54] [INFO ] Invariant cache hit.
[2023-03-22 04:16:54] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-00 in 1297 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-01
// Phase 1: matrix 64 rows 40 cols
[2023-03-22 04:16:54] [INFO ] Computed 8 place invariants in 0 ms
Incomplete random walk after 10005 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1667 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :187
[2023-03-22 04:16:54] [INFO ] Invariant cache hit.
[2023-03-22 04:16:54] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:54] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-22 04:16:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:54] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-22 04:16:54] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 04:16:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-22 04:16:54] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 04:16:54] [INFO ] Added : 14 causal constraints over 4 iterations in 40 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 04:16:55] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 04:16:55] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 5/40 places, 8/64 transitions.
[2023-03-22 04:16:55] [INFO ] Invariant cache hit.
Incomplete random walk after 1000009 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=8928 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=5434 ) properties (out of 1) seen :201
[2023-03-22 04:16:55] [INFO ] Invariant cache hit.
[2023-03-22 04:16:55] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 04:16:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:55] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-22 04:16:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 04:16:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:55] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 04:16:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 04:16:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 04:16:55] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 04:16:55] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-22 04:16:55] [INFO ] Invariant cache hit.
[2023-03-22 04:16:55] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-22 04:16:55] [INFO ] Invariant cache hit.
[2023-03-22 04:16:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 04:16:55] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-22 04:16:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 04:16:55] [INFO ] Invariant cache hit.
[2023-03-22 04:16:55] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-01 in 881 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-03
// Phase 1: matrix 64 rows 40 cols
[2023-03-22 04:16:55] [INFO ] Computed 8 place invariants in 0 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :168
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :122
[2023-03-22 04:16:55] [INFO ] Invariant cache hit.
[2023-03-22 04:16:55] [INFO ] [Real]Absence check using 8 positive place invariants in 30 ms returned sat
[2023-03-22 04:16:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:55] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 04:16:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:55] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-22 04:16:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 04:16:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 04:16:55] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 04:16:55] [INFO ] Added : 10 causal constraints over 2 iterations in 37 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[168]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 04:16:56] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 04:16:56] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 5/40 places, 8/64 transitions.
[2023-03-22 04:16:56] [INFO ] Invariant cache hit.
Incomplete random walk after 1000013 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=9009 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=7518 ) properties (out of 1) seen :200
[2023-03-22 04:16:56] [INFO ] Invariant cache hit.
[2023-03-22 04:16:56] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:56] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 04:16:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 04:16:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:56] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 04:16:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 04:16:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 04:16:56] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-22 04:16:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-03-22 04:16:56] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 04:16:56] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-22 04:16:56] [INFO ] Invariant cache hit.
[2023-03-22 04:16:56] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-22 04:16:56] [INFO ] Invariant cache hit.
[2023-03-22 04:16:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 04:16:56] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-22 04:16:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 04:16:56] [INFO ] Invariant cache hit.
[2023-03-22 04:16:56] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-03 in 855 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-04
// Phase 1: matrix 64 rows 40 cols
[2023-03-22 04:16:56] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 10003 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :159
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :187
[2023-03-22 04:16:56] [INFO ] Invariant cache hit.
[2023-03-22 04:16:56] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:56] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 04:16:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:56] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-22 04:16:56] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 04:16:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-22 04:16:56] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 04:16:56] [INFO ] Added : 19 causal constraints over 4 iterations in 27 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[187]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 04:16:56] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 04:16:56] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 5/40 places, 8/64 transitions.
[2023-03-22 04:16:56] [INFO ] Invariant cache hit.
Incomplete random walk after 1000052 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=8264 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=5524 ) properties (out of 1) seen :201
[2023-03-22 04:16:57] [INFO ] Invariant cache hit.
[2023-03-22 04:16:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:57] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 04:16:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 04:16:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:57] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-22 04:16:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 04:16:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 04:16:57] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 04:16:57] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-22 04:16:57] [INFO ] Invariant cache hit.
[2023-03-22 04:16:57] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-22 04:16:57] [INFO ] Invariant cache hit.
[2023-03-22 04:16:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 04:16:57] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-22 04:16:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 04:16:57] [INFO ] Invariant cache hit.
[2023-03-22 04:16:57] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-04 in 707 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-07
// Phase 1: matrix 64 rows 40 cols
[2023-03-22 04:16:57] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 10005 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1429 ) properties (out of 1) seen :142
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :108
[2023-03-22 04:16:57] [INFO ] Invariant cache hit.
[2023-03-22 04:16:57] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:57] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-22 04:16:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:57] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-22 04:16:57] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 04:16:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-22 04:16:57] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 04:16:57] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-22 04:16:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-03-22 04:16:57] [INFO ] Added : 32 causal constraints over 8 iterations in 120 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[142]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 04:16:57] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 04:16:57] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 5/40 places, 8/64 transitions.
[2023-03-22 04:16:57] [INFO ] Invariant cache hit.
Incomplete random walk after 1000009 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=8695 ) properties (out of 1) seen :199
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=7246 ) properties (out of 1) seen :198
[2023-03-22 04:16:58] [INFO ] Invariant cache hit.
[2023-03-22 04:16:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:58] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 04:16:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 04:16:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:58] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 04:16:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 04:16:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 04:16:58] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 04:16:58] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[200]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-22 04:16:58] [INFO ] Invariant cache hit.
[2023-03-22 04:16:58] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-22 04:16:58] [INFO ] Invariant cache hit.
[2023-03-22 04:16:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 04:16:58] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-22 04:16:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 04:16:58] [INFO ] Invariant cache hit.
[2023-03-22 04:16:58] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 5/5 places, 8/8 transitions.
[2023-03-22 04:16:58] [INFO ] Invariant cache hit.
Incomplete random walk after 1000071 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=8403 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=6756 ) properties (out of 1) seen :198
[2023-03-22 04:16:58] [INFO ] Invariant cache hit.
[2023-03-22 04:16:58] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 04:16:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:58] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 04:16:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:58] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-22 04:16:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 04:16:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-22 04:16:58] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 04:16:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-03-22 04:16:58] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 04:16:58] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-22 04:16:58] [INFO ] Invariant cache hit.
[2023-03-22 04:16:58] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-22 04:16:58] [INFO ] Invariant cache hit.
[2023-03-22 04:16:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 04:16:58] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-22 04:16:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 04:16:58] [INFO ] Invariant cache hit.
[2023-03-22 04:16:58] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-07 in 1454 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-08
// Phase 1: matrix 64 rows 40 cols
[2023-03-22 04:16:58] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 10013 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1112 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :200
[2023-03-22 04:16:58] [INFO ] Invariant cache hit.
[2023-03-22 04:16:58] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:58] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-22 04:16:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 04:16:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:58] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2023-03-22 04:16:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 04:16:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 04:16:58] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 04:16:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 04:16:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-22 04:16:58] [INFO ] Added : 17 causal constraints over 5 iterations in 72 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[200]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 04:16:58] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 04:16:59] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 5/40 places, 8/64 transitions.
[2023-03-22 04:16:59] [INFO ] Invariant cache hit.
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=8771 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=6896 ) properties (out of 1) seen :200
[2023-03-22 04:16:59] [INFO ] Invariant cache hit.
[2023-03-22 04:16:59] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:59] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 04:16:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 04:16:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:59] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 04:16:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 04:16:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 04:16:59] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 04:16:59] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[200]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-22 04:16:59] [INFO ] Invariant cache hit.
[2023-03-22 04:16:59] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-22 04:16:59] [INFO ] Invariant cache hit.
[2023-03-22 04:16:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 04:16:59] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-22 04:16:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 04:16:59] [INFO ] Invariant cache hit.
[2023-03-22 04:16:59] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-08 in 736 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-11
// Phase 1: matrix 64 rows 40 cols
[2023-03-22 04:16:59] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 10100 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1442 ) properties (out of 1) seen :162
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :112
[2023-03-22 04:16:59] [INFO ] Invariant cache hit.
[2023-03-22 04:16:59] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:59] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-22 04:16:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:16:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:16:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:16:59] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-22 04:16:59] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 04:16:59] [INFO ] [Nat]Added 8 Read/Feed constraints in 34 ms returned sat
[2023-03-22 04:16:59] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 04:16:59] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-22 04:16:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-22 04:16:59] [INFO ] Added : 29 causal constraints over 6 iterations in 85 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[162]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 04:16:59] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 04:16:59] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 5/40 places, 8/64 transitions.
[2023-03-22 04:16:59] [INFO ] Invariant cache hit.
Incomplete random walk after 1000040 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=8547 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=6944 ) properties (out of 1) seen :200
[2023-03-22 04:17:00] [INFO ] Invariant cache hit.
[2023-03-22 04:17:00] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 04:17:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:17:00] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 04:17:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:17:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 04:17:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:17:00] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 04:17:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 04:17:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-22 04:17:00] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-22 04:17:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2023-03-22 04:17:00] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 04:17:00] [INFO ] Added : 5 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 4 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-22 04:17:00] [INFO ] Invariant cache hit.
[2023-03-22 04:17:00] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-22 04:17:00] [INFO ] Invariant cache hit.
[2023-03-22 04:17:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 04:17:00] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-22 04:17:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 04:17:00] [INFO ] Invariant cache hit.
[2023-03-22 04:17:00] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-11 in 862 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-14
// Phase 1: matrix 64 rows 40 cols
[2023-03-22 04:17:00] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 10006 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :187
[2023-03-22 04:17:00] [INFO ] Invariant cache hit.
[2023-03-22 04:17:00] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:17:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:17:00] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 04:17:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:17:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-22 04:17:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:17:00] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-22 04:17:00] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 04:17:00] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 04:17:00] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 04:17:00] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 04:17:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-03-22 04:17:00] [INFO ] Added : 21 causal constraints over 5 iterations in 82 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 04:17:00] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-22 04:17:00] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 5/40 places, 8/64 transitions.
[2023-03-22 04:17:00] [INFO ] Invariant cache hit.
Incomplete random walk after 1000012 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=8695 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=6410 ) properties (out of 1) seen :201
[2023-03-22 04:17:00] [INFO ] Invariant cache hit.
[2023-03-22 04:17:00] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 04:17:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:17:00] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 04:17:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:17:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 04:17:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:17:00] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 04:17:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 04:17:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 04:17:00] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 04:17:00] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-22 04:17:00] [INFO ] Invariant cache hit.
[2023-03-22 04:17:00] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-22 04:17:00] [INFO ] Invariant cache hit.
[2023-03-22 04:17:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 04:17:01] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-22 04:17:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 04:17:01] [INFO ] Invariant cache hit.
[2023-03-22 04:17:01] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-14 in 727 ms.
[2023-03-22 04:17:01] [INFO ] Flatten gal took : 22 ms
[2023-03-22 04:17:01] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-22 04:17:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 40 places, 64 transitions and 168 arcs took 1 ms.
Total runtime 250791 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: JoinFreeModules_PT_0200
(NrP: 40 NrTr: 64 NrArc: 168)

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

net check time: 0m 0.000sec

init dd package: 0m 2.722sec


RS generation: 0m11.860sec


-> reachability set: #nodes 8168 (8.2e+03) #states 928,639,490,413,445,481,873,317,550,170,524,789,908,674,871,664,543,012,250,390,625 (62)



starting MCC model checker
--------------------------

checking: place_bound(p28)
normalized: place_bound(p28)

-> the formula is 202

FORMULA JoinFreeModules-PT-0200-UpperBounds-00 202 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p36)
normalized: place_bound(p36)

-> the formula is 201

FORMULA JoinFreeModules-PT-0200-UpperBounds-01 201 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p33)
normalized: place_bound(p33)

-> the formula is 202

FORMULA JoinFreeModules-PT-0200-UpperBounds-03 202 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p1)
normalized: place_bound(p1)

-> the formula is 201

FORMULA JoinFreeModules-PT-0200-UpperBounds-04 201 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p13)
normalized: place_bound(p13)

-> the formula is 202

FORMULA JoinFreeModules-PT-0200-UpperBounds-07 202 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p22)
normalized: place_bound(p22)

-> the formula is 200

FORMULA JoinFreeModules-PT-0200-UpperBounds-08 200 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p18)
normalized: place_bound(p18)

-> the formula is 202

FORMULA JoinFreeModules-PT-0200-UpperBounds-11 202 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p6)
normalized: place_bound(p6)

-> the formula is 201

FORMULA JoinFreeModules-PT-0200-UpperBounds-14 201 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 371552 (3.7e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 35174478 1224488 36398966
used/not used/entry size/cache size: 1405926 65702938 16 1024MB
basic ops cache: hits/miss/sum: 26573 11741 38314
used/not used/entry size/cache size: 18121 16759095 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 668440 8168 676608
used/not used/entry size/cache size: 8165 8380443 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66789342
1 290674
2 21484
3 5715
4 80
5 1
6 0
7 0
8 8
9 0
>= 10 1560

Total processing time: 0m16.310sec


BK_STOP 1679458638474

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

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


initing FirstDep: 0m 0.000sec


iterations count:32912 (514), effective:12168 (190)

initing FirstDep: 0m 0.000sec

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is JoinFreeModules-PT-0200, 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 r234-tall-167856420000197"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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