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.r151-smll-167819438100302.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 DoubleExponent-PT-020, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-smll-167819438100302
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 7.9K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 13:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 13:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 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 340K 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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1678393374885

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=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-020
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-09 20:22:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-09 20:22:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 20:22:59] [INFO ] Load time of PNML (sax parser for PT used): 229 ms
[2023-03-09 20:22:59] [INFO ] Transformed 1064 places.
[2023-03-09 20:22:59] [INFO ] Transformed 998 transitions.
[2023-03-09 20:22:59] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 394 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 244 rules applied. Total rules applied 244 place count 1060 transition count 758
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 484 place count 820 transition count 758
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 484 place count 820 transition count 718
Deduced a syphon composed of 40 places in 71 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 564 place count 780 transition count 718
Performed 184 Post agglomeration using F-continuation condition.Transition count delta: 184
Deduced a syphon composed of 184 places in 18 ms
Reduce places removed 184 places and 0 transitions.
Iterating global reduction 2 with 368 rules applied. Total rules applied 932 place count 596 transition count 534
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 14 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 1008 place count 558 transition count 534
Applied a total of 1008 rules in 314 ms. Remains 558 /1064 variables (removed 506) and now considering 534/998 (removed 464) transitions.
// Phase 1: matrix 534 rows 558 cols
[2023-03-09 20:22:59] [INFO ] Invariants computation overflowed in 83 ms
[2023-03-09 20:23:00] [INFO ] Implicit Places using invariants in 610 ms returned []
// Phase 1: matrix 534 rows 558 cols
[2023-03-09 20:23:00] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-09 20:23:00] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-09 20:23:30] [INFO ] Performed 299/558 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 20:23:57] [INFO ] Implicit Places using invariants and state equation in 57255 ms returned []
Implicit Place search using SMT with State Equation took 57943 ms to find 0 implicit places.
// Phase 1: matrix 534 rows 558 cols
[2023-03-09 20:23:57] [INFO ] Invariants computation overflowed in 38 ms
[2023-03-09 20:23:58] [INFO ] Dead Transitions using invariants and state equation in 721 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 558/1064 places, 534/998 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 58984 ms. Remains : 558/1064 places, 534/998 transitions.
Discarding 118 transitions out of 534. Remains 416
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 1236 resets, run finished after 1325 ms. (steps per millisecond=7 ) properties (out of 415) seen :14
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=9 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=9 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 12 ms. (steps per millisecond=8 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=9 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=10 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 401) seen :0
Interrupted probabilistic random walk after 56192 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{0=1, 1=1, 4=1, 8=1, 9=1, 10=1, 11=1, 26=1, 89=1, 106=1, 127=1, 136=1, 140=1, 149=1, 173=1, 182=1, 206=1, 210=1, 216=1, 230=1, 239=1, 242=1, 255=1, 256=1, 307=1, 308=1, 317=1, 320=1, 327=1, 339=1, 348=1, 377=1, 378=1, 387=1, 388=1}
Probabilistic random walk after 56192 steps, saw 28106 distinct states, run finished after 3003 ms. (steps per millisecond=18 ) properties seen :35
Running SMT prover for 366 properties.
// Phase 1: matrix 534 rows 558 cols
[2023-03-09 20:24:02] [INFO ] Invariants computation overflowed in 17 ms
[2023-03-09 20:24:28] [INFO ] After 12194ms SMT Verify possible using state equation in real domain returned unsat :0 sat :230 real:135
[2023-03-09 20:24:28] [INFO ] State equation strengthened by 40 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:339)
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.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-09 20:24:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 20:24:28] [INFO ] After 25045ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 366 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 2029 ms.
Support contains 494 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 534/534 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 558 transition count 529
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 553 transition count 529
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 553 transition count 529
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 552 transition count 528
Applied a total of 19 rules in 142 ms. Remains 552 /558 variables (removed 6) and now considering 528/534 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 552/558 places, 528/534 transitions.
Interrupted random walk after 474677 steps, including 60967 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 859 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 881 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 874 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 844 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 879 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 818 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 811 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 869 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 821 resets, run finished after 642 ms. (steps per millisecond=15 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 620 ms. (steps per millisecond=16 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 890 resets, run finished after 641 ms. (steps per millisecond=15 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 857 resets, run finished after 522 ms. (steps per millisecond=19 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 851 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 832 resets, run finished after 484 ms. (steps per millisecond=20 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 858 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 838 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 830 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 849 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 859 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 848 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 818 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 851 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 855 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 831 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 865 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 864 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 835 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 872 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 862 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 839 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 832 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 352 ms. (steps per millisecond=28 ) properties (out of 366) seen :0
Probably explored full state space saw : 657971 states, properties seen :7
Probabilistic random walk after 1315987 steps, saw 657971 distinct states, run finished after 48627 ms. (steps per millisecond=27 ) properties seen :7
Interrupted probabilistic random walk after 3742738 steps, run timeout after 147001 ms. (steps per millisecond=25 ) properties seen :{0=1, 1=1, 2=1, 3=1, 6=1, 10=1, 11=1, 12=1, 13=1, 229=1, 230=1, 293=1, 294=1, 295=1}
Exhaustive walk after 3742738 steps, saw 1871564 distinct states, run finished after 147002 ms. (steps per millisecond=25 ) properties seen :14
Running SMT prover for 345 properties.
// Phase 1: matrix 528 rows 552 cols
[2023-03-09 20:28:35] [INFO ] Computed 101 place invariants in 85 ms
[2023-03-09 20:28:41] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:41] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 81 ms returned sat
[2023-03-09 20:29:12] [INFO ] After 24335ms SMT Verify possible using state equation in real domain returned unsat :0 sat :34 real:311
[2023-03-09 20:29:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 20:29:14] [INFO ] After 1905ms SMT Verify possible using 42 Read/Feed constraints in real domain returned unsat :0 sat :31 real:314
[2023-03-09 20:29:15] [INFO ] Deduced a trap composed of 17 places in 309 ms of which 4 ms to minimize.
[2023-03-09 20:29:15] [INFO ] Deduced a trap composed of 41 places in 257 ms of which 2 ms to minimize.
[2023-03-09 20:29:15] [INFO ] Deduced a trap composed of 45 places in 243 ms of which 2 ms to minimize.
[2023-03-09 20:29:15] [INFO ] Deduced a trap composed of 62 places in 179 ms of which 1 ms to minimize.
[2023-03-09 20:29:16] [INFO ] Deduced a trap composed of 53 places in 159 ms of which 7 ms to minimize.
[2023-03-09 20:29:16] [INFO ] Deduced a trap composed of 65 places in 154 ms of which 1 ms to minimize.
[2023-03-09 20:29:16] [INFO ] Deduced a trap composed of 77 places in 143 ms of which 1 ms to minimize.
[2023-03-09 20:29:16] [INFO ] Deduced a trap composed of 61 places in 140 ms of which 1 ms to minimize.
[2023-03-09 20:29:16] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2046 ms
[2023-03-09 20:29:17] [INFO ] Deduced a trap composed of 53 places in 165 ms of which 1 ms to minimize.
[2023-03-09 20:29:17] [INFO ] Deduced a trap composed of 57 places in 163 ms of which 1 ms to minimize.
[2023-03-09 20:29:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 480 ms
[2023-03-09 20:29:17] [INFO ] Deduced a trap composed of 49 places in 184 ms of which 2 ms to minimize.
[2023-03-09 20:29:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 295 ms
[2023-03-09 20:29:18] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 1 ms to minimize.
[2023-03-09 20:29:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2023-03-09 20:29:20] [INFO ] After 7850ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:345
[2023-03-09 20:29:20] [INFO ] After 44934ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:345
[2023-03-09 20:29:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-09 20:29:26] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 89 ms returned sat
[2023-03-09 20:29:52] [INFO ] After 19760ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :345
[2023-03-09 20:30:48] [INFO ] After 55570ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :345
[2023-03-09 20:30:48] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 1 ms to minimize.
[2023-03-09 20:30:49] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 2 ms to minimize.
[2023-03-09 20:30:49] [INFO ] Deduced a trap composed of 21 places in 306 ms of which 2 ms to minimize.
[2023-03-09 20:30:49] [INFO ] Deduced a trap composed of 13 places in 377 ms of which 1 ms to minimize.
[2023-03-09 20:30:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1405 ms
[2023-03-09 20:30:52] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 1 ms to minimize.
[2023-03-09 20:30:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2719 ms
[2023-03-09 20:30:57] [INFO ] Deduced a trap composed of 9 places in 243 ms of which 1 ms to minimize.
[2023-03-09 20:30:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
[2023-03-09 20:30:59] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 0 ms to minimize.
[2023-03-09 20:30:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2023-03-09 20:31:00] [INFO ] Deduced a trap composed of 27 places in 218 ms of which 0 ms to minimize.
[2023-03-09 20:31:00] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 0 ms to minimize.
[2023-03-09 20:31:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 555 ms
[2023-03-09 20:31:03] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 1 ms to minimize.
[2023-03-09 20:31:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2023-03-09 20:31:06] [INFO ] Deduced a trap composed of 29 places in 204 ms of which 1 ms to minimize.
[2023-03-09 20:31:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
[2023-03-09 20:31:06] [INFO ] Deduced a trap composed of 17 places in 220 ms of which 1 ms to minimize.
[2023-03-09 20:31:07] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 1 ms to minimize.
[2023-03-09 20:31:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 515 ms
[2023-03-09 20:31:08] [INFO ] Deduced a trap composed of 25 places in 217 ms of which 1 ms to minimize.
[2023-03-09 20:31:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 303 ms
[2023-03-09 20:31:09] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 0 ms to minimize.
[2023-03-09 20:31:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2023-03-09 20:31:10] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 1 ms to minimize.
[2023-03-09 20:31:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-03-09 20:31:10] [INFO ] Deduced a trap composed of 33 places in 192 ms of which 1 ms to minimize.
[2023-03-09 20:31:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2023-03-09 20:31:11] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 1 ms to minimize.
[2023-03-09 20:31:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2023-03-09 20:31:12] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 1 ms to minimize.
[2023-03-09 20:31:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2023-03-09 20:31:13] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 1 ms to minimize.
[2023-03-09 20:31:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2023-03-09 20:31:15] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 0 ms to minimize.
[2023-03-09 20:31:15] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 7 ms to minimize.
[2023-03-09 20:31:15] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 2 ms to minimize.
[2023-03-09 20:31:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 657 ms
[2023-03-09 20:31:17] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 1 ms to minimize.
[2023-03-09 20:31:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2023-03-09 20:31:18] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 4 ms to minimize.
[2023-03-09 20:31:18] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 0 ms to minimize.
[2023-03-09 20:31:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 438 ms
[2023-03-09 20:31:20] [INFO ] Deduced a trap composed of 45 places in 226 ms of which 1 ms to minimize.
[2023-03-09 20:31:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 357 ms
[2023-03-09 20:31:20] [INFO ] Deduced a trap composed of 41 places in 223 ms of which 1 ms to minimize.
[2023-03-09 20:31:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 312 ms
[2023-03-09 20:31:21] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 1 ms to minimize.
[2023-03-09 20:31:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2023-03-09 20:31:21] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 1 ms to minimize.
[2023-03-09 20:31:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2023-03-09 20:31:22] [INFO ] Deduced a trap composed of 6 places in 367 ms of which 1 ms to minimize.
[2023-03-09 20:31:22] [INFO ] Deduced a trap composed of 10 places in 246 ms of which 0 ms to minimize.
[2023-03-09 20:31:22] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 1 ms to minimize.
[2023-03-09 20:31:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 919 ms
[2023-03-09 20:31:24] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 0 ms to minimize.
[2023-03-09 20:31:24] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 0 ms to minimize.
[2023-03-09 20:31:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 463 ms
[2023-03-09 20:31:26] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 0 ms to minimize.
[2023-03-09 20:31:26] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 1 ms to minimize.
[2023-03-09 20:31:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 365 ms
[2023-03-09 20:31:26] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 1 ms to minimize.
[2023-03-09 20:31:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-03-09 20:31:27] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 0 ms to minimize.
[2023-03-09 20:31:27] [INFO ] Deduced a trap composed of 53 places in 131 ms of which 0 ms to minimize.
[2023-03-09 20:31:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 368 ms
[2023-03-09 20:31:29] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 1 ms to minimize.
[2023-03-09 20:31:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2023-03-09 20:31:38] [INFO ] Deduced a trap composed of 62 places in 135 ms of which 1 ms to minimize.
[2023-03-09 20:31:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-03-09 20:31:38] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 0 ms to minimize.
[2023-03-09 20:31:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2023-03-09 20:31:39] [INFO ] Deduced a trap composed of 57 places in 117 ms of which 14 ms to minimize.
[2023-03-09 20:31:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2023-03-09 20:31:39] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 1 ms to minimize.
[2023-03-09 20:31:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2023-03-09 20:31:40] [INFO ] Deduced a trap composed of 60 places in 115 ms of which 1 ms to minimize.
[2023-03-09 20:31:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2023-03-09 20:31:40] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 0 ms to minimize.
[2023-03-09 20:31:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-03-09 20:31:41] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 0 ms to minimize.
[2023-03-09 20:31:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2023-03-09 20:31:41] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 1 ms to minimize.
[2023-03-09 20:31:41] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 0 ms to minimize.
[2023-03-09 20:31:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 319 ms
[2023-03-09 20:31:43] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 2 ms to minimize.
[2023-03-09 20:31:43] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 0 ms to minimize.
[2023-03-09 20:31:43] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 0 ms to minimize.
[2023-03-09 20:31:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 410 ms
[2023-03-09 20:31:43] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 2 ms to minimize.
[2023-03-09 20:31:44] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 2 ms to minimize.
[2023-03-09 20:31:44] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 3 ms to minimize.
[2023-03-09 20:31:44] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 2 ms to minimize.
[2023-03-09 20:31:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 631 ms
[2023-03-09 20:31:45] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 0 ms to minimize.
[2023-03-09 20:31:45] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 1 ms to minimize.
[2023-03-09 20:31:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 269 ms
[2023-03-09 20:31:45] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 0 ms to minimize.
[2023-03-09 20:31:45] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 1 ms to minimize.
[2023-03-09 20:31:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 283 ms
[2023-03-09 20:31:46] [INFO ] Deduced a trap composed of 77 places in 80 ms of which 1 ms to minimize.
[2023-03-09 20:31:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-03-09 20:31:46] [INFO ] Deduced a trap composed of 71 places in 83 ms of which 1 ms to minimize.
[2023-03-09 20:31:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-03-09 20:31:47] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 1 ms to minimize.
[2023-03-09 20:31:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2023-03-09 20:31:47] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 1 ms to minimize.
[2023-03-09 20:31:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2023-03-09 20:31:48] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 0 ms to minimize.
[2023-03-09 20:31:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2023-03-09 20:31:48] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 0 ms to minimize.
[2023-03-09 20:31:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-03-09 20:31:48] [INFO ] Deduced a trap composed of 76 places in 71 ms of which 1 ms to minimize.
[2023-03-09 20:31:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2023-03-09 20:32:39] [INFO ] After 167118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :345
Attempting to minimize the solution found.
Minimization took 25680 ms.
[2023-03-09 20:33:05] [INFO ] After 225013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :344
Parikh walk visited 0 properties in 30567 ms.
Support contains 466 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 528/528 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 552 transition count 524
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 548 transition count 524
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 548 transition count 524
Applied a total of 12 rules in 61 ms. Remains 548 /552 variables (removed 4) and now considering 524/528 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 548/552 places, 524/528 transitions.
Interrupted random walk after 594179 steps, including 76033 resets, run timeout after 30001 ms. (steps per millisecond=19 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 817 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 835 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 847 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 867 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 870 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 828 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 848 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 862 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 834 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 845 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 840 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 816 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 838 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 863 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 850 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 863 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 835 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 841 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 882 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 837 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 878 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 863 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 854 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 862 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 872 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 866 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 877 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 889 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 892 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 848 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 868 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 856 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 865 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 837 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Probably explored full state space saw : 590436 states, properties seen :0
Probabilistic random walk after 1180919 steps, saw 590436 distinct states, run finished after 39704 ms. (steps per millisecond=29 ) properties seen :0
Interrupted probabilistic random walk after 3741485 steps, run timeout after 138001 ms. (steps per millisecond=27 ) properties seen :{}
Exhaustive walk after 3741485 steps, saw 1870922 distinct states, run finished after 138004 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 345 properties.
// Phase 1: matrix 524 rows 548 cols
[2023-03-09 20:37:20] [INFO ] Computed 101 place invariants in 136 ms
[2023-03-09 20:37:24] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:37:24] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 60 ms returned sat
[2023-03-09 20:37:49] [INFO ] After 20298ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:343
[2023-03-09 20:37:49] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-09 20:37:50] [INFO ] After 761ms SMT Verify possible using 44 Read/Feed constraints in real domain returned unsat :0 sat :0 real:345
[2023-03-09 20:37:50] [INFO ] After 29400ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:345
[2023-03-09 20:37:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 20:37:54] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 89 ms returned sat
[2023-03-09 20:38:19] [INFO ] After 18696ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :345
[2023-03-09 20:39:19] [INFO ] After 59669ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :345
[2023-03-09 20:39:19] [INFO ] Deduced a trap composed of 24 places in 304 ms of which 2 ms to minimize.
[2023-03-09 20:39:20] [INFO ] Deduced a trap composed of 20 places in 364 ms of which 2 ms to minimize.
[2023-03-09 20:39:20] [INFO ] Deduced a trap composed of 9 places in 368 ms of which 1 ms to minimize.
[2023-03-09 20:39:21] [INFO ] Deduced a trap composed of 16 places in 380 ms of which 1 ms to minimize.
[2023-03-09 20:39:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1671 ms
[2023-03-09 20:39:24] [INFO ] Deduced a trap composed of 22 places in 296 ms of which 0 ms to minimize.
[2023-03-09 20:39:25] [INFO ] Deduced a trap composed of 16 places in 327 ms of which 1 ms to minimize.
[2023-03-09 20:39:25] [INFO ] Deduced a trap composed of 24 places in 336 ms of which 1 ms to minimize.
[2023-03-09 20:39:25] [INFO ] Deduced a trap composed of 24 places in 330 ms of which 1 ms to minimize.
[2023-03-09 20:39:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1558 ms
[2023-03-09 20:39:27] [INFO ] Deduced a trap composed of 22 places in 352 ms of which 1 ms to minimize.
[2023-03-09 20:39:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 499 ms
[2023-03-09 20:39:27] [INFO ] Deduced a trap composed of 16 places in 354 ms of which 1 ms to minimize.
[2023-03-09 20:39:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 461 ms
[2023-03-09 20:39:30] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 1 ms to minimize.
[2023-03-09 20:39:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
[2023-03-09 20:39:32] [INFO ] Deduced a trap composed of 28 places in 332 ms of which 1 ms to minimize.
[2023-03-09 20:39:32] [INFO ] Deduced a trap composed of 28 places in 313 ms of which 1 ms to minimize.
[2023-03-09 20:39:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 813 ms
[2023-03-09 20:39:33] [INFO ] Deduced a trap composed of 20 places in 195 ms of which 1 ms to minimize.
[2023-03-09 20:39:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2023-03-09 20:39:36] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 1 ms to minimize.
[2023-03-09 20:39:36] [INFO ] Deduced a trap composed of 32 places in 182 ms of which 1 ms to minimize.
[2023-03-09 20:39:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 481 ms
[2023-03-09 20:39:37] [INFO ] Deduced a trap composed of 30 places in 300 ms of which 1 ms to minimize.
[2023-03-09 20:39:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 371 ms
[2023-03-09 20:39:38] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 0 ms to minimize.
[2023-03-09 20:39:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2023-03-09 20:39:39] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 0 ms to minimize.
[2023-03-09 20:39:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2023-03-09 20:39:40] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 1 ms to minimize.
[2023-03-09 20:39:40] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 0 ms to minimize.
[2023-03-09 20:39:40] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 1 ms to minimize.
[2023-03-09 20:39:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 640 ms
[2023-03-09 20:39:42] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 1 ms to minimize.
[2023-03-09 20:39:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-03-09 20:39:48] [INFO ] Deduced a trap composed of 11 places in 218 ms of which 1 ms to minimize.
[2023-03-09 20:39:49] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 0 ms to minimize.
[2023-03-09 20:39:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2106 ms
[2023-03-09 20:39:51] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 0 ms to minimize.
[2023-03-09 20:39:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2023-03-09 20:39:53] [INFO ] Deduced a trap composed of 40 places in 243 ms of which 1 ms to minimize.
[2023-03-09 20:39:53] [INFO ] Deduced a trap composed of 36 places in 231 ms of which 1 ms to minimize.
[2023-03-09 20:39:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 568 ms
[2023-03-09 20:39:55] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 0 ms to minimize.
[2023-03-09 20:39:55] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 1 ms to minimize.
[2023-03-09 20:39:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 388 ms
[2023-03-09 20:39:56] [INFO ] Deduced a trap composed of 44 places in 188 ms of which 0 ms to minimize.
[2023-03-09 20:39:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2023-03-09 20:39:57] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 1 ms to minimize.
[2023-03-09 20:39:57] [INFO ] Deduced a trap composed of 48 places in 156 ms of which 1 ms to minimize.
[2023-03-09 20:39:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 436 ms
[2023-03-09 20:39:58] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 0 ms to minimize.
[2023-03-09 20:39:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2023-03-09 20:39:58] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 1 ms to minimize.
[2023-03-09 20:39:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-09 20:39:59] [INFO ] Deduced a trap composed of 52 places in 136 ms of which 0 ms to minimize.
[2023-03-09 20:39:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2023-03-09 20:40:00] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 1 ms to minimize.
[2023-03-09 20:40:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2023-03-09 20:40:01] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 0 ms to minimize.
[2023-03-09 20:40:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2023-03-09 20:40:02] [INFO ] Deduced a trap composed of 52 places in 146 ms of which 0 ms to minimize.
[2023-03-09 20:40:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2023-03-09 20:40:02] [INFO ] Deduced a trap composed of 56 places in 127 ms of which 1 ms to minimize.
[2023-03-09 20:40:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2023-03-09 20:40:02] [INFO ] Deduced a trap composed of 52 places in 166 ms of which 1 ms to minimize.
[2023-03-09 20:40:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2023-03-09 20:40:04] [INFO ] Deduced a trap composed of 56 places in 108 ms of which 0 ms to minimize.
[2023-03-09 20:40:04] [INFO ] Deduced a trap composed of 60 places in 133 ms of which 0 ms to minimize.
[2023-03-09 20:40:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 368 ms
[2023-03-09 20:40:05] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 1 ms to minimize.
[2023-03-09 20:40:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-03-09 20:40:06] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 0 ms to minimize.
[2023-03-09 20:40:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2023-03-09 20:40:06] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 0 ms to minimize.
[2023-03-09 20:40:06] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 1 ms to minimize.
[2023-03-09 20:40:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 361 ms
[2023-03-09 20:40:07] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 0 ms to minimize.
[2023-03-09 20:40:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2023-03-09 20:40:08] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 1 ms to minimize.
[2023-03-09 20:40:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2023-03-09 20:40:08] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 0 ms to minimize.
[2023-03-09 20:40:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-03-09 20:40:08] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 0 ms to minimize.
[2023-03-09 20:40:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2023-03-09 20:40:09] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 1 ms to minimize.
[2023-03-09 20:40:09] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 1 ms to minimize.
[2023-03-09 20:40:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 265 ms
[2023-03-09 20:40:09] [INFO ] Deduced a trap composed of 76 places in 79 ms of which 1 ms to minimize.
[2023-03-09 20:40:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-03-09 20:40:10] [INFO ] Deduced a trap composed of 76 places in 59 ms of which 1 ms to minimize.
[2023-03-09 20:40:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2023-03-09 20:40:10] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 1 ms to minimize.
[2023-03-09 20:40:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-03-09 20:40:11] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 1 ms to minimize.
[2023-03-09 20:40:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2023-03-09 20:40:11] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 0 ms to minimize.
[2023-03-09 20:40:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2023-03-09 20:40:12] [INFO ] Deduced a trap composed of 68 places in 94 ms of which 0 ms to minimize.
[2023-03-09 20:40:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-03-09 20:40:12] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 1 ms to minimize.
[2023-03-09 20:40:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2023-03-09 20:40:12] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 0 ms to minimize.
[2023-03-09 20:40:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-03-09 20:40:18] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 0 ms to minimize.
[2023-03-09 20:40:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 4429 ms
[2023-03-09 20:40:42] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 1 ms to minimize.
[2023-03-09 20:40:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2023-03-09 20:40:46] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 1 ms to minimize.
[2023-03-09 20:40:47] [INFO ] Deduced a trap composed of 17 places in 257 ms of which 1 ms to minimize.
[2023-03-09 20:40:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 591 ms
[2023-03-09 20:40:58] [INFO ] Deduced a trap composed of 6 places in 269 ms of which 1 ms to minimize.
[2023-03-09 20:40:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 360 ms
[2023-03-09 20:41:16] [INFO ] After 176614ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :345
Attempting to minimize the solution found.
Minimization took 18530 ms.
[2023-03-09 20:41:35] [INFO ] After 225010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :344
Parikh walk visited 0 properties in 30000 ms.
Support contains 466 out of 548 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 548/548 places, 524/524 transitions.
Applied a total of 0 rules in 16 ms. Remains 548 /548 variables (removed 0) and now considering 524/524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 548/548 places, 524/524 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 548/548 places, 524/524 transitions.
Applied a total of 0 rules in 15 ms. Remains 548 /548 variables (removed 0) and now considering 524/524 (removed 0) transitions.
[2023-03-09 20:42:05] [INFO ] Invariant cache hit.
[2023-03-09 20:42:05] [INFO ] Implicit Places using invariants in 224 ms returned []
[2023-03-09 20:42:05] [INFO ] Invariant cache hit.
[2023-03-09 20:42:05] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-09 20:42:06] [INFO ] Implicit Places using invariants and state equation in 1268 ms returned [53, 177, 247, 449, 519]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 1497 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 543/548 places, 524/524 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 543 transition count 522
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 541 transition count 522
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 541 transition count 522
Applied a total of 5 rules in 41 ms. Remains 541 /543 variables (removed 2) and now considering 522/524 (removed 2) transitions.
// Phase 1: matrix 522 rows 541 cols
[2023-03-09 20:42:06] [INFO ] Invariants computation overflowed in 53 ms
[2023-03-09 20:42:06] [INFO ] Implicit Places using invariants in 224 ms returned []
// Phase 1: matrix 522 rows 541 cols
[2023-03-09 20:42:06] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-09 20:42:07] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-09 20:42:12] [INFO ] Implicit Places using invariants and state equation in 5563 ms returned []
Implicit Place search using SMT with State Equation took 5788 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 541/548 places, 522/524 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7342 ms. Remains : 541/548 places, 522/524 transitions.
Interrupted random walk after 597497 steps, including 86008 resets, run timeout after 30001 ms. (steps per millisecond=19 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 919 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 887 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 912 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 919 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 897 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 921 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 874 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 944 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 934 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 905 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 921 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 919 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 908 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 912 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 915 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 960 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 878 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 907 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 901 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 903 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 894 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 908 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 922 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 870 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 902 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 900 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 912 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 911 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 927 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 925 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 904 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 930 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 929 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 895 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 915 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 920 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 898 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 902 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 880 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 916 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 902 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 904 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 888 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 870 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 923 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 899 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Interrupted probabilistic random walk after 3797310 steps, run timeout after 138001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 3797310 steps, saw 1898502 distinct states, run finished after 138001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 345 properties.
// Phase 1: matrix 522 rows 541 cols
[2023-03-09 20:45:17] [INFO ] Invariants computation overflowed in 47 ms
[2023-03-09 20:45:54] [INFO ] After 25753ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:341
[2023-03-09 20:45:54] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-09 20:45:54] [INFO ] After 359ms SMT Verify possible using 44 Read/Feed constraints in real domain returned unsat :0 sat :0 real:345
[2023-03-09 20:45:54] [INFO ] After 37664ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:345
[2023-03-09 20:46:37] [INFO ] After 31331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :345
[2023-03-09 20:47:46] [INFO ] After 69099ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :345
[2023-03-09 20:47:47] [INFO ] Deduced a trap composed of 20 places in 214 ms of which 1 ms to minimize.
[2023-03-09 20:47:47] [INFO ] Deduced a trap composed of 24 places in 217 ms of which 1 ms to minimize.
[2023-03-09 20:47:47] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 1 ms to minimize.
[2023-03-09 20:47:48] [INFO ] Deduced a trap composed of 13 places in 284 ms of which 1 ms to minimize.
[2023-03-09 20:47:48] [INFO ] Deduced a trap composed of 11 places in 293 ms of which 0 ms to minimize.
[2023-03-09 20:47:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1466 ms
[2023-03-09 20:47:48] [INFO ] Deduced a trap composed of 18 places in 202 ms of which 1 ms to minimize.
[2023-03-09 20:47:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2023-03-09 20:47:51] [INFO ] Deduced a trap composed of 22 places in 210 ms of which 1 ms to minimize.
[2023-03-09 20:47:51] [INFO ] Deduced a trap composed of 24 places in 297 ms of which 1 ms to minimize.
[2023-03-09 20:47:52] [INFO ] Deduced a trap composed of 24 places in 324 ms of which 1 ms to minimize.
[2023-03-09 20:47:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 998 ms
[2023-03-09 20:47:52] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 1 ms to minimize.
[2023-03-09 20:47:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2023-03-09 20:47:53] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 0 ms to minimize.
[2023-03-09 20:47:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2023-03-09 20:47:54] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 2 ms to minimize.
[2023-03-09 20:47:54] [INFO ] Deduced a trap composed of 28 places in 180 ms of which 1 ms to minimize.
[2023-03-09 20:47:54] [INFO ] Deduced a trap composed of 28 places in 182 ms of which 0 ms to minimize.
[2023-03-09 20:47:55] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 0 ms to minimize.
[2023-03-09 20:47:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 857 ms
[2023-03-09 20:47:55] [INFO ] Deduced a trap composed of 16 places in 207 ms of which 0 ms to minimize.
[2023-03-09 20:47:55] [INFO ] Deduced a trap composed of 12 places in 202 ms of which 0 ms to minimize.
[2023-03-09 20:47:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 503 ms
[2023-03-09 20:47:56] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 1 ms to minimize.
[2023-03-09 20:47:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2023-03-09 20:47:57] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 1 ms to minimize.
[2023-03-09 20:47:57] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 1 ms to minimize.
[2023-03-09 20:47:57] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 1 ms to minimize.
[2023-03-09 20:47:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 607 ms
[2023-03-09 20:47:58] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 1 ms to minimize.
[2023-03-09 20:47:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-03-09 20:47:59] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 1 ms to minimize.
[2023-03-09 20:47:59] [INFO ] Deduced a trap composed of 3 places in 206 ms of which 1 ms to minimize.
[2023-03-09 20:47:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 508 ms
[2023-03-09 20:48:00] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 0 ms to minimize.
[2023-03-09 20:48:00] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 0 ms to minimize.
[2023-03-09 20:48:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 402 ms
[2023-03-09 20:48:00] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 0 ms to minimize.
[2023-03-09 20:48:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2023-03-09 20:48:01] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 0 ms to minimize.
[2023-03-09 20:48:01] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 0 ms to minimize.
[2023-03-09 20:48:02] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 0 ms to minimize.
[2023-03-09 20:48:02] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 1 ms to minimize.
[2023-03-09 20:48:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 768 ms
[2023-03-09 20:48:02] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 1 ms to minimize.
[2023-03-09 20:48:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2023-03-09 20:48:03] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 1 ms to minimize.
[2023-03-09 20:48:03] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 1 ms to minimize.
[2023-03-09 20:48:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 354 ms
[2023-03-09 20:48:04] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 1 ms to minimize.
[2023-03-09 20:48:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2023-03-09 20:48:05] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 1 ms to minimize.
[2023-03-09 20:48:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 5577 ms
[2023-03-09 20:48:14] [INFO ] Deduced a trap composed of 40 places in 255 ms of which 1 ms to minimize.
[2023-03-09 20:48:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 352 ms
[2023-03-09 20:48:15] [INFO ] Deduced a trap composed of 44 places in 252 ms of which 1 ms to minimize.
[2023-03-09 20:48:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 346 ms
[2023-03-09 20:48:18] [INFO ] Deduced a trap composed of 44 places in 205 ms of which 1 ms to minimize.
[2023-03-09 20:48:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
[2023-03-09 20:48:19] [INFO ] Deduced a trap composed of 44 places in 229 ms of which 1 ms to minimize.
[2023-03-09 20:48:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 328 ms
[2023-03-09 20:48:20] [INFO ] Deduced a trap composed of 52 places in 189 ms of which 1 ms to minimize.
[2023-03-09 20:48:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
[2023-03-09 20:48:21] [INFO ] Deduced a trap composed of 48 places in 193 ms of which 1 ms to minimize.
[2023-03-09 20:48:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 291 ms
[2023-03-09 20:48:22] [INFO ] Deduced a trap composed of 50 places in 209 ms of which 1 ms to minimize.
[2023-03-09 20:48:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
[2023-03-09 20:48:24] [INFO ] Deduced a trap composed of 52 places in 181 ms of which 1 ms to minimize.
[2023-03-09 20:48:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
[2023-03-09 20:48:25] [INFO ] Deduced a trap composed of 54 places in 193 ms of which 1 ms to minimize.
[2023-03-09 20:48:26] [INFO ] Deduced a trap composed of 56 places in 188 ms of which 1 ms to minimize.
[2023-03-09 20:48:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 533 ms
[2023-03-09 20:48:27] [INFO ] Deduced a trap composed of 56 places in 175 ms of which 1 ms to minimize.
[2023-03-09 20:48:28] [INFO ] Deduced a trap composed of 60 places in 171 ms of which 0 ms to minimize.
[2023-03-09 20:48:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 492 ms
[2023-03-09 20:48:28] [INFO ] Deduced a trap composed of 58 places in 172 ms of which 1 ms to minimize.
[2023-03-09 20:48:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 292 ms
[2023-03-09 20:48:30] [INFO ] Deduced a trap composed of 64 places in 141 ms of which 0 ms to minimize.
[2023-03-09 20:48:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2023-03-09 20:48:30] [INFO ] Deduced a trap composed of 60 places in 159 ms of which 0 ms to minimize.
[2023-03-09 20:48:31] [INFO ] Deduced a trap composed of 64 places in 162 ms of which 1 ms to minimize.
[2023-03-09 20:48:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 470 ms
[2023-03-09 20:48:33] [INFO ] Deduced a trap composed of 68 places in 125 ms of which 1 ms to minimize.
[2023-03-09 20:48:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2023-03-09 20:48:33] [INFO ] Deduced a trap composed of 64 places in 152 ms of which 1 ms to minimize.
[2023-03-09 20:48:34] [INFO ] Deduced a trap composed of 70 places in 126 ms of which 1 ms to minimize.
[2023-03-09 20:48:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 446 ms
[2023-03-09 20:48:35] [INFO ] Deduced a trap composed of 68 places in 145 ms of which 1 ms to minimize.
[2023-03-09 20:48:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2023-03-09 20:48:36] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 1 ms to minimize.
[2023-03-09 20:48:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-03-09 20:48:36] [INFO ] Deduced a trap composed of 72 places in 123 ms of which 1 ms to minimize.
[2023-03-09 20:48:36] [INFO ] Deduced a trap composed of 68 places in 121 ms of which 0 ms to minimize.
[2023-03-09 20:48:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 394 ms
[2023-03-09 20:48:37] [INFO ] Deduced a trap composed of 74 places in 122 ms of which 0 ms to minimize.
[2023-03-09 20:48:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2023-03-09 20:48:38] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 1 ms to minimize.
[2023-03-09 20:48:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2023-03-09 20:48:38] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 0 ms to minimize.
[2023-03-09 20:48:38] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 0 ms to minimize.
[2023-03-09 20:48:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 356 ms
[2023-03-09 20:48:39] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 1 ms to minimize.
[2023-03-09 20:48:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2023-03-09 20:48:40] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 1 ms to minimize.
[2023-03-09 20:48:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-03-09 20:49:39] [INFO ] After 182230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :344
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-09 20:49:39] [INFO ] After 225011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :344
Parikh walk visited 0 properties in 30004 ms.
Support contains 466 out of 541 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 541/541 places, 522/522 transitions.
Applied a total of 0 rules in 24 ms. Remains 541 /541 variables (removed 0) and now considering 522/522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 541/541 places, 522/522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 541/541 places, 522/522 transitions.
Applied a total of 0 rules in 12 ms. Remains 541 /541 variables (removed 0) and now considering 522/522 (removed 0) transitions.
// Phase 1: matrix 522 rows 541 cols
[2023-03-09 20:50:09] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-09 20:50:10] [INFO ] Implicit Places using invariants in 215 ms returned []
// Phase 1: matrix 522 rows 541 cols
[2023-03-09 20:50:10] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-09 20:50:10] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-09 20:50:16] [INFO ] Implicit Places using invariants and state equation in 6066 ms returned []
Implicit Place search using SMT with State Equation took 6284 ms to find 0 implicit places.
[2023-03-09 20:50:16] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 522 rows 541 cols
[2023-03-09 20:50:16] [INFO ] Invariants computation overflowed in 47 ms
[2023-03-09 20:50:16] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6813 ms. Remains : 541/541 places, 522/522 transitions.
Incomplete random walk after 100000 steps, including 14434 resets, run finished after 5832 ms. (steps per millisecond=17 ) properties (out of 466) seen :0
Running SMT prover for 466 properties.
// Phase 1: matrix 522 rows 541 cols
[2023-03-09 20:50:22] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-09 20:50:29] [INFO ] After 5772ms SMT Verify possible using state equation in real domain returned unsat :0 sat :466
[2023-03-09 20:50:29] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-09 20:50:42] [INFO ] After 13631ms SMT Verify possible using 44 Read/Feed constraints in real domain returned unsat :0 sat :466
[2023-03-09 20:50:43] [INFO ] Deduced a trap composed of 24 places in 208 ms of which 1 ms to minimize.
[2023-03-09 20:50:43] [INFO ] Deduced a trap composed of 20 places in 241 ms of which 1 ms to minimize.
[2023-03-09 20:50:43] [INFO ] Deduced a trap composed of 31 places in 224 ms of which 1 ms to minimize.
[2023-03-09 20:50:43] [INFO ] Deduced a trap composed of 24 places in 277 ms of which 1 ms to minimize.
[2023-03-09 20:50:44] [INFO ] Deduced a trap composed of 28 places in 245 ms of which 0 ms to minimize.
[2023-03-09 20:50:44] [INFO ] Deduced a trap composed of 34 places in 238 ms of which 1 ms to minimize.
[2023-03-09 20:50:44] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 1 ms to minimize.
[2023-03-09 20:50:45] [INFO ] Deduced a trap composed of 86 places in 210 ms of which 0 ms to minimize.
[2023-03-09 20:50:45] [INFO ] Deduced a trap composed of 32 places in 208 ms of which 1 ms to minimize.
[2023-03-09 20:50:45] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 1 ms to minimize.
[2023-03-09 20:50:45] [INFO ] Deduced a trap composed of 28 places in 253 ms of which 1 ms to minimize.
[2023-03-09 20:50:46] [INFO ] Deduced a trap composed of 36 places in 188 ms of which 0 ms to minimize.
[2023-03-09 20:50:46] [INFO ] Deduced a trap composed of 46 places in 200 ms of which 1 ms to minimize.
[2023-03-09 20:50:46] [INFO ] Deduced a trap composed of 44 places in 182 ms of which 0 ms to minimize.
[2023-03-09 20:50:46] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3835 ms
[2023-03-09 20:50:48] [INFO ] Deduced a trap composed of 16 places in 276 ms of which 1 ms to minimize.
[2023-03-09 20:50:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 381 ms
[2023-03-09 20:50:50] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 1 ms to minimize.
[2023-03-09 20:50:50] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 1 ms to minimize.
[2023-03-09 20:50:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 549 ms
[2023-03-09 20:50:50] [INFO ] Deduced a trap composed of 12 places in 295 ms of which 3 ms to minimize.
[2023-03-09 20:50:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 402 ms
[2023-03-09 20:50:56] [INFO ] Deduced a trap composed of 36 places in 241 ms of which 1 ms to minimize.
[2023-03-09 20:50:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 343 ms
[2023-03-09 20:51:00] [INFO ] Deduced a trap composed of 28 places in 273 ms of which 2 ms to minimize.
[2023-03-09 20:51:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 384 ms
[2023-03-09 20:51:01] [INFO ] Deduced a trap composed of 36 places in 230 ms of which 1 ms to minimize.
[2023-03-09 20:51:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 343 ms
[2023-03-09 20:51:02] [INFO ] Deduced a trap composed of 48 places in 246 ms of which 1 ms to minimize.
[2023-03-09 20:51:02] [INFO ] Deduced a trap composed of 40 places in 242 ms of which 1 ms to minimize.
[2023-03-09 20:51:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 659 ms
[2023-03-09 20:51:04] [INFO ] Deduced a trap composed of 44 places in 230 ms of which 0 ms to minimize.
[2023-03-09 20:51:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 343 ms
[2023-03-09 20:51:04] [INFO ] Deduced a trap composed of 40 places in 223 ms of which 1 ms to minimize.
[2023-03-09 20:51:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 338 ms
[2023-03-09 20:51:06] [INFO ] Deduced a trap composed of 48 places in 214 ms of which 0 ms to minimize.
[2023-03-09 20:51:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 328 ms
[2023-03-09 20:51:07] [INFO ] Deduced a trap composed of 59 places in 190 ms of which 1 ms to minimize.
[2023-03-09 20:51:07] [INFO ] Deduced a trap composed of 63 places in 189 ms of which 1 ms to minimize.
[2023-03-09 20:51:07] [INFO ] Deduced a trap composed of 64 places in 185 ms of which 1 ms to minimize.
[2023-03-09 20:51:07] [INFO ] Deduced a trap composed of 53 places in 201 ms of which 1 ms to minimize.
[2023-03-09 20:51:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1045 ms
[2023-03-09 20:51:08] [INFO ] Deduced a trap composed of 50 places in 218 ms of which 1 ms to minimize.
[2023-03-09 20:51:08] [INFO ] Deduced a trap composed of 50 places in 199 ms of which 2 ms to minimize.
[2023-03-09 20:51:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 589 ms
[2023-03-09 20:51:09] [INFO ] Deduced a trap composed of 52 places in 203 ms of which 3 ms to minimize.
[2023-03-09 20:51:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 321 ms
[2023-03-09 20:51:10] [INFO ] Deduced a trap composed of 48 places in 191 ms of which 1 ms to minimize.
[2023-03-09 20:51:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2023-03-09 20:51:11] [INFO ] Deduced a trap composed of 44 places in 182 ms of which 1 ms to minimize.
[2023-03-09 20:51:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
[2023-03-09 20:51:18] [INFO ] Deduced a trap composed of 56 places in 160 ms of which 1 ms to minimize.
[2023-03-09 20:51:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2023-03-09 20:51:19] [INFO ] Deduced a trap composed of 56 places in 145 ms of which 1 ms to minimize.
[2023-03-09 20:51:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2023-03-09 20:51:20] [INFO ] Deduced a trap composed of 52 places in 173 ms of which 1 ms to minimize.
[2023-03-09 20:51:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 307 ms
[2023-03-09 20:51:21] [INFO ] Deduced a trap composed of 64 places in 149 ms of which 1 ms to minimize.
[2023-03-09 20:51:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2023-03-09 20:51:21] [INFO ] Deduced a trap composed of 60 places in 141 ms of which 0 ms to minimize.
[2023-03-09 20:51:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
[2023-03-09 20:51:22] [INFO ] Deduced a trap composed of 77 places in 126 ms of which 3 ms to minimize.
[2023-03-09 20:51:22] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 2 ms to minimize.
[2023-03-09 20:51:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 418 ms
[2023-03-09 20:51:23] [INFO ] Deduced a trap composed of 68 places in 128 ms of which 0 ms to minimize.
[2023-03-09 20:51:23] [INFO ] Deduced a trap composed of 72 places in 123 ms of which 1 ms to minimize.
[2023-03-09 20:51:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 435 ms
[2023-03-09 20:51:25] [INFO ] Deduced a trap composed of 74 places in 116 ms of which 0 ms to minimize.
[2023-03-09 20:51:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2023-03-09 20:51:25] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 1 ms to minimize.
[2023-03-09 20:51:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2023-03-09 20:51:26] [INFO ] Deduced a trap composed of 64 places in 139 ms of which 0 ms to minimize.
[2023-03-09 20:51:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2023-03-09 20:51:27] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 1 ms to minimize.
[2023-03-09 20:51:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2023-03-09 20:51:29] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 1 ms to minimize.
[2023-03-09 20:51:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2023-03-09 20:51:33] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 1 ms to minimize.
[2023-03-09 20:51:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2023-03-09 20:51:35] [INFO ] Deduced a trap composed of 16 places in 335 ms of which 1 ms to minimize.
[2023-03-09 20:51:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 439 ms
[2023-03-09 20:51:38] [INFO ] Deduced a trap composed of 20 places in 287 ms of which 1 ms to minimize.
[2023-03-09 20:51:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 383 ms
[2023-03-09 20:51:39] [INFO ] Deduced a trap composed of 20 places in 296 ms of which 1 ms to minimize.
[2023-03-09 20:51:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 408 ms
[2023-03-09 20:51:45] [INFO ] Deduced a trap composed of 40 places in 227 ms of which 1 ms to minimize.
[2023-03-09 20:51:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 348 ms
[2023-03-09 20:51:49] [INFO ] Deduced a trap composed of 68 places in 139 ms of which 0 ms to minimize.
[2023-03-09 20:51:49] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 1 ms to minimize.
[2023-03-09 20:51:49] [INFO ] Deduced a trap composed of 68 places in 133 ms of which 0 ms to minimize.
[2023-03-09 20:51:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 639 ms
[2023-03-09 20:52:00] [INFO ] After 91547ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:466
[2023-03-09 20:52:00] [INFO ] After 97942ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:466
[2023-03-09 20:52:07] [INFO ] After 5747ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :466
[2023-03-09 20:52:28] [INFO ] After 21591ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :466
[2023-03-09 20:52:29] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 1 ms to minimize.
[2023-03-09 20:52:29] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 1 ms to minimize.
[2023-03-09 20:52:29] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 1 ms to minimize.
[2023-03-09 20:52:30] [INFO ] Deduced a trap composed of 16 places in 332 ms of which 1 ms to minimize.
[2023-03-09 20:52:30] [INFO ] Deduced a trap composed of 12 places in 320 ms of which 1 ms to minimize.
[2023-03-09 20:52:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1670 ms
[2023-03-09 20:52:30] [INFO ] Deduced a trap composed of 13 places in 331 ms of which 1 ms to minimize.
[2023-03-09 20:52:31] [INFO ] Deduced a trap composed of 11 places in 325 ms of which 1 ms to minimize.
[2023-03-09 20:52:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1680 ms
[2023-03-09 20:52:33] [INFO ] Deduced a trap composed of 22 places in 331 ms of which 1 ms to minimize.
[2023-03-09 20:52:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 426 ms
[2023-03-09 20:52:34] [INFO ] Deduced a trap composed of 16 places in 298 ms of which 1 ms to minimize.
[2023-03-09 20:52:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 378 ms
[2023-03-09 20:52:36] [INFO ] Deduced a trap composed of 27 places in 318 ms of which 1 ms to minimize.
[2023-03-09 20:52:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 418 ms
[2023-03-09 20:52:37] [INFO ] Deduced a trap composed of 24 places in 314 ms of which 1 ms to minimize.
[2023-03-09 20:52:37] [INFO ] Deduced a trap composed of 26 places in 310 ms of which 1 ms to minimize.
[2023-03-09 20:52:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 759 ms
[2023-03-09 20:52:39] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 0 ms to minimize.
[2023-03-09 20:52:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-03-09 20:52:40] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 0 ms to minimize.
[2023-03-09 20:52:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-03-09 20:52:40] [INFO ] Deduced a trap composed of 32 places in 284 ms of which 1 ms to minimize.
[2023-03-09 20:52:41] [INFO ] Deduced a trap composed of 24 places in 289 ms of which 1 ms to minimize.
[2023-03-09 20:52:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 756 ms
[2023-03-09 20:52:41] [INFO ] Deduced a trap composed of 28 places in 288 ms of which 1 ms to minimize.
[2023-03-09 20:52:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 376 ms
[2023-03-09 20:52:43] [INFO ] Deduced a trap composed of 20 places in 304 ms of which 1 ms to minimize.
[2023-03-09 20:52:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 397 ms
[2023-03-09 20:52:43] [INFO ] Deduced a trap composed of 24 places in 306 ms of which 1 ms to minimize.
[2023-03-09 20:52:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 436 ms
[2023-03-09 20:52:44] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 1 ms to minimize.
[2023-03-09 20:52:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 350 ms
[2023-03-09 20:52:45] [INFO ] Deduced a trap composed of 34 places in 271 ms of which 1 ms to minimize.
[2023-03-09 20:52:46] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 1 ms to minimize.
[2023-03-09 20:52:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 671 ms
[2023-03-09 20:52:46] [INFO ] Deduced a trap composed of 28 places in 271 ms of which 1 ms to minimize.
[2023-03-09 20:52:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 379 ms
[2023-03-09 20:52:49] [INFO ] Deduced a trap composed of 36 places in 264 ms of which 1 ms to minimize.
[2023-03-09 20:52:49] [INFO ] Deduced a trap composed of 38 places in 266 ms of which 1 ms to minimize.
[2023-03-09 20:52:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 674 ms
[2023-03-09 20:52:52] [INFO ] Deduced a trap composed of 42 places in 243 ms of which 1 ms to minimize.
[2023-03-09 20:52:53] [INFO ] Deduced a trap composed of 40 places in 243 ms of which 1 ms to minimize.
[2023-03-09 20:52:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 626 ms
[2023-03-09 20:52:53] [INFO ] Deduced a trap composed of 44 places in 223 ms of which 1 ms to minimize.
[2023-03-09 20:52:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 322 ms
[2023-03-09 20:52:54] [INFO ] Deduced a trap composed of 36 places in 227 ms of which 0 ms to minimize.
[2023-03-09 20:52:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 331 ms
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393232 kB
MemFree: 13493108 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16128956 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//
++ perl -pe 's/.*\.//g'
++ 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 QuasiLiveness -timeout 180 -rebuildPNML

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="DoubleExponent-PT-020"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 DoubleExponent-PT-020, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r151-smll-167819438100302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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