Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r131-smll-171624288500170.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is DLCround-PT-12b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r131-smll-171624288500170
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Apr 13 12:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 13 12:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 13 12:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 13 12:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.9M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716402391292

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=gold2023
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-12b
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-22 18:26:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 18:26:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 18:26:34] [INFO ] Load time of PNML (sax parser for PT used): 442 ms
[2024-05-22 18:26:34] [INFO ] Transformed 4848 places.
[2024-05-22 18:26:34] [INFO ] Transformed 7836 transitions.
[2024-05-22 18:26:34] [INFO ] Found NUPN structural information;
[2024-05-22 18:26:34] [INFO ] Parsed PT model containing 4848 places and 7836 transitions and 22188 arcs in 746 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 971 ms. (steps per millisecond=10 ) properties (out of 16) seen :9
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 7836 rows 4848 cols
[2024-05-22 18:26:36] [INFO ] Computed 277 invariants in 75 ms
[2024-05-22 18:26:39] [INFO ] After 2429ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-22 18:26:41] [INFO ] [Nat]Absence check using 277 positive place invariants in 404 ms returned sat
[2024-05-22 18:26:53] [INFO ] After 10992ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-22 18:26:57] [INFO ] Deduced a trap composed of 133 places in 1633 ms of which 12 ms to minimize.
[2024-05-22 18:26:59] [INFO ] Deduced a trap composed of 235 places in 1203 ms of which 2 ms to minimize.
[2024-05-22 18:27:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3980 ms
[2024-05-22 18:27:02] [INFO ] Deduced a trap composed of 361 places in 1111 ms of which 3 ms to minimize.
[2024-05-22 18:27:04] [INFO ] Deduced a trap composed of 266 places in 1055 ms of which 4 ms to minimize.
[2024-05-22 18:27:05] [INFO ] Deduced a trap composed of 336 places in 831 ms of which 2 ms to minimize.
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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-22 18:27:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-22 18:27:05] [INFO ] After 25911ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 973 ms.
Support contains 263 out of 4848 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4848/4848 places, 7836/7836 transitions.
Graph (trivial) has 3974 edges and 4848 vertex of which 551 / 4848 are part of one of the 53 SCC in 25 ms
Free SCC test removed 498 places
Drop transitions removed 564 transitions
Reduce isomorphic transitions removed 564 transitions.
Drop transitions removed 1639 transitions
Trivial Post-agglo rules discarded 1639 transitions
Performed 1639 trivial Post agglomeration. Transition count delta: 1639
Iterating post reduction 0 with 1639 rules applied. Total rules applied 1640 place count 4350 transition count 5633
Reduce places removed 1639 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 1689 rules applied. Total rules applied 3329 place count 2711 transition count 5583
Reduce places removed 21 places and 0 transitions.
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Iterating post reduction 2 with 86 rules applied. Total rules applied 3415 place count 2690 transition count 5518
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 71 rules applied. Total rules applied 3486 place count 2625 transition count 5512
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3488 place count 2623 transition count 5512
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 91 Pre rules applied. Total rules applied 3488 place count 2623 transition count 5421
Deduced a syphon composed of 91 places in 54 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 5 with 182 rules applied. Total rules applied 3670 place count 2532 transition count 5421
Discarding 638 places :
Symmetric choice reduction at 5 with 638 rule applications. Total rules 4308 place count 1894 transition count 4783
Iterating global reduction 5 with 638 rules applied. Total rules applied 4946 place count 1894 transition count 4783
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 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 5 with 26 rules applied. Total rules applied 4972 place count 1894 transition count 4757
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 4985 place count 1885 transition count 4753
Performed 245 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 245 Pre rules applied. Total rules applied 4985 place count 1885 transition count 4508
Deduced a syphon composed of 245 places in 44 ms
Reduce places removed 245 places and 0 transitions.
Iterating global reduction 7 with 490 rules applied. Total rules applied 5475 place count 1640 transition count 4508
Discarding 34 places :
Symmetric choice reduction at 7 with 34 rule applications. Total rules 5509 place count 1606 transition count 4012
Iterating global reduction 7 with 34 rules applied. Total rules applied 5543 place count 1606 transition count 4012
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 5553 place count 1606 transition count 4002
Performed 385 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 385 places in 3 ms
Reduce places removed 385 places and 0 transitions.
Iterating global reduction 8 with 770 rules applied. Total rules applied 6323 place count 1221 transition count 3613
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 6326 place count 1221 transition count 3610
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 6329 place count 1218 transition count 3562
Iterating global reduction 9 with 3 rules applied. Total rules applied 6332 place count 1218 transition count 3562
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: -662
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 9 with 144 rules applied. Total rules applied 6476 place count 1146 transition count 4224
Drop transitions removed 58 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 9 with 63 rules applied. Total rules applied 6539 place count 1146 transition count 4161
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 6544 place count 1141 transition count 4013
Iterating global reduction 10 with 5 rules applied. Total rules applied 6549 place count 1141 transition count 4013
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 6551 place count 1141 transition count 4011
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 6555 place count 1139 transition count 4035
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 6557 place count 1139 transition count 4033
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 12 with 37 rules applied. Total rules applied 6594 place count 1139 transition count 3996
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 6596 place count 1137 transition count 3994
Iterating global reduction 12 with 2 rules applied. Total rules applied 6598 place count 1137 transition count 3994
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 6600 place count 1135 transition count 3954
Iterating global reduction 12 with 2 rules applied. Total rules applied 6602 place count 1135 transition count 3954
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 6604 place count 1135 transition count 3952
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 6612 place count 1131 transition count 3948
Discarding 4 places :
Symmetric choice reduction at 13 with 4 rule applications. Total rules 6616 place count 1127 transition count 3869
Iterating global reduction 13 with 4 rules applied. Total rules applied 6620 place count 1127 transition count 3869
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 6623 place count 1127 transition count 3866
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 6625 place count 1126 transition count 3879
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 6626 place count 1126 transition count 3878
Free-agglomeration rule applied 356 times with reduction of 41 identical transitions.
Iterating global reduction 14 with 356 rules applied. Total rules applied 6982 place count 1126 transition count 3481
Reduce places removed 356 places and 0 transitions.
Drop transitions removed 260 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 266 transitions.
Iterating post reduction 14 with 622 rules applied. Total rules applied 7604 place count 770 transition count 3215
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 7607 place count 767 transition count 3198
Iterating global reduction 15 with 3 rules applied. Total rules applied 7610 place count 767 transition count 3198
Drop transitions removed 116 transitions
Redundant transition composition rules discarded 116 transitions
Iterating global reduction 15 with 116 rules applied. Total rules applied 7726 place count 767 transition count 3082
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 7728 place count 766 transition count 3081
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 7729 place count 766 transition count 3080
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 15 with 10 rules applied. Total rules applied 7739 place count 765 transition count 3071
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 16 with 2 rules applied. Total rules applied 7741 place count 765 transition count 3092
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 16 with 15 rules applied. Total rules applied 7756 place count 763 transition count 3079
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 17 with 4 rules applied. Total rules applied 7760 place count 763 transition count 3075
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 17 with 19 rules applied. Total rules applied 7779 place count 763 transition count 3075
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 17 with 3 rules applied. Total rules applied 7782 place count 763 transition count 3072
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 7784 place count 761 transition count 3070
Iterating global reduction 17 with 2 rules applied. Total rules applied 7786 place count 761 transition count 3070
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 7787 place count 760 transition count 3050
Iterating global reduction 17 with 1 rules applied. Total rules applied 7788 place count 760 transition count 3050
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 7789 place count 760 transition count 3049
Applied a total of 7789 rules in 2721 ms. Remains 760 /4848 variables (removed 4088) and now considering 3049/7836 (removed 4787) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2723 ms. Remains : 760/4848 places, 3049/7836 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 5) seen :1
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-22 18:27:09] [INFO ] Flow matrix only has 1810 transitions (discarded 1239 similar events)
// Phase 1: matrix 1810 rows 760 cols
[2024-05-22 18:27:09] [INFO ] Computed 274 invariants in 19 ms
[2024-05-22 18:27:10] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 18:27:10] [INFO ] [Nat]Absence check using 274 positive place invariants in 98 ms returned sat
[2024-05-22 18:27:12] [INFO ] After 1674ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 18:27:12] [INFO ] State equation strengthened by 259 read => feed constraints.
[2024-05-22 18:27:13] [INFO ] After 1461ms SMT Verify possible using 259 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 18:27:14] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 0 ms to minimize.
[2024-05-22 18:27:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2024-05-22 18:27:15] [INFO ] After 3172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1250 ms.
[2024-05-22 18:27:16] [INFO ] After 6461ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 11 ms.
Support contains 256 out of 760 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 760/760 places, 3049/3049 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 0 with 2 rules applied. Total rules applied 2 place count 760 transition count 3047
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 758 transition count 3046
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 757 transition count 3046
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 6 place count 757 transition count 3044
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 10 place count 755 transition count 3044
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 16 place count 752 transition count 3041
Drop transitions removed 16 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 38 place count 752 transition count 3019
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 41 place count 749 transition count 3007
Iterating global reduction 4 with 3 rules applied. Total rules applied 44 place count 749 transition count 3007
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 46 place count 748 transition count 3015
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 47 place count 748 transition count 3014
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 48 place count 748 transition count 3013
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 49 place count 747 transition count 3013
Applied a total of 49 rules in 205 ms. Remains 747 /760 variables (removed 13) and now considering 3013/3049 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 747/760 places, 3013/3049 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 4) seen :1
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-22 18:27:17] [INFO ] Flow matrix only has 1780 transitions (discarded 1233 similar events)
// Phase 1: matrix 1780 rows 747 cols
[2024-05-22 18:27:17] [INFO ] Computed 271 invariants in 17 ms
[2024-05-22 18:27:17] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 18:27:17] [INFO ] [Nat]Absence check using 271 positive place invariants in 79 ms returned sat
[2024-05-22 18:27:19] [INFO ] After 1302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 18:27:19] [INFO ] State equation strengthened by 257 read => feed constraints.
[2024-05-22 18:27:20] [INFO ] After 1069ms SMT Verify possible using 257 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-22 18:27:20] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2024-05-22 18:27:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2024-05-22 18:27:21] [INFO ] After 2128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 952 ms.
[2024-05-22 18:27:22] [INFO ] After 4713ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 3 ms.
Support contains 180 out of 747 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 3013/3013 transitions.
Graph (trivial) has 169 edges and 747 vertex of which 13 / 747 are part of one of the 5 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions removed 23 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 739 transition count 2973
Reduce places removed 10 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 729 transition count 2971
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 727 transition count 2971
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 25 place count 727 transition count 2960
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 47 place count 716 transition count 2960
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 48 place count 716 transition count 2959
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 54 place count 710 transition count 2872
Iterating global reduction 4 with 6 rules applied. Total rules applied 60 place count 710 transition count 2872
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 62 place count 710 transition count 2870
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 98 place count 692 transition count 2852
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 112 place count 692 transition count 2838
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 114 place count 690 transition count 2806
Iterating global reduction 6 with 2 rules applied. Total rules applied 116 place count 690 transition count 2806
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 118 place count 690 transition count 2804
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 119 place count 689 transition count 2802
Iterating global reduction 7 with 1 rules applied. Total rules applied 120 place count 689 transition count 2802
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 124 place count 687 transition count 2812
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 125 place count 687 transition count 2811
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 8 with 21 rules applied. Total rules applied 146 place count 687 transition count 2790
Free-agglomeration rule applied 47 times with reduction of 3 identical transitions.
Iterating global reduction 8 with 47 rules applied. Total rules applied 193 place count 687 transition count 2740
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 129 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 135 transitions.
Iterating post reduction 8 with 182 rules applied. Total rules applied 375 place count 640 transition count 2605
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 376 place count 639 transition count 2596
Iterating global reduction 9 with 1 rules applied. Total rules applied 377 place count 639 transition count 2596
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 399 place count 639 transition count 2574
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 10 with 30 rules applied. Total rules applied 429 place count 639 transition count 2544
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 435 place count 639 transition count 2544
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 438 place count 639 transition count 2541
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 442 place count 637 transition count 2539
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 444 place count 636 transition count 2551
Applied a total of 444 rules in 441 ms. Remains 636 /747 variables (removed 111) and now considering 2551/3013 (removed 462) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 441 ms. Remains : 636/747 places, 2551/3013 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 168799 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 168799 steps, saw 151196 distinct states, run finished after 3003 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-22 18:27:26] [INFO ] Flow matrix only has 1361 transitions (discarded 1190 similar events)
// Phase 1: matrix 1361 rows 636 cols
[2024-05-22 18:27:26] [INFO ] Computed 269 invariants in 9 ms
[2024-05-22 18:27:26] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 18:27:26] [INFO ] [Nat]Absence check using 269 positive place invariants in 89 ms returned sat
[2024-05-22 18:27:28] [INFO ] After 1118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 18:27:28] [INFO ] State equation strengthened by 246 read => feed constraints.
[2024-05-22 18:27:29] [INFO ] After 868ms SMT Verify possible using 246 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-22 18:27:29] [INFO ] After 1684ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 884 ms.
[2024-05-22 18:27:30] [INFO ] After 3965ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 11 ms.
Support contains 180 out of 636 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 636/636 places, 2551/2551 transitions.
Applied a total of 0 rules in 53 ms. Remains 636 /636 variables (removed 0) and now considering 2551/2551 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 636/636 places, 2551/2551 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 636/636 places, 2551/2551 transitions.
Applied a total of 0 rules in 35 ms. Remains 636 /636 variables (removed 0) and now considering 2551/2551 (removed 0) transitions.
[2024-05-22 18:27:30] [INFO ] Flow matrix only has 1361 transitions (discarded 1190 similar events)
[2024-05-22 18:27:30] [INFO ] Invariant cache hit.
[2024-05-22 18:27:31] [INFO ] Implicit Places using invariants in 562 ms returned [622, 628, 629, 630, 631, 632, 635]
Discarding 7 places :
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Implicit Place search using SMT only with invariants took 567 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 629/636 places, 2521/2551 transitions.
Graph (trivial) has 53 edges and 629 vertex of which 3 / 629 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 18 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 163 transitions
Redundant transition composition rules discarded 163 transitions
Iterating global reduction 0 with 163 rules applied. Total rules applied 164 place count 627 transition count 2335
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 210 place count 581 transition count 2123
Iterating global reduction 0 with 46 rules applied. Total rules applied 256 place count 581 transition count 2123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 258 place count 580 transition count 2132
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 265 place count 580 transition count 2125
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 266 place count 580 transition count 2125
Applied a total of 266 rules in 114 ms. Remains 580 /629 variables (removed 49) and now considering 2125/2521 (removed 396) transitions.
[2024-05-22 18:27:31] [INFO ] Flow matrix only has 1345 transitions (discarded 780 similar events)
// Phase 1: matrix 1345 rows 580 cols
[2024-05-22 18:27:31] [INFO ] Computed 216 invariants in 6 ms
[2024-05-22 18:27:31] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-05-22 18:27:31] [INFO ] Flow matrix only has 1345 transitions (discarded 780 similar events)
[2024-05-22 18:27:31] [INFO ] Invariant cache hit.
[2024-05-22 18:27:32] [INFO ] State equation strengthened by 235 read => feed constraints.
[2024-05-22 18:27:33] [INFO ] Implicit Places using invariants and state equation in 1669 ms returned []
Implicit Place search using SMT with State Equation took 2046 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 580/636 places, 2125/2551 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2763 ms. Remains : 580/636 places, 2125/2551 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 167878 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 167878 steps, saw 150401 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-22 18:27:37] [INFO ] Flow matrix only has 1345 transitions (discarded 780 similar events)
[2024-05-22 18:27:37] [INFO ] Invariant cache hit.
[2024-05-22 18:27:37] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 18:27:37] [INFO ] [Nat]Absence check using 216 positive place invariants in 77 ms returned sat
[2024-05-22 18:27:38] [INFO ] After 1063ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 18:27:38] [INFO ] State equation strengthened by 235 read => feed constraints.
[2024-05-22 18:27:39] [INFO ] After 867ms SMT Verify possible using 235 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-22 18:27:40] [INFO ] After 1674ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 825 ms.
[2024-05-22 18:27:41] [INFO ] After 3826ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 36 ms.
Support contains 180 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 2125/2125 transitions.
Applied a total of 0 rules in 32 ms. Remains 580 /580 variables (removed 0) and now considering 2125/2125 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 580/580 places, 2125/2125 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 2125/2125 transitions.
Applied a total of 0 rules in 32 ms. Remains 580 /580 variables (removed 0) and now considering 2125/2125 (removed 0) transitions.
[2024-05-22 18:27:41] [INFO ] Flow matrix only has 1345 transitions (discarded 780 similar events)
[2024-05-22 18:27:41] [INFO ] Invariant cache hit.
[2024-05-22 18:27:41] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-05-22 18:27:41] [INFO ] Flow matrix only has 1345 transitions (discarded 780 similar events)
[2024-05-22 18:27:41] [INFO ] Invariant cache hit.
[2024-05-22 18:27:42] [INFO ] State equation strengthened by 235 read => feed constraints.
[2024-05-22 18:27:43] [INFO ] Implicit Places using invariants and state equation in 1488 ms returned []
Implicit Place search using SMT with State Equation took 2004 ms to find 0 implicit places.
[2024-05-22 18:27:43] [INFO ] Redundant transitions in 182 ms returned [2124]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
[2024-05-22 18:27:43] [INFO ] Flow matrix only has 1344 transitions (discarded 780 similar events)
// Phase 1: matrix 1344 rows 580 cols
[2024-05-22 18:27:43] [INFO ] Computed 216 invariants in 6 ms
[2024-05-22 18:27:44] [INFO ] Dead Transitions using invariants and state equation in 1414 ms found 0 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 580/580 places, 2124/2125 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 579 transition count 2123
Applied a total of 2 rules in 46 ms. Remains 579 /580 variables (removed 1) and now considering 2123/2124 (removed 1) transitions.
[2024-05-22 18:27:44] [INFO ] Flow matrix only has 1343 transitions (discarded 780 similar events)
// Phase 1: matrix 1343 rows 579 cols
[2024-05-22 18:27:44] [INFO ] Computed 216 invariants in 6 ms
[2024-05-22 18:27:45] [INFO ] Implicit Places using invariants in 466 ms returned []
[2024-05-22 18:27:45] [INFO ] Flow matrix only has 1343 transitions (discarded 780 similar events)
[2024-05-22 18:27:45] [INFO ] Invariant cache hit.
[2024-05-22 18:27:46] [INFO ] State equation strengthened by 235 read => feed constraints.
[2024-05-22 18:27:46] [INFO ] Implicit Places using invariants and state equation in 1478 ms returned []
Implicit Place search using SMT with State Equation took 1946 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 579/580 places, 2123/2125 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5634 ms. Remains : 579/580 places, 2123/2125 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 3) seen :1
FORMULA DLCround-PT-12b-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-22 18:27:47] [INFO ] Flow matrix only has 1343 transitions (discarded 780 similar events)
[2024-05-22 18:27:47] [INFO ] Invariant cache hit.
[2024-05-22 18:27:47] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 18:27:47] [INFO ] [Nat]Absence check using 216 positive place invariants in 74 ms returned sat
[2024-05-22 18:27:48] [INFO ] After 948ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 18:27:48] [INFO ] State equation strengthened by 235 read => feed constraints.
[2024-05-22 18:27:49] [INFO ] After 672ms SMT Verify possible using 235 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 18:27:49] [INFO ] After 1309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 593 ms.
[2024-05-22 18:27:50] [INFO ] After 3075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 150 out of 579 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 579/579 places, 2123/2123 transitions.
Graph (trivial) has 92 edges and 579 vertex of which 8 / 579 are part of one of the 2 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 21 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 0 with 3 rules applied. Total rules applied 4 place count 573 transition count 2099
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 570 transition count 2099
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 7 place count 570 transition count 2093
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 19 place count 564 transition count 2093
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21 place count 564 transition count 2091
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 25 place count 560 transition count 2053
Iterating global reduction 3 with 4 rules applied. Total rules applied 29 place count 560 transition count 2053
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 39 place count 555 transition count 2048
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 77 place count 555 transition count 2010
Free-agglomeration rule applied 23 times.
Iterating global reduction 3 with 23 rules applied. Total rules applied 100 place count 555 transition count 1987
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 70 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 3 with 97 rules applied. Total rules applied 197 place count 532 transition count 1913
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 202 place count 527 transition count 1888
Iterating global reduction 4 with 5 rules applied. Total rules applied 207 place count 527 transition count 1888
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 218 place count 527 transition count 1877
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 224 place count 527 transition count 1871
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 225 place count 527 transition count 1888
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 234 place count 526 transition count 1880
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 6 with 21 rules applied. Total rules applied 255 place count 526 transition count 1859
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 256 place count 526 transition count 1859
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 257 place count 526 transition count 1859
Applied a total of 257 rules in 218 ms. Remains 526 /579 variables (removed 53) and now considering 1859/2123 (removed 264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 218 ms. Remains : 526/579 places, 1859/2123 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 172103 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 172103 steps, saw 154159 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-22 18:27:54] [INFO ] Flow matrix only has 1121 transitions (discarded 738 similar events)
// Phase 1: matrix 1121 rows 526 cols
[2024-05-22 18:27:54] [INFO ] Computed 211 invariants in 7 ms
[2024-05-22 18:27:54] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 18:27:54] [INFO ] [Nat]Absence check using 211 positive place invariants in 72 ms returned sat
[2024-05-22 18:27:55] [INFO ] After 870ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 18:27:55] [INFO ] State equation strengthened by 217 read => feed constraints.
[2024-05-22 18:27:56] [INFO ] After 642ms SMT Verify possible using 217 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 18:27:56] [INFO ] After 1184ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 516 ms.
[2024-05-22 18:27:57] [INFO ] After 2786ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 150 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1859/1859 transitions.
Applied a total of 0 rules in 21 ms. Remains 526 /526 variables (removed 0) and now considering 1859/1859 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 526/526 places, 1859/1859 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1859/1859 transitions.
Applied a total of 0 rules in 21 ms. Remains 526 /526 variables (removed 0) and now considering 1859/1859 (removed 0) transitions.
[2024-05-22 18:27:57] [INFO ] Flow matrix only has 1121 transitions (discarded 738 similar events)
[2024-05-22 18:27:57] [INFO ] Invariant cache hit.
[2024-05-22 18:27:57] [INFO ] Implicit Places using invariants in 440 ms returned []
[2024-05-22 18:27:57] [INFO ] Flow matrix only has 1121 transitions (discarded 738 similar events)
[2024-05-22 18:27:57] [INFO ] Invariant cache hit.
[2024-05-22 18:27:58] [INFO ] State equation strengthened by 217 read => feed constraints.
[2024-05-22 18:27:58] [INFO ] Implicit Places using invariants and state equation in 1332 ms returned []
Implicit Place search using SMT with State Equation took 1774 ms to find 0 implicit places.
[2024-05-22 18:27:59] [INFO ] Redundant transitions in 152 ms returned []
[2024-05-22 18:27:59] [INFO ] Flow matrix only has 1121 transitions (discarded 738 similar events)
[2024-05-22 18:27:59] [INFO ] Invariant cache hit.
[2024-05-22 18:28:00] [INFO ] Dead Transitions using invariants and state equation in 1662 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3617 ms. Remains : 526/526 places, 1859/1859 transitions.
Graph (trivial) has 523 edges and 526 vertex of which 84 / 526 are part of one of the 40 SCC in 0 ms
Free SCC test removed 44 places
Drop transitions removed 239 transitions
Ensure Unique test removed 705 transitions
Reduce isomorphic transitions removed 944 transitions.
Graph (complete) has 1316 edges and 482 vertex of which 398 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.3 ms
Discarding 84 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 398 transition count 912
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 396 transition count 912
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 396 transition count 910
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 394 transition count 910
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 22 place count 382 transition count 872
Iterating global reduction 2 with 12 rules applied. Total rules applied 34 place count 382 transition count 872
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 36 place count 382 transition count 870
Performed 11 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 58 place count 371 transition count 851
Drop transitions removed 5 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 85 place count 371 transition count 824
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 88 place count 368 transition count 818
Iterating global reduction 4 with 3 rules applied. Total rules applied 91 place count 368 transition count 818
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 93 place count 367 transition count 817
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 101 place count 363 transition count 835
Drop transitions removed 162 transitions
Redundant transition composition rules discarded 162 transitions
Iterating global reduction 4 with 162 rules applied. Total rules applied 263 place count 363 transition count 673
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 287 place count 339 transition count 673
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 291 place count 337 transition count 671
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 5 with 29 rules applied. Total rules applied 320 place count 337 transition count 671
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 327 place count 337 transition count 664
Applied a total of 327 rules in 91 ms. Remains 337 /526 variables (removed 189) and now considering 664/1859 (removed 1195) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 664 rows 337 cols
[2024-05-22 18:28:00] [INFO ] Computed 95 invariants in 3 ms
[2024-05-22 18:28:00] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 18:28:01] [INFO ] [Nat]Absence check using 95 positive place invariants in 29 ms returned sat
[2024-05-22 18:28:01] [INFO ] After 539ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 18:28:01] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-22 18:28:01] [INFO ] After 306ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 18:28:02] [INFO ] After 624ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 294 ms.
[2024-05-22 18:28:02] [INFO ] After 1587ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-22 18:28:02] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-05-22 18:28:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 526 places, 1859 transitions and 9640 arcs took 15 ms.
[2024-05-22 18:28:03] [INFO ] Flatten gal took : 322 ms
Total runtime 89363 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DLCround-PT-12b
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/370
ReachabilityFireability

FORMULA DLCround-PT-12b-ReachabilityFireability-2024-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-12b-ReachabilityFireability-2024-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716402486986

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/370/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/370/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/370/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 11 (type EXCL) for 3 DLCround-PT-12b-ReachabilityFireability-2024-08
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 7 (type FNDP) for 3 DLCround-PT-12b-ReachabilityFireability-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type EQUN) for 3 DLCround-PT-12b-ReachabilityFireability-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 10 (type SRCH) for 3 DLCround-PT-12b-ReachabilityFireability-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 7 (type FNDP) for DLCround-PT-12b-ReachabilityFireability-2024-08
lola: result : true
lola: fired transitions : 187
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 8 (type EQUN) for DLCround-PT-12b-ReachabilityFireability-2024-08 (obsolete)
lola: CANCELED task # 10 (type SRCH) for DLCround-PT-12b-ReachabilityFireability-2024-08 (obsolete)
lola: CANCELED task # 11 (type EXCL) for DLCround-PT-12b-ReachabilityFireability-2024-08 (obsolete)
lola: LAUNCH task # 17 (type EXCL) for 0 DLCround-PT-12b-ReachabilityFireability-2024-07
lola: time limit : 3598 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 13 (type FNDP) for 0 DLCround-PT-12b-ReachabilityFireability-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 0 DLCround-PT-12b-ReachabilityFireability-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 16 (type SRCH) for 0 DLCround-PT-12b-ReachabilityFireability-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 16 (type SRCH) for DLCround-PT-12b-ReachabilityFireability-2024-07
lola: result : true
lola: markings : 34
lola: fired transitions : 33
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 13 (type FNDP) for DLCround-PT-12b-ReachabilityFireability-2024-07 (obsolete)
lola: CANCELED task # 14 (type EQUN) for DLCround-PT-12b-ReachabilityFireability-2024-07 (obsolete)
lola: CANCELED task # 17 (type EXCL) for DLCround-PT-12b-ReachabilityFireability-2024-07 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DLCround-PT-12b-ReachabilityFireability-2024-07: EF true tandem / insertion
DLCround-PT-12b-ReachabilityFireability-2024-08: AG false findpath


Time elapsed: 2 secs. Pages in use: 2

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is DLCround-PT-12b, 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 r131-smll-171624288500170"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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