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.r010-oct2-167813598700151.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 marciexred
Input is ASLink-PT-09b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598700151
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 5.9K Feb 26 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 13:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 13:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 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 1.3M 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 booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678672703721

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-09b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 01:58:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 01:58:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 01:58:25] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2023-03-13 01:58:25] [INFO ] Transformed 4014 places.
[2023-03-13 01:58:25] [INFO ] Transformed 4932 transitions.
[2023-03-13 01:58:25] [INFO ] Found NUPN structural information;
[2023-03-13 01:58:25] [INFO ] Parsed PT model containing 4014 places and 4932 transitions and 14960 arcs in 325 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 11 resets, run finished after 423 ms. (steps per millisecond=23 ) properties (out of 16) seen :2
FORMULA ASLink-PT-09b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 4932 rows 4014 cols
[2023-03-13 01:58:26] [INFO ] Computed 394 place invariants in 159 ms
[2023-03-13 01:58:28] [INFO ] After 1720ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-13 01:58:30] [INFO ] [Nat]Absence check using 93 positive place invariants in 81 ms returned sat
[2023-03-13 01:58:30] [INFO ] [Nat]Absence check using 93 positive and 301 generalized place invariants in 211 ms returned sat
[2023-03-13 01:58:53] [INFO ] After 22748ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2023-03-13 01:58:53] [INFO ] After 22756ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :10
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-13 01:58:53] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :10
FORMULA ASLink-PT-09b-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 273 out of 4014 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4014/4014 places, 4932/4932 transitions.
Drop transitions removed 763 transitions
Trivial Post-agglo rules discarded 763 transitions
Performed 763 trivial Post agglomeration. Transition count delta: 763
Iterating post reduction 0 with 763 rules applied. Total rules applied 763 place count 4014 transition count 4169
Reduce places removed 763 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 789 rules applied. Total rules applied 1552 place count 3251 transition count 4143
Reduce places removed 6 places and 0 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Iterating post reduction 2 with 66 rules applied. Total rules applied 1618 place count 3245 transition count 4083
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 70 rules applied. Total rules applied 1688 place count 3185 transition count 4073
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1690 place count 3183 transition count 4073
Performed 865 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 865 Pre rules applied. Total rules applied 1690 place count 3183 transition count 3208
Deduced a syphon composed of 865 places in 9 ms
Ensure Unique test removed 80 places
Reduce places removed 945 places and 0 transitions.
Iterating global reduction 5 with 1810 rules applied. Total rules applied 3500 place count 2238 transition count 3208
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 5 with 57 rules applied. Total rules applied 3557 place count 2226 transition count 3163
Reduce places removed 45 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 6 with 50 rules applied. Total rules applied 3607 place count 2181 transition count 3158
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 3612 place count 2176 transition count 3158
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 31 Pre rules applied. Total rules applied 3612 place count 2176 transition count 3127
Deduced a syphon composed of 31 places in 7 ms
Ensure Unique test removed 24 places
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 8 with 86 rules applied. Total rules applied 3698 place count 2121 transition count 3127
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 8 with 1 rules applied. Total rules applied 3699 place count 2120 transition count 3127
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 23 Pre rules applied. Total rules applied 3699 place count 2120 transition count 3104
Deduced a syphon composed of 23 places in 19 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 9 with 46 rules applied. Total rules applied 3745 place count 2097 transition count 3104
Discarding 124 places :
Symmetric choice reduction at 9 with 124 rule applications. Total rules 3869 place count 1973 transition count 2980
Iterating global reduction 9 with 124 rules applied. Total rules applied 3993 place count 1973 transition count 2980
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3994 place count 1973 transition count 2979
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 30 Pre rules applied. Total rules applied 3994 place count 1973 transition count 2949
Deduced a syphon composed of 30 places in 20 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 10 with 61 rules applied. Total rules applied 4055 place count 1942 transition count 2949
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 4055 place count 1942 transition count 2948
Deduced a syphon composed of 1 places in 21 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 4058 place count 1940 transition count 2948
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 4064 place count 1934 transition count 2912
Iterating global reduction 10 with 6 rules applied. Total rules applied 4070 place count 1934 transition count 2912
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 4 Pre rules applied. Total rules applied 4070 place count 1934 transition count 2908
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 4078 place count 1930 transition count 2908
Performed 220 Post agglomeration using F-continuation condition.Transition count delta: 220
Deduced a syphon composed of 220 places in 19 ms
Ensure Unique test removed 4 places
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 10 with 444 rules applied. Total rules applied 4522 place count 1706 transition count 2688
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 4523 place count 1705 transition count 2687
Ensure Unique test removed 1 places
Iterating global reduction 10 with 2 rules applied. Total rules applied 4525 place count 1704 transition count 2687
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 4526 place count 1703 transition count 2686
Iterating global reduction 10 with 1 rules applied. Total rules applied 4527 place count 1703 transition count 2686
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 10 with 2 rules applied. Total rules applied 4529 place count 1703 transition count 2684
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 4530 place count 1702 transition count 2684
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 4532 place count 1701 transition count 2693
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 4534 place count 1701 transition count 2691
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 12 with 4 rules applied. Total rules applied 4538 place count 1699 transition count 2689
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 4540 place count 1697 transition count 2689
Free-agglomeration rule applied 14 times.
Iterating global reduction 14 with 14 rules applied. Total rules applied 4554 place count 1697 transition count 2675
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 14 with 14 rules applied. Total rules applied 4568 place count 1683 transition count 2675
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 15 with 10 rules applied. Total rules applied 4578 place count 1683 transition count 2665
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 15 with 10 rules applied. Total rules applied 4588 place count 1673 transition count 2665
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 4589 place count 1673 transition count 2665
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 4590 place count 1672 transition count 2664
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 16 with 11 rules applied. Total rules applied 4601 place count 1663 transition count 2662
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 4603 place count 1661 transition count 2662
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 18 with 13 Pre rules applied. Total rules applied 4603 place count 1661 transition count 2649
Deduced a syphon composed of 13 places in 6 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 18 with 26 rules applied. Total rules applied 4629 place count 1648 transition count 2649
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 18 with 3 rules applied. Total rules applied 4632 place count 1645 transition count 2649
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 19 with 20 rules applied. Total rules applied 4652 place count 1635 transition count 2639
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 4654 place count 1633 transition count 2637
Iterating global reduction 19 with 2 rules applied. Total rules applied 4656 place count 1633 transition count 2637
Free-agglomeration rule applied 2 times.
Iterating global reduction 19 with 2 rules applied. Total rules applied 4658 place count 1633 transition count 2635
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 4660 place count 1631 transition count 2635
Applied a total of 4660 rules in 1852 ms. Remains 1631 /4014 variables (removed 2383) and now considering 2635/4932 (removed 2297) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1853 ms. Remains : 1631/4014 places, 2635/4932 transitions.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 13) seen :1
FORMULA ASLink-PT-09b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 128102 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 128102 steps, saw 31015 distinct states, run finished after 3004 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 2635 rows 1631 cols
[2023-03-13 01:58:59] [INFO ] Computed 256 place invariants in 73 ms
[2023-03-13 01:59:00] [INFO ] After 546ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-13 01:59:00] [INFO ] [Nat]Absence check using 62 positive place invariants in 24 ms returned sat
[2023-03-13 01:59:01] [INFO ] [Nat]Absence check using 62 positive and 194 generalized place invariants in 106 ms returned sat
[2023-03-13 01:59:25] [INFO ] After 23937ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2023-03-13 01:59:25] [INFO ] State equation strengthened by 8 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
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-13 01:59:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 01:59:25] [INFO ] After 25050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
FORMULA ASLink-PT-09b-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-09b-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 365 ms.
Support contains 238 out of 1631 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1631/1631 places, 2635/2635 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1631 transition count 2629
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 1625 transition count 2629
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 12 place count 1625 transition count 2609
Deduced a syphon composed of 20 places in 6 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 52 place count 1605 transition count 2609
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1604 transition count 2600
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1604 transition count 2600
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1603 transition count 2592
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1603 transition count 2592
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 1602 transition count 2584
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 1602 transition count 2584
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 6 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 70 place count 1596 transition count 2578
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 1596 transition count 2578
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 1595 transition count 2577
Applied a total of 72 rules in 384 ms. Remains 1595 /1631 variables (removed 36) and now considering 2577/2635 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 384 ms. Remains : 1595/1631 places, 2577/2635 transitions.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 173502 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 173502 steps, saw 38225 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2577 rows 1595 cols
[2023-03-13 01:59:29] [INFO ] Computed 256 place invariants in 34 ms
[2023-03-13 01:59:30] [INFO ] After 573ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-13 01:59:31] [INFO ] [Nat]Absence check using 63 positive place invariants in 35 ms returned sat
[2023-03-13 01:59:31] [INFO ] [Nat]Absence check using 63 positive and 193 generalized place invariants in 88 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
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-13 01:59:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 01:59:55] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
FORMULA ASLink-PT-09b-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 186 ms.
Support contains 199 out of 1595 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1595/1595 places, 2577/2577 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1595 transition count 2573
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 1591 transition count 2572
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 1590 transition count 2572
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 10 place count 1590 transition count 2553
Deduced a syphon composed of 19 places in 5 ms
Ensure Unique test removed 2 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 50 place count 1569 transition count 2553
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 50 place count 1569 transition count 2552
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 1568 transition count 2552
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 62 place count 1563 transition count 2547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 1562 transition count 2546
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 1562 transition count 2544
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 68 place count 1560 transition count 2544
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 69 place count 1560 transition count 2544
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 72 place count 1557 transition count 2541
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 1556 transition count 2541
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 73 place count 1556 transition count 2539
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 77 place count 1554 transition count 2539
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 78 place count 1553 transition count 2539
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 79 place count 1552 transition count 2538
Iterating global reduction 6 with 1 rules applied. Total rules applied 80 place count 1552 transition count 2538
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 81 place count 1551 transition count 2537
Iterating global reduction 6 with 1 rules applied. Total rules applied 82 place count 1551 transition count 2537
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 83 place count 1550 transition count 2536
Iterating global reduction 6 with 1 rules applied. Total rules applied 84 place count 1550 transition count 2536
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 85 place count 1550 transition count 2535
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 87 place count 1549 transition count 2534
Applied a total of 87 rules in 968 ms. Remains 1549 /1595 variables (removed 46) and now considering 2534/2577 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 968 ms. Remains : 1549/1595 places, 2534/2577 transitions.
Incomplete random walk after 10000 steps, including 61 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :1
FORMULA ASLink-PT-09b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2534 rows 1549 cols
[2023-03-13 01:59:57] [INFO ] Computed 252 place invariants in 25 ms
[2023-03-13 01:59:57] [INFO ] After 349ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 01:59:58] [INFO ] [Nat]Absence check using 65 positive place invariants in 30 ms returned sat
[2023-03-13 01:59:58] [INFO ] [Nat]Absence check using 65 positive and 187 generalized place invariants in 71 ms returned sat
[2023-03-13 02:00:22] [INFO ] After 24344ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-13 02:00:22] [INFO ] After 24353ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-13 02:00:22] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA ASLink-PT-09b-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 5 different solutions.
FORMULA ASLink-PT-09b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 396 ms.
Support contains 175 out of 1549 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1549/1549 places, 2534/2534 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 0 with 5 rules applied. Total rules applied 5 place count 1549 transition count 2529
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 1543 transition count 2528
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 1542 transition count 2528
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 13 place count 1542 transition count 2519
Deduced a syphon composed of 9 places in 10 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 31 place count 1533 transition count 2519
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 32 place count 1532 transition count 2519
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 40 place count 1528 transition count 2515
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 41 place count 1527 transition count 2514
Iterating global reduction 4 with 1 rules applied. Total rules applied 42 place count 1527 transition count 2514
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 1527 transition count 2513
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 44 place count 1526 transition count 2513
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 45 place count 1526 transition count 2513
Applied a total of 45 rules in 276 ms. Remains 1526 /1549 variables (removed 23) and now considering 2513/2534 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 1526/1549 places, 2513/2534 transitions.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 174584 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 174584 steps, saw 38316 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2513 rows 1526 cols
[2023-03-13 02:00:26] [INFO ] Computed 250 place invariants in 30 ms
[2023-03-13 02:00:27] [INFO ] After 353ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 02:00:27] [INFO ] [Nat]Absence check using 64 positive place invariants in 21 ms returned sat
[2023-03-13 02:00:27] [INFO ] [Nat]Absence check using 64 positive and 186 generalized place invariants in 93 ms returned sat
[2023-03-13 02:00:52] [INFO ] After 24440ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-13 02:00:52] [INFO ] After 24444ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-13 02:00:52] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA ASLink-PT-09b-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 93 ms.
Support contains 96 out of 1526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1526/1526 places, 2513/2513 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1526 transition count 2504
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 1516 transition count 2504
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 19 place count 1516 transition count 2462
Deduced a syphon composed of 42 places in 5 ms
Ensure Unique test removed 5 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 89 rules applied. Total rules applied 108 place count 1469 transition count 2462
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 109 place count 1469 transition count 2461
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 111 place count 1467 transition count 2461
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 111 place count 1467 transition count 2458
Deduced a syphon composed of 3 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 118 place count 1463 transition count 2458
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 119 place count 1462 transition count 2458
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 121 place count 1460 transition count 2449
Iterating global reduction 5 with 2 rules applied. Total rules applied 123 place count 1460 transition count 2449
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 125 place count 1458 transition count 2440
Iterating global reduction 5 with 2 rules applied. Total rules applied 127 place count 1458 transition count 2440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 128 place count 1458 transition count 2439
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 37 rules applied. Total rules applied 165 place count 1438 transition count 2422
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 168 place count 1437 transition count 2420
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 170 place count 1435 transition count 2420
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 4 Pre rules applied. Total rules applied 170 place count 1435 transition count 2416
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 178 place count 1431 transition count 2416
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 8 with 2 rules applied. Total rules applied 180 place count 1429 transition count 2416
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 182 place count 1427 transition count 2414
Iterating global reduction 9 with 2 rules applied. Total rules applied 184 place count 1427 transition count 2414
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 186 place count 1425 transition count 2412
Iterating global reduction 9 with 2 rules applied. Total rules applied 188 place count 1425 transition count 2412
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 189 place count 1425 transition count 2411
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 197 place count 1421 transition count 2407
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 198 place count 1420 transition count 2406
Iterating global reduction 10 with 1 rules applied. Total rules applied 199 place count 1420 transition count 2406
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 200 place count 1419 transition count 2405
Iterating global reduction 10 with 1 rules applied. Total rules applied 201 place count 1419 transition count 2405
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 202 place count 1419 transition count 2404
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 204 place count 1418 transition count 2403
Free-agglomeration rule applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 206 place count 1418 transition count 2401
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 208 place count 1416 transition count 2401
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 210 place count 1416 transition count 2399
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 212 place count 1414 transition count 2399
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 216 place count 1410 transition count 2395
Applied a total of 216 rules in 589 ms. Remains 1410 /1526 variables (removed 116) and now considering 2395/2513 (removed 118) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 589 ms. Remains : 1410/1526 places, 2395/2513 transitions.
Incomplete random walk after 10000 steps, including 86 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 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 8 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 233328 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 233328 steps, saw 39919 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2395 rows 1410 cols
[2023-03-13 02:00:56] [INFO ] Computed 234 place invariants in 23 ms
[2023-03-13 02:00:56] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 02:00:56] [INFO ] [Nat]Absence check using 57 positive place invariants in 14 ms returned sat
[2023-03-13 02:00:56] [INFO ] [Nat]Absence check using 57 positive and 177 generalized place invariants in 88 ms returned sat
[2023-03-13 02:01:21] [INFO ] After 24614ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 02:01:21] [INFO ] After 24624ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-13 02:01:21] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 128 ms.
Support contains 96 out of 1410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1410/1410 places, 2395/2395 transitions.
Applied a total of 0 rules in 46 ms. Remains 1410 /1410 variables (removed 0) and now considering 2395/2395 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 1410/1410 places, 2395/2395 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1410/1410 places, 2395/2395 transitions.
Applied a total of 0 rules in 40 ms. Remains 1410 /1410 variables (removed 0) and now considering 2395/2395 (removed 0) transitions.
[2023-03-13 02:01:21] [INFO ] Invariant cache hit.
[2023-03-13 02:01:22] [INFO ] Implicit Places using invariants in 849 ms returned [1, 22, 23, 36, 53, 71, 145, 149, 158, 184, 202, 223, 273, 278, 279, 290, 291, 293, 312, 330, 354, 405, 413, 414, 425, 426, 427, 429, 446, 464, 549, 553, 554, 565, 566, 567, 590, 609, 629, 661, 686, 691, 692, 703, 704, 706, 725, 743, 819, 834, 835, 856, 874, 895, 946, 951, 952, 963, 964, 967, 987, 1005, 1066, 1078, 1083, 1096, 1097, 1099, 1118, 1136, 1192, 1213, 1217, 1218, 1234, 1235, 1236, 1268, 1270, 1274, 1293, 1294, 1295, 1296, 1311, 1317, 1325, 1331, 1337, 1343, 1349, 1361, 1367, 1373]
Discarding 94 places :
Implicit Place search using SMT only with invariants took 854 ms to find 94 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1316/1410 places, 2395/2395 transitions.
Drop transitions removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 1316 transition count 2265
Reduce places removed 130 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 141 rules applied. Total rules applied 271 place count 1186 transition count 2254
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 279 place count 1178 transition count 2254
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 279 place count 1178 transition count 2210
Deduced a syphon composed of 44 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 89 rules applied. Total rules applied 368 place count 1133 transition count 2210
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 380 place count 1129 transition count 2202
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 388 place count 1121 transition count 2202
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 400 place count 1109 transition count 2190
Iterating global reduction 5 with 12 rules applied. Total rules applied 412 place count 1109 transition count 2190
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 415 place count 1109 transition count 2187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 415 place count 1109 transition count 2186
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 417 place count 1108 transition count 2186
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 419 place count 1106 transition count 2182
Iterating global reduction 6 with 2 rules applied. Total rules applied 421 place count 1106 transition count 2182
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 4 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 6 with 138 rules applied. Total rules applied 559 place count 1037 transition count 2113
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 566 place count 1030 transition count 2103
Iterating global reduction 6 with 7 rules applied. Total rules applied 573 place count 1030 transition count 2103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 575 place count 1030 transition count 2101
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 577 place count 1028 transition count 2099
Iterating global reduction 7 with 2 rules applied. Total rules applied 579 place count 1028 transition count 2099
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 581 place count 1028 transition count 2097
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 583 place count 1027 transition count 2098
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 586 place count 1027 transition count 2095
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 589 place count 1024 transition count 2095
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 9 with 25 rules applied. Total rules applied 614 place count 1024 transition count 2070
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 9 with 26 rules applied. Total rules applied 640 place count 998 transition count 2070
Partial Free-agglomeration rule applied 26 times.
Drop transitions removed 26 transitions
Iterating global reduction 10 with 26 rules applied. Total rules applied 666 place count 998 transition count 2070
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 667 place count 998 transition count 2070
Applied a total of 667 rules in 541 ms. Remains 998 /1316 variables (removed 318) and now considering 2070/2395 (removed 325) transitions.
// Phase 1: matrix 2070 rows 998 cols
[2023-03-13 02:01:23] [INFO ] Computed 134 place invariants in 48 ms
[2023-03-13 02:01:23] [INFO ] Implicit Places using invariants in 581 ms returned [81, 110, 117, 118, 201, 207, 210, 212, 217, 218, 292, 298, 300, 315, 316, 368, 393, 399, 402, 404, 414, 415, 506, 513, 518, 519, 592, 598, 601, 603, 606, 613, 614, 694, 700, 706, 773, 790, 801, 803, 810, 811, 868, 895]
Discarding 44 places :
Implicit Place search using SMT only with invariants took 587 ms to find 44 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 954/1410 places, 2070/2395 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 954 transition count 2069
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 953 transition count 2069
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 17 place count 938 transition count 2054
Iterating global reduction 2 with 15 rules applied. Total rules applied 32 place count 938 transition count 2054
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 37 place count 933 transition count 2049
Iterating global reduction 2 with 5 rules applied. Total rules applied 42 place count 933 transition count 2049
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 66 place count 921 transition count 2037
Free-agglomeration rule applied 18 times.
Iterating global reduction 2 with 18 rules applied. Total rules applied 84 place count 921 transition count 2019
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 102 place count 903 transition count 2019
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 903 transition count 2017
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 106 place count 901 transition count 2017
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 107 place count 901 transition count 2017
Applied a total of 107 rules in 186 ms. Remains 901 /954 variables (removed 53) and now considering 2017/2070 (removed 53) transitions.
// Phase 1: matrix 2017 rows 901 cols
[2023-03-13 02:01:24] [INFO ] Computed 90 place invariants in 16 ms
[2023-03-13 02:01:24] [INFO ] Implicit Places using invariants in 417 ms returned []
[2023-03-13 02:01:24] [INFO ] Invariant cache hit.
[2023-03-13 02:01:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 02:01:26] [INFO ] Implicit Places using invariants and state equation in 1832 ms returned []
Implicit Place search using SMT with State Equation took 2252 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 901/1410 places, 2017/2395 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4460 ms. Remains : 901/1410 places, 2017/2395 transitions.
Incomplete random walk after 10000 steps, including 95 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 216207 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 216207 steps, saw 64068 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-13 02:01:29] [INFO ] Invariant cache hit.
[2023-03-13 02:01:29] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 02:01:29] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-13 02:01:29] [INFO ] [Nat]Absence check using 20 positive and 70 generalized place invariants in 41 ms returned sat
[2023-03-13 02:01:51] [INFO ] After 21924ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 02:01:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 02:01:54] [INFO ] After 2788ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 02:01:54] [INFO ] After 2789ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-13 02:01:54] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 31 ms.
Support contains 96 out of 901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 901/901 places, 2017/2017 transitions.
Applied a total of 0 rules in 27 ms. Remains 901 /901 variables (removed 0) and now considering 2017/2017 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 901/901 places, 2017/2017 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 901/901 places, 2017/2017 transitions.
Applied a total of 0 rules in 26 ms. Remains 901 /901 variables (removed 0) and now considering 2017/2017 (removed 0) transitions.
[2023-03-13 02:01:54] [INFO ] Invariant cache hit.
[2023-03-13 02:01:55] [INFO ] Implicit Places using invariants in 435 ms returned []
[2023-03-13 02:01:55] [INFO ] Invariant cache hit.
[2023-03-13 02:01:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 02:01:57] [INFO ] Implicit Places using invariants and state equation in 2126 ms returned []
Implicit Place search using SMT with State Equation took 2563 ms to find 0 implicit places.
[2023-03-13 02:01:57] [INFO ] Redundant transitions in 142 ms returned []
[2023-03-13 02:01:57] [INFO ] Invariant cache hit.
[2023-03-13 02:01:58] [INFO ] Dead Transitions using invariants and state equation in 726 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3473 ms. Remains : 901/901 places, 2017/2017 transitions.
Applied a total of 0 rules in 26 ms. Remains 901 /901 variables (removed 0) and now considering 2017/2017 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-13 02:01:58] [INFO ] Invariant cache hit.
[2023-03-13 02:01:58] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 02:01:58] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-13 02:01:58] [INFO ] [Nat]Absence check using 20 positive and 70 generalized place invariants in 29 ms returned sat
[2023-03-13 02:02:19] [INFO ] After 20234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 02:02:34] [INFO ] After 35662ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 9424 ms.
[2023-03-13 02:02:43] [INFO ] After 45399ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-13 02:02:43] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-13 02:02:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 901 places, 2017 transitions and 7937 arcs took 15 ms.
[2023-03-13 02:02:44] [INFO ] Flatten gal took : 178 ms
Total runtime 259024 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: ASLink_PT_09b
(NrP: 901 NrTr: 2017 NrArc: 7937)

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

net check time: 0m 0.000sec

init dd package: 0m 2.838sec


before gc: list nodes free: 2001244

after gc: idd nodes used:5637, unused:63994363; list nodes free:262113125

before gc: list nodes free: 1325104

after gc: idd nodes used:11427, unused:63988573; list nodes free:266266056
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 6549972 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16095796 kB

BK_TIME_CONFINEMENT_REACHED

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

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


initing FirstDep: 0m 0.015sec

1339 2677 2743 2694 2792 2924 2955 3060 3119 3354 3325 3596 3599 3919 3839 4198 4051 4254 4357 4693 4734 5120 5166 5352 5488 5447 5966 5892 6432 6412 7049 6886 7447 7450 8012 7955 8542 8613 10411 9120 11175 9848 12057 10515 12596 11143 13567 11909 14486 12670 15489 13457 16482 14359 17545 15162 18558

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is ASLink-PT-09b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r010-oct2-167813598700151"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-09b.tgz
mv ASLink-PT-09b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;