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.r152-smll-167819439200302.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 marciexred
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 r152-smll-167819439200302
=====================================================================

--------------------
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 1678400612706

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-020
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 22:23:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-09 22:23:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 22:23:35] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2023-03-09 22:23:35] [INFO ] Transformed 1064 places.
[2023-03-09 22:23:35] [INFO ] Transformed 998 transitions.
[2023-03-09 22:23:35] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 252 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 41 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 11 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 9 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 194 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 22:23:35] [INFO ] Invariants computation overflowed in 56 ms
[2023-03-09 22:23:36] [INFO ] Implicit Places using invariants in 953 ms returned []
// Phase 1: matrix 534 rows 558 cols
[2023-03-09 22:23:36] [INFO ] Invariants computation overflowed in 23 ms
[2023-03-09 22:23:36] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-09 22:24:07] [INFO ] Performed 231/558 implicitness test of which 2 returned IMPLICIT in 30 seconds.
[2023-03-09 22:24:37] [INFO ] Performed 491/558 implicitness test of which 2 returned IMPLICIT in 60 seconds.
[2023-03-09 22:25:02] [INFO ] Implicit Places using invariants and state equation in 85413 ms returned [16, 17]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 86417 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 556/1064 places, 534/998 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 556 transition count 533
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 555 transition count 533
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 552 transition count 530
Applied a total of 8 rules in 46 ms. Remains 552 /556 variables (removed 4) and now considering 530/534 (removed 4) transitions.
// Phase 1: matrix 530 rows 552 cols
[2023-03-09 22:25:02] [INFO ] Computed 99 place invariants in 210 ms
[2023-03-09 22:25:02] [INFO ] Implicit Places using invariants in 910 ms returned []
[2023-03-09 22:25:02] [INFO ] Invariant cache hit.
[2023-03-09 22:25:03] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-09 22:25:33] [INFO ] Performed 234/552 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 22:25:38] [INFO ] Implicit Places using invariants and state equation in 35774 ms returned []
Implicit Place search using SMT with State Equation took 36689 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 552/1064 places, 530/998 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 123348 ms. Remains : 552/1064 places, 530/998 transitions.
Discarding 118 transitions out of 530. Remains 412
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 1208 resets, run finished after 1403 ms. (steps per millisecond=7 ) properties (out of 411) seen :24
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 101 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=10 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 101 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=10 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=10 ) properties (out of 387) 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 387) 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 387) 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 387) 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 387) 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 387) 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 387) 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 387) seen :0
Incomplete Best-First random walk after 101 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 100 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 387) 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 387) 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 387) 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 387) 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 387) 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 387) 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 387) 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 387) 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 387) 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 387) 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 387) 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 387) 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 387) 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 387) 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 387) 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 387) 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 387) 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 387) 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 387) 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 387) 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 387) 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 387) 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 387) seen :0
Incomplete Best-First random walk after 101 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 387) 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 387) 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 387) 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 387) 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 387) 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 387) 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 387) 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 387) 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 387) seen :0
Incomplete Best-First random walk after 100 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 387) 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 387) seen :0
Interrupted probabilistic random walk after 63210 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{0=1, 1=1, 4=1, 8=1, 9=1, 10=1, 11=1, 124=1, 133=1, 137=1, 146=1, 170=1, 179=1, 203=1, 229=1, 230=1, 242=1, 243=1, 302=1, 305=1, 312=1, 332=1, 361=1, 370=1, 371=1}
Probabilistic random walk after 63210 steps, saw 31615 distinct states, run finished after 3004 ms. (steps per millisecond=21 ) properties seen :25
Running SMT prover for 362 properties.
[2023-03-09 22:25:43] [INFO ] Invariant cache hit.
[2023-03-09 22:25:49] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 22:25:50] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 104 ms returned sat
[2023-03-09 22:26:08] [INFO ] After 11999ms SMT Verify possible using state equation in real domain returned unsat :0 sat :138 real:224
[2023-03-09 22:26:08] [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 22:26:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 22:26:08] [INFO ] After 25028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 362 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 488 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 530/530 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 552 transition count 525
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 547 transition count 525
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 547 transition count 525
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 546 transition count 524
Applied a total of 19 rules in 121 ms. Remains 546 /552 variables (removed 6) and now considering 524/530 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 546/552 places, 524/530 transitions.
Interrupted random walk after 458239 steps, including 58654 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 878 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 816 resets, run finished after 483 ms. (steps per millisecond=20 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 497 ms. (steps per millisecond=20 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 829 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 499 ms. (steps per millisecond=20 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 868 resets, run finished after 526 ms. (steps per millisecond=19 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 841 resets, run finished after 513 ms. (steps per millisecond=19 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 822 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 875 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 845 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 829 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 847 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 833 resets, run finished after 438 ms. (steps per millisecond=22 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 522 ms. (steps per millisecond=19 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 527 ms. (steps per millisecond=18 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 472 ms. (steps per millisecond=21 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 821 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 871 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 830 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 843 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 823 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 857 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 833 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 825 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 839 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 828 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 858 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 856 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 809 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 826 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 877 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 863 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 506 ms. (steps per millisecond=19 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 854 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 362) seen :0
Interrupted probabilistic random walk after 3684926 steps, run timeout after 153001 ms. (steps per millisecond=24 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 10=1, 14=1, 15=1, 16=1, 17=1, 226=1, 227=1, 228=1, 229=1, 292=1, 293=1, 294=1, 295=1}
Probabilistic random walk after 3684926 steps, saw 1842481 distinct states, run finished after 153001 ms. (steps per millisecond=24 ) properties seen :21
Running SMT prover for 341 properties.
// Phase 1: matrix 524 rows 546 cols
[2023-03-09 22:29:33] [INFO ] Invariants computation overflowed in 91 ms
[2023-03-09 22:30:10] [INFO ] After 25193ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:339
[2023-03-09 22:30:10] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 22:30:11] [INFO ] After 1244ms SMT Verify possible using 42 Read/Feed constraints in real domain returned unsat :0 sat :1 real:340
[2023-03-09 22:30:11] [INFO ] After 1416ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:341
[2023-03-09 22:30:11] [INFO ] After 38131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:341
[2023-03-09 22:30:43] [INFO ] After 21114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :341
[2023-03-09 22:31:32] [INFO ] After 49004ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :341
[2023-03-09 22:31:35] [INFO ] Deduced a trap composed of 21 places in 356 ms of which 11 ms to minimize.
[2023-03-09 22:31:35] [INFO ] Deduced a trap composed of 21 places in 383 ms of which 2 ms to minimize.
[2023-03-09 22:31:36] [INFO ] Deduced a trap composed of 13 places in 364 ms of which 3 ms to minimize.
[2023-03-09 22:31:36] [INFO ] Deduced a trap composed of 9 places in 357 ms of which 2 ms to minimize.
[2023-03-09 22:31:37] [INFO ] Deduced a trap composed of 10 places in 418 ms of which 1 ms to minimize.
[2023-03-09 22:31:37] [INFO ] Deduced a trap composed of 4 places in 307 ms of which 1 ms to minimize.
[2023-03-09 22:31:37] [INFO ] Deduced a trap composed of 17 places in 257 ms of which 1 ms to minimize.
[2023-03-09 22:31:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2925 ms
[2023-03-09 22:31:39] [INFO ] Deduced a trap composed of 23 places in 309 ms of which 2 ms to minimize.
[2023-03-09 22:31:40] [INFO ] Deduced a trap composed of 51 places in 196 ms of which 1 ms to minimize.
[2023-03-09 22:31:40] [INFO ] Deduced a trap composed of 61 places in 166 ms of which 1 ms to minimize.
[2023-03-09 22:31:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 838 ms
[2023-03-09 22:31:43] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 1 ms to minimize.
[2023-03-09 22:31:43] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 1 ms to minimize.
[2023-03-09 22:31:43] [INFO ] Deduced a trap composed of 25 places in 261 ms of which 1 ms to minimize.
[2023-03-09 22:31:43] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 1 ms to minimize.
[2023-03-09 22:31:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1061 ms
[2023-03-09 22:31:44] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 0 ms to minimize.
[2023-03-09 22:31:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2023-03-09 22:31:45] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 2 ms to minimize.
[2023-03-09 22:31:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2023-03-09 22:31:46] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 1 ms to minimize.
[2023-03-09 22:31:46] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 1 ms to minimize.
[2023-03-09 22:31:46] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 1 ms to minimize.
[2023-03-09 22:31:46] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 1 ms to minimize.
[2023-03-09 22:31:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 882 ms
[2023-03-09 22:31:47] [INFO ] Deduced a trap composed of 21 places in 199 ms of which 1 ms to minimize.
[2023-03-09 22:31:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2023-03-09 22:31:48] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 1 ms to minimize.
[2023-03-09 22:31:48] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 0 ms to minimize.
[2023-03-09 22:31:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 428 ms
[2023-03-09 22:31:49] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 1 ms to minimize.
[2023-03-09 22:31:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-03-09 22:31:51] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 1 ms to minimize.
[2023-03-09 22:31:51] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 0 ms to minimize.
[2023-03-09 22:31:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 402 ms
[2023-03-09 22:31:51] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 1 ms to minimize.
[2023-03-09 22:31:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-03-09 22:31:52] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 1 ms to minimize.
[2023-03-09 22:31:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2023-03-09 22:31:53] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 1 ms to minimize.
[2023-03-09 22:31:53] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 1 ms to minimize.
[2023-03-09 22:31:53] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 0 ms to minimize.
[2023-03-09 22:31:53] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 1 ms to minimize.
[2023-03-09 22:31:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 743 ms
[2023-03-09 22:31:54] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 1 ms to minimize.
[2023-03-09 22:31:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2023-03-09 22:31:54] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 1 ms to minimize.
[2023-03-09 22:31:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-03-09 22:31:55] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 4 ms to minimize.
[2023-03-09 22:31:56] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 1 ms to minimize.
[2023-03-09 22:31:56] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 1 ms to minimize.
[2023-03-09 22:31:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 549 ms
[2023-03-09 22:31:57] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 0 ms to minimize.
[2023-03-09 22:31:57] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 0 ms to minimize.
[2023-03-09 22:31:58] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 0 ms to minimize.
[2023-03-09 22:31:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1217 ms
[2023-03-09 22:32:01] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 0 ms to minimize.
[2023-03-09 22:32:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2023-03-09 22:32:01] [INFO ] Deduced a trap composed of 57 places in 120 ms of which 0 ms to minimize.
[2023-03-09 22:32:01] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 1 ms to minimize.
[2023-03-09 22:32:01] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 1 ms to minimize.
[2023-03-09 22:32:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 478 ms
[2023-03-09 22:32:02] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 0 ms to minimize.
[2023-03-09 22:32:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2023-03-09 22:32:03] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 2 ms to minimize.
[2023-03-09 22:32:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2023-03-09 22:32:03] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 0 ms to minimize.
[2023-03-09 22:32:03] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 0 ms to minimize.
[2023-03-09 22:32:03] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 1 ms to minimize.
[2023-03-09 22:32:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 488 ms
[2023-03-09 22:32:04] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 0 ms to minimize.
[2023-03-09 22:32:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1534 ms
[2023-03-09 22:32:09] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 2 ms to minimize.
[2023-03-09 22:32:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2023-03-09 22:32:11] [INFO ] Deduced a trap composed of 57 places in 168 ms of which 3 ms to minimize.
[2023-03-09 22:32:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2023-03-09 22:32:12] [INFO ] Deduced a trap composed of 60 places in 114 ms of which 0 ms to minimize.
[2023-03-09 22:32:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2023-03-09 22:32:13] [INFO ] Deduced a trap composed of 61 places in 99 ms of which 1 ms to minimize.
[2023-03-09 22:32:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2023-03-09 22:32:13] [INFO ] Deduced a trap composed of 61 places in 109 ms of which 1 ms to minimize.
[2023-03-09 22:32:13] [INFO ] Deduced a trap composed of 65 places in 101 ms of which 1 ms to minimize.
[2023-03-09 22:32:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 313 ms
[2023-03-09 22:32:15] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 4 ms to minimize.
[2023-03-09 22:32:15] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 1 ms to minimize.
[2023-03-09 22:32:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 268 ms
[2023-03-09 22:32:15] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 0 ms to minimize.
[2023-03-09 22:32:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-03-09 22:32:16] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 1 ms to minimize.
[2023-03-09 22:32:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-03-09 22:32:17] [INFO ] Deduced a trap composed of 68 places in 97 ms of which 1 ms to minimize.
[2023-03-09 22:32:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-03-09 22:32:17] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 0 ms to minimize.
[2023-03-09 22:32:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2023-03-09 22:32:18] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 1 ms to minimize.
[2023-03-09 22:32:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-03-09 22:32:18] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 2 ms to minimize.
[2023-03-09 22:32:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2023-03-09 22:32:19] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 0 ms to minimize.
[2023-03-09 22:32:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-03-09 22:32:19] [INFO ] Deduced a trap composed of 75 places in 78 ms of which 2 ms to minimize.
[2023-03-09 22:32:20] [INFO ] Deduced a trap composed of 77 places in 75 ms of which 0 ms to minimize.
[2023-03-09 22:32:20] [INFO ] Deduced a trap composed of 75 places in 78 ms of which 0 ms to minimize.
[2023-03-09 22:32:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 350 ms
[2023-03-09 22:32:20] [INFO ] Deduced a trap composed of 79 places in 73 ms of which 2 ms to minimize.
[2023-03-09 22:32:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-03-09 22:33:02] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 3 ms to minimize.
[2023-03-09 22:33:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2023-03-09 22:33:04] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 0 ms to minimize.
[2023-03-09 22:33:04] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 1 ms to minimize.
[2023-03-09 22:33:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 517 ms
[2023-03-09 22:33:04] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 1 ms to minimize.
[2023-03-09 22:33:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2023-03-09 22:33:11] [INFO ] After 148008ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :341
Attempting to minimize the solution found.
Minimization took 45290 ms.
[2023-03-09 22:33:56] [INFO ] After 225023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :340
Parikh walk visited 0 properties in 30009 ms.
Support contains 460 out of 546 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 546/546 places, 524/524 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 546 transition count 520
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 542 transition count 520
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 542 transition count 520
Applied a total of 12 rules in 82 ms. Remains 542 /546 variables (removed 4) and now considering 520/524 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 542/546 places, 520/524 transitions.
Interrupted random walk after 474458 steps, including 60803 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 862 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 806 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 851 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 422 ms. (steps per millisecond=23 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 473 ms. (steps per millisecond=21 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 866 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 831 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 865 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 827 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 860 resets, run finished after 431 ms. (steps per millisecond=23 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 837 resets, run finished after 517 ms. (steps per millisecond=19 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 823 resets, run finished after 423 ms. (steps per millisecond=23 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 865 resets, run finished after 485 ms. (steps per millisecond=20 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 811 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 824 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 849 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 871 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 870 resets, run finished after 449 ms. (steps per millisecond=22 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 882 resets, run finished after 481 ms. (steps per millisecond=20 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 552 ms. (steps per millisecond=18 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 451 ms. (steps per millisecond=22 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 861 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 838 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 859 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 872 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 862 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 865 resets, run finished after 517 ms. (steps per millisecond=19 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 873 resets, run finished after 444 ms. (steps per millisecond=22 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 546 ms. (steps per millisecond=18 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 710 ms. (steps per millisecond=14 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 851 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 833 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 833 resets, run finished after 460 ms. (steps per millisecond=21 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 871 resets, run finished after 485 ms. (steps per millisecond=20 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 848 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Interrupted probabilistic random walk after 3708592 steps, run timeout after 150001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 3708592 steps, saw 1854280 distinct states, run finished after 150006 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 341 properties.
// Phase 1: matrix 520 rows 542 cols
[2023-03-09 22:37:47] [INFO ] Computed 99 place invariants in 77 ms
[2023-03-09 22:37:53] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 22:37:53] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 85 ms returned sat
[2023-03-09 22:38:18] [INFO ] After 18866ms SMT Verify possible using state equation in real domain returned unsat :0 sat :34 real:307
[2023-03-09 22:38:18] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-09 22:38:19] [INFO ] After 1303ms SMT Verify possible using 44 Read/Feed constraints in real domain returned unsat :0 sat :5 real:336
[2023-03-09 22:38:19] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 1 ms to minimize.
[2023-03-09 22:38:19] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 1 ms to minimize.
[2023-03-09 22:38:20] [INFO ] Deduced a trap composed of 40 places in 177 ms of which 1 ms to minimize.
[2023-03-09 22:38:20] [INFO ] Deduced a trap composed of 36 places in 183 ms of which 1 ms to minimize.
[2023-03-09 22:38:20] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 0 ms to minimize.
[2023-03-09 22:38:20] [INFO ] Deduced a trap composed of 55 places in 177 ms of which 1 ms to minimize.
[2023-03-09 22:38:20] [INFO ] Deduced a trap composed of 50 places in 169 ms of which 0 ms to minimize.
[2023-03-09 22:38:21] [INFO ] Deduced a trap composed of 52 places in 167 ms of which 1 ms to minimize.
[2023-03-09 22:38:21] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 1 ms to minimize.
[2023-03-09 22:38:21] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1918 ms
[2023-03-09 22:38:21] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 1 ms to minimize.
[2023-03-09 22:38:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2023-03-09 22:38:21] [INFO ] After 3727ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:341
[2023-03-09 22:38:21] [INFO ] After 33991ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:341
[2023-03-09 22:38:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:38:25] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 52 ms returned sat
[2023-03-09 22:38:45] [INFO ] After 15860ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :341
[2023-03-09 22:39:39] [INFO ] After 54004ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :341
[2023-03-09 22:39:40] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 1 ms to minimize.
[2023-03-09 22:39:40] [INFO ] Deduced a trap composed of 22 places in 335 ms of which 1 ms to minimize.
[2023-03-09 22:39:40] [INFO ] Deduced a trap composed of 15 places in 237 ms of which 1 ms to minimize.
[2023-03-09 22:39:41] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 1 ms to minimize.
[2023-03-09 22:39:41] [INFO ] Deduced a trap composed of 16 places in 243 ms of which 1 ms to minimize.
[2023-03-09 22:39:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1573 ms
[2023-03-09 22:39:44] [INFO ] Deduced a trap composed of 16 places in 316 ms of which 0 ms to minimize.
[2023-03-09 22:39:45] [INFO ] Deduced a trap composed of 24 places in 249 ms of which 1 ms to minimize.
[2023-03-09 22:39:45] [INFO ] Deduced a trap composed of 26 places in 236 ms of which 1 ms to minimize.
[2023-03-09 22:39:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 991 ms
[2023-03-09 22:39:46] [INFO ] Deduced a trap composed of 16 places in 284 ms of which 0 ms to minimize.
[2023-03-09 22:39:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 348 ms
[2023-03-09 22:39:47] [INFO ] Deduced a trap composed of 18 places in 255 ms of which 0 ms to minimize.
[2023-03-09 22:39:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 348 ms
[2023-03-09 22:39:50] [INFO ] Deduced a trap composed of 20 places in 217 ms of which 1 ms to minimize.
[2023-03-09 22:39:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1762 ms
[2023-03-09 22:39:53] [INFO ] Deduced a trap composed of 12 places in 297 ms of which 1 ms to minimize.
[2023-03-09 22:39:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 727 ms
[2023-03-09 22:39:59] [INFO ] Deduced a trap composed of 20 places in 344 ms of which 1 ms to minimize.
[2023-03-09 22:39:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 468 ms
[2023-03-09 22:40:01] [INFO ] Deduced a trap composed of 24 places in 333 ms of which 1 ms to minimize.
[2023-03-09 22:40:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 662 ms
[2023-03-09 22:40:02] [INFO ] Deduced a trap composed of 28 places in 340 ms of which 1 ms to minimize.
[2023-03-09 22:40:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 437 ms
[2023-03-09 22:40:05] [INFO ] Deduced a trap composed of 32 places in 280 ms of which 1 ms to minimize.
[2023-03-09 22:40:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 386 ms
[2023-03-09 22:40:06] [INFO ] Deduced a trap composed of 28 places in 268 ms of which 1 ms to minimize.
[2023-03-09 22:40:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 374 ms
[2023-03-09 22:40:07] [INFO ] Deduced a trap composed of 30 places in 319 ms of which 1 ms to minimize.
[2023-03-09 22:40:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 426 ms
[2023-03-09 22:40:08] [INFO ] Deduced a trap composed of 28 places in 313 ms of which 2 ms to minimize.
[2023-03-09 22:40:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 433 ms
[2023-03-09 22:40:10] [INFO ] Deduced a trap composed of 32 places in 266 ms of which 1 ms to minimize.
[2023-03-09 22:40:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 375 ms
[2023-03-09 22:40:10] [INFO ] Deduced a trap composed of 36 places in 306 ms of which 1 ms to minimize.
[2023-03-09 22:40:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 404 ms
[2023-03-09 22:40:12] [INFO ] Deduced a trap composed of 36 places in 284 ms of which 1 ms to minimize.
[2023-03-09 22:40:12] [INFO ] Deduced a trap composed of 40 places in 272 ms of which 1 ms to minimize.
[2023-03-09 22:40:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 701 ms
[2023-03-09 22:40:13] [INFO ] Deduced a trap composed of 36 places in 263 ms of which 1 ms to minimize.
[2023-03-09 22:40:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 372 ms
[2023-03-09 22:40:14] [INFO ] Deduced a trap composed of 40 places in 290 ms of which 1 ms to minimize.
[2023-03-09 22:40:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 394 ms
[2023-03-09 22:40:15] [INFO ] Deduced a trap composed of 38 places in 290 ms of which 1 ms to minimize.
[2023-03-09 22:40:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 400 ms
[2023-03-09 22:40:17] [INFO ] Deduced a trap composed of 44 places in 222 ms of which 0 ms to minimize.
[2023-03-09 22:40:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 328 ms
[2023-03-09 22:40:17] [INFO ] Deduced a trap composed of 40 places in 255 ms of which 0 ms to minimize.
[2023-03-09 22:40:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2023-03-09 22:40:18] [INFO ] Deduced a trap composed of 42 places in 265 ms of which 0 ms to minimize.
[2023-03-09 22:40:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 374 ms
[2023-03-09 22:40:20] [INFO ] Deduced a trap composed of 48 places in 217 ms of which 2 ms to minimize.
[2023-03-09 22:40:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
[2023-03-09 22:40:21] [INFO ] Deduced a trap composed of 44 places in 222 ms of which 1 ms to minimize.
[2023-03-09 22:40:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 325 ms
[2023-03-09 22:40:21] [INFO ] Deduced a trap composed of 46 places in 194 ms of which 1 ms to minimize.
[2023-03-09 22:40:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 316 ms
[2023-03-09 22:40:22] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 0 ms to minimize.
[2023-03-09 22:40:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2023-03-09 22:40:23] [INFO ] Deduced a trap composed of 52 places in 139 ms of which 1 ms to minimize.
[2023-03-09 22:40:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2023-03-09 22:40:23] [INFO ] Deduced a trap composed of 48 places in 147 ms of which 1 ms to minimize.
[2023-03-09 22:40:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2023-03-09 22:40:24] [INFO ] Deduced a trap composed of 50 places in 160 ms of which 1 ms to minimize.
[2023-03-09 22:40:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2023-03-09 22:40:26] [INFO ] Deduced a trap composed of 56 places in 132 ms of which 1 ms to minimize.
[2023-03-09 22:40:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2023-03-09 22:40:26] [INFO ] Deduced a trap composed of 52 places in 139 ms of which 1 ms to minimize.
[2023-03-09 22:40:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-09 22:40:27] [INFO ] Deduced a trap composed of 52 places in 149 ms of which 1 ms to minimize.
[2023-03-09 22:40:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2023-03-09 22:40:28] [INFO ] Deduced a trap composed of 63 places in 122 ms of which 0 ms to minimize.
[2023-03-09 22:40:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2023-03-09 22:40:29] [INFO ] Deduced a trap composed of 60 places in 124 ms of which 1 ms to minimize.
[2023-03-09 22:40:29] [INFO ] Deduced a trap composed of 66 places in 140 ms of which 0 ms to minimize.
[2023-03-09 22:40:29] [INFO ] Deduced a trap composed of 67 places in 139 ms of which 1 ms to minimize.
[2023-03-09 22:40:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 632 ms
[2023-03-09 22:40:31] [INFO ] Deduced a trap composed of 64 places in 164 ms of which 0 ms to minimize.
[2023-03-09 22:40:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2023-03-09 22:40:31] [INFO ] Deduced a trap composed of 58 places in 185 ms of which 0 ms to minimize.
[2023-03-09 22:40:32] [INFO ] Deduced a trap composed of 60 places in 125 ms of which 1 ms to minimize.
[2023-03-09 22:40:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 440 ms
[2023-03-09 22:40:32] [INFO ] Deduced a trap composed of 70 places in 175 ms of which 0 ms to minimize.
[2023-03-09 22:40:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2023-03-09 22:40:32] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 0 ms to minimize.
[2023-03-09 22:40:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 619 ms
[2023-03-09 22:40:37] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 1 ms to minimize.
[2023-03-09 22:40:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 648 ms
[2023-03-09 22:40:38] [INFO ] Deduced a trap composed of 68 places in 143 ms of which 0 ms to minimize.
[2023-03-09 22:40:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 324 ms
[2023-03-09 22:40:39] [INFO ] Deduced a trap composed of 64 places in 137 ms of which 1 ms to minimize.
[2023-03-09 22:40:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2023-03-09 22:40:40] [INFO ] Deduced a trap composed of 67 places in 148 ms of which 1 ms to minimize.
[2023-03-09 22:40:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2023-03-09 22:40:42] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 1 ms to minimize.
[2023-03-09 22:40:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2023-03-09 22:40:43] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 0 ms to minimize.
[2023-03-09 22:40:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2023-03-09 22:40:43] [INFO ] Deduced a trap composed of 68 places in 102 ms of which 0 ms to minimize.
[2023-03-09 22:40:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2023-03-09 22:40:44] [INFO ] Deduced a trap composed of 13 places in 314 ms of which 1 ms to minimize.
[2023-03-09 22:40:44] [INFO ] Deduced a trap composed of 4 places in 322 ms of which 1 ms to minimize.
[2023-03-09 22:40:45] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 1 ms to minimize.
[2023-03-09 22:40:45] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 2 ms to minimize.
[2023-03-09 22:40:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1222 ms
[2023-03-09 22:40:46] [INFO ] Deduced a trap composed of 78 places in 82 ms of which 0 ms to minimize.
[2023-03-09 22:40:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2023-03-09 22:40:46] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 0 ms to minimize.
[2023-03-09 22:40:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-03-09 22:40:47] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 1 ms to minimize.
[2023-03-09 22:40:47] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 1 ms to minimize.
[2023-03-09 22:40:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 312 ms
[2023-03-09 22:40:47] [INFO ] Deduced a trap composed of 76 places in 65 ms of which 0 ms to minimize.
[2023-03-09 22:40:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-03-09 22:41:07] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 0 ms to minimize.
[2023-03-09 22:41:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2023-03-09 22:41:39] [INFO ] Deduced a trap composed of 77 places in 161 ms of which 1 ms to minimize.
[2023-03-09 22:41:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 356 ms
[2023-03-09 22:41:41] [INFO ] Deduced a trap composed of 80 places in 117 ms of which 1 ms to minimize.
[2023-03-09 22:41:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-03-09 22:41:42] [INFO ] Deduced a trap composed of 72 places in 133 ms of which 0 ms to minimize.
[2023-03-09 22:41:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 690 ms
[2023-03-09 22:41:43] [INFO ] After 177279ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :341
Attempting to minimize the solution found.
Minimization took 23775 ms.
[2023-03-09 22:42:06] [INFO ] After 225028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :340
Parikh walk visited 0 properties in 30002 ms.
Support contains 460 out of 542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 520/520 transitions.
Applied a total of 0 rules in 18 ms. Remains 542 /542 variables (removed 0) and now considering 520/520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 542/542 places, 520/520 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 520/520 transitions.
Applied a total of 0 rules in 28 ms. Remains 542 /542 variables (removed 0) and now considering 520/520 (removed 0) transitions.
[2023-03-09 22:42:36] [INFO ] Invariant cache hit.
[2023-03-09 22:42:37] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-03-09 22:42:37] [INFO ] Invariant cache hit.
[2023-03-09 22:42:37] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-09 22:42:38] [INFO ] Implicit Places using invariants and state equation in 1630 ms returned [47, 171, 241, 443, 513]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 1841 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 537/542 places, 520/520 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 537 transition count 518
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 535 transition count 518
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 535 transition count 518
Applied a total of 5 rules in 40 ms. Remains 535 /537 variables (removed 2) and now considering 518/520 (removed 2) transitions.
// Phase 1: matrix 518 rows 535 cols
[2023-03-09 22:42:38] [INFO ] Computed 94 place invariants in 61 ms
[2023-03-09 22:42:39] [INFO ] Implicit Places using invariants in 255 ms returned []
[2023-03-09 22:42:39] [INFO ] Invariant cache hit.
[2023-03-09 22:42:39] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-09 22:42:40] [INFO ] Implicit Places using invariants and state equation in 1362 ms returned []
Implicit Place search using SMT with State Equation took 1620 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 535/542 places, 518/520 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3533 ms. Remains : 535/542 places, 518/520 transitions.
Interrupted random walk after 505236 steps, including 73220 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 900 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 888 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 936 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 916 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 889 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 907 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 922 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 945 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 919 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 918 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 926 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 891 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 912 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 904 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 914 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 941 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 938 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 903 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 928 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 902 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 914 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 920 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 913 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 934 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 903 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 939 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 910 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 928 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 906 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 894 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 898 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 913 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 911 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 910 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 902 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 936 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 920 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 927 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 922 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 902 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 890 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 934 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 929 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 910 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 948 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 928 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 915 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 918 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 341) seen :0
Interrupted probabilistic random walk after 3586218 steps, run timeout after 147001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 3586218 steps, saw 1792995 distinct states, run finished after 147001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 341 properties.
[2023-03-09 22:45:56] [INFO ] Invariant cache hit.
[2023-03-09 22:46:02] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:46:02] [INFO ] [Real]Absence check using 2 positive and 92 generalized place invariants in 97 ms returned sat
[2023-03-09 22:46:31] [INFO ] After 22240ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7 real:334
[2023-03-09 22:46:31] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-09 22:46:31] [INFO ] After 279ms SMT Verify possible using 44 Read/Feed constraints in real domain returned unsat :0 sat :7 real:334
[2023-03-09 22:46:31] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 1 ms to minimize.
[2023-03-09 22:46:31] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 0 ms to minimize.
[2023-03-09 22:46:32] [INFO ] Deduced a trap composed of 68 places in 131 ms of which 1 ms to minimize.
[2023-03-09 22:46:32] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 1 ms to minimize.
[2023-03-09 22:46:32] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 0 ms to minimize.
[2023-03-09 22:46:32] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 0 ms to minimize.
[2023-03-09 22:46:32] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 0 ms to minimize.
[2023-03-09 22:46:32] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1127 ms
[2023-03-09 22:46:32] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 0 ms to minimize.
[2023-03-09 22:46:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2023-03-09 22:46:33] [INFO ] After 2148ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:340
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-09 22:46:33] [INFO ] After 36731ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:341
[2023-03-09 22:46:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:46:38] [INFO ] [Nat]Absence check using 2 positive and 92 generalized place invariants in 87 ms returned sat
[2023-03-09 22:46:57] [INFO ] After 14376ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :341
[2023-03-09 22:47:47] [INFO ] After 49593ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :341
[2023-03-09 22:47:47] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 1 ms to minimize.
[2023-03-09 22:47:47] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 0 ms to minimize.
[2023-03-09 22:47:48] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 1 ms to minimize.
[2023-03-09 22:47:48] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 0 ms to minimize.
[2023-03-09 22:47:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 941 ms
[2023-03-09 22:47:51] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 1 ms to minimize.
[2023-03-09 22:47:52] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 1 ms to minimize.
[2023-03-09 22:47:52] [INFO ] Deduced a trap composed of 22 places in 208 ms of which 1 ms to minimize.
[2023-03-09 22:47:52] [INFO ] Deduced a trap composed of 16 places in 219 ms of which 1 ms to minimize.
[2023-03-09 22:47:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1035 ms
[2023-03-09 22:47:53] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 1 ms to minimize.
[2023-03-09 22:47:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2023-03-09 22:47:55] [INFO ] Deduced a trap composed of 18 places in 206 ms of which 1 ms to minimize.
[2023-03-09 22:47:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2023-03-09 22:47:55] [INFO ] Deduced a trap composed of 12 places in 202 ms of which 1 ms to minimize.
[2023-03-09 22:47:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2023-03-09 22:47:56] [INFO ] Deduced a trap composed of 27 places in 178 ms of which 0 ms to minimize.
[2023-03-09 22:47:56] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 1 ms to minimize.
[2023-03-09 22:47:57] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 1 ms to minimize.
[2023-03-09 22:47:57] [INFO ] Deduced a trap composed of 28 places in 200 ms of which 1 ms to minimize.
[2023-03-09 22:47:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 959 ms
[2023-03-09 22:47:58] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 1 ms to minimize.
[2023-03-09 22:47:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2023-03-09 22:48:01] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 1 ms to minimize.
[2023-03-09 22:48:01] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 1 ms to minimize.
[2023-03-09 22:48:01] [INFO ] Deduced a trap composed of 30 places in 172 ms of which 1 ms to minimize.
[2023-03-09 22:48:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 680 ms
[2023-03-09 22:48:05] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 0 ms to minimize.
[2023-03-09 22:48:05] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 0 ms to minimize.
[2023-03-09 22:48:05] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 0 ms to minimize.
[2023-03-09 22:48:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 599 ms
[2023-03-09 22:48:06] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 1 ms to minimize.
[2023-03-09 22:48:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2023-03-09 22:48:11] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 1 ms to minimize.
[2023-03-09 22:48:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2023-03-09 22:48:13] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 1 ms to minimize.
[2023-03-09 22:48:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2023-03-09 22:48:15] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 1 ms to minimize.
[2023-03-09 22:48:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2023-03-09 22:48:16] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 1 ms to minimize.
[2023-03-09 22:48:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-03-09 22:48:16] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 0 ms to minimize.
[2023-03-09 22:48:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2023-03-09 22:48:17] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 0 ms to minimize.
[2023-03-09 22:48:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-03-09 22:48:17] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 0 ms to minimize.
[2023-03-09 22:48:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2023-03-09 22:48:18] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 1 ms to minimize.
[2023-03-09 22:48:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2023-03-09 22:48:19] [INFO ] Deduced a trap composed of 48 places in 139 ms of which 0 ms to minimize.
[2023-03-09 22:48:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2023-03-09 22:48:20] [INFO ] Deduced a trap composed of 44 places in 174 ms of which 0 ms to minimize.
[2023-03-09 22:48:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2023-03-09 22:48:20] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 0 ms to minimize.
[2023-03-09 22:48:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-03-09 22:48:21] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 1 ms to minimize.
[2023-03-09 22:48:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2023-03-09 22:48:22] [INFO ] Deduced a trap composed of 50 places in 125 ms of which 1 ms to minimize.
[2023-03-09 22:48:22] [INFO ] Deduced a trap composed of 52 places in 125 ms of which 0 ms to minimize.
[2023-03-09 22:48:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 379 ms
[2023-03-09 22:48:23] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 1 ms to minimize.
[2023-03-09 22:48:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2023-03-09 22:48:23] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 0 ms to minimize.
[2023-03-09 22:48:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2023-03-09 22:48:24] [INFO ] Deduced a trap composed of 52 places in 204 ms of which 1 ms to minimize.
[2023-03-09 22:48:24] [INFO ] Deduced a trap composed of 44 places in 182 ms of which 1 ms to minimize.
[2023-03-09 22:48:24] [INFO ] Deduced a trap composed of 54 places in 192 ms of which 1 ms to minimize.
[2023-03-09 22:48:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 789 ms
[2023-03-09 22:48:26] [INFO ] Deduced a trap composed of 60 places in 112 ms of which 0 ms to minimize.
[2023-03-09 22:48:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2023-03-09 22:48:27] [INFO ] Deduced a trap composed of 56 places in 150 ms of which 1 ms to minimize.
[2023-03-09 22:48:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2023-03-09 22:48:28] [INFO ] Deduced a trap composed of 59 places in 148 ms of which 1 ms to minimize.
[2023-03-09 22:48:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2023-03-09 22:48:29] [INFO ] Deduced a trap composed of 63 places in 108 ms of which 1 ms to minimize.
[2023-03-09 22:48:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2023-03-09 22:48:29] [INFO ] Deduced a trap composed of 60 places in 116 ms of which 1 ms to minimize.
[2023-03-09 22:48:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2023-03-09 22:48:30] [INFO ] Deduced a trap composed of 64 places in 129 ms of which 0 ms to minimize.
[2023-03-09 22:48:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2023-03-09 22:48:31] [INFO ] Deduced a trap composed of 68 places in 95 ms of which 0 ms to minimize.
[2023-03-09 22:48:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2023-03-09 22:48:31] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 1 ms to minimize.
[2023-03-09 22:48:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-03-09 22:48:32] [INFO ] Deduced a trap composed of 67 places in 154 ms of which 1 ms to minimize.
[2023-03-09 22:48:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2023-03-09 22:48:34] [INFO ] Deduced a trap composed of 69 places in 97 ms of which 1 ms to minimize.
[2023-03-09 22:48:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-03-09 22:48:34] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 1 ms to minimize.
[2023-03-09 22:48:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2023-03-09 22:48:34] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 0 ms to minimize.
[2023-03-09 22:48:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2023-03-09 22:48:35] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 1 ms to minimize.
[2023-03-09 22:48:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-03-09 22:48:36] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 0 ms to minimize.
[2023-03-09 22:48:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-03-09 22:48:36] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 0 ms to minimize.
[2023-03-09 22:48:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2023-03-09 22:48:37] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 0 ms to minimize.
[2023-03-09 22:48:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2023-03-09 22:48:37] [INFO ] Deduced a trap composed of 78 places in 83 ms of which 0 ms to minimize.
[2023-03-09 22:48:40] [INFO ] Deduced a trap composed of 80 places in 69 ms of which 0 ms to minimize.
[2023-03-09 22:48:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 7078 ms
[2023-03-09 22:49:23] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 0 ms to minimize.
[2023-03-09 22:49:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1314 ms
[2023-03-09 22:49:24] [INFO ] After 146904ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :341
Attempting to minimize the solution found.
Minimization took 53717 ms.
[2023-03-09 22:50:18] [INFO ] After 225012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :340
Parikh walk visited 0 properties in 30001 ms.
Support contains 460 out of 535 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 535/535 places, 518/518 transitions.
Applied a total of 0 rules in 28 ms. Remains 535 /535 variables (removed 0) and now considering 518/518 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 535/535 places, 518/518 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 535/535 places, 518/518 transitions.
Applied a total of 0 rules in 27 ms. Remains 535 /535 variables (removed 0) and now considering 518/518 (removed 0) transitions.
[2023-03-09 22:50:48] [INFO ] Invariant cache hit.
[2023-03-09 22:50:48] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-03-09 22:50:48] [INFO ] Invariant cache hit.
[2023-03-09 22:50:49] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-09 22:50:50] [INFO ] Implicit Places using invariants and state equation in 1487 ms returned []
Implicit Place search using SMT with State Equation took 1829 ms to find 0 implicit places.
[2023-03-09 22:50:50] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-09 22:50:50] [INFO ] Invariant cache hit.
[2023-03-09 22:50:50] [INFO ] Dead Transitions using invariants and state equation in 473 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2372 ms. Remains : 535/535 places, 518/518 transitions.
Incomplete random walk after 100000 steps, including 14446 resets, run finished after 6990 ms. (steps per millisecond=14 ) properties (out of 460) seen :0
Running SMT prover for 460 properties.
[2023-03-09 22:50:57] [INFO ] Invariant cache hit.
[2023-03-09 22:50:58] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 22:50:58] [INFO ] [Real]Absence check using 2 positive and 92 generalized place invariants in 65 ms returned sat
[2023-03-09 22:51:02] [INFO ] After 3882ms SMT Verify possible using state equation in real domain returned unsat :0 sat :460
[2023-03-09 22:51:02] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-09 22:51:15] [INFO ] After 12719ms SMT Verify possible using 44 Read/Feed constraints in real domain returned unsat :0 sat :460
[2023-03-09 22:51:15] [INFO ] Deduced a trap composed of 12 places in 260 ms of which 1 ms to minimize.
[2023-03-09 22:51:15] [INFO ] Deduced a trap composed of 18 places in 247 ms of which 1 ms to minimize.
[2023-03-09 22:51:16] [INFO ] Deduced a trap composed of 20 places in 273 ms of which 1 ms to minimize.
[2023-03-09 22:51:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 961 ms
[2023-03-09 22:51:16] [INFO ] Deduced a trap composed of 16 places in 283 ms of which 0 ms to minimize.
[2023-03-09 22:51:16] [INFO ] Deduced a trap composed of 20 places in 269 ms of which 2 ms to minimize.
[2023-03-09 22:51:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 697 ms
[2023-03-09 22:51:17] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 1 ms to minimize.
[2023-03-09 22:51:17] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 0 ms to minimize.
[2023-03-09 22:51:17] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 2 ms to minimize.
[2023-03-09 22:51:17] [INFO ] Deduced a trap composed of 28 places in 230 ms of which 1 ms to minimize.
[2023-03-09 22:51:18] [INFO ] Deduced a trap composed of 30 places in 230 ms of which 1 ms to minimize.
[2023-03-09 22:51:18] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 1 ms to minimize.
[2023-03-09 22:51:18] [INFO ] Deduced a trap composed of 36 places in 194 ms of which 1 ms to minimize.
[2023-03-09 22:51:18] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 1 ms to minimize.
[2023-03-09 22:51:19] [INFO ] Deduced a trap composed of 54 places in 144 ms of which 1 ms to minimize.
[2023-03-09 22:51:19] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 0 ms to minimize.
[2023-03-09 22:51:19] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 1 ms to minimize.
[2023-03-09 22:51:19] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 1 ms to minimize.
[2023-03-09 22:51:19] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2489 ms
[2023-03-09 22:51:23] [INFO ] Deduced a trap composed of 20 places in 275 ms of which 1 ms to minimize.
[2023-03-09 22:51:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 366 ms
[2023-03-09 22:51:24] [INFO ] Deduced a trap composed of 24 places in 229 ms of which 1 ms to minimize.
[2023-03-09 22:51:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 308 ms
[2023-03-09 22:51:26] [INFO ] Deduced a trap composed of 16 places in 284 ms of which 1 ms to minimize.
[2023-03-09 22:51:26] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 0 ms to minimize.
[2023-03-09 22:51:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 599 ms
[2023-03-09 22:51:26] [INFO ] Deduced a trap composed of 24 places in 229 ms of which 1 ms to minimize.
[2023-03-09 22:51:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 304 ms
[2023-03-09 22:51:27] [INFO ] Deduced a trap composed of 24 places in 248 ms of which 1 ms to minimize.
[2023-03-09 22:51:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 346 ms
[2023-03-09 22:51:28] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 1 ms to minimize.
[2023-03-09 22:51:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2023-03-09 22:51:31] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 2 ms to minimize.
[2023-03-09 22:51:31] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 0 ms to minimize.
[2023-03-09 22:51:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 454 ms
[2023-03-09 22:51:31] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 1 ms to minimize.
[2023-03-09 22:51:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2023-03-09 22:51:32] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 0 ms to minimize.
[2023-03-09 22:51:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2023-03-09 22:51:35] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 1 ms to minimize.
[2023-03-09 22:51:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2023-03-09 22:51:36] [INFO ] Deduced a trap composed of 48 places in 175 ms of which 1 ms to minimize.
[2023-03-09 22:51:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2023-03-09 22:51:37] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 2 ms to minimize.
[2023-03-09 22:51:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2023-03-09 22:51:39] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 6 ms to minimize.
[2023-03-09 22:51:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2023-03-09 22:51:40] [INFO ] Deduced a trap composed of 48 places in 159 ms of which 0 ms to minimize.
[2023-03-09 22:51:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2023-03-09 22:51:41] [INFO ] Deduced a trap composed of 56 places in 122 ms of which 1 ms to minimize.
[2023-03-09 22:51:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2023-03-09 22:51:42] [INFO ] Deduced a trap composed of 36 places in 210 ms of which 1 ms to minimize.
[2023-03-09 22:51:42] [INFO ] Deduced a trap composed of 68 places in 136 ms of which 1 ms to minimize.
[2023-03-09 22:51:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 493 ms
[2023-03-09 22:51:43] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 0 ms to minimize.
[2023-03-09 22:51:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2023-03-09 22:51:44] [INFO ] Deduced a trap composed of 60 places in 112 ms of which 0 ms to minimize.
[2023-03-09 22:51:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2023-03-09 22:51:45] [INFO ] Deduced a trap composed of 60 places in 118 ms of which 1 ms to minimize.
[2023-03-09 22:51:45] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 1 ms to minimize.
[2023-03-09 22:51:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 383 ms
[2023-03-09 22:51:46] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 1 ms to minimize.
[2023-03-09 22:51:46] [INFO ] Deduced a trap composed of 52 places in 175 ms of which 1 ms to minimize.
[2023-03-09 22:51:46] [INFO ] Deduced a trap composed of 52 places in 181 ms of which 1 ms to minimize.
[2023-03-09 22:51:46] [INFO ] Deduced a trap composed of 56 places in 137 ms of which 0 ms to minimize.
[2023-03-09 22:51:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 916 ms
[2023-03-09 22:51:47] [INFO ] Deduced a trap composed of 56 places in 145 ms of which 1 ms to minimize.
[2023-03-09 22:51:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2023-03-09 22:51:49] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 1 ms to minimize.
[2023-03-09 22:51:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2023-03-09 22:51:50] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 0 ms to minimize.
[2023-03-09 22:51:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2023-03-09 22:51:52] [INFO ] Deduced a trap composed of 68 places in 95 ms of which 0 ms to minimize.
[2023-03-09 22:51:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2023-03-09 22:51:52] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2023-03-09 22:51:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-03-09 22:51:53] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 1 ms to minimize.
[2023-03-09 22:51:53] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 1 ms to minimize.
[2023-03-09 22:51:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 312 ms
[2023-03-09 22:51:54] [INFO ] Deduced a trap composed of 40 places in 185 ms of which 1 ms to minimize.
[2023-03-09 22:51:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2023-03-09 22:52:07] [INFO ] Deduced a trap composed of 44 places in 176 ms of which 1 ms to minimize.
[2023-03-09 22:52:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
[2023-03-09 22:52:09] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 0 ms to minimize.
[2023-03-09 22:52:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2023-03-09 22:52:13] [INFO ] Deduced a trap composed of 75 places in 147 ms of which 1 ms to minimize.
[2023-03-09 22:52:14] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 0 ms to minimize.
[2023-03-09 22:52:14] [INFO ] Deduced a trap composed of 68 places in 139 ms of which 0 ms to minimize.
[2023-03-09 22:52:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 643 ms
[2023-03-09 22:52:20] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 1 ms to minimize.
[2023-03-09 22:52:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
[2023-03-09 22:52:24] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 1 ms to minimize.
[2023-03-09 22:52:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2023-03-09 22:52:25] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 1 ms to minimize.
[2023-03-09 22:52:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2023-03-09 22:52:25] [INFO ] After 83149ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:460
[2023-03-09 22:52:25] [INFO ] After 87672ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:460
[2023-03-09 22:52:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 22:52:26] [INFO ] [Nat]Absence check using 2 positive and 92 generalized place invariants in 87 ms returned sat
[2023-03-09 22:52:30] [INFO ] After 4236ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :460
[2023-03-09 22:53:06] [INFO ] After 35489ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :459
[2023-03-09 22:53:06] [INFO ] Deduced a trap composed of 16 places in 207 ms of which 1 ms to minimize.
[2023-03-09 22:53:06] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 0 ms to minimize.
[2023-03-09 22:53:07] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 0 ms to minimize.
[2023-03-09 22:53:07] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 0 ms to minimize.
[2023-03-09 22:53:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1610 ms
[2023-03-09 22:53:08] [INFO ] Deduced a trap composed of 32 places in 224 ms of which 0 ms to minimize.
[2023-03-09 22:53:08] [INFO ] Deduced a trap composed of 24 places in 213 ms of which 1 ms to minimize.
[2023-03-09 22:53:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 550 ms
[2023-03-09 22:53:11] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 0 ms to minimize.
[2023-03-09 22:53:11] [INFO ] Deduced a trap composed of 22 places in 277 ms of which 1 ms to minimize.
[2023-03-09 22:53:11] [INFO ] Deduced a trap composed of 20 places in 289 ms of which 1 ms to minimize.
[2023-03-09 22:53:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 869 ms
[2023-03-09 22:53:12] [INFO ] Deduced a trap composed of 16 places in 239 ms of which 1 ms to minimize.
[2023-03-09 22:53:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 292 ms
[2023-03-09 22:53:14] [INFO ] Deduced a trap composed of 16 places in 214 ms of which 1 ms to minimize.
[2023-03-09 22:53:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2023-03-09 22:53:15] [INFO ] Deduced a trap composed of 26 places in 285 ms of which 1 ms to minimize.
[2023-03-09 22:53:15] [INFO ] Deduced a trap composed of 24 places in 266 ms of which 1 ms to minimize.
[2023-03-09 22:53:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 643 ms
[2023-03-09 22:53:16] [INFO ] Deduced a trap composed of 20 places in 290 ms of which 1 ms to minimize.
[2023-03-09 22:53:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 380 ms
[2023-03-09 22:53:17] [INFO ] Deduced a trap composed of 24 places in 276 ms of which 1 ms to minimize.
[2023-03-09 22:53:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 375 ms
[2023-03-09 22:53:18] [INFO ] Deduced a trap composed of 30 places in 276 ms of which 1 ms to minimize.
[2023-03-09 22:53:18] [INFO ] Deduced a trap composed of 28 places in 271 ms of which 1 ms to minimize.
[2023-03-09 22:53:18] [INFO ] Deduced a trap composed of 20 places in 273 ms of which 1 ms to minimize.
[2023-03-09 22:53:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 930 ms
[2023-03-09 22:53:19] [INFO ] Deduced a trap composed of 34 places in 249 ms of which 1 ms to minimize.
[2023-03-09 22:53:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
[2023-03-09 22:53:21] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 0 ms to minimize.
[2023-03-09 22:53:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 307 ms
[2023-03-09 22:53:22] [INFO ] Deduced a trap composed of 36 places in 238 ms of which 1 ms to minimize.
[2023-03-09 22:53:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 297 ms
[2023-03-09 22:53:22] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 0 ms to minimize.
[2023-03-09 22:53:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2023-03-09 22:53:23] [INFO ] Deduced a trap composed of 40 places in 221 ms of which 1 ms to minimize.
[2023-03-09 22:53:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2023-03-09 22:53:24] [INFO ] Deduced a trap composed of 42 places in 222 ms of which 0 ms to minimize.
[2023-03-09 22:53:24] [INFO ] Deduced a trap composed of 40 places in 208 ms of which 1 ms to minimize.
[2023-03-09 22:53:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 521 ms
[2023-03-09 22:53:24] [INFO ] Deduced a trap composed of 36 places in 204 ms of which 0 ms to minimize.
[2023-03-09 22:53:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2023-03-09 22:53:26] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 1 ms to minimize.
[2023-03-09 22:53:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2023-03-09 22:53:26] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 1 ms to minimize.
[2023-03-09 22:53:26] [INFO ] Deduced a trap composed of 46 places in 229 ms of which 1 ms to minimize.
[2023-03-09 22:53:27] [INFO ] Deduced a trap composed of 44 places in 225 ms of which 1 ms to minimize.
[2023-03-09 22:53:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 797 ms
[2023-03-09 22:53:28] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 1 ms to minimize.
[2023-03-09 22:53:28] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 1 ms to minimize.
[2023-03-09 22:53:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 392 ms
[2023-03-09 22:53:29] [INFO ] Deduced a trap composed of 28 places in 214 ms of which 1 ms to minimize.
[2023-03-09 22:53:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 424 ms
[2023-03-09 22:53:30] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 0 ms to minimize.
[2023-03-09 22:53:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 351 ms
[2023-03-09 22:53:32] [INFO ] Deduced a trap composed of 50 places in 159 ms of which 0 ms to minimize.
[2023-03-09 22:53:32] [INFO ] Deduced a trap composed of 52 places in 151 ms of which 1 ms to minimize.
[2023-03-09 22:53:32] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 0 ms to minimize.
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 15705312 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16132044 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="marciexred"
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 marciexred"
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 r152-smll-167819439200302"
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 ;