About the Execution of ITS-Tools for ASLink-PT-03b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16216.336 | 3600000.00 | 3689895.00 | 9272.30 | 1 1 1 1 1 1 ? 1 1 1 1 1 1 1 ? 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813592600053.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ASLink-PT-03b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813592600053
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 944K
-rw-r--r-- 1 mcc users 6.5K Feb 26 13:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 13:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 13:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 13:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 13:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 13:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 13:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 13:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 544K 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 ASLink-PT-03b-UpperBounds-00
FORMULA_NAME ASLink-PT-03b-UpperBounds-01
FORMULA_NAME ASLink-PT-03b-UpperBounds-02
FORMULA_NAME ASLink-PT-03b-UpperBounds-03
FORMULA_NAME ASLink-PT-03b-UpperBounds-04
FORMULA_NAME ASLink-PT-03b-UpperBounds-05
FORMULA_NAME ASLink-PT-03b-UpperBounds-06
FORMULA_NAME ASLink-PT-03b-UpperBounds-07
FORMULA_NAME ASLink-PT-03b-UpperBounds-08
FORMULA_NAME ASLink-PT-03b-UpperBounds-09
FORMULA_NAME ASLink-PT-03b-UpperBounds-10
FORMULA_NAME ASLink-PT-03b-UpperBounds-11
FORMULA_NAME ASLink-PT-03b-UpperBounds-12
FORMULA_NAME ASLink-PT-03b-UpperBounds-13
FORMULA_NAME ASLink-PT-03b-UpperBounds-14
FORMULA_NAME ASLink-PT-03b-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678488227280
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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-03b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-10 22:43:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 22:43:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 22:43:50] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2023-03-10 22:43:50] [INFO ] Transformed 1638 places.
[2023-03-10 22:43:50] [INFO ] Transformed 2094 transitions.
[2023-03-10 22:43:50] [INFO ] Found NUPN structural information;
[2023-03-10 22:43:50] [INFO ] Parsed PT model containing 1638 places and 2094 transitions and 6458 arcs in 279 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 2094 rows 1638 cols
[2023-03-10 22:43:50] [INFO ] Computed 160 place invariants in 93 ms
Incomplete random walk after 10000 steps, including 27 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 16) seen :11
FORMULA ASLink-PT-03b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :0
[2023-03-10 22:43:51] [INFO ] Invariant cache hit.
[2023-03-10 22:43:51] [INFO ] [Real]Absence check using 37 positive place invariants in 38 ms returned sat
[2023-03-10 22:43:51] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 67 ms returned sat
[2023-03-10 22:43:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:43:52] [INFO ] [Real]Absence check using state equation in 1038 ms returned sat
[2023-03-10 22:43:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:43:53] [INFO ] [Nat]Absence check using 37 positive place invariants in 29 ms returned sat
[2023-03-10 22:43:53] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 90 ms returned sat
[2023-03-10 22:43:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:43:55] [INFO ] [Nat]Absence check using state equation in 2595 ms returned sat
[2023-03-10 22:43:56] [INFO ] Deduced a trap composed of 70 places in 552 ms of which 6 ms to minimize.
[2023-03-10 22:43:57] [INFO ] Deduced a trap composed of 245 places in 528 ms of which 2 ms to minimize.
[2023-03-10 22:43:57] [INFO ] Deduced a trap composed of 97 places in 481 ms of which 1 ms to minimize.
[2023-03-10 22:43:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1888 ms
[2023-03-10 22:43:58] [INFO ] Computed and/alt/rep : 1742/3856/1742 causal constraints (skipped 351 transitions) in 187 ms.
[2023-03-10 22:43:58] [INFO ] Added : 0 causal constraints over 0 iterations in 188 ms. Result :unknown
[2023-03-10 22:43:58] [INFO ] [Real]Absence check using 37 positive place invariants in 25 ms returned sat
[2023-03-10 22:43:58] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 89 ms returned sat
[2023-03-10 22:43:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:43:59] [INFO ] [Real]Absence check using state equation in 1241 ms returned sat
[2023-03-10 22:43:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:44:00] [INFO ] [Nat]Absence check using 37 positive place invariants in 68 ms returned sat
[2023-03-10 22:44:00] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 46 ms returned sat
[2023-03-10 22:44:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:44:02] [INFO ] [Nat]Absence check using state equation in 2394 ms returned sat
[2023-03-10 22:44:02] [INFO ] Deduced a trap composed of 26 places in 394 ms of which 1 ms to minimize.
[2023-03-10 22:44:03] [INFO ] Deduced a trap composed of 26 places in 406 ms of which 1 ms to minimize.
[2023-03-10 22:44:03] [INFO ] Deduced a trap composed of 106 places in 406 ms of which 0 ms to minimize.
[2023-03-10 22:44:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1644 ms
[2023-03-10 22:44:04] [INFO ] Computed and/alt/rep : 1742/3856/1742 causal constraints (skipped 351 transitions) in 145 ms.
[2023-03-10 22:44:04] [INFO ] Added : 5 causal constraints over 1 iterations in 649 ms. Result :unknown
[2023-03-10 22:44:05] [INFO ] [Real]Absence check using 37 positive place invariants in 49 ms returned sat
[2023-03-10 22:44:05] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 57 ms returned sat
[2023-03-10 22:44:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:44:06] [INFO ] [Real]Absence check using state equation in 1100 ms returned sat
[2023-03-10 22:44:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:44:06] [INFO ] [Nat]Absence check using 37 positive place invariants in 58 ms returned sat
[2023-03-10 22:44:06] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 53 ms returned sat
[2023-03-10 22:44:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:44:07] [INFO ] [Nat]Absence check using state equation in 1080 ms returned sat
[2023-03-10 22:44:08] [INFO ] Deduced a trap composed of 67 places in 669 ms of which 3 ms to minimize.
[2023-03-10 22:44:09] [INFO ] Deduced a trap composed of 49 places in 727 ms of which 1 ms to minimize.
[2023-03-10 22:44:10] [INFO ] Deduced a trap composed of 176 places in 414 ms of which 1 ms to minimize.
[2023-03-10 22:44:10] [INFO ] Deduced a trap composed of 153 places in 542 ms of which 1 ms to minimize.
[2023-03-10 22:44:11] [INFO ] Deduced a trap composed of 104 places in 426 ms of which 1 ms to minimize.
[2023-03-10 22:44:11] [INFO ] Deduced a trap composed of 135 places in 410 ms of which 1 ms to minimize.
[2023-03-10 22:44:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 22:44:11] [INFO ] [Real]Absence check using 37 positive place invariants in 24 ms returned sat
[2023-03-10 22:44:11] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 47 ms returned sat
[2023-03-10 22:44:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:44:12] [INFO ] [Real]Absence check using state equation in 914 ms returned sat
[2023-03-10 22:44:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:44:13] [INFO ] [Nat]Absence check using 37 positive place invariants in 27 ms returned sat
[2023-03-10 22:44:13] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 43 ms returned sat
[2023-03-10 22:44:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:44:17] [INFO ] [Nat]Absence check using state equation in 4647 ms returned unknown
[2023-03-10 22:44:18] [INFO ] [Real]Absence check using 37 positive place invariants in 37 ms returned sat
[2023-03-10 22:44:18] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 151 ms returned sat
[2023-03-10 22:44:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:44:19] [INFO ] [Real]Absence check using state equation in 911 ms returned sat
[2023-03-10 22:44:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:44:19] [INFO ] [Nat]Absence check using 37 positive place invariants in 26 ms returned sat
[2023-03-10 22:44:20] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 84 ms returned sat
[2023-03-10 22:44:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:44:22] [INFO ] [Nat]Absence check using state equation in 2490 ms returned sat
[2023-03-10 22:44:23] [INFO ] Deduced a trap composed of 40 places in 905 ms of which 1 ms to minimize.
[2023-03-10 22:44:24] [INFO ] Deduced a trap composed of 18 places in 799 ms of which 1 ms to minimize.
[2023-03-10 22:44:25] [INFO ] Deduced a trap composed of 21 places in 703 ms of which 2 ms to minimize.
[2023-03-10 22:44:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 1638 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1638/1638 places, 2094/2094 transitions.
Drop transitions removed 370 transitions
Trivial Post-agglo rules discarded 370 transitions
Performed 370 trivial Post agglomeration. Transition count delta: 370
Iterating post reduction 0 with 370 rules applied. Total rules applied 370 place count 1638 transition count 1724
Reduce places removed 370 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 388 rules applied. Total rules applied 758 place count 1268 transition count 1706
Reduce places removed 5 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 8 rules applied. Total rules applied 766 place count 1263 transition count 1703
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 769 place count 1260 transition count 1703
Performed 374 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 374 Pre rules applied. Total rules applied 769 place count 1260 transition count 1329
Deduced a syphon composed of 374 places in 1 ms
Ensure Unique test removed 32 places
Reduce places removed 406 places and 0 transitions.
Iterating global reduction 4 with 780 rules applied. Total rules applied 1549 place count 854 transition count 1329
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 4 with 25 rules applied. Total rules applied 1574 place count 850 transition count 1308
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 1595 place count 829 transition count 1308
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1595 place count 829 transition count 1296
Deduced a syphon composed of 12 places in 4 ms
Ensure Unique test removed 10 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 1629 place count 807 transition count 1296
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 6 with 2 rules applied. Total rules applied 1631 place count 805 transition count 1296
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 12 Pre rules applied. Total rules applied 1631 place count 805 transition count 1284
Deduced a syphon composed of 12 places in 5 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1655 place count 793 transition count 1284
Discarding 51 places :
Symmetric choice reduction at 7 with 51 rule applications. Total rules 1706 place count 742 transition count 1233
Iterating global reduction 7 with 51 rules applied. Total rules applied 1757 place count 742 transition count 1233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1758 place count 742 transition count 1232
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 18 Pre rules applied. Total rules applied 1758 place count 742 transition count 1214
Deduced a syphon composed of 18 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 8 with 37 rules applied. Total rules applied 1795 place count 723 transition count 1214
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1795 place count 723 transition count 1213
Deduced a syphon composed of 1 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1798 place count 721 transition count 1213
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1802 place count 717 transition count 1186
Iterating global reduction 8 with 4 rules applied. Total rules applied 1806 place count 717 transition count 1186
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 1806 place count 717 transition count 1183
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1812 place count 714 transition count 1183
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1813 place count 713 transition count 1175
Iterating global reduction 8 with 1 rules applied. Total rules applied 1814 place count 713 transition count 1175
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1815 place count 712 transition count 1167
Iterating global reduction 8 with 1 rules applied. Total rules applied 1816 place count 712 transition count 1167
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1817 place count 711 transition count 1159
Iterating global reduction 8 with 1 rules applied. Total rules applied 1818 place count 711 transition count 1159
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1819 place count 710 transition count 1151
Iterating global reduction 8 with 1 rules applied. Total rules applied 1820 place count 710 transition count 1151
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1821 place count 709 transition count 1143
Iterating global reduction 8 with 1 rules applied. Total rules applied 1822 place count 709 transition count 1143
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1823 place count 708 transition count 1135
Iterating global reduction 8 with 1 rules applied. Total rules applied 1824 place count 708 transition count 1135
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1825 place count 707 transition count 1127
Iterating global reduction 8 with 1 rules applied. Total rules applied 1826 place count 707 transition count 1127
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1827 place count 706 transition count 1119
Iterating global reduction 8 with 1 rules applied. Total rules applied 1828 place count 706 transition count 1119
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1829 place count 705 transition count 1111
Iterating global reduction 8 with 1 rules applied. Total rules applied 1830 place count 705 transition count 1111
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1831 place count 704 transition count 1103
Iterating global reduction 8 with 1 rules applied. Total rules applied 1832 place count 704 transition count 1103
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1833 place count 703 transition count 1095
Iterating global reduction 8 with 1 rules applied. Total rules applied 1834 place count 703 transition count 1095
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1835 place count 702 transition count 1087
Iterating global reduction 8 with 1 rules applied. Total rules applied 1836 place count 702 transition count 1087
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1837 place count 701 transition count 1079
Iterating global reduction 8 with 1 rules applied. Total rules applied 1838 place count 701 transition count 1079
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1839 place count 700 transition count 1071
Iterating global reduction 8 with 1 rules applied. Total rules applied 1840 place count 700 transition count 1071
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1841 place count 699 transition count 1063
Iterating global reduction 8 with 1 rules applied. Total rules applied 1842 place count 699 transition count 1063
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1843 place count 698 transition count 1055
Iterating global reduction 8 with 1 rules applied. Total rules applied 1844 place count 698 transition count 1055
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 2 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 8 with 178 rules applied. Total rules applied 2022 place count 609 transition count 966
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2023 place count 608 transition count 965
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 2025 place count 607 transition count 965
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2026 place count 606 transition count 964
Iterating global reduction 8 with 1 rules applied. Total rules applied 2027 place count 606 transition count 964
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2029 place count 606 transition count 962
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2030 place count 605 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2032 place count 604 transition count 971
Free-agglomeration rule applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 2036 place count 604 transition count 967
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 2040 place count 600 transition count 967
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 2043 place count 600 transition count 964
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 2046 place count 597 transition count 964
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2047 place count 596 transition count 963
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 12 with 9 rules applied. Total rules applied 2056 place count 590 transition count 960
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 2059 place count 587 transition count 960
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 9 Pre rules applied. Total rules applied 2059 place count 587 transition count 951
Deduced a syphon composed of 9 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 14 with 19 rules applied. Total rules applied 2078 place count 577 transition count 951
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 14 with 4 rules applied. Total rules applied 2082 place count 573 transition count 951
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2082 place count 573 transition count 950
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2084 place count 572 transition count 950
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 15 with 14 rules applied. Total rules applied 2098 place count 565 transition count 943
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 2101 place count 562 transition count 940
Iterating global reduction 15 with 3 rules applied. Total rules applied 2104 place count 562 transition count 940
Free-agglomeration rule applied 3 times.
Iterating global reduction 15 with 3 rules applied. Total rules applied 2107 place count 562 transition count 937
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 2110 place count 559 transition count 937
Applied a total of 2110 rules in 983 ms. Remains 559 /1638 variables (removed 1079) and now considering 937/2094 (removed 1157) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 983 ms. Remains : 559/1638 places, 937/2094 transitions.
// Phase 1: matrix 937 rows 559 cols
[2023-03-10 22:44:27] [INFO ] Computed 98 place invariants in 42 ms
Incomplete random walk after 1000000 steps, including 14031 resets, run finished after 2113 ms. (steps per millisecond=473 ) properties (out of 5) seen :1
FORMULA ASLink-PT-03b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 3886 resets, run finished after 1015 ms. (steps per millisecond=985 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3866 resets, run finished after 1121 ms. (steps per millisecond=892 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3840 resets, run finished after 1063 ms. (steps per millisecond=940 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3857 resets, run finished after 903 ms. (steps per millisecond=1107 ) properties (out of 4) seen :0
[2023-03-10 22:44:33] [INFO ] Invariant cache hit.
[2023-03-10 22:44:33] [INFO ] [Real]Absence check using 25 positive place invariants in 17 ms returned sat
[2023-03-10 22:44:33] [INFO ] [Real]Absence check using 25 positive and 73 generalized place invariants in 24 ms returned sat
[2023-03-10 22:44:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:44:34] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2023-03-10 22:44:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:44:34] [INFO ] [Nat]Absence check using 25 positive place invariants in 11 ms returned sat
[2023-03-10 22:44:34] [INFO ] [Nat]Absence check using 25 positive and 73 generalized place invariants in 19 ms returned sat
[2023-03-10 22:44:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:44:34] [INFO ] [Nat]Absence check using state equation in 298 ms returned sat
[2023-03-10 22:44:34] [INFO ] Computed and/alt/rep : 363/1393/363 causal constraints (skipped 553 transitions) in 81 ms.
[2023-03-10 22:44:38] [INFO ] Deduced a trap composed of 123 places in 309 ms of which 1 ms to minimize.
[2023-03-10 22:44:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 467 ms
[2023-03-10 22:44:38] [INFO ] Added : 205 causal constraints over 41 iterations in 4026 ms. Result :sat
Minimization took 292 ms.
[2023-03-10 22:44:39] [INFO ] [Real]Absence check using 25 positive place invariants in 13 ms returned sat
[2023-03-10 22:44:39] [INFO ] [Real]Absence check using 25 positive and 73 generalized place invariants in 26 ms returned sat
[2023-03-10 22:44:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:44:39] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2023-03-10 22:44:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:44:39] [INFO ] [Nat]Absence check using 25 positive place invariants in 17 ms returned sat
[2023-03-10 22:44:39] [INFO ] [Nat]Absence check using 25 positive and 73 generalized place invariants in 40 ms returned sat
[2023-03-10 22:44:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:44:40] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2023-03-10 22:44:40] [INFO ] Computed and/alt/rep : 363/1393/363 causal constraints (skipped 553 transitions) in 80 ms.
[2023-03-10 22:44:44] [INFO ] Added : 270 causal constraints over 54 iterations in 4571 ms. Result :sat
Minimization took 226 ms.
[2023-03-10 22:44:45] [INFO ] [Real]Absence check using 25 positive place invariants in 8 ms returned sat
[2023-03-10 22:44:45] [INFO ] [Real]Absence check using 25 positive and 73 generalized place invariants in 36 ms returned sat
[2023-03-10 22:44:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:44:45] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2023-03-10 22:44:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:44:45] [INFO ] [Nat]Absence check using 25 positive place invariants in 8 ms returned sat
[2023-03-10 22:44:45] [INFO ] [Nat]Absence check using 25 positive and 73 generalized place invariants in 17 ms returned sat
[2023-03-10 22:44:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:44:46] [INFO ] [Nat]Absence check using state equation in 378 ms returned sat
[2023-03-10 22:44:46] [INFO ] Computed and/alt/rep : 363/1393/363 causal constraints (skipped 553 transitions) in 62 ms.
[2023-03-10 22:44:49] [INFO ] Added : 212 causal constraints over 43 iterations in 3342 ms. Result :sat
Minimization took 473 ms.
[2023-03-10 22:44:50] [INFO ] [Real]Absence check using 25 positive place invariants in 67 ms returned sat
[2023-03-10 22:44:50] [INFO ] [Real]Absence check using 25 positive and 73 generalized place invariants in 22 ms returned sat
[2023-03-10 22:44:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:44:50] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2023-03-10 22:44:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:44:50] [INFO ] [Nat]Absence check using 25 positive place invariants in 9 ms returned sat
[2023-03-10 22:44:50] [INFO ] [Nat]Absence check using 25 positive and 73 generalized place invariants in 39 ms returned sat
[2023-03-10 22:44:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:44:51] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2023-03-10 22:44:51] [INFO ] Computed and/alt/rep : 363/1393/363 causal constraints (skipped 553 transitions) in 61 ms.
[2023-03-10 22:44:54] [INFO ] Added : 212 causal constraints over 43 iterations in 3536 ms. Result :sat
Minimization took 256 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 559 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 559/559 places, 937/937 transitions.
Applied a total of 0 rules in 38 ms. Remains 559 /559 variables (removed 0) and now considering 937/937 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 559/559 places, 937/937 transitions.
[2023-03-10 22:44:56] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 14146 resets, run finished after 2046 ms. (steps per millisecond=488 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3901 resets, run finished after 1003 ms. (steps per millisecond=997 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3880 resets, run finished after 1045 ms. (steps per millisecond=956 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3817 resets, run finished after 977 ms. (steps per millisecond=1023 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3888 resets, run finished after 832 ms. (steps per millisecond=1201 ) properties (out of 4) seen :0
[2023-03-10 22:45:02] [INFO ] Invariant cache hit.
[2023-03-10 22:45:02] [INFO ] [Real]Absence check using 25 positive place invariants in 48 ms returned sat
[2023-03-10 22:45:02] [INFO ] [Real]Absence check using 25 positive and 73 generalized place invariants in 42 ms returned sat
[2023-03-10 22:45:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:45:02] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2023-03-10 22:45:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:45:02] [INFO ] [Nat]Absence check using 25 positive place invariants in 13 ms returned sat
[2023-03-10 22:45:03] [INFO ] [Nat]Absence check using 25 positive and 73 generalized place invariants in 36 ms returned sat
[2023-03-10 22:45:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:45:03] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2023-03-10 22:45:03] [INFO ] Computed and/alt/rep : 363/1393/363 causal constraints (skipped 553 transitions) in 70 ms.
[2023-03-10 22:45:07] [INFO ] Deduced a trap composed of 123 places in 374 ms of which 1 ms to minimize.
[2023-03-10 22:45:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 492 ms
[2023-03-10 22:45:07] [INFO ] Added : 205 causal constraints over 41 iterations in 4107 ms. Result :sat
Minimization took 230 ms.
[2023-03-10 22:45:07] [INFO ] [Real]Absence check using 25 positive place invariants in 11 ms returned sat
[2023-03-10 22:45:07] [INFO ] [Real]Absence check using 25 positive and 73 generalized place invariants in 23 ms returned sat
[2023-03-10 22:45:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:45:08] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2023-03-10 22:45:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:45:08] [INFO ] [Nat]Absence check using 25 positive place invariants in 11 ms returned sat
[2023-03-10 22:45:08] [INFO ] [Nat]Absence check using 25 positive and 73 generalized place invariants in 23 ms returned sat
[2023-03-10 22:45:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:45:08] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2023-03-10 22:45:08] [INFO ] Computed and/alt/rep : 363/1393/363 causal constraints (skipped 553 transitions) in 80 ms.
[2023-03-10 22:45:13] [INFO ] Added : 270 causal constraints over 54 iterations in 4681 ms. Result :sat
Minimization took 265 ms.
[2023-03-10 22:45:13] [INFO ] [Real]Absence check using 25 positive place invariants in 7 ms returned sat
[2023-03-10 22:45:13] [INFO ] [Real]Absence check using 25 positive and 73 generalized place invariants in 14 ms returned sat
[2023-03-10 22:45:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:45:14] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2023-03-10 22:45:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:45:14] [INFO ] [Nat]Absence check using 25 positive place invariants in 10 ms returned sat
[2023-03-10 22:45:14] [INFO ] [Nat]Absence check using 25 positive and 73 generalized place invariants in 92 ms returned sat
[2023-03-10 22:45:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:45:14] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2023-03-10 22:45:14] [INFO ] Computed and/alt/rep : 363/1393/363 causal constraints (skipped 553 transitions) in 104 ms.
[2023-03-10 22:45:18] [INFO ] Added : 212 causal constraints over 43 iterations in 3393 ms. Result :sat
Minimization took 441 ms.
[2023-03-10 22:45:18] [INFO ] [Real]Absence check using 25 positive place invariants in 10 ms returned sat
[2023-03-10 22:45:18] [INFO ] [Real]Absence check using 25 positive and 73 generalized place invariants in 20 ms returned sat
[2023-03-10 22:45:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:45:19] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2023-03-10 22:45:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:45:19] [INFO ] [Nat]Absence check using 25 positive place invariants in 8 ms returned sat
[2023-03-10 22:45:19] [INFO ] [Nat]Absence check using 25 positive and 73 generalized place invariants in 18 ms returned sat
[2023-03-10 22:45:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:45:19] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2023-03-10 22:45:19] [INFO ] Computed and/alt/rep : 363/1393/363 causal constraints (skipped 553 transitions) in 68 ms.
[2023-03-10 22:45:22] [INFO ] Added : 212 causal constraints over 43 iterations in 3231 ms. Result :sat
Minimization took 239 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA ASLink-PT-03b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 559 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 559/559 places, 937/937 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 559 transition count 936
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 558 transition count 936
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 557 transition count 935
Applied a total of 4 rules in 31 ms. Remains 557 /559 variables (removed 2) and now considering 935/937 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 557/559 places, 935/937 transitions.
// Phase 1: matrix 935 rows 557 cols
[2023-03-10 22:45:24] [INFO ] Computed 98 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 14011 resets, run finished after 2060 ms. (steps per millisecond=485 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3903 resets, run finished after 1061 ms. (steps per millisecond=942 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3803 resets, run finished after 1046 ms. (steps per millisecond=956 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3913 resets, run finished after 1022 ms. (steps per millisecond=978 ) properties (out of 3) seen :1
FORMULA ASLink-PT-03b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-10 22:45:29] [INFO ] Invariant cache hit.
[2023-03-10 22:45:29] [INFO ] [Real]Absence check using 25 positive place invariants in 17 ms returned sat
[2023-03-10 22:45:29] [INFO ] [Real]Absence check using 25 positive and 73 generalized place invariants in 30 ms returned sat
[2023-03-10 22:45:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:45:29] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2023-03-10 22:45:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:45:30] [INFO ] [Nat]Absence check using 25 positive place invariants in 61 ms returned sat
[2023-03-10 22:45:30] [INFO ] [Nat]Absence check using 25 positive and 73 generalized place invariants in 39 ms returned sat
[2023-03-10 22:45:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:45:30] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2023-03-10 22:45:30] [INFO ] Computed and/alt/rep : 361/1391/361 causal constraints (skipped 553 transitions) in 76 ms.
[2023-03-10 22:45:34] [INFO ] Added : 211 causal constraints over 43 iterations in 3614 ms. Result :sat
Minimization took 238 ms.
[2023-03-10 22:45:34] [INFO ] [Real]Absence check using 25 positive place invariants in 8 ms returned sat
[2023-03-10 22:45:34] [INFO ] [Real]Absence check using 25 positive and 73 generalized place invariants in 40 ms returned sat
[2023-03-10 22:45:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:45:34] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2023-03-10 22:45:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:45:35] [INFO ] [Nat]Absence check using 25 positive place invariants in 8 ms returned sat
[2023-03-10 22:45:35] [INFO ] [Nat]Absence check using 25 positive and 73 generalized place invariants in 134 ms returned sat
[2023-03-10 22:45:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:45:35] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2023-03-10 22:45:35] [INFO ] Computed and/alt/rep : 361/1391/361 causal constraints (skipped 553 transitions) in 69 ms.
[2023-03-10 22:45:39] [INFO ] Added : 223 causal constraints over 45 iterations in 4177 ms. Result :sat
Minimization took 543 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 557 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 557/557 places, 935/935 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 557 transition count 934
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 556 transition count 934
Applied a total of 2 rules in 19 ms. Remains 556 /557 variables (removed 1) and now considering 934/935 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 556/557 places, 934/935 transitions.
// Phase 1: matrix 934 rows 556 cols
[2023-03-10 22:45:40] [INFO ] Computed 98 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 14087 resets, run finished after 1942 ms. (steps per millisecond=514 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3873 resets, run finished after 965 ms. (steps per millisecond=1036 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3879 resets, run finished after 890 ms. (steps per millisecond=1123 ) properties (out of 2) seen :0
[2023-03-10 22:45:44] [INFO ] Invariant cache hit.
[2023-03-10 22:45:44] [INFO ] [Real]Absence check using 25 positive place invariants in 70 ms returned sat
[2023-03-10 22:45:44] [INFO ] [Real]Absence check using 25 positive and 73 generalized place invariants in 28 ms returned sat
[2023-03-10 22:45:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:45:45] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2023-03-10 22:45:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:45:45] [INFO ] [Nat]Absence check using 25 positive place invariants in 9 ms returned sat
[2023-03-10 22:45:45] [INFO ] [Nat]Absence check using 25 positive and 73 generalized place invariants in 17 ms returned sat
[2023-03-10 22:45:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:45:45] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2023-03-10 22:45:45] [INFO ] Computed and/alt/rep : 360/1390/360 causal constraints (skipped 553 transitions) in 91 ms.
[2023-03-10 22:45:47] [INFO ] Added : 97 causal constraints over 20 iterations in 1748 ms. Result :sat
Minimization took 255 ms.
[2023-03-10 22:45:47] [INFO ] [Real]Absence check using 25 positive place invariants in 8 ms returned sat
[2023-03-10 22:45:47] [INFO ] [Real]Absence check using 25 positive and 73 generalized place invariants in 50 ms returned sat
[2023-03-10 22:45:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:45:48] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2023-03-10 22:45:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:45:48] [INFO ] [Nat]Absence check using 25 positive place invariants in 8 ms returned sat
[2023-03-10 22:45:48] [INFO ] [Nat]Absence check using 25 positive and 73 generalized place invariants in 31 ms returned sat
[2023-03-10 22:45:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:45:49] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2023-03-10 22:45:49] [INFO ] Computed and/alt/rep : 360/1390/360 causal constraints (skipped 553 transitions) in 109 ms.
[2023-03-10 22:45:53] [INFO ] Added : 274 causal constraints over 55 iterations in 4268 ms. Result :sat
Minimization took 292 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 934/934 transitions.
Applied a total of 0 rules in 15 ms. Remains 556 /556 variables (removed 0) and now considering 934/934 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 556/556 places, 934/934 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 934/934 transitions.
Applied a total of 0 rules in 15 ms. Remains 556 /556 variables (removed 0) and now considering 934/934 (removed 0) transitions.
[2023-03-10 22:45:54] [INFO ] Invariant cache hit.
[2023-03-10 22:45:54] [INFO ] Implicit Places using invariants in 578 ms returned [1, 18, 19, 31, 48, 66, 137, 141, 150, 151, 153, 170, 188, 259, 263, 264, 275, 276, 278, 295, 313, 382, 386, 387, 390, 401, 402, 403, 421, 423, 427, 445, 446, 447, 448, 460, 466, 472, 478, 484, 490, 496, 502, 508, 514, 520]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 592 ms to find 46 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 510/556 places, 934/934 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 510 transition count 856
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 83 rules applied. Total rules applied 161 place count 432 transition count 851
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 163 place count 430 transition count 851
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 163 place count 430 transition count 832
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 39 rules applied. Total rules applied 202 place count 410 transition count 832
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 214 place count 406 transition count 824
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 222 place count 398 transition count 824
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 237 place count 383 transition count 809
Iterating global reduction 5 with 15 rules applied. Total rules applied 252 place count 383 transition count 809
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 255 place count 383 transition count 806
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 255 place count 383 transition count 805
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 257 place count 382 transition count 805
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 260 place count 379 transition count 799
Iterating global reduction 6 with 3 rules applied. Total rules applied 263 place count 379 transition count 799
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 264 place count 378 transition count 798
Iterating global reduction 6 with 1 rules applied. Total rules applied 265 place count 378 transition count 798
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 266 place count 377 transition count 796
Iterating global reduction 6 with 1 rules applied. Total rules applied 267 place count 377 transition count 796
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 321 place count 350 transition count 769
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 324 place count 347 transition count 766
Iterating global reduction 6 with 3 rules applied. Total rules applied 327 place count 347 transition count 766
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 330 place count 347 transition count 763
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 334 place count 345 transition count 764
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 340 place count 345 transition count 758
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 347 place count 338 transition count 758
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 356 place count 338 transition count 758
Applied a total of 356 rules in 106 ms. Remains 338 /510 variables (removed 172) and now considering 758/934 (removed 176) transitions.
// Phase 1: matrix 758 rows 338 cols
[2023-03-10 22:45:55] [INFO ] Computed 46 place invariants in 5 ms
[2023-03-10 22:45:55] [INFO ] Implicit Places using invariants in 260 ms returned [72, 91, 97, 100, 102, 105, 106, 158, 177, 183, 186, 188, 193, 194, 246, 263, 269, 272, 274]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 261 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 319/556 places, 758/934 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 310 transition count 749
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 310 transition count 749
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 307 transition count 746
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 307 transition count 746
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 36 place count 301 transition count 740
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 45 place count 301 transition count 731
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 54 place count 292 transition count 731
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 292 transition count 728
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 60 place count 289 transition count 728
Applied a total of 60 rules in 54 ms. Remains 289 /319 variables (removed 30) and now considering 728/758 (removed 30) transitions.
// Phase 1: matrix 728 rows 289 cols
[2023-03-10 22:45:55] [INFO ] Computed 27 place invariants in 9 ms
[2023-03-10 22:45:55] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-10 22:45:55] [INFO ] Invariant cache hit.
[2023-03-10 22:45:56] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 907 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 289/556 places, 728/934 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1947 ms. Remains : 289/556 places, 728/934 transitions.
Successfully produced net in file /tmp/petri1000_17452957323888087327.dot
Successfully produced net in file /tmp/petri1001_2307627046220089747.dot
Successfully produced net in file /tmp/petri1002_4254130319260930501.dot
Drop transitions removed 3 transitions
Dominated transitions for bounds rules discarded 3 transitions
// Phase 1: matrix 725 rows 289 cols
[2023-03-10 22:45:56] [INFO ] Computed 27 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 21868 resets, run finished after 1546 ms. (steps per millisecond=646 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6889 resets, run finished after 717 ms. (steps per millisecond=1394 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6881 resets, run finished after 723 ms. (steps per millisecond=1383 ) properties (out of 2) seen :0
[2023-03-10 22:45:59] [INFO ] Invariant cache hit.
[2023-03-10 22:45:59] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-10 22:45:59] [INFO ] [Real]Absence check using 8 positive and 19 generalized place invariants in 23 ms returned sat
[2023-03-10 22:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:45:59] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2023-03-10 22:45:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:45:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-10 22:45:59] [INFO ] [Nat]Absence check using 8 positive and 19 generalized place invariants in 5 ms returned sat
[2023-03-10 22:45:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:46:00] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2023-03-10 22:46:00] [INFO ] Computed and/alt/rep : 142/729/142 causal constraints (skipped 562 transitions) in 56 ms.
[2023-03-10 22:46:00] [INFO ] Added : 14 causal constraints over 4 iterations in 388 ms. Result :sat
Minimization took 101 ms.
[2023-03-10 22:46:00] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-10 22:46:00] [INFO ] [Real]Absence check using 8 positive and 19 generalized place invariants in 6 ms returned sat
[2023-03-10 22:46:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:46:00] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2023-03-10 22:46:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:46:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2023-03-10 22:46:00] [INFO ] [Nat]Absence check using 8 positive and 19 generalized place invariants in 35 ms returned sat
[2023-03-10 22:46:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:46:01] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2023-03-10 22:46:01] [INFO ] Computed and/alt/rep : 142/729/142 causal constraints (skipped 562 transitions) in 80 ms.
[2023-03-10 22:46:01] [INFO ] Added : 10 causal constraints over 2 iterations in 189 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 289 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 725/725 transitions.
Graph (complete) has 1784 edges and 289 vertex of which 286 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 286 transition count 725
Applied a total of 4 rules in 17 ms. Remains 286 /289 variables (removed 3) and now considering 725/725 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 286/289 places, 725/725 transitions.
// Phase 1: matrix 725 rows 286 cols
[2023-03-10 22:46:01] [INFO ] Computed 27 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 21601 resets, run finished after 1570 ms. (steps per millisecond=636 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 6874 resets, run finished after 642 ms. (steps per millisecond=1557 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6782 resets, run finished after 630 ms. (steps per millisecond=1587 ) properties (out of 2) seen :0
[2023-03-10 22:46:04] [INFO ] Invariant cache hit.
[2023-03-10 22:46:04] [INFO ] [Real]Absence check using 9 positive place invariants in 60 ms returned sat
[2023-03-10 22:46:04] [INFO ] [Real]Absence check using 9 positive and 18 generalized place invariants in 20 ms returned sat
[2023-03-10 22:46:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:46:04] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2023-03-10 22:46:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:46:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-10 22:46:04] [INFO ] [Nat]Absence check using 9 positive and 18 generalized place invariants in 18 ms returned sat
[2023-03-10 22:46:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:46:05] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2023-03-10 22:46:05] [INFO ] Computed and/alt/rep : 142/727/142 causal constraints (skipped 562 transitions) in 81 ms.
[2023-03-10 22:46:05] [INFO ] Added : 13 causal constraints over 3 iterations in 274 ms. Result :sat
Minimization took 108 ms.
[2023-03-10 22:46:05] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-10 22:46:05] [INFO ] [Real]Absence check using 9 positive and 18 generalized place invariants in 67 ms returned sat
[2023-03-10 22:46:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:46:05] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2023-03-10 22:46:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:46:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-10 22:46:06] [INFO ] [Nat]Absence check using 9 positive and 18 generalized place invariants in 18 ms returned sat
[2023-03-10 22:46:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:46:06] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2023-03-10 22:46:06] [INFO ] Computed and/alt/rep : 142/727/142 causal constraints (skipped 562 transitions) in 57 ms.
[2023-03-10 22:46:06] [INFO ] Added : 13 causal constraints over 3 iterations in 240 ms. Result :sat
Minimization took 105 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 286 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 286/286 places, 725/725 transitions.
Applied a total of 0 rules in 7 ms. Remains 286 /286 variables (removed 0) and now considering 725/725 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 286/286 places, 725/725 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 286/286 places, 725/725 transitions.
Applied a total of 0 rules in 7 ms. Remains 286 /286 variables (removed 0) and now considering 725/725 (removed 0) transitions.
[2023-03-10 22:46:06] [INFO ] Invariant cache hit.
[2023-03-10 22:46:07] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-03-10 22:46:07] [INFO ] Invariant cache hit.
[2023-03-10 22:46:07] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 1065 ms to find 0 implicit places.
[2023-03-10 22:46:07] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-10 22:46:07] [INFO ] Invariant cache hit.
[2023-03-10 22:46:08] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1467 ms. Remains : 286/286 places, 725/725 transitions.
Starting property specific reduction for ASLink-PT-03b-UpperBounds-06
[2023-03-10 22:46:08] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 203 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 64 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-10 22:46:08] [INFO ] Invariant cache hit.
[2023-03-10 22:46:08] [INFO ] [Real]Absence check using 9 positive place invariants in 15 ms returned sat
[2023-03-10 22:46:08] [INFO ] [Real]Absence check using 9 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 22:46:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:46:08] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2023-03-10 22:46:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:46:08] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-10 22:46:08] [INFO ] [Nat]Absence check using 9 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-10 22:46:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:46:08] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2023-03-10 22:46:08] [INFO ] Computed and/alt/rep : 142/727/142 causal constraints (skipped 562 transitions) in 58 ms.
[2023-03-10 22:46:09] [INFO ] Added : 13 causal constraints over 3 iterations in 215 ms. Result :sat
Minimization took 94 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 286 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 286/286 places, 725/725 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 286 transition count 724
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 285 transition count 724
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 285 transition count 723
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 284 transition count 723
Applied a total of 4 rules in 11 ms. Remains 284 /286 variables (removed 2) and now considering 723/725 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 284/286 places, 723/725 transitions.
// Phase 1: matrix 723 rows 284 cols
[2023-03-10 22:46:09] [INFO ] Computed 27 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 21712 resets, run finished after 1553 ms. (steps per millisecond=643 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6833 resets, run finished after 619 ms. (steps per millisecond=1615 ) properties (out of 1) seen :0
[2023-03-10 22:46:11] [INFO ] Invariant cache hit.
[2023-03-10 22:46:11] [INFO ] [Real]Absence check using 8 positive place invariants in 53 ms returned sat
[2023-03-10 22:46:11] [INFO ] [Real]Absence check using 8 positive and 19 generalized place invariants in 103 ms returned sat
[2023-03-10 22:46:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:46:11] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2023-03-10 22:46:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:46:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-10 22:46:12] [INFO ] [Nat]Absence check using 8 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-10 22:46:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:46:12] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2023-03-10 22:46:12] [INFO ] Computed and/alt/rep : 140/725/140 causal constraints (skipped 562 transitions) in 69 ms.
[2023-03-10 22:46:12] [INFO ] Added : 32 causal constraints over 7 iterations in 547 ms. Result :sat
Minimization took 134 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 723/723 transitions.
Applied a total of 0 rules in 9 ms. Remains 284 /284 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 284/284 places, 723/723 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 723/723 transitions.
Applied a total of 0 rules in 8 ms. Remains 284 /284 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2023-03-10 22:46:13] [INFO ] Invariant cache hit.
[2023-03-10 22:46:13] [INFO ] Implicit Places using invariants in 351 ms returned []
[2023-03-10 22:46:13] [INFO ] Invariant cache hit.
[2023-03-10 22:46:14] [INFO ] Implicit Places using invariants and state equation in 759 ms returned []
Implicit Place search using SMT with State Equation took 1124 ms to find 0 implicit places.
[2023-03-10 22:46:14] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-10 22:46:14] [INFO ] Invariant cache hit.
[2023-03-10 22:46:14] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1475 ms. Remains : 284/284 places, 723/723 transitions.
Ending property specific reduction for ASLink-PT-03b-UpperBounds-06 in 6311 ms.
Starting property specific reduction for ASLink-PT-03b-UpperBounds-14
// Phase 1: matrix 725 rows 286 cols
[2023-03-10 22:46:14] [INFO ] Computed 27 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 222 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-10 22:46:14] [INFO ] Invariant cache hit.
[2023-03-10 22:46:14] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-10 22:46:14] [INFO ] [Real]Absence check using 9 positive and 18 generalized place invariants in 69 ms returned sat
[2023-03-10 22:46:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:46:15] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2023-03-10 22:46:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:46:15] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-10 22:46:15] [INFO ] [Nat]Absence check using 9 positive and 18 generalized place invariants in 25 ms returned sat
[2023-03-10 22:46:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:46:15] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2023-03-10 22:46:15] [INFO ] Computed and/alt/rep : 142/727/142 causal constraints (skipped 562 transitions) in 72 ms.
[2023-03-10 22:46:15] [INFO ] Added : 13 causal constraints over 3 iterations in 317 ms. Result :sat
Minimization took 114 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[0]
Support contains 1 out of 286 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 286/286 places, 725/725 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 286 transition count 724
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 285 transition count 724
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 285 transition count 723
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 284 transition count 723
Applied a total of 4 rules in 36 ms. Remains 284 /286 variables (removed 2) and now considering 723/725 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 284/286 places, 723/725 transitions.
// Phase 1: matrix 723 rows 284 cols
[2023-03-10 22:46:16] [INFO ] Computed 27 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 21577 resets, run finished after 1634 ms. (steps per millisecond=611 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 6891 resets, run finished after 806 ms. (steps per millisecond=1240 ) properties (out of 1) seen :0
[2023-03-10 22:46:18] [INFO ] Invariant cache hit.
[2023-03-10 22:46:18] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-10 22:46:18] [INFO ] [Real]Absence check using 8 positive and 19 generalized place invariants in 42 ms returned sat
[2023-03-10 22:46:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:46:18] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2023-03-10 22:46:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:46:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-10 22:46:19] [INFO ] [Nat]Absence check using 8 positive and 19 generalized place invariants in 6 ms returned sat
[2023-03-10 22:46:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:46:19] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2023-03-10 22:46:19] [INFO ] Computed and/alt/rep : 140/725/140 causal constraints (skipped 562 transitions) in 55 ms.
[2023-03-10 22:46:20] [INFO ] Added : 44 causal constraints over 9 iterations in 760 ms. Result :sat
Minimization took 128 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[0]
Support contains 1 out of 284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 723/723 transitions.
Applied a total of 0 rules in 7 ms. Remains 284 /284 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 284/284 places, 723/723 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 723/723 transitions.
Applied a total of 0 rules in 7 ms. Remains 284 /284 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2023-03-10 22:46:20] [INFO ] Invariant cache hit.
[2023-03-10 22:46:20] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-10 22:46:20] [INFO ] Invariant cache hit.
[2023-03-10 22:46:21] [INFO ] Implicit Places using invariants and state equation in 679 ms returned []
Implicit Place search using SMT with State Equation took 1039 ms to find 0 implicit places.
[2023-03-10 22:46:21] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-10 22:46:21] [INFO ] Invariant cache hit.
[2023-03-10 22:46:21] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1451 ms. Remains : 284/284 places, 723/723 transitions.
Ending property specific reduction for ASLink-PT-03b-UpperBounds-14 in 7333 ms.
[2023-03-10 22:46:22] [INFO ] Flatten gal took : 89 ms
[2023-03-10 22:46:22] [INFO ] Applying decomposition
[2023-03-10 22:46:22] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6362517566932334722.txt' '-o' '/tmp/graph6362517566932334722.bin' '-w' '/tmp/graph6362517566932334722.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6362517566932334722.bin' '-l' '-1' '-v' '-w' '/tmp/graph6362517566932334722.weights' '-q' '0' '-e' '0.001'
[2023-03-10 22:46:22] [INFO ] Decomposing Gal with order
[2023-03-10 22:46:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 22:46:22] [INFO ] Removed a total of 1382 redundant transitions.
[2023-03-10 22:46:22] [INFO ] Flatten gal took : 99 ms
[2023-03-10 22:46:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 28 ms.
[2023-03-10 22:46:22] [INFO ] Time to serialize gal into /tmp/UpperBounds11632856902990448501.gal : 11 ms
[2023-03-10 22:46:22] [INFO ] Time to serialize properties into /tmp/UpperBounds16375442268323625559.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11632856902990448501.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16375442268323625559.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds16375442268323625559.prop.
Detected timeout of ITS tools.
[2023-03-10 23:07:13] [INFO ] Applying decomposition
[2023-03-10 23:07:13] [INFO ] Flatten gal took : 34 ms
[2023-03-10 23:07:13] [INFO ] Decomposing Gal with order
[2023-03-10 23:07:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 23:07:13] [INFO ] Removed a total of 1350 redundant transitions.
[2023-03-10 23:07:13] [INFO ] Flatten gal took : 74 ms
[2023-03-10 23:07:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 538 labels/synchronizations in 13 ms.
[2023-03-10 23:07:13] [INFO ] Time to serialize gal into /tmp/UpperBounds11731852849776164585.gal : 3 ms
[2023-03-10 23:07:13] [INFO ] Time to serialize properties into /tmp/UpperBounds15308984777070058197.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11731852849776164585.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15308984777070058197.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds15308984777070058197.prop.
Detected timeout of ITS tools.
[2023-03-10 23:28:03] [INFO ] Flatten gal took : 107 ms
[2023-03-10 23:28:03] [INFO ] Input system was already deterministic with 725 transitions.
[2023-03-10 23:28:03] [INFO ] Transformed 286 places.
[2023-03-10 23:28:03] [INFO ] Transformed 725 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-10 23:28:03] [INFO ] Time to serialize gal into /tmp/UpperBounds3697417777750146851.gal : 6 ms
[2023-03-10 23:28:03] [INFO ] Time to serialize properties into /tmp/UpperBounds9767192978678911700.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3697417777750146851.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9767192978678911700.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds9767192978678911700.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 153652 kB
After kill :
MemTotal: 16393220 kB
MemFree: 15687644 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="ASLink-PT-03b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ASLink-PT-03b, 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 r005-oct2-167813592600053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-03b.tgz
mv ASLink-PT-03b execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;