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-167813598500055.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-03b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598500055
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 952K
-rw-r--r-- 1 mcc users 6.5K Feb 26 13:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 13:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 13:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 13:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 13:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 13:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 13:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 13:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 544K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678659096155

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-03b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 22:11:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 22:11:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 22:11:38] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2023-03-12 22:11:38] [INFO ] Transformed 1638 places.
[2023-03-12 22:11:38] [INFO ] Transformed 2094 transitions.
[2023-03-12 22:11:38] [INFO ] Found NUPN structural information;
[2023-03-12 22:11:38] [INFO ] Parsed PT model containing 1638 places and 2094 transitions and 6458 arcs in 231 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 24 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 16) seen :8
FORMULA ASLink-PT-03b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2094 rows 1638 cols
[2023-03-12 22:11:39] [INFO ] Computed 160 place invariants in 87 ms
[2023-03-12 22:11:40] [INFO ] [Real]Absence check using 37 positive place invariants in 17 ms returned sat
[2023-03-12 22:11:40] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 77 ms returned sat
[2023-03-12 22:11:40] [INFO ] After 829ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 22:11:41] [INFO ] [Nat]Absence check using 37 positive place invariants in 18 ms returned sat
[2023-03-12 22:11:41] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 73 ms returned sat
[2023-03-12 22:12:05] [INFO ] After 24183ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-12 22:12:05] [INFO ] After 24196ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-12 22:12:05] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
FORMULA ASLink-PT-03b-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-03b-ReachabilityFireability-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-03b-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 67 ms.
Support contains 163 out of 1638 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1638/1638 places, 2094/2094 transitions.
Drop transitions removed 296 transitions
Trivial Post-agglo rules discarded 296 transitions
Performed 296 trivial Post agglomeration. Transition count delta: 296
Iterating post reduction 0 with 296 rules applied. Total rules applied 296 place count 1638 transition count 1798
Reduce places removed 296 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 1 with 305 rules applied. Total rules applied 601 place count 1342 transition count 1789
Reduce places removed 1 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 2 with 28 rules applied. Total rules applied 629 place count 1341 transition count 1762
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 32 rules applied. Total rules applied 661 place count 1314 transition count 1757
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 662 place count 1313 transition count 1757
Performed 325 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 325 Pre rules applied. Total rules applied 662 place count 1313 transition count 1432
Deduced a syphon composed of 325 places in 3 ms
Ensure Unique test removed 23 places
Reduce places removed 348 places and 0 transitions.
Iterating global reduction 5 with 673 rules applied. Total rules applied 1335 place count 965 transition count 1432
Discarding 6 places :
Implicit places reduction removed 6 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 5 with 14 rules applied. Total rules applied 1349 place count 959 transition count 1424
Reduce places removed 8 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 6 with 15 rules applied. Total rules applied 1364 place count 951 transition count 1417
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1371 place count 944 transition count 1417
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 10 Pre rules applied. Total rules applied 1371 place count 944 transition count 1407
Deduced a syphon composed of 10 places in 5 ms
Ensure Unique test removed 9 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 8 with 29 rules applied. Total rules applied 1400 place count 925 transition count 1407
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 8 Pre rules applied. Total rules applied 1400 place count 925 transition count 1399
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 1416 place count 917 transition count 1399
Discarding 51 places :
Symmetric choice reduction at 8 with 51 rule applications. Total rules 1467 place count 866 transition count 1348
Iterating global reduction 8 with 51 rules applied. Total rules applied 1518 place count 866 transition count 1348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1519 place count 866 transition count 1347
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 12 Pre rules applied. Total rules applied 1519 place count 866 transition count 1335
Deduced a syphon composed of 12 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 25 rules applied. Total rules applied 1544 place count 853 transition count 1335
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1544 place count 853 transition count 1334
Deduced a syphon composed of 1 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 1547 place count 851 transition count 1334
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 3 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 9 with 132 rules applied. Total rules applied 1679 place count 785 transition count 1268
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1680 place count 784 transition count 1267
Ensure Unique test removed 1 places
Iterating global reduction 9 with 2 rules applied. Total rules applied 1682 place count 783 transition count 1267
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1683 place count 782 transition count 1266
Iterating global reduction 9 with 1 rules applied. Total rules applied 1684 place count 782 transition count 1266
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 9 with 2 rules applied. Total rules applied 1686 place count 782 transition count 1264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1687 place count 781 transition count 1264
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1689 place count 780 transition count 1273
Free-agglomeration rule applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 1692 place count 780 transition count 1270
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 1695 place count 777 transition count 1270
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 12 with 5 rules applied. Total rules applied 1700 place count 777 transition count 1265
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 1705 place count 772 transition count 1265
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 1707 place count 772 transition count 1265
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 13 with 4 rules applied. Total rules applied 1711 place count 772 transition count 1265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1712 place count 771 transition count 1264
Applied a total of 1712 rules in 591 ms. Remains 771 /1638 variables (removed 867) and now considering 1264/2094 (removed 830) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 591 ms. Remains : 771/1638 places, 1264/2094 transitions.
Incomplete random walk after 10000 steps, including 75 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 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 17 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 307111 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 307111 steps, saw 87640 distinct states, run finished after 3002 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1264 rows 771 cols
[2023-03-12 22:12:09] [INFO ] Computed 119 place invariants in 30 ms
[2023-03-12 22:12:10] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2023-03-12 22:12:10] [INFO ] [Real]Absence check using 31 positive and 88 generalized place invariants in 37 ms returned sat
[2023-03-12 22:12:10] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 22:12:10] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-12 22:12:10] [INFO ] [Nat]Absence check using 31 positive and 88 generalized place invariants in 41 ms returned sat
[2023-03-12 22:12:35] [INFO ] After 24626ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 22:12:35] [INFO ] State equation strengthened by 9 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-12 22:12:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 22:12:35] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 190 ms.
Support contains 163 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1264/1264 transitions.
Applied a total of 0 rules in 20 ms. Remains 771 /771 variables (removed 0) and now considering 1264/1264 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 771/771 places, 1264/1264 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1264/1264 transitions.
Applied a total of 0 rules in 33 ms. Remains 771 /771 variables (removed 0) and now considering 1264/1264 (removed 0) transitions.
[2023-03-12 22:12:35] [INFO ] Invariant cache hit.
[2023-03-12 22:12:35] [INFO ] Implicit Places using invariants in 367 ms returned [4, 28, 29, 32, 66, 88, 214, 217, 218, 249, 336, 378, 379, 383, 434, 515, 545, 553, 565, 572, 573, 619, 645, 648, 665, 672, 678, 684, 690, 696, 702, 708, 714, 720, 726, 753, 756]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 370 ms to find 37 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 734/771 places, 1264/1264 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 734 transition count 1252
Reduce places removed 12 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 29 rules applied. Total rules applied 41 place count 722 transition count 1235
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 58 place count 705 transition count 1235
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 58 place count 705 transition count 1221
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 86 place count 691 transition count 1221
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 98 place count 679 transition count 1209
Iterating global reduction 3 with 12 rules applied. Total rules applied 110 place count 679 transition count 1209
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 110 place count 679 transition count 1208
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 678 transition count 1208
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 121 place count 669 transition count 1199
Iterating global reduction 3 with 9 rules applied. Total rules applied 130 place count 669 transition count 1199
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 132 place count 668 transition count 1198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 133 place count 667 transition count 1198
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 134 place count 666 transition count 1196
Iterating global reduction 5 with 1 rules applied. Total rules applied 135 place count 666 transition count 1196
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 136 place count 665 transition count 1195
Iterating global reduction 5 with 1 rules applied. Total rules applied 137 place count 665 transition count 1195
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 138 place count 664 transition count 1194
Iterating global reduction 5 with 1 rules applied. Total rules applied 139 place count 664 transition count 1194
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 140 place count 663 transition count 1192
Iterating global reduction 5 with 1 rules applied. Total rules applied 141 place count 663 transition count 1192
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 191 place count 638 transition count 1167
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 196 place count 638 transition count 1162
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 201 place count 633 transition count 1162
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 203 place count 633 transition count 1162
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 204 place count 633 transition count 1162
Applied a total of 204 rules in 218 ms. Remains 633 /734 variables (removed 101) and now considering 1162/1264 (removed 102) transitions.
// Phase 1: matrix 1162 rows 633 cols
[2023-03-12 22:12:36] [INFO ] Computed 81 place invariants in 27 ms
[2023-03-12 22:12:36] [INFO ] Implicit Places using invariants in 297 ms returned [156, 157, 322, 461]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 299 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 629/771 places, 1162/1264 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 627 transition count 1160
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 627 transition count 1160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 626 transition count 1158
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 626 transition count 1158
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 625 transition count 1157
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 625 transition count 1156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 624 transition count 1156
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 624 transition count 1156
Applied a total of 11 rules in 90 ms. Remains 624 /629 variables (removed 5) and now considering 1156/1162 (removed 6) transitions.
// Phase 1: matrix 1156 rows 624 cols
[2023-03-12 22:12:36] [INFO ] Computed 77 place invariants in 20 ms
[2023-03-12 22:12:36] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-12 22:12:36] [INFO ] Invariant cache hit.
[2023-03-12 22:12:37] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-12 22:12:37] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1176 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 624/771 places, 1156/1264 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2187 ms. Remains : 624/771 places, 1156/1264 transitions.
Incomplete random walk after 10000 steps, including 80 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 5) seen :1
FORMULA ASLink-PT-03b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 22:12:37] [INFO ] Invariant cache hit.
[2023-03-12 22:12:38] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-12 22:12:38] [INFO ] [Real]Absence check using 21 positive and 56 generalized place invariants in 16 ms returned sat
[2023-03-12 22:12:38] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 22:12:38] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-03-12 22:12:38] [INFO ] [Nat]Absence check using 21 positive and 56 generalized place invariants in 24 ms returned sat
[2023-03-12 22:12:55] [INFO ] After 17583ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 22:12:55] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-12 22:13:00] [INFO ] After 5064ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 22:13:01] [INFO ] Deduced a trap composed of 90 places in 325 ms of which 6 ms to minimize.
[2023-03-12 22:13:01] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 1 ms to minimize.
[2023-03-12 22:13:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 600 ms
[2023-03-12 22:13:03] [INFO ] After 7173ms 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-12 22:13:03] [INFO ] After 25008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 142 ms.
Support contains 126 out of 624 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 624/624 places, 1156/1156 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 624 transition count 1151
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 619 transition count 1149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 617 transition count 1149
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 14 place count 617 transition count 1133
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 46 place count 601 transition count 1133
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 62 place count 593 transition count 1125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 593 transition count 1124
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 593 transition count 1123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 65 place count 592 transition count 1123
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 66 place count 592 transition count 1122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 67 place count 591 transition count 1122
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 68 place count 591 transition count 1122
Applied a total of 68 rules in 91 ms. Remains 591 /624 variables (removed 33) and now considering 1122/1156 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 591/624 places, 1122/1156 transitions.
Incomplete random walk after 10000 steps, including 96 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 410176 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :{}
Probabilistic random walk after 410176 steps, saw 88116 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1122 rows 591 cols
[2023-03-12 22:13:06] [INFO ] Computed 77 place invariants in 7 ms
[2023-03-12 22:13:06] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-12 22:13:06] [INFO ] [Real]Absence check using 20 positive and 57 generalized place invariants in 19 ms returned sat
[2023-03-12 22:13:06] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 22:13:06] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-12 22:13:06] [INFO ] [Nat]Absence check using 20 positive and 57 generalized place invariants in 21 ms returned sat
[2023-03-12 22:13:24] [INFO ] After 17962ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-12 22:13:24] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-12 22:13:31] [INFO ] After 6843ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-12 22:13:31] [INFO ] After 6843ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-12 22:13:31] [INFO ] After 25011ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA ASLink-PT-03b-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 42 ms.
Support contains 124 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 1122/1122 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 591 transition count 1120
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 589 transition count 1120
Applied a total of 4 rules in 41 ms. Remains 589 /591 variables (removed 2) and now considering 1120/1122 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 589/591 places, 1120/1122 transitions.
Incomplete random walk after 10000 steps, including 81 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 447128 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :{}
Probabilistic random walk after 447128 steps, saw 95603 distinct states, run finished after 3002 ms. (steps per millisecond=148 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1120 rows 589 cols
[2023-03-12 22:13:35] [INFO ] Computed 77 place invariants in 20 ms
[2023-03-12 22:13:35] [INFO ] [Real]Absence check using 22 positive place invariants in 8 ms returned sat
[2023-03-12 22:13:35] [INFO ] [Real]Absence check using 22 positive and 55 generalized place invariants in 37 ms returned sat
[2023-03-12 22:13:35] [INFO ] After 575ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:13:35] [INFO ] [Nat]Absence check using 22 positive place invariants in 14 ms returned sat
[2023-03-12 22:13:35] [INFO ] [Nat]Absence check using 22 positive and 55 generalized place invariants in 35 ms returned sat
[2023-03-12 22:13:49] [INFO ] After 13148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 22:13:49] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-12 22:13:58] [INFO ] After 9830ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 22:13:59] [INFO ] Deduced a trap composed of 97 places in 239 ms of which 0 ms to minimize.
[2023-03-12 22:13:59] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 0 ms to minimize.
[2023-03-12 22:13:59] [INFO ] Deduced a trap composed of 73 places in 249 ms of which 1 ms to minimize.
[2023-03-12 22:14:00] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 1 ms to minimize.
[2023-03-12 22:14:00] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 0 ms to minimize.
[2023-03-12 22:14:00] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 0 ms to minimize.
[2023-03-12 22:14:00] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1391 ms
[2023-03-12 22:14:00] [INFO ] After 11593ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 22:14:00] [INFO ] After 25007ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 290 ms.
Support contains 124 out of 589 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 589/589 places, 1120/1120 transitions.
Applied a total of 0 rules in 13 ms. Remains 589 /589 variables (removed 0) and now considering 1120/1120 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 589/589 places, 1120/1120 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 589/589 places, 1120/1120 transitions.
Applied a total of 0 rules in 12 ms. Remains 589 /589 variables (removed 0) and now considering 1120/1120 (removed 0) transitions.
[2023-03-12 22:14:01] [INFO ] Invariant cache hit.
[2023-03-12 22:14:01] [INFO ] Implicit Places using invariants in 216 ms returned [124, 279, 298, 559]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 218 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 585/589 places, 1120/1120 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 583 transition count 1118
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 583 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 582 transition count 1117
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 582 transition count 1117
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 8 place count 581 transition count 1116
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 581 transition count 1115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 580 transition count 1115
Applied a total of 10 rules in 46 ms. Remains 580 /585 variables (removed 5) and now considering 1115/1120 (removed 5) transitions.
// Phase 1: matrix 1115 rows 580 cols
[2023-03-12 22:14:01] [INFO ] Computed 73 place invariants in 12 ms
[2023-03-12 22:14:01] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-12 22:14:01] [INFO ] Invariant cache hit.
[2023-03-12 22:14:01] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-12 22:14:02] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 1114 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 580/589 places, 1115/1120 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1390 ms. Remains : 580/589 places, 1115/1120 transitions.
Incomplete random walk after 10000 steps, including 84 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 426952 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 426952 steps, saw 89733 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 22:14:05] [INFO ] Invariant cache hit.
[2023-03-12 22:14:05] [INFO ] [Real]Absence check using 19 positive place invariants in 25 ms returned sat
[2023-03-12 22:14:05] [INFO ] [Real]Absence check using 19 positive and 54 generalized place invariants in 75 ms returned sat
[2023-03-12 22:14:05] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:14:06] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-12 22:14:06] [INFO ] [Nat]Absence check using 19 positive and 54 generalized place invariants in 22 ms returned sat
[2023-03-12 22:14:14] [INFO ] After 8693ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 22:14:14] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-12 22:14:29] [INFO ] After 15115ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 22:14:30] [INFO ] Deduced a trap composed of 62 places in 337 ms of which 1 ms to minimize.
[2023-03-12 22:14:30] [INFO ] Deduced a trap composed of 105 places in 187 ms of which 1 ms to minimize.
[2023-03-12 22:14:31] [INFO ] Deduced a trap composed of 29 places in 336 ms of which 0 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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-12 22:14:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 22:14:31] [INFO ] After 25176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 1722 ms.
Support contains 124 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1115/1115 transitions.
Applied a total of 0 rules in 13 ms. Remains 580 /580 variables (removed 0) and now considering 1115/1115 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 580/580 places, 1115/1115 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1115/1115 transitions.
Applied a total of 0 rules in 12 ms. Remains 580 /580 variables (removed 0) and now considering 1115/1115 (removed 0) transitions.
[2023-03-12 22:14:32] [INFO ] Invariant cache hit.
[2023-03-12 22:14:33] [INFO ] Implicit Places using invariants in 214 ms returned []
[2023-03-12 22:14:33] [INFO ] Invariant cache hit.
[2023-03-12 22:14:33] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-12 22:14:33] [INFO ] Implicit Places using invariants and state equation in 866 ms returned []
Implicit Place search using SMT with State Equation took 1084 ms to find 0 implicit places.
[2023-03-12 22:14:34] [INFO ] Redundant transitions in 85 ms returned []
[2023-03-12 22:14:34] [INFO ] Invariant cache hit.
[2023-03-12 22:14:34] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1627 ms. Remains : 580/580 places, 1115/1115 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 580 transition count 1111
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 576 transition count 1111
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 575 transition count 1111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 574 transition count 1110
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 574 transition count 1110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 573 transition count 1109
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 573 transition count 1109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 572 transition count 1108
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 572 transition count 1108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 572 transition count 1107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 571 transition count 1106
Applied a total of 18 rules in 47 ms. Remains 571 /580 variables (removed 9) and now considering 1106/1115 (removed 9) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1106 rows 571 cols
[2023-03-12 22:14:34] [INFO ] Computed 72 place invariants in 7 ms
[2023-03-12 22:14:34] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2023-03-12 22:14:34] [INFO ] [Real]Absence check using 18 positive and 54 generalized place invariants in 37 ms returned sat
[2023-03-12 22:14:34] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:14:34] [INFO ] [Nat]Absence check using 18 positive place invariants in 36 ms returned sat
[2023-03-12 22:14:34] [INFO ] [Nat]Absence check using 18 positive and 54 generalized place invariants in 15 ms returned sat
[2023-03-12 22:14:48] [INFO ] After 13365ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 22:14:48] [INFO ] Deduced a trap composed of 103 places in 270 ms of which 1 ms to minimize.
[2023-03-12 22:14:48] [INFO ] Deduced a trap composed of 58 places in 141 ms of which 0 ms to minimize.
[2023-03-12 22:14:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 614 ms
[2023-03-12 22:15:04] [INFO ] After 29574ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4836 ms.
[2023-03-12 22:15:09] [INFO ] After 34608ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-12 22:15:09] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-12 22:15:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 580 places, 1115 transitions and 4262 arcs took 8 ms.
[2023-03-12 22:15:09] [INFO ] Flatten gal took : 115 ms
Total runtime 211312 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_03b
(NrP: 580 NrTr: 1115 NrArc: 4262)

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

net check time: 0m 0.000sec

init dd package: 0m 2.807sec


before gc: list nodes free: 1285405

after gc: idd nodes used:390646, unused:63609354; list nodes free:273067152
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6423444 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16097780 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.005sec

135288 162538 168145 162065 231823 312858 322277 330853 457731 442546 563700 527471 479867 510783 559514 480787 458501 512770 433791 412465 372525 350022 346164 422769 343876 291889 121407 89734 126787 163491 158501 170303 170061 169371 204331 193941 232774 269399 271403 269959 270836 288988 261774 287449 408075 355284

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-03b"
export BK_EXAMINATION="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-03b, 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-167813598500055"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-03b.tgz
mv ASLink-PT-03b execution
cd execution
if [ "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 ;