fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r009-oct2-167813597500151
Last Updated
May 14, 2023

About the Execution of LTSMin+red for ASLink-PT-09b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3446.968 3600000.00 13856882.00 44.90 ??FFTFT?TF?FT??? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r009-oct2-167813597500151.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 ltsminxred
Input is ASLink-PT-09b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597500151
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 5.9K Feb 26 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 13:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 13:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678617683933

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=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-09b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 10:41:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 10:41:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 10:41:26] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2023-03-12 10:41:26] [INFO ] Transformed 4014 places.
[2023-03-12 10:41:26] [INFO ] Transformed 4932 transitions.
[2023-03-12 10:41:26] [INFO ] Found NUPN structural information;
[2023-03-12 10:41:26] [INFO ] Parsed PT model containing 4014 places and 4932 transitions and 14960 arcs in 355 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 12 resets, run finished after 519 ms. (steps per millisecond=19 ) properties (out of 16) seen :1
FORMULA ASLink-PT-09b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 89395 steps, run timeout after 3002 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89395 steps, saw 22465 distinct states, run finished after 3006 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 4932 rows 4014 cols
[2023-03-12 10:41:30] [INFO ] Computed 394 place invariants in 314 ms
[2023-03-12 10:41:34] [INFO ] After 2941ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-12 10:41:36] [INFO ] [Nat]Absence check using 93 positive place invariants in 99 ms returned sat
[2023-03-12 10:41:37] [INFO ] [Nat]Absence check using 93 positive and 301 generalized place invariants in 357 ms returned sat
[2023-03-12 10:41:59] [INFO ] After 20814ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :12
[2023-03-12 10:41:59] [INFO ] After 20822ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :12
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-12 10:41:59] [INFO ] After 25059ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :12
FORMULA ASLink-PT-09b-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 274 out of 4014 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4014/4014 places, 4932/4932 transitions.
Drop transitions removed 763 transitions
Trivial Post-agglo rules discarded 763 transitions
Performed 763 trivial Post agglomeration. Transition count delta: 763
Iterating post reduction 0 with 763 rules applied. Total rules applied 763 place count 4014 transition count 4169
Reduce places removed 763 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 789 rules applied. Total rules applied 1552 place count 3251 transition count 4143
Reduce places removed 6 places and 0 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Iterating post reduction 2 with 66 rules applied. Total rules applied 1618 place count 3245 transition count 4083
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 70 rules applied. Total rules applied 1688 place count 3185 transition count 4073
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1690 place count 3183 transition count 4073
Performed 865 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 865 Pre rules applied. Total rules applied 1690 place count 3183 transition count 3208
Deduced a syphon composed of 865 places in 9 ms
Ensure Unique test removed 80 places
Reduce places removed 945 places and 0 transitions.
Iterating global reduction 5 with 1810 rules applied. Total rules applied 3500 place count 2238 transition count 3208
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 5 with 57 rules applied. Total rules applied 3557 place count 2226 transition count 3163
Reduce places removed 45 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 6 with 50 rules applied. Total rules applied 3607 place count 2181 transition count 3158
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 3612 place count 2176 transition count 3158
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 31 Pre rules applied. Total rules applied 3612 place count 2176 transition count 3127
Deduced a syphon composed of 31 places in 9 ms
Ensure Unique test removed 24 places
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 8 with 86 rules applied. Total rules applied 3698 place count 2121 transition count 3127
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 8 with 1 rules applied. Total rules applied 3699 place count 2120 transition count 3127
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 23 Pre rules applied. Total rules applied 3699 place count 2120 transition count 3104
Deduced a syphon composed of 23 places in 28 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 9 with 46 rules applied. Total rules applied 3745 place count 2097 transition count 3104
Discarding 124 places :
Symmetric choice reduction at 9 with 124 rule applications. Total rules 3869 place count 1973 transition count 2980
Iterating global reduction 9 with 124 rules applied. Total rules applied 3993 place count 1973 transition count 2980
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3994 place count 1973 transition count 2979
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 30 Pre rules applied. Total rules applied 3994 place count 1973 transition count 2949
Deduced a syphon composed of 30 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 10 with 61 rules applied. Total rules applied 4055 place count 1942 transition count 2949
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 4055 place count 1942 transition count 2948
Deduced a syphon composed of 1 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 4058 place count 1940 transition count 2948
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 4064 place count 1934 transition count 2912
Iterating global reduction 10 with 6 rules applied. Total rules applied 4070 place count 1934 transition count 2912
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 4 Pre rules applied. Total rules applied 4070 place count 1934 transition count 2908
Deduced a syphon composed of 4 places in 25 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 4078 place count 1930 transition count 2908
Performed 220 Post agglomeration using F-continuation condition.Transition count delta: 220
Deduced a syphon composed of 220 places in 9 ms
Ensure Unique test removed 4 places
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 10 with 444 rules applied. Total rules applied 4522 place count 1706 transition count 2688
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 4523 place count 1705 transition count 2687
Ensure Unique test removed 1 places
Iterating global reduction 10 with 2 rules applied. Total rules applied 4525 place count 1704 transition count 2687
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 4526 place count 1703 transition count 2686
Iterating global reduction 10 with 1 rules applied. Total rules applied 4527 place count 1703 transition count 2686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 2 rules applied. Total rules applied 4529 place count 1703 transition count 2684
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 4530 place count 1702 transition count 2684
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 4532 place count 1701 transition count 2693
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 4534 place count 1701 transition count 2691
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 12 with 4 rules applied. Total rules applied 4538 place count 1699 transition count 2689
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 4540 place count 1697 transition count 2689
Free-agglomeration rule applied 14 times.
Iterating global reduction 14 with 14 rules applied. Total rules applied 4554 place count 1697 transition count 2675
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 14 with 14 rules applied. Total rules applied 4568 place count 1683 transition count 2675
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 15 with 10 rules applied. Total rules applied 4578 place count 1683 transition count 2665
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 15 with 10 rules applied. Total rules applied 4588 place count 1673 transition count 2665
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 4589 place count 1673 transition count 2665
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 4590 place count 1672 transition count 2664
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 16 with 11 rules applied. Total rules applied 4601 place count 1663 transition count 2662
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 4603 place count 1661 transition count 2662
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 18 with 13 Pre rules applied. Total rules applied 4603 place count 1661 transition count 2649
Deduced a syphon composed of 13 places in 6 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 18 with 26 rules applied. Total rules applied 4629 place count 1648 transition count 2649
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 18 with 3 rules applied. Total rules applied 4632 place count 1645 transition count 2649
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 19 with 20 rules applied. Total rules applied 4652 place count 1635 transition count 2639
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 4654 place count 1633 transition count 2637
Iterating global reduction 19 with 2 rules applied. Total rules applied 4656 place count 1633 transition count 2637
Free-agglomeration rule applied 2 times.
Iterating global reduction 19 with 2 rules applied. Total rules applied 4658 place count 1633 transition count 2635
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 4660 place count 1631 transition count 2635
Applied a total of 4660 rules in 2145 ms. Remains 1631 /4014 variables (removed 2383) and now considering 2635/4932 (removed 2297) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2146 ms. Remains : 1631/4014 places, 2635/4932 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 14) seen :3
FORMULA ASLink-PT-09b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 11) seen :1
FORMULA ASLink-PT-09b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2635 rows 1631 cols
[2023-03-12 10:42:02] [INFO ] Computed 256 place invariants in 58 ms
[2023-03-12 10:42:03] [INFO ] After 455ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 10:42:03] [INFO ] [Nat]Absence check using 62 positive place invariants in 78 ms returned sat
[2023-03-12 10:42:03] [INFO ] [Nat]Absence check using 62 positive and 194 generalized place invariants in 194 ms returned sat
[2023-03-12 10:42:28] [INFO ] After 23641ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 10:42:28] [INFO ] State equation strengthened by 8 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 10:42:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 10:42:28] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 164 ms.
Support contains 267 out of 1631 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1631/1631 places, 2635/2635 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1631 transition count 2634
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1630 transition count 2634
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 1630 transition count 2632
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 1628 transition count 2632
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 1628 transition count 2632
Applied a total of 7 rules in 169 ms. Remains 1628 /1631 variables (removed 3) and now considering 2632/2635 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 1628/1631 places, 2632/2635 transitions.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 128838 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 128838 steps, saw 31152 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2632 rows 1628 cols
[2023-03-12 10:42:32] [INFO ] Computed 256 place invariants in 37 ms
[2023-03-12 10:42:32] [INFO ] After 468ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 10:42:33] [INFO ] [Nat]Absence check using 63 positive place invariants in 18 ms returned sat
[2023-03-12 10:42:33] [INFO ] [Nat]Absence check using 63 positive and 193 generalized place invariants in 66 ms returned sat
[2023-03-12 10:42:57] [INFO ] After 24082ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 10:42:57] [INFO ] State equation strengthened by 8 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 10:42:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 10:42:57] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 101 ms.
Support contains 267 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 2632/2632 transitions.
Applied a total of 0 rules in 66 ms. Remains 1628 /1628 variables (removed 0) and now considering 2632/2632 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 1628/1628 places, 2632/2632 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 2632/2632 transitions.
Applied a total of 0 rules in 57 ms. Remains 1628 /1628 variables (removed 0) and now considering 2632/2632 (removed 0) transitions.
[2023-03-12 10:42:58] [INFO ] Invariant cache hit.
[2023-03-12 10:42:59] [INFO ] Implicit Places using invariants in 1134 ms returned [1, 24, 25, 29, 42, 82, 172, 178, 192, 193, 242, 320, 328, 329, 341, 345, 366, 384, 465, 492, 493, 495, 498, 515, 533, 607, 623, 627, 628, 641, 642, 643, 693, 753, 809, 813, 814, 818, 856, 935, 950, 951, 998, 1039, 1070, 1073, 1085, 1097, 1113, 1114, 1117, 1141, 1159, 1219, 1230, 1242, 1248, 1261, 1262, 1264, 1286, 1305, 1371, 1384, 1410, 1411, 1428, 1429, 1479, 1484, 1505, 1506, 1508, 1529, 1535, 1543, 1549, 1555, 1561, 1567, 1579, 1585, 1591]
Discarding 83 places :
Implicit Place search using SMT only with invariants took 1153 ms to find 83 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1545/1628 places, 2632/2632 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 1545 transition count 2554
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 101 rules applied. Total rules applied 179 place count 1467 transition count 2531
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 201 place count 1445 transition count 2531
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 201 place count 1445 transition count 2501
Deduced a syphon composed of 30 places in 5 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 261 place count 1415 transition count 2501
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 262 place count 1414 transition count 2501
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 272 place count 1404 transition count 2491
Iterating global reduction 4 with 10 rules applied. Total rules applied 282 place count 1404 transition count 2491
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 282 place count 1404 transition count 2490
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 284 place count 1403 transition count 2490
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 287 place count 1400 transition count 2487
Iterating global reduction 4 with 3 rules applied. Total rules applied 290 place count 1400 transition count 2487
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 293 place count 1397 transition count 2482
Iterating global reduction 4 with 3 rules applied. Total rules applied 296 place count 1397 transition count 2482
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 297 place count 1397 transition count 2481
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 5 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 5 with 104 rules applied. Total rules applied 401 place count 1345 transition count 2429
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 406 place count 1340 transition count 2422
Iterating global reduction 5 with 5 rules applied. Total rules applied 411 place count 1340 transition count 2422
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 414 place count 1337 transition count 2419
Iterating global reduction 5 with 3 rules applied. Total rules applied 417 place count 1337 transition count 2419
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 418 place count 1337 transition count 2418
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 420 place count 1337 transition count 2416
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 422 place count 1335 transition count 2416
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 7 with 28 rules applied. Total rules applied 450 place count 1335 transition count 2388
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 7 with 28 rules applied. Total rules applied 478 place count 1307 transition count 2388
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 480 place count 1307 transition count 2386
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 489 place count 1307 transition count 2386
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 490 place count 1307 transition count 2386
Applied a total of 490 rules in 750 ms. Remains 1307 /1545 variables (removed 238) and now considering 2386/2632 (removed 246) transitions.
// Phase 1: matrix 2386 rows 1307 cols
[2023-03-12 10:43:00] [INFO ] Computed 172 place invariants in 19 ms
[2023-03-12 10:43:00] [INFO ] Implicit Places using invariants in 627 ms returned [93, 152, 354, 384, 397, 402, 403, 458, 483, 495, 497, 640, 649, 658, 749, 757, 763, 766, 773, 774, 876, 897, 902, 982, 1015, 1017, 1025, 1026, 1286, 1290, 1299, 1303]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 631 ms to find 32 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1275/1628 places, 2386/2632 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1275 transition count 2385
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1274 transition count 2385
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 8 place count 1268 transition count 2379
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 1268 transition count 2379
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 1267 transition count 2378
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 1267 transition count 2378
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 1266 transition count 2377
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 1266 transition count 2377
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 1258 transition count 2369
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 1258 transition count 2368
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 44 place count 1258 transition count 2359
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 53 place count 1249 transition count 2359
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 1249 transition count 2359
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 1249 transition count 2359
Applied a total of 56 rules in 293 ms. Remains 1249 /1275 variables (removed 26) and now considering 2359/2386 (removed 27) transitions.
// Phase 1: matrix 2359 rows 1249 cols
[2023-03-12 10:43:01] [INFO ] Computed 140 place invariants in 18 ms
[2023-03-12 10:43:01] [INFO ] Implicit Places using invariants in 652 ms returned []
[2023-03-12 10:43:01] [INFO ] Invariant cache hit.
[2023-03-12 10:43:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 10:43:03] [INFO ] Implicit Places using invariants and state equation in 2260 ms returned []
Implicit Place search using SMT with State Equation took 2937 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1249/1628 places, 2359/2632 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5821 ms. Remains : 1249/1628 places, 2359/2632 transitions.
Incomplete random walk after 10000 steps, including 63 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 99495 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99495 steps, saw 66229 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-12 10:43:07] [INFO ] Invariant cache hit.
[2023-03-12 10:43:08] [INFO ] After 423ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 10:43:08] [INFO ] [Nat]Absence check using 42 positive place invariants in 25 ms returned sat
[2023-03-12 10:43:08] [INFO ] [Nat]Absence check using 42 positive and 98 generalized place invariants in 111 ms returned sat
[2023-03-12 10:43:33] [INFO ] After 24227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 10:43:33] [INFO ] State equation strengthened by 6 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 10:43:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 10:43:33] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 267 out of 1249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1249/1249 places, 2359/2359 transitions.
Applied a total of 0 rules in 35 ms. Remains 1249 /1249 variables (removed 0) and now considering 2359/2359 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 1249/1249 places, 2359/2359 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1249/1249 places, 2359/2359 transitions.
Applied a total of 0 rules in 33 ms. Remains 1249 /1249 variables (removed 0) and now considering 2359/2359 (removed 0) transitions.
[2023-03-12 10:43:33] [INFO ] Invariant cache hit.
[2023-03-12 10:43:33] [INFO ] Implicit Places using invariants in 600 ms returned []
[2023-03-12 10:43:33] [INFO ] Invariant cache hit.
[2023-03-12 10:43:34] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 10:43:36] [INFO ] Implicit Places using invariants and state equation in 2741 ms returned []
Implicit Place search using SMT with State Equation took 3370 ms to find 0 implicit places.
[2023-03-12 10:43:36] [INFO ] Redundant transitions in 125 ms returned []
[2023-03-12 10:43:36] [INFO ] Invariant cache hit.
[2023-03-12 10:43:37] [INFO ] Dead Transitions using invariants and state equation in 1142 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4712 ms. Remains : 1249/1249 places, 2359/2359 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 1249 transition count 2348
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 1238 transition count 2348
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 1237 transition count 2347
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 1237 transition count 2347
Applied a total of 25 rules in 97 ms. Remains 1237 /1249 variables (removed 12) and now considering 2347/2359 (removed 12) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 2347 rows 1237 cols
[2023-03-12 10:43:38] [INFO ] Computed 140 place invariants in 46 ms
[2023-03-12 10:43:38] [INFO ] After 398ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 10:43:39] [INFO ] [Nat]Absence check using 37 positive place invariants in 37 ms returned sat
[2023-03-12 10:43:39] [INFO ] [Nat]Absence check using 37 positive and 103 generalized place invariants in 69 ms returned sat
[2023-03-12 10:44:36] [INFO ] After 57278ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-12 10:44:37] [INFO ] Deduced a trap composed of 63 places in 262 ms of which 17 ms to minimize.
[2023-03-12 10:44:37] [INFO ] Deduced a trap composed of 64 places in 189 ms of which 2 ms to minimize.
[2023-03-12 10:44:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 678 ms
[2023-03-12 10:44:37] [INFO ] After 58289ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 140 ms.
[2023-03-12 10:44:37] [INFO ] After 59198ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
FORMULA ASLink-PT-09b-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
FORMULA ASLink-PT-09b-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
FORMULA ASLink-PT-09b-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
[2023-03-12 10:44:37] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-12 10:44:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1249 places, 2359 transitions and 8990 arcs took 9 ms.
[2023-03-12 10:44:38] [INFO ] Flatten gal took : 244 ms
Total runtime 191895 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/536/inv_0_ --invariant=/tmp/536/inv_1_ --invariant=/tmp/536/inv_2_ --invariant=/tmp/536/inv_3_ --invariant=/tmp/536/inv_4_ --invariant=/tmp/536/inv_5_ --invariant=/tmp/536/inv_6_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 12696332 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16095928 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-09b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ASLink-PT-09b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r009-oct2-167813597500151"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-09b.tgz
mv ASLink-PT-09b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;