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.r307-tall-167873961400442.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 itstools
Input is PolyORBNT-COL-S10J80, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tall-167873961400442
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 9.1K Feb 26 01:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 01:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 00:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 00:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 03:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 03:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Feb 26 02:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 95K Mar 5 18:23 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 1678868219014

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=itstools
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-COL-S10J80
Not applying reductions.
Model is COL
QuasiLiveness COL
Running Version 202303021504
[2023-03-15 08:17:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-15 08:17:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 08:17:00] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 08:17:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 08:17:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 688 ms
[2023-03-15 08:17:01] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1694 PT places and 13742.0 transition bindings in 24 ms.
[2023-03-15 08:17:01] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 13580 transitions 119919 arcs in 210 ms.
[2023-03-15 08:17:01] [INFO ] Unfolded 38 HLPN properties in 4 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-15 08:17:01] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-15 08:17:01] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-15 08:17:01] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 80 places in 41 ms
Reduce places removed 80 places and 80 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
[2023-03-15 08:17:02] [INFO ] Flatten gal took : 429 ms
[2023-03-15 08:17:02] [INFO ] Flatten gal took : 279 ms
[2023-03-15 08:17:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16611687334310190679.gal : 94 ms
[2023-03-15 08:17:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5888228418414685940.prop : 23 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16611687334310190679.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5888228418414685940.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5888228418414685940.prop.
Incomplete random walk after 10000 steps, including 559 resets, run finished after 1888 ms. (steps per millisecond=5 ) properties (out of 36) seen :6
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=8 ) properties (out of 30) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :2
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 111 ms. (steps per millisecond=9 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
[2023-03-15 08:17:04] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
// Phase 1: matrix 3381 rows 1614 cols
[2023-03-15 08:17:04] [INFO ] Computed 192 place invariants in 209 ms
[2023-03-15 08:17:08] [INFO ] [Real]Absence check using 185 positive place invariants in 74 ms returned sat
[2023-03-15 08:17:08] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 45 ms returned sat
Reachability property qltransition_31 is true.
SDD proceeding with computation,35 properties remain. new max is 2
SDD size :1 after 2
Reachability property qltransition_32 is true.
SDD proceeding with computation,34 properties remain. new max is 2
SDD size :2 after 3
Reachability property qltransition_35 is true.
Reachability property qltransition_16 is true.
SDD proceeding with computation,32 properties remain. new max is 2
SDD size :3 after 6
Reachability property qltransition_27 is true.
Reachability property qltransition_20 is true.
Reachability property qltransition_15 is true.
SDD proceeding with computation,29 properties remain. new max is 2
SDD size :6 after 14
Reachability property qltransition_21 is true.
Reachability property qltransition_6 is true.
SDD proceeding with computation,27 properties remain. new max is 2
SDD size :14 after 16
SDD proceeding with computation,27 properties remain. new max is 4
SDD size :16 after 17
SDD proceeding with computation,27 properties remain. new max is 8
SDD size :17 after 18
[2023-03-15 08:17:11] [INFO ] After 2535ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:23
[2023-03-15 08:17:11] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,27 properties remain. new max is 16
SDD size :18 after 19
SDD proceeding with computation,27 properties remain. new max is 32
SDD size :19 after 20
[2023-03-15 08:17:12] [INFO ] After 379ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2 real:23
SDD proceeding with computation,27 properties remain. new max is 64
SDD size :20 after 22
Reachability property qltransition_36 is true.
Reachability property qltransition_30 is true.
Reachability property qltransition_25 is true.
Reachability property qltransition_14 is true.
Reachability property qltransition_10 is true.
Reachability property qltransition_9 is true.
Reachability property qltransition_8 is true.
Reachability property qltransition_7 is true.
Reachability property qltransition_5 is true.
[2023-03-15 08:17:12] [INFO ] After 785ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:23
Attempting to minimize the solution found.
SDD proceeding with computation,18 properties remain. new max is 64
SDD size :22 after 42
Minimization took 290 ms.
[2023-03-15 08:17:12] [INFO ] After 5688ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:23
SDD proceeding with computation,18 properties remain. new max is 128
SDD size :42 after 51
[2023-03-15 08:17:13] [INFO ] [Nat]Absence check using 185 positive place invariants in 69 ms returned sat
[2023-03-15 08:17:13] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 48 ms returned sat
SDD proceeding with computation,18 properties remain. new max is 256
SDD size :51 after 60
SDD proceeding with computation,18 properties remain. new max is 512
SDD size :60 after 87
Reachability property qltransition_34 is true.
Reachability property qltransition_28 is true.
Reachability property qltransition_3 is true.
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :87 after 127
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :127 after 137
Reachability property qltransition_33 is true.
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :137 after 180
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :180 after 220
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :220 after 296
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :296 after 429
[2023-03-15 08:17:37] [INFO ] After 23211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.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-15 08:17:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 08:17:37] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2 real:23
Fused 25 Parikh solutions to 24 different solutions.
Parikh walk visited 0 properties in 1004 ms.
Support contains 269 out of 1614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1614/1614 places, 3390/3390 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 1604 transition count 3305
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 180 place count 1519 transition count 3305
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 83 Pre rules applied. Total rules applied 180 place count 1519 transition count 3222
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 346 place count 1436 transition count 3222
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 16 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 350 place count 1434 transition count 3220
Applied a total of 350 rules in 628 ms. Remains 1434 /1614 variables (removed 180) and now considering 3220/3390 (removed 170) transitions.
[2023-03-15 08:17:39] [INFO ] Flow matrix only has 3211 transitions (discarded 9 similar events)
// Phase 1: matrix 3211 rows 1434 cols
[2023-03-15 08:17:39] [INFO ] Computed 182 place invariants in 103 ms
[2023-03-15 08:17:41] [INFO ] Dead Transitions using invariants and state equation in 2229 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1434/1614 places, 2605/3390 transitions.
Applied a total of 0 rules in 79 ms. Remains 1434 /1434 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2942 ms. Remains : 1434/1614 places, 2605/3390 transitions.
Incomplete random walk after 1000000 steps, including 64365 resets, run finished after 9862 ms. (steps per millisecond=101 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 1000001 steps, including 6442 resets, run finished after 2178 ms. (steps per millisecond=459 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:17:53] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
// Phase 1: matrix 2596 rows 1434 cols
[2023-03-15 08:17:53] [INFO ] Computed 182 place invariants in 65 ms
[2023-03-15 08:17:54] [INFO ] [Real]Absence check using 175 positive place invariants in 48 ms returned sat
[2023-03-15 08:17:54] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 46 ms returned sat
[2023-03-15 08:17:55] [INFO ] After 1149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:17:55] [INFO ] [Nat]Absence check using 175 positive place invariants in 47 ms returned sat
[2023-03-15 08:17:55] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 48 ms returned sat
[2023-03-15 08:17:56] [INFO ] After 1003ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:17:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:17:56] [INFO ] After 188ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 08:17:57] [INFO ] Deduced a trap composed of 567 places in 787 ms of which 1 ms to minimize.
[2023-03-15 08:17:58] [INFO ] Deduced a trap composed of 589 places in 623 ms of which 11 ms to minimize.
[2023-03-15 08:17:58] [INFO ] Deduced a trap composed of 593 places in 602 ms of which 2 ms to minimize.
[2023-03-15 08:18:00] [INFO ] Deduced a trap composed of 577 places in 879 ms of which 2 ms to minimize.
[2023-03-15 08:18:01] [INFO ] Deduced a trap composed of 589 places in 688 ms of which 1 ms to minimize.
[2023-03-15 08:18:01] [INFO ] Deduced a trap composed of 585 places in 583 ms of which 1 ms to minimize.
[2023-03-15 08:18:02] [INFO ] Deduced a trap composed of 593 places in 572 ms of which 1 ms to minimize.
[2023-03-15 08:18:03] [INFO ] Deduced a trap composed of 579 places in 593 ms of which 1 ms to minimize.
[2023-03-15 08:18:04] [INFO ] Deduced a trap composed of 585 places in 575 ms of which 1 ms to minimize.
[2023-03-15 08:18:04] [INFO ] Deduced a trap composed of 599 places in 586 ms of which 1 ms to minimize.
[2023-03-15 08:18:05] [INFO ] Deduced a trap composed of 579 places in 604 ms of which 1 ms to minimize.
[2023-03-15 08:18:06] [INFO ] Deduced a trap composed of 603 places in 575 ms of which 1 ms to minimize.
[2023-03-15 08:18:06] [INFO ] Deduced a trap composed of 583 places in 589 ms of which 1 ms to minimize.
[2023-03-15 08:18:07] [INFO ] Deduced a trap composed of 585 places in 604 ms of which 1 ms to minimize.
[2023-03-15 08:18:08] [INFO ] Deduced a trap composed of 577 places in 584 ms of which 1 ms to minimize.
[2023-03-15 08:18:09] [INFO ] Deduced a trap composed of 577 places in 592 ms of which 1 ms to minimize.
[2023-03-15 08:18:10] [INFO ] Deduced a trap composed of 587 places in 602 ms of which 1 ms to minimize.
[2023-03-15 08:18:10] [INFO ] Deduced a trap composed of 579 places in 627 ms of which 1 ms to minimize.
[2023-03-15 08:18:11] [INFO ] Deduced a trap composed of 579 places in 629 ms of which 2 ms to minimize.
[2023-03-15 08:18:12] [INFO ] Deduced a trap composed of 581 places in 633 ms of which 1 ms to minimize.
[2023-03-15 08:18:13] [INFO ] Deduced a trap composed of 591 places in 611 ms of which 1 ms to minimize.
[2023-03-15 08:18:13] [INFO ] Deduced a trap composed of 595 places in 606 ms of which 1 ms to minimize.
[2023-03-15 08:18:14] [INFO ] Deduced a trap composed of 583 places in 619 ms of which 1 ms to minimize.
[2023-03-15 08:18:15] [INFO ] Deduced a trap composed of 579 places in 623 ms of which 1 ms to minimize.
[2023-03-15 08:18:16] [INFO ] Deduced a trap composed of 579 places in 601 ms of which 1 ms to minimize.
[2023-03-15 08:18:17] [INFO ] Deduced a trap composed of 581 places in 611 ms of which 1 ms to minimize.
Reachability property qltransition_24 is true.
Reachability property qltransition_19 is true.
[2023-03-15 08:18:18] [INFO ] Deduced a trap composed of 565 places in 612 ms of which 1 ms to minimize.
[2023-03-15 08:18:19] [INFO ] Deduced a trap composed of 603 places in 594 ms of which 1 ms to minimize.
[2023-03-15 08:18:20] [INFO ] Deduced a trap composed of 585 places in 628 ms of which 1 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 8192
SDD size :429 after 1502
[2023-03-15 08:18:21] [INFO ] Deduced a trap composed of 575 places in 609 ms of which 7 ms to minimize.
[2023-03-15 08:18:22] [INFO ] Deduced a trap composed of 573 places in 591 ms of which 1 ms to minimize.
[2023-03-15 08:18:23] [INFO ] Deduced a trap composed of 591 places in 587 ms of which 1 ms to minimize.
[2023-03-15 08:18:24] [INFO ] Deduced a trap composed of 581 places in 593 ms of which 2 ms to minimize.
[2023-03-15 08:18:25] [INFO ] Deduced a trap composed of 591 places in 603 ms of which 5 ms to minimize.
[2023-03-15 08:18:26] [INFO ] Deduced a trap composed of 573 places in 585 ms of which 2 ms to minimize.
[2023-03-15 08:18:27] [INFO ] Deduced a trap composed of 573 places in 604 ms of which 2 ms to minimize.
[2023-03-15 08:18:27] [INFO ] Deduced a trap composed of 585 places in 593 ms of which 1 ms to minimize.
[2023-03-15 08:18:28] [INFO ] Deduced a trap composed of 573 places in 587 ms of which 1 ms to minimize.
[2023-03-15 08:18:29] [INFO ] Deduced a trap composed of 573 places in 600 ms of which 2 ms to minimize.
[2023-03-15 08:18:30] [INFO ] Deduced a trap composed of 591 places in 597 ms of which 1 ms to minimize.
[2023-03-15 08:18:30] [INFO ] Deduced a trap composed of 573 places in 602 ms of which 1 ms to minimize.
[2023-03-15 08:18:31] [INFO ] Deduced a trap composed of 581 places in 599 ms of which 1 ms to minimize.
[2023-03-15 08:18:32] [INFO ] Deduced a trap composed of 577 places in 626 ms of which 18 ms to minimize.
[2023-03-15 08:18:33] [INFO ] Deduced a trap composed of 591 places in 601 ms of which 1 ms to minimize.
[2023-03-15 08:18:34] [INFO ] Deduced a trap composed of 573 places in 601 ms of which 1 ms to minimize.
[2023-03-15 08:18:34] [INFO ] Deduced a trap composed of 573 places in 593 ms of which 1 ms to minimize.
[2023-03-15 08:18:35] [INFO ] Deduced a trap composed of 581 places in 599 ms of which 3 ms to minimize.
[2023-03-15 08:18:36] [INFO ] Deduced a trap composed of 591 places in 590 ms of which 1 ms to minimize.
[2023-03-15 08:18:37] [INFO ] Deduced a trap composed of 589 places in 601 ms of which 1 ms to minimize.
[2023-03-15 08:18:38] [INFO ] Deduced a trap composed of 575 places in 606 ms of which 2 ms to minimize.
[2023-03-15 08:18:39] [INFO ] Deduced a trap composed of 581 places in 614 ms of which 1 ms to minimize.
[2023-03-15 08:18:40] [INFO ] Deduced a trap composed of 577 places in 617 ms of which 1 ms to minimize.
[2023-03-15 08:18:41] [INFO ] Deduced a trap composed of 585 places in 597 ms of which 2 ms to minimize.
[2023-03-15 08:18:42] [INFO ] Deduced a trap composed of 583 places in 633 ms of which 1 ms to minimize.
[2023-03-15 08:18:45] [INFO ] Deduced a trap composed of 593 places in 619 ms of which 1 ms to minimize.
[2023-03-15 08:18:45] [INFO ] Deduced a trap composed of 583 places in 603 ms of which 1 ms to minimize.
[2023-03-15 08:18:47] [INFO ] Deduced a trap composed of 577 places in 647 ms of which 2 ms to minimize.
[2023-03-15 08:18:48] [INFO ] Deduced a trap composed of 585 places in 611 ms of which 1 ms to minimize.
[2023-03-15 08:18:49] [INFO ] Deduced a trap composed of 583 places in 586 ms of which 1 ms to minimize.
[2023-03-15 08:18:50] [INFO ] Deduced a trap composed of 593 places in 586 ms of which 1 ms to minimize.
[2023-03-15 08:18:52] [INFO ] Deduced a trap composed of 587 places in 584 ms of which 1 ms to minimize.
[2023-03-15 08:18:52] [INFO ] Deduced a trap composed of 577 places in 599 ms of which 2 ms to minimize.
[2023-03-15 08:18:53] [INFO ] Deduced a trap composed of 589 places in 645 ms of which 1 ms to minimize.
[2023-03-15 08:18:54] [INFO ] Deduced a trap composed of 579 places in 621 ms of which 1 ms to minimize.
[2023-03-15 08:19:01] [INFO ] Deduced a trap composed of 579 places in 616 ms of which 1 ms to minimize.
[2023-03-15 08:19:02] [INFO ] Deduced a trap composed of 565 places in 602 ms of which 16 ms to minimize.
[2023-03-15 08:19:02] [INFO ] Deduced a trap composed of 577 places in 595 ms of which 10 ms to minimize.
[2023-03-15 08:19:03] [INFO ] Deduced a trap composed of 595 places in 620 ms of which 2 ms to minimize.
[2023-03-15 08:19:04] [INFO ] Deduced a trap composed of 591 places in 601 ms of which 1 ms to minimize.
[2023-03-15 08:19:05] [INFO ] Deduced a trap composed of 573 places in 598 ms of which 1 ms to minimize.
[2023-03-15 08:19:06] [INFO ] Deduced a trap composed of 585 places in 651 ms of which 1 ms to minimize.
[2023-03-15 08:19:06] [INFO ] Deduced a trap composed of 579 places in 606 ms of which 1 ms to minimize.
[2023-03-15 08:19:09] [INFO ] Deduced a trap composed of 585 places in 626 ms of which 1 ms to minimize.
[2023-03-15 08:19:10] [INFO ] Deduced a trap composed of 585 places in 610 ms of which 1 ms to minimize.
[2023-03-15 08:19:11] [INFO ] Deduced a trap composed of 607 places in 598 ms of which 1 ms to minimize.
[2023-03-15 08:19:16] [INFO ] Deduced a trap composed of 583 places in 596 ms of which 1 ms to minimize.
[2023-03-15 08:19:22] [INFO ] Deduced a trap composed of 579 places in 634 ms of which 1 ms to minimize.
[2023-03-15 08:19:23] [INFO ] Deduced a trap composed of 577 places in 602 ms of which 1 ms to minimize.
[2023-03-15 08:19:23] [INFO ] Deduced a trap composed of 593 places in 599 ms of which 1 ms to minimize.
Reachability property qltransition_13 is true.
Reachability property qltransition_4 is true.
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :1502 after 4137
[2023-03-15 08:19:32] [INFO ] Trap strengthening (SAT) tested/added 79/79 trap constraints in 96170 ms
[2023-03-15 08:19:32] [INFO ] After 96560ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 08:19:32] [INFO ] After 97835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 1434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1434/1434 places, 2605/2605 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 1434 transition count 2604
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1433 transition count 2604
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 1433 transition count 2602
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 1431 transition count 2602
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1430 transition count 2601
Applied a total of 8 rules in 488 ms. Remains 1430 /1434 variables (removed 4) and now considering 2601/2605 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 488 ms. Remains : 1430/1434 places, 2601/2605 transitions.
Incomplete random walk after 1000000 steps, including 72639 resets, run finished after 11852 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6294 resets, run finished after 2372 ms. (steps per millisecond=421 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3271103 steps, run timeout after 42001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 3271103 steps, saw 543727 distinct states, run finished after 42002 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:20:29] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2023-03-15 08:20:29] [INFO ] Computed 182 place invariants in 52 ms
[2023-03-15 08:20:30] [INFO ] [Real]Absence check using 175 positive place invariants in 143 ms returned sat
[2023-03-15 08:20:30] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-15 08:20:30] [INFO ] After 344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:20:30] [INFO ] [Nat]Absence check using 175 positive place invariants in 45 ms returned sat
[2023-03-15 08:20:30] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 35 ms returned sat
[2023-03-15 08:20:31] [INFO ] After 949ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:20:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:20:32] [INFO ] After 1176ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 08:20:33] [INFO ] Deduced a trap composed of 568 places in 612 ms of which 1 ms to minimize.
[2023-03-15 08:20:33] [INFO ] Deduced a trap composed of 564 places in 615 ms of which 1 ms to minimize.
[2023-03-15 08:20:34] [INFO ] Deduced a trap composed of 570 places in 609 ms of which 1 ms to minimize.
[2023-03-15 08:20:35] [INFO ] Deduced a trap composed of 572 places in 578 ms of which 2 ms to minimize.
[2023-03-15 08:20:35] [INFO ] Deduced a trap composed of 578 places in 603 ms of which 1 ms to minimize.
[2023-03-15 08:20:36] [INFO ] Deduced a trap composed of 560 places in 595 ms of which 1 ms to minimize.
[2023-03-15 08:20:37] [INFO ] Deduced a trap composed of 566 places in 616 ms of which 1 ms to minimize.
[2023-03-15 08:20:38] [INFO ] Deduced a trap composed of 584 places in 666 ms of which 2 ms to minimize.
[2023-03-15 08:20:39] [INFO ] Deduced a trap composed of 576 places in 641 ms of which 1 ms to minimize.
[2023-03-15 08:20:40] [INFO ] Deduced a trap composed of 575 places in 662 ms of which 2 ms to minimize.
[2023-03-15 08:20:40] [INFO ] Deduced a trap composed of 576 places in 662 ms of which 1 ms to minimize.
[2023-03-15 08:20:41] [INFO ] Deduced a trap composed of 583 places in 654 ms of which 1 ms to minimize.
[2023-03-15 08:20:42] [INFO ] Deduced a trap composed of 574 places in 639 ms of which 1 ms to minimize.
[2023-03-15 08:20:43] [INFO ] Deduced a trap composed of 584 places in 651 ms of which 1 ms to minimize.
[2023-03-15 08:20:43] [INFO ] Deduced a trap composed of 572 places in 652 ms of which 1 ms to minimize.
[2023-03-15 08:20:44] [INFO ] Deduced a trap composed of 574 places in 655 ms of which 2 ms to minimize.
[2023-03-15 08:20:45] [INFO ] Deduced a trap composed of 580 places in 648 ms of which 1 ms to minimize.
[2023-03-15 08:20:46] [INFO ] Deduced a trap composed of 584 places in 647 ms of which 1 ms to minimize.
[2023-03-15 08:20:46] [INFO ] Deduced a trap composed of 576 places in 647 ms of which 1 ms to minimize.
[2023-03-15 08:20:47] [INFO ] Deduced a trap composed of 579 places in 660 ms of which 1 ms to minimize.
[2023-03-15 08:20:48] [INFO ] Deduced a trap composed of 568 places in 640 ms of which 1 ms to minimize.
[2023-03-15 08:20:49] [INFO ] Deduced a trap composed of 579 places in 659 ms of which 1 ms to minimize.
[2023-03-15 08:20:50] [INFO ] Deduced a trap composed of 579 places in 641 ms of which 1 ms to minimize.
[2023-03-15 08:20:51] [INFO ] Deduced a trap composed of 566 places in 623 ms of which 1 ms to minimize.
[2023-03-15 08:20:52] [INFO ] Deduced a trap composed of 578 places in 606 ms of which 1 ms to minimize.
[2023-03-15 08:20:53] [INFO ] Deduced a trap composed of 572 places in 604 ms of which 1 ms to minimize.
[2023-03-15 08:20:54] [INFO ] Deduced a trap composed of 576 places in 604 ms of which 1 ms to minimize.
[2023-03-15 08:20:55] [INFO ] Deduced a trap composed of 574 places in 589 ms of which 1 ms to minimize.
[2023-03-15 08:20:55] [INFO ] Deduced a trap composed of 586 places in 593 ms of which 1 ms to minimize.
[2023-03-15 08:21:05] [INFO ] Trap strengthening (SAT) tested/added 29/29 trap constraints in 32516 ms
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :4137 after 5592
[2023-03-15 08:21:06] [INFO ] After 34765ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 08:21:06] [INFO ] After 35971ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 1430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1430/1430 places, 2601/2601 transitions.
Applied a total of 0 rules in 72 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 1430/1430 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1430/1430 places, 2601/2601 transitions.
Applied a total of 0 rules in 72 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-15 08:21:06] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 08:21:06] [INFO ] Invariant cache hit.
[2023-03-15 08:21:07] [INFO ] Implicit Places using invariants in 1449 ms returned []
[2023-03-15 08:21:07] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 08:21:07] [INFO ] Invariant cache hit.
[2023-03-15 08:21:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:21:19] [INFO ] Implicit Places using invariants and state equation in 11620 ms returned []
Implicit Place search using SMT with State Equation took 13086 ms to find 0 implicit places.
[2023-03-15 08:21:19] [INFO ] Redundant transitions in 146 ms returned []
[2023-03-15 08:21:19] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 08:21:19] [INFO ] Invariant cache hit.
[2023-03-15 08:21:20] [INFO ] Dead Transitions using invariants and state equation in 1395 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14722 ms. Remains : 1430/1430 places, 2601/2601 transitions.
Incomplete random walk after 100000 steps, including 7296 resets, run finished after 1314 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:21:22] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 08:21:22] [INFO ] Invariant cache hit.
[2023-03-15 08:21:22] [INFO ] [Real]Absence check using 175 positive place invariants in 62 ms returned sat
[2023-03-15 08:21:22] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 54 ms returned sat
[2023-03-15 08:21:23] [INFO ] After 876ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 08:21:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:21:23] [INFO ] After 322ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 08:21:23] [INFO ] After 460ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:21:23] [INFO ] After 1612ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:21:24] [INFO ] [Nat]Absence check using 175 positive place invariants in 38 ms returned sat
[2023-03-15 08:21:24] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 39 ms returned sat
[2023-03-15 08:21:24] [INFO ] After 693ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:21:25] [INFO ] After 629ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 08:21:26] [INFO ] Deduced a trap composed of 570 places in 597 ms of which 1 ms to minimize.
[2023-03-15 08:21:26] [INFO ] Deduced a trap composed of 558 places in 590 ms of which 1 ms to minimize.
[2023-03-15 08:21:27] [INFO ] Deduced a trap composed of 556 places in 711 ms of which 1 ms to minimize.
[2023-03-15 08:21:28] [INFO ] Deduced a trap composed of 568 places in 581 ms of which 1 ms to minimize.
[2023-03-15 08:21:29] [INFO ] Deduced a trap composed of 578 places in 582 ms of which 1 ms to minimize.
[2023-03-15 08:21:29] [INFO ] Deduced a trap composed of 574 places in 580 ms of which 1 ms to minimize.
[2023-03-15 08:21:30] [INFO ] Deduced a trap composed of 568 places in 589 ms of which 1 ms to minimize.
[2023-03-15 08:21:31] [INFO ] Deduced a trap composed of 588 places in 587 ms of which 1 ms to minimize.
[2023-03-15 08:21:31] [INFO ] Deduced a trap composed of 570 places in 584 ms of which 1 ms to minimize.
[2023-03-15 08:21:32] [INFO ] Deduced a trap composed of 574 places in 584 ms of which 2 ms to minimize.
[2023-03-15 08:21:33] [INFO ] Deduced a trap composed of 572 places in 629 ms of which 2 ms to minimize.
[2023-03-15 08:21:33] [INFO ] Deduced a trap composed of 566 places in 595 ms of which 1 ms to minimize.
[2023-03-15 08:21:34] [INFO ] Deduced a trap composed of 566 places in 620 ms of which 2 ms to minimize.
[2023-03-15 08:21:35] [INFO ] Deduced a trap composed of 570 places in 603 ms of which 2 ms to minimize.
[2023-03-15 08:21:36] [INFO ] Deduced a trap composed of 578 places in 604 ms of which 1 ms to minimize.
[2023-03-15 08:21:37] [INFO ] Deduced a trap composed of 574 places in 595 ms of which 1 ms to minimize.
[2023-03-15 08:21:37] [INFO ] Deduced a trap composed of 576 places in 584 ms of which 1 ms to minimize.
[2023-03-15 08:21:38] [INFO ] Deduced a trap composed of 572 places in 600 ms of which 1 ms to minimize.
[2023-03-15 08:21:39] [INFO ] Deduced a trap composed of 564 places in 612 ms of which 1 ms to minimize.
[2023-03-15 08:21:40] [INFO ] Deduced a trap composed of 574 places in 621 ms of which 1 ms to minimize.
[2023-03-15 08:21:41] [INFO ] Deduced a trap composed of 574 places in 614 ms of which 2 ms to minimize.
[2023-03-15 08:21:41] [INFO ] Deduced a trap composed of 580 places in 621 ms of which 1 ms to minimize.
[2023-03-15 08:21:43] [INFO ] Deduced a trap composed of 562 places in 611 ms of which 1 ms to minimize.
[2023-03-15 08:21:43] [INFO ] Deduced a trap composed of 568 places in 618 ms of which 1 ms to minimize.
[2023-03-15 08:21:44] [INFO ] Deduced a trap composed of 572 places in 601 ms of which 2 ms to minimize.
[2023-03-15 08:21:45] [INFO ] Deduced a trap composed of 576 places in 585 ms of which 1 ms to minimize.
[2023-03-15 08:21:46] [INFO ] Deduced a trap composed of 562 places in 604 ms of which 1 ms to minimize.
[2023-03-15 08:21:47] [INFO ] Deduced a trap composed of 570 places in 594 ms of which 1 ms to minimize.
[2023-03-15 08:21:48] [INFO ] Deduced a trap composed of 572 places in 602 ms of which 1 ms to minimize.
[2023-03-15 08:21:51] [INFO ] Deduced a trap composed of 572 places in 596 ms of which 1 ms to minimize.
[2023-03-15 08:21:52] [INFO ] Deduced a trap composed of 562 places in 634 ms of which 1 ms to minimize.
[2023-03-15 08:21:52] [INFO ] Deduced a trap composed of 572 places in 633 ms of which 1 ms to minimize.
[2023-03-15 08:21:53] [INFO ] Deduced a trap composed of 564 places in 630 ms of which 1 ms to minimize.
[2023-03-15 08:21:54] [INFO ] Deduced a trap composed of 570 places in 602 ms of which 2 ms to minimize.
[2023-03-15 08:21:55] [INFO ] Deduced a trap composed of 570 places in 601 ms of which 1 ms to minimize.
[2023-03-15 08:21:56] [INFO ] Deduced a trap composed of 582 places in 600 ms of which 1 ms to minimize.
[2023-03-15 08:21:57] [INFO ] Deduced a trap composed of 574 places in 596 ms of which 1 ms to minimize.
[2023-03-15 08:21:58] [INFO ] Deduced a trap composed of 570 places in 602 ms of which 5 ms to minimize.
[2023-03-15 08:21:58] [INFO ] Deduced a trap composed of 582 places in 603 ms of which 1 ms to minimize.
[2023-03-15 08:21:59] [INFO ] Deduced a trap composed of 566 places in 594 ms of which 1 ms to minimize.
[2023-03-15 08:22:00] [INFO ] Deduced a trap composed of 574 places in 606 ms of which 1 ms to minimize.
[2023-03-15 08:22:01] [INFO ] Deduced a trap composed of 568 places in 607 ms of which 1 ms to minimize.
[2023-03-15 08:22:01] [INFO ] Deduced a trap composed of 560 places in 602 ms of which 1 ms to minimize.
[2023-03-15 08:22:02] [INFO ] Deduced a trap composed of 578 places in 599 ms of which 1 ms to minimize.
[2023-03-15 08:22:03] [INFO ] Deduced a trap composed of 572 places in 606 ms of which 1 ms to minimize.
[2023-03-15 08:22:04] [INFO ] Deduced a trap composed of 576 places in 617 ms of which 1 ms to minimize.
[2023-03-15 08:22:04] [INFO ] Deduced a trap composed of 580 places in 602 ms of which 1 ms to minimize.
[2023-03-15 08:22:05] [INFO ] Deduced a trap composed of 572 places in 595 ms of which 1 ms to minimize.
[2023-03-15 08:22:07] [INFO ] Deduced a trap composed of 574 places in 623 ms of which 1 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 32768
SDD size :5592 after 8879
[2023-03-15 08:22:16] [INFO ] Trap strengthening (SAT) tested/added 49/49 trap constraints in 50763 ms
[2023-03-15 08:22:16] [INFO ] After 51673ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 08:22:16] [INFO ] After 52747ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 72597 resets, run finished after 11843 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6265 resets, run finished after 2326 ms. (steps per millisecond=429 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3281700 steps, run timeout after 42001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 3281700 steps, saw 545382 distinct states, run finished after 42001 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:23:12] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 08:23:12] [INFO ] Invariant cache hit.
[2023-03-15 08:23:13] [INFO ] [Real]Absence check using 175 positive place invariants in 44 ms returned sat
[2023-03-15 08:23:13] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 55 ms returned sat
[2023-03-15 08:23:13] [INFO ] After 269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:23:13] [INFO ] [Nat]Absence check using 175 positive place invariants in 45 ms returned sat
[2023-03-15 08:23:13] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 38 ms returned sat
[2023-03-15 08:23:14] [INFO ] After 763ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:23:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:23:14] [INFO ] After 706ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 08:23:15] [INFO ] Deduced a trap composed of 570 places in 626 ms of which 1 ms to minimize.
[2023-03-15 08:23:16] [INFO ] Deduced a trap composed of 558 places in 623 ms of which 1 ms to minimize.
[2023-03-15 08:23:16] [INFO ] Deduced a trap composed of 556 places in 652 ms of which 1 ms to minimize.
[2023-03-15 08:23:17] [INFO ] Deduced a trap composed of 568 places in 613 ms of which 1 ms to minimize.
[2023-03-15 08:23:18] [INFO ] Deduced a trap composed of 578 places in 607 ms of which 1 ms to minimize.
[2023-03-15 08:23:19] [INFO ] Deduced a trap composed of 574 places in 588 ms of which 1 ms to minimize.
[2023-03-15 08:23:19] [INFO ] Deduced a trap composed of 568 places in 611 ms of which 1 ms to minimize.
[2023-03-15 08:23:20] [INFO ] Deduced a trap composed of 588 places in 602 ms of which 1 ms to minimize.
[2023-03-15 08:23:21] [INFO ] Deduced a trap composed of 570 places in 617 ms of which 1 ms to minimize.
[2023-03-15 08:23:21] [INFO ] Deduced a trap composed of 574 places in 604 ms of which 1 ms to minimize.
[2023-03-15 08:23:22] [INFO ] Deduced a trap composed of 572 places in 601 ms of which 1 ms to minimize.
[2023-03-15 08:23:23] [INFO ] Deduced a trap composed of 566 places in 614 ms of which 1 ms to minimize.
[2023-03-15 08:23:24] [INFO ] Deduced a trap composed of 566 places in 614 ms of which 1 ms to minimize.
[2023-03-15 08:23:24] [INFO ] Deduced a trap composed of 570 places in 606 ms of which 1 ms to minimize.
[2023-03-15 08:23:25] [INFO ] Deduced a trap composed of 578 places in 614 ms of which 1 ms to minimize.
[2023-03-15 08:23:26] [INFO ] Deduced a trap composed of 574 places in 611 ms of which 1 ms to minimize.
[2023-03-15 08:23:27] [INFO ] Deduced a trap composed of 576 places in 611 ms of which 1 ms to minimize.
[2023-03-15 08:23:28] [INFO ] Deduced a trap composed of 572 places in 594 ms of which 1 ms to minimize.
[2023-03-15 08:23:28] [INFO ] Deduced a trap composed of 564 places in 603 ms of which 1 ms to minimize.
[2023-03-15 08:23:29] [INFO ] Deduced a trap composed of 574 places in 602 ms of which 1 ms to minimize.
[2023-03-15 08:23:30] [INFO ] Deduced a trap composed of 574 places in 604 ms of which 1 ms to minimize.
[2023-03-15 08:23:31] [INFO ] Deduced a trap composed of 580 places in 620 ms of which 1 ms to minimize.
[2023-03-15 08:23:32] [INFO ] Deduced a trap composed of 562 places in 618 ms of which 1 ms to minimize.
[2023-03-15 08:23:33] [INFO ] Deduced a trap composed of 568 places in 606 ms of which 1 ms to minimize.
[2023-03-15 08:23:33] [INFO ] Deduced a trap composed of 572 places in 605 ms of which 1 ms to minimize.
[2023-03-15 08:23:35] [INFO ] Deduced a trap composed of 576 places in 615 ms of which 1 ms to minimize.
[2023-03-15 08:23:35] [INFO ] Deduced a trap composed of 562 places in 616 ms of which 1 ms to minimize.
[2023-03-15 08:23:36] [INFO ] Deduced a trap composed of 570 places in 606 ms of which 1 ms to minimize.
[2023-03-15 08:23:37] [INFO ] Deduced a trap composed of 572 places in 605 ms of which 1 ms to minimize.
[2023-03-15 08:23:40] [INFO ] Deduced a trap composed of 572 places in 631 ms of which 1 ms to minimize.
[2023-03-15 08:23:41] [INFO ] Deduced a trap composed of 562 places in 587 ms of which 1 ms to minimize.
[2023-03-15 08:23:42] [INFO ] Deduced a trap composed of 572 places in 589 ms of which 1 ms to minimize.
[2023-03-15 08:23:42] [INFO ] Deduced a trap composed of 564 places in 604 ms of which 1 ms to minimize.
[2023-03-15 08:23:44] [INFO ] Deduced a trap composed of 570 places in 592 ms of which 1 ms to minimize.
[2023-03-15 08:23:44] [INFO ] Deduced a trap composed of 570 places in 599 ms of which 1 ms to minimize.
[2023-03-15 08:23:45] [INFO ] Deduced a trap composed of 582 places in 579 ms of which 1 ms to minimize.
[2023-03-15 08:23:46] [INFO ] Deduced a trap composed of 574 places in 591 ms of which 1 ms to minimize.
[2023-03-15 08:23:47] [INFO ] Deduced a trap composed of 570 places in 595 ms of which 1 ms to minimize.
[2023-03-15 08:23:48] [INFO ] Deduced a trap composed of 582 places in 615 ms of which 1 ms to minimize.
[2023-03-15 08:23:48] [INFO ] Deduced a trap composed of 566 places in 619 ms of which 1 ms to minimize.
[2023-03-15 08:23:49] [INFO ] Deduced a trap composed of 574 places in 612 ms of which 2 ms to minimize.
[2023-03-15 08:23:50] [INFO ] Deduced a trap composed of 568 places in 634 ms of which 2 ms to minimize.
[2023-03-15 08:23:51] [INFO ] Deduced a trap composed of 560 places in 599 ms of which 1 ms to minimize.
[2023-03-15 08:23:51] [INFO ] Deduced a trap composed of 578 places in 603 ms of which 2 ms to minimize.
[2023-03-15 08:23:52] [INFO ] Deduced a trap composed of 572 places in 601 ms of which 2 ms to minimize.
[2023-03-15 08:23:53] [INFO ] Deduced a trap composed of 576 places in 631 ms of which 1 ms to minimize.
[2023-03-15 08:23:53] [INFO ] Deduced a trap composed of 580 places in 592 ms of which 1 ms to minimize.
[2023-03-15 08:23:54] [INFO ] Deduced a trap composed of 572 places in 587 ms of which 1 ms to minimize.
[2023-03-15 08:23:56] [INFO ] Deduced a trap composed of 574 places in 599 ms of which 1 ms to minimize.
[2023-03-15 08:24:05] [INFO ] Trap strengthening (SAT) tested/added 49/49 trap constraints in 50718 ms
[2023-03-15 08:24:05] [INFO ] After 51574ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 08:24:05] [INFO ] After 52603ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 1430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1430/1430 places, 2601/2601 transitions.
Applied a total of 0 rules in 71 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 1430/1430 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1430/1430 places, 2601/2601 transitions.
Applied a total of 0 rules in 86 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-15 08:24:05] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 08:24:05] [INFO ] Invariant cache hit.
[2023-03-15 08:24:07] [INFO ] Implicit Places using invariants in 1412 ms returned []
[2023-03-15 08:24:07] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 08:24:07] [INFO ] Invariant cache hit.
[2023-03-15 08:24:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:24:17] [INFO ] Implicit Places using invariants and state equation in 9776 ms returned []
Implicit Place search using SMT with State Equation took 11203 ms to find 0 implicit places.
[2023-03-15 08:24:17] [INFO ] Redundant transitions in 142 ms returned []
[2023-03-15 08:24:17] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 08:24:17] [INFO ] Invariant cache hit.
[2023-03-15 08:24:18] [INFO ] Dead Transitions using invariants and state equation in 1413 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12857 ms. Remains : 1430/1430 places, 2601/2601 transitions.
Incomplete random walk after 100000 steps, including 7300 resets, run finished after 1197 ms. (steps per millisecond=83 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:24:19] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 08:24:19] [INFO ] Invariant cache hit.
[2023-03-15 08:24:20] [INFO ] [Real]Absence check using 175 positive place invariants in 43 ms returned sat
[2023-03-15 08:24:20] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 37 ms returned sat
[2023-03-15 08:24:20] [INFO ] After 696ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 08:24:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:24:21] [INFO ] After 330ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 08:24:21] [INFO ] After 455ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:24:21] [INFO ] After 1393ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:24:21] [INFO ] [Nat]Absence check using 175 positive place invariants in 38 ms returned sat
[2023-03-15 08:24:21] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 36 ms returned sat
[2023-03-15 08:24:22] [INFO ] After 668ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:24:22] [INFO ] After 619ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 08:24:23] [INFO ] Deduced a trap composed of 570 places in 603 ms of which 1 ms to minimize.
[2023-03-15 08:24:24] [INFO ] Deduced a trap composed of 558 places in 594 ms of which 1 ms to minimize.
[2023-03-15 08:24:24] [INFO ] Deduced a trap composed of 556 places in 595 ms of which 1 ms to minimize.
[2023-03-15 08:24:25] [INFO ] Deduced a trap composed of 568 places in 599 ms of which 1 ms to minimize.
[2023-03-15 08:24:26] [INFO ] Deduced a trap composed of 578 places in 585 ms of which 1 ms to minimize.
[2023-03-15 08:24:26] [INFO ] Deduced a trap composed of 574 places in 663 ms of which 1 ms to minimize.
[2023-03-15 08:24:27] [INFO ] Deduced a trap composed of 568 places in 594 ms of which 1 ms to minimize.
[2023-03-15 08:24:28] [INFO ] Deduced a trap composed of 588 places in 626 ms of which 2 ms to minimize.
[2023-03-15 08:24:28] [INFO ] Deduced a trap composed of 570 places in 608 ms of which 2 ms to minimize.
[2023-03-15 08:24:29] [INFO ] Deduced a trap composed of 574 places in 606 ms of which 1 ms to minimize.
[2023-03-15 08:24:30] [INFO ] Deduced a trap composed of 572 places in 586 ms of which 1 ms to minimize.
[2023-03-15 08:24:31] [INFO ] Deduced a trap composed of 566 places in 597 ms of which 1 ms to minimize.
[2023-03-15 08:24:31] [INFO ] Deduced a trap composed of 566 places in 599 ms of which 1 ms to minimize.
[2023-03-15 08:24:32] [INFO ] Deduced a trap composed of 570 places in 605 ms of which 1 ms to minimize.
[2023-03-15 08:24:33] [INFO ] Deduced a trap composed of 578 places in 608 ms of which 1 ms to minimize.
[2023-03-15 08:24:34] [INFO ] Deduced a trap composed of 574 places in 616 ms of which 2 ms to minimize.
[2023-03-15 08:24:35] [INFO ] Deduced a trap composed of 576 places in 608 ms of which 1 ms to minimize.
[2023-03-15 08:24:35] [INFO ] Deduced a trap composed of 572 places in 609 ms of which 1 ms to minimize.
[2023-03-15 08:24:36] [INFO ] Deduced a trap composed of 564 places in 599 ms of which 1 ms to minimize.
[2023-03-15 08:24:37] [INFO ] Deduced a trap composed of 574 places in 615 ms of which 1 ms to minimize.
[2023-03-15 08:24:38] [INFO ] Deduced a trap composed of 574 places in 627 ms of which 2 ms to minimize.
[2023-03-15 08:24:38] [INFO ] Deduced a trap composed of 580 places in 604 ms of which 1 ms to minimize.
[2023-03-15 08:24:40] [INFO ] Deduced a trap composed of 562 places in 627 ms of which 1 ms to minimize.
[2023-03-15 08:24:40] [INFO ] Deduced a trap composed of 568 places in 614 ms of which 1 ms to minimize.
[2023-03-15 08:24:41] [INFO ] Deduced a trap composed of 572 places in 618 ms of which 2 ms to minimize.
[2023-03-15 08:24:42] [INFO ] Deduced a trap composed of 576 places in 601 ms of which 1 ms to minimize.
[2023-03-15 08:24:43] [INFO ] Deduced a trap composed of 562 places in 596 ms of which 2 ms to minimize.
[2023-03-15 08:24:44] [INFO ] Deduced a trap composed of 570 places in 613 ms of which 2 ms to minimize.
[2023-03-15 08:24:45] [INFO ] Deduced a trap composed of 572 places in 619 ms of which 1 ms to minimize.
[2023-03-15 08:24:48] [INFO ] Deduced a trap composed of 572 places in 593 ms of which 1 ms to minimize.
[2023-03-15 08:24:49] [INFO ] Deduced a trap composed of 562 places in 586 ms of which 1 ms to minimize.
[2023-03-15 08:24:49] [INFO ] Deduced a trap composed of 572 places in 588 ms of which 1 ms to minimize.
[2023-03-15 08:24:50] [INFO ] Deduced a trap composed of 564 places in 593 ms of which 1 ms to minimize.
[2023-03-15 08:24:51] [INFO ] Deduced a trap composed of 570 places in 583 ms of which 1 ms to minimize.
[2023-03-15 08:24:52] [INFO ] Deduced a trap composed of 570 places in 598 ms of which 1 ms to minimize.
[2023-03-15 08:24:53] [INFO ] Deduced a trap composed of 582 places in 586 ms of which 1 ms to minimize.
[2023-03-15 08:24:54] [INFO ] Deduced a trap composed of 574 places in 587 ms of which 1 ms to minimize.
[2023-03-15 08:24:54] [INFO ] Deduced a trap composed of 570 places in 595 ms of which 1 ms to minimize.
[2023-03-15 08:24:55] [INFO ] Deduced a trap composed of 582 places in 611 ms of which 1 ms to minimize.
[2023-03-15 08:24:56] [INFO ] Deduced a trap composed of 566 places in 602 ms of which 1 ms to minimize.
[2023-03-15 08:24:57] [INFO ] Deduced a trap composed of 574 places in 595 ms of which 1 ms to minimize.
[2023-03-15 08:24:58] [INFO ] Deduced a trap composed of 568 places in 577 ms of which 2 ms to minimize.
[2023-03-15 08:24:58] [INFO ] Deduced a trap composed of 560 places in 594 ms of which 1 ms to minimize.
[2023-03-15 08:24:59] [INFO ] Deduced a trap composed of 578 places in 584 ms of which 1 ms to minimize.
[2023-03-15 08:25:00] [INFO ] Deduced a trap composed of 572 places in 587 ms of which 1 ms to minimize.
[2023-03-15 08:25:00] [INFO ] Deduced a trap composed of 576 places in 597 ms of which 1 ms to minimize.
[2023-03-15 08:25:01] [INFO ] Deduced a trap composed of 580 places in 624 ms of which 1 ms to minimize.
[2023-03-15 08:25:02] [INFO ] Deduced a trap composed of 572 places in 604 ms of which 1 ms to minimize.
[2023-03-15 08:25:04] [INFO ] Deduced a trap composed of 574 places in 587 ms of which 3 ms to minimize.
[2023-03-15 08:25:13] [INFO ] Trap strengthening (SAT) tested/added 49/49 trap constraints in 50329 ms
[2023-03-15 08:25:13] [INFO ] After 51059ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 08:25:13] [INFO ] After 51932ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 722 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 232710 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 232710 steps, saw 38793 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:25:16] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 08:25:16] [INFO ] Invariant cache hit.
[2023-03-15 08:25:16] [INFO ] [Real]Absence check using 175 positive place invariants in 141 ms returned sat
[2023-03-15 08:25:16] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 36 ms returned sat
[2023-03-15 08:25:16] [INFO ] After 509ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:25:17] [INFO ] [Nat]Absence check using 175 positive place invariants in 42 ms returned sat
[2023-03-15 08:25:17] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 40 ms returned sat
[2023-03-15 08:25:17] [INFO ] After 755ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:25:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:25:18] [INFO ] After 893ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 08:25:19] [INFO ] Deduced a trap composed of 586 places in 621 ms of which 1 ms to minimize.
[2023-03-15 08:25:20] [INFO ] Deduced a trap composed of 572 places in 628 ms of which 1 ms to minimize.
[2023-03-15 08:25:20] [INFO ] Deduced a trap composed of 580 places in 606 ms of which 1 ms to minimize.
[2023-03-15 08:25:21] [INFO ] Deduced a trap composed of 576 places in 619 ms of which 1 ms to minimize.
[2023-03-15 08:25:22] [INFO ] Deduced a trap composed of 580 places in 574 ms of which 1 ms to minimize.
[2023-03-15 08:25:22] [INFO ] Deduced a trap composed of 574 places in 590 ms of which 1 ms to minimize.
[2023-03-15 08:25:23] [INFO ] Deduced a trap composed of 576 places in 611 ms of which 1 ms to minimize.
[2023-03-15 08:25:24] [INFO ] Deduced a trap composed of 568 places in 598 ms of which 1 ms to minimize.
[2023-03-15 08:25:24] [INFO ] Deduced a trap composed of 574 places in 601 ms of which 1 ms to minimize.
[2023-03-15 08:25:25] [INFO ] Deduced a trap composed of 568 places in 582 ms of which 1 ms to minimize.
[2023-03-15 08:25:26] [INFO ] Deduced a trap composed of 564 places in 584 ms of which 1 ms to minimize.
[2023-03-15 08:25:27] [INFO ] Deduced a trap composed of 580 places in 593 ms of which 1 ms to minimize.
[2023-03-15 08:25:27] [INFO ] Deduced a trap composed of 566 places in 592 ms of which 1 ms to minimize.
[2023-03-15 08:25:28] [INFO ] Deduced a trap composed of 568 places in 593 ms of which 1 ms to minimize.
[2023-03-15 08:25:29] [INFO ] Deduced a trap composed of 572 places in 596 ms of which 1 ms to minimize.
[2023-03-15 08:25:29] [INFO ] Deduced a trap composed of 578 places in 593 ms of which 1 ms to minimize.
[2023-03-15 08:25:30] [INFO ] Deduced a trap composed of 566 places in 611 ms of which 2 ms to minimize.
[2023-03-15 08:25:31] [INFO ] Deduced a trap composed of 572 places in 616 ms of which 1 ms to minimize.
[2023-03-15 08:25:32] [INFO ] Deduced a trap composed of 570 places in 599 ms of which 1 ms to minimize.
[2023-03-15 08:25:33] [INFO ] Deduced a trap composed of 560 places in 618 ms of which 2 ms to minimize.
[2023-03-15 08:25:34] [INFO ] Deduced a trap composed of 576 places in 614 ms of which 1 ms to minimize.
[2023-03-15 08:25:34] [INFO ] Deduced a trap composed of 576 places in 619 ms of which 2 ms to minimize.
[2023-03-15 08:25:35] [INFO ] Deduced a trap composed of 568 places in 612 ms of which 1 ms to minimize.
[2023-03-15 08:25:36] [INFO ] Deduced a trap composed of 570 places in 618 ms of which 3 ms to minimize.
[2023-03-15 08:25:37] [INFO ] Deduced a trap composed of 566 places in 613 ms of which 1 ms to minimize.
[2023-03-15 08:25:38] [INFO ] Deduced a trap composed of 574 places in 615 ms of which 1 ms to minimize.
[2023-03-15 08:25:39] [INFO ] Deduced a trap composed of 566 places in 603 ms of which 1 ms to minimize.
[2023-03-15 08:25:40] [INFO ] Deduced a trap composed of 570 places in 608 ms of which 1 ms to minimize.
[2023-03-15 08:25:40] [INFO ] Deduced a trap composed of 580 places in 607 ms of which 1 ms to minimize.
[2023-03-15 08:25:41] [INFO ] Deduced a trap composed of 564 places in 590 ms of which 1 ms to minimize.
[2023-03-15 08:25:42] [INFO ] Deduced a trap composed of 572 places in 631 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
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-15 08:25:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 08:25:42] [INFO ] After 25479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1430/1430 places, 2601/2601 transitions.
Applied a total of 0 rules in 75 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-15 08:25:42] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 08:25:42] [INFO ] Invariant cache hit.
[2023-03-15 08:25:43] [INFO ] Dead Transitions using invariants and state equation in 1392 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1471 ms. Remains : 1430/1430 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 717 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 223154 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 223154 steps, saw 37333 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:25:46] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 08:25:46] [INFO ] Invariant cache hit.
[2023-03-15 08:25:47] [INFO ] [Real]Absence check using 175 positive place invariants in 44 ms returned sat
[2023-03-15 08:25:47] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 38 ms returned sat
[2023-03-15 08:25:47] [INFO ] After 271ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:25:47] [INFO ] [Nat]Absence check using 175 positive place invariants in 45 ms returned sat
[2023-03-15 08:25:47] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 39 ms returned sat
[2023-03-15 08:25:48] [INFO ] After 803ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:25:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:25:49] [INFO ] After 916ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 08:25:49] [INFO ] Deduced a trap composed of 586 places in 642 ms of which 2 ms to minimize.
[2023-03-15 08:25:50] [INFO ] Deduced a trap composed of 572 places in 642 ms of which 1 ms to minimize.
[2023-03-15 08:25:51] [INFO ] Deduced a trap composed of 580 places in 632 ms of which 1 ms to minimize.
[2023-03-15 08:25:52] [INFO ] Deduced a trap composed of 576 places in 639 ms of which 1 ms to minimize.
[2023-03-15 08:25:52] [INFO ] Deduced a trap composed of 580 places in 634 ms of which 1 ms to minimize.
[2023-03-15 08:25:53] [INFO ] Deduced a trap composed of 574 places in 633 ms of which 1 ms to minimize.
[2023-03-15 08:25:54] [INFO ] Deduced a trap composed of 576 places in 625 ms of which 1 ms to minimize.
[2023-03-15 08:25:55] [INFO ] Deduced a trap composed of 568 places in 635 ms of which 1 ms to minimize.
[2023-03-15 08:25:55] [INFO ] Deduced a trap composed of 574 places in 628 ms of which 2 ms to minimize.
[2023-03-15 08:25:56] [INFO ] Deduced a trap composed of 568 places in 632 ms of which 1 ms to minimize.
[2023-03-15 08:25:57] [INFO ] Deduced a trap composed of 564 places in 593 ms of which 1 ms to minimize.
[2023-03-15 08:25:58] [INFO ] Deduced a trap composed of 580 places in 629 ms of which 1 ms to minimize.
[2023-03-15 08:25:58] [INFO ] Deduced a trap composed of 566 places in 599 ms of which 1 ms to minimize.
[2023-03-15 08:25:59] [INFO ] Deduced a trap composed of 568 places in 595 ms of which 1 ms to minimize.
[2023-03-15 08:26:00] [INFO ] Deduced a trap composed of 572 places in 583 ms of which 1 ms to minimize.
[2023-03-15 08:26:00] [INFO ] Deduced a trap composed of 578 places in 592 ms of which 1 ms to minimize.
[2023-03-15 08:26:01] [INFO ] Deduced a trap composed of 566 places in 633 ms of which 1 ms to minimize.
[2023-03-15 08:26:02] [INFO ] Deduced a trap composed of 572 places in 637 ms of which 2 ms to minimize.
[2023-03-15 08:26:03] [INFO ] Deduced a trap composed of 570 places in 625 ms of which 1 ms to minimize.
[2023-03-15 08:26:04] [INFO ] Deduced a trap composed of 560 places in 638 ms of which 1 ms to minimize.
[2023-03-15 08:26:05] [INFO ] Deduced a trap composed of 576 places in 587 ms of which 1 ms to minimize.
[2023-03-15 08:26:05] [INFO ] Deduced a trap composed of 576 places in 584 ms of which 1 ms to minimize.
[2023-03-15 08:26:06] [INFO ] Deduced a trap composed of 568 places in 626 ms of which 1 ms to minimize.
[2023-03-15 08:26:07] [INFO ] Deduced a trap composed of 570 places in 634 ms of which 1 ms to minimize.
[2023-03-15 08:26:09] [INFO ] Deduced a trap composed of 566 places in 638 ms of which 2 ms to minimize.
[2023-03-15 08:26:09] [INFO ] Deduced a trap composed of 574 places in 630 ms of which 1 ms to minimize.
[2023-03-15 08:26:10] [INFO ] Deduced a trap composed of 566 places in 656 ms of which 1 ms to minimize.
[2023-03-15 08:26:11] [INFO ] Deduced a trap composed of 570 places in 646 ms of which 1 ms to minimize.
[2023-03-15 08:26:12] [INFO ] Deduced a trap composed of 580 places in 642 ms of which 1 ms to minimize.
[2023-03-15 08:26:12] [INFO ] Trap strengthening (SAT) tested/added 29/29 trap constraints in 23025 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
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-15 08:26:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 08:26:12] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1430/1430 places, 2601/2601 transitions.
Applied a total of 0 rules in 63 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 1430/1430 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1430/1430 places, 2601/2601 transitions.
Applied a total of 0 rules in 62 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-15 08:26:12] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 08:26:12] [INFO ] Invariant cache hit.
[2023-03-15 08:26:13] [INFO ] Implicit Places using invariants in 1354 ms returned []
[2023-03-15 08:26:13] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 08:26:13] [INFO ] Invariant cache hit.
[2023-03-15 08:26:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:26:24] [INFO ] Implicit Places using invariants and state equation in 10830 ms returned []
Implicit Place search using SMT with State Equation took 12185 ms to find 0 implicit places.
[2023-03-15 08:26:24] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-15 08:26:24] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 08:26:24] [INFO ] Invariant cache hit.
[2023-03-15 08:26:26] [INFO ] Dead Transitions using invariants and state equation in 1409 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13723 ms. Remains : 1430/1430 places, 2601/2601 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1430 transition count 2592
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 1430 transition count 2591
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 1429 transition count 2591
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1429 transition count 2590
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 1428 transition count 2590
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 1428 transition count 2580
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 1418 transition count 2580
Applied a total of 33 rules in 303 ms. Remains 1418 /1430 variables (removed 12) and now considering 2580/2601 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2580 rows 1418 cols
[2023-03-15 08:26:26] [INFO ] Computed 182 place invariants in 59 ms
[2023-03-15 08:26:26] [INFO ] [Real]Absence check using 175 positive place invariants in 43 ms returned sat
[2023-03-15 08:26:26] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 35 ms returned sat
[2023-03-15 08:26:26] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:26:26] [INFO ] [Nat]Absence check using 175 positive place invariants in 44 ms returned sat
[2023-03-15 08:26:26] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 37 ms returned sat
[2023-03-15 08:26:27] [INFO ] After 773ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:26:28] [INFO ] Deduced a trap composed of 566 places in 593 ms of which 2 ms to minimize.
[2023-03-15 08:26:29] [INFO ] Deduced a trap composed of 576 places in 588 ms of which 1 ms to minimize.
[2023-03-15 08:26:29] [INFO ] Deduced a trap composed of 566 places in 587 ms of which 1 ms to minimize.
[2023-03-15 08:26:30] [INFO ] Deduced a trap composed of 572 places in 595 ms of which 2 ms to minimize.
[2023-03-15 08:26:31] [INFO ] Deduced a trap composed of 574 places in 599 ms of which 1 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 65536
[2023-03-15 08:26:31] [INFO ] Deduced a trap composed of 566 places in 597 ms of which 1 ms to minimize.
SDD size :8879 after 15023
[2023-03-15 08:26:32] [INFO ] Deduced a trap composed of 572 places in 602 ms of which 1 ms to minimize.
[2023-03-15 08:26:33] [INFO ] Deduced a trap composed of 560 places in 596 ms of which 1 ms to minimize.
[2023-03-15 08:26:34] [INFO ] Deduced a trap composed of 566 places in 563 ms of which 1 ms to minimize.
[2023-03-15 08:26:35] [INFO ] Deduced a trap composed of 566 places in 587 ms of which 1 ms to minimize.
[2023-03-15 08:26:36] [INFO ] Deduced a trap composed of 572 places in 561 ms of which 1 ms to minimize.
[2023-03-15 08:26:36] [INFO ] Deduced a trap composed of 584 places in 564 ms of which 2 ms to minimize.
[2023-03-15 08:26:37] [INFO ] Deduced a trap composed of 588 places in 563 ms of which 1 ms to minimize.
[2023-03-15 08:26:38] [INFO ] Deduced a trap composed of 566 places in 558 ms of which 2 ms to minimize.
[2023-03-15 08:26:38] [INFO ] Deduced a trap composed of 582 places in 550 ms of which 1 ms to minimize.
[2023-03-15 08:26:39] [INFO ] Deduced a trap composed of 566 places in 549 ms of which 1 ms to minimize.
[2023-03-15 08:26:39] [INFO ] Deduced a trap composed of 570 places in 560 ms of which 1 ms to minimize.
[2023-03-15 08:26:40] [INFO ] Deduced a trap composed of 582 places in 555 ms of which 1 ms to minimize.
[2023-03-15 08:26:41] [INFO ] Deduced a trap composed of 564 places in 567 ms of which 1 ms to minimize.
[2023-03-15 08:26:41] [INFO ] Deduced a trap composed of 566 places in 588 ms of which 1 ms to minimize.
[2023-03-15 08:26:42] [INFO ] Deduced a trap composed of 570 places in 555 ms of which 1 ms to minimize.
[2023-03-15 08:26:43] [INFO ] Deduced a trap composed of 570 places in 551 ms of which 1 ms to minimize.
[2023-03-15 08:26:43] [INFO ] Deduced a trap composed of 578 places in 556 ms of which 1 ms to minimize.
[2023-03-15 08:26:44] [INFO ] Deduced a trap composed of 558 places in 562 ms of which 1 ms to minimize.
[2023-03-15 08:26:45] [INFO ] Deduced a trap composed of 572 places in 565 ms of which 1 ms to minimize.
[2023-03-15 08:26:45] [INFO ] Deduced a trap composed of 558 places in 563 ms of which 1 ms to minimize.
[2023-03-15 08:26:46] [INFO ] Deduced a trap composed of 558 places in 556 ms of which 1 ms to minimize.
[2023-03-15 08:26:46] [INFO ] Deduced a trap composed of 572 places in 551 ms of which 1 ms to minimize.
[2023-03-15 08:26:47] [INFO ] Deduced a trap composed of 570 places in 555 ms of which 1 ms to minimize.
[2023-03-15 08:26:48] [INFO ] Deduced a trap composed of 572 places in 556 ms of which 1 ms to minimize.
[2023-03-15 08:26:48] [INFO ] Deduced a trap composed of 568 places in 568 ms of which 1 ms to minimize.
[2023-03-15 08:26:49] [INFO ] Deduced a trap composed of 576 places in 553 ms of which 2 ms to minimize.
[2023-03-15 08:26:50] [INFO ] Deduced a trap composed of 564 places in 567 ms of which 1 ms to minimize.
[2023-03-15 08:26:50] [INFO ] Deduced a trap composed of 568 places in 585 ms of which 1 ms to minimize.
[2023-03-15 08:26:51] [INFO ] Deduced a trap composed of 564 places in 558 ms of which 1 ms to minimize.
[2023-03-15 08:26:52] [INFO ] Deduced a trap composed of 562 places in 572 ms of which 1 ms to minimize.
[2023-03-15 08:26:52] [INFO ] Deduced a trap composed of 562 places in 559 ms of which 1 ms to minimize.
[2023-03-15 08:26:53] [INFO ] Deduced a trap composed of 564 places in 564 ms of which 1 ms to minimize.
[2023-03-15 08:26:54] [INFO ] Deduced a trap composed of 558 places in 555 ms of which 1 ms to minimize.
[2023-03-15 08:26:54] [INFO ] Deduced a trap composed of 564 places in 557 ms of which 1 ms to minimize.
[2023-03-15 08:26:55] [INFO ] Deduced a trap composed of 574 places in 557 ms of which 2 ms to minimize.
[2023-03-15 08:26:55] [INFO ] Deduced a trap composed of 572 places in 555 ms of which 2 ms to minimize.
[2023-03-15 08:26:56] [INFO ] Deduced a trap composed of 574 places in 557 ms of which 1 ms to minimize.
[2023-03-15 08:26:57] [INFO ] Deduced a trap composed of 580 places in 566 ms of which 1 ms to minimize.
[2023-03-15 08:26:57] [INFO ] Deduced a trap composed of 576 places in 558 ms of which 1 ms to minimize.
[2023-03-15 08:26:58] [INFO ] Deduced a trap composed of 572 places in 570 ms of which 2 ms to minimize.
[2023-03-15 08:26:59] [INFO ] Deduced a trap composed of 568 places in 566 ms of which 1 ms to minimize.
[2023-03-15 08:26:59] [INFO ] Deduced a trap composed of 574 places in 560 ms of which 1 ms to minimize.
[2023-03-15 08:27:00] [INFO ] Deduced a trap composed of 572 places in 595 ms of which 1 ms to minimize.
[2023-03-15 08:27:01] [INFO ] Deduced a trap composed of 574 places in 591 ms of which 1 ms to minimize.
[2023-03-15 08:27:01] [INFO ] Deduced a trap composed of 574 places in 560 ms of which 1 ms to minimize.
[2023-03-15 08:27:02] [INFO ] Deduced a trap composed of 570 places in 557 ms of which 1 ms to minimize.
[2023-03-15 08:27:02] [INFO ] Deduced a trap composed of 574 places in 562 ms of which 1 ms to minimize.
Detected timeout of ITS tools.
[2023-03-15 08:27:03] [INFO ] Flatten gal took : 189 ms
[2023-03-15 08:27:03] [INFO ] Applying decomposition
[2023-03-15 08:27:03] [INFO ] Deduced a trap composed of 576 places in 825 ms of which 1 ms to minimize.
[2023-03-15 08:27:03] [INFO ] Flatten gal took : 297 ms
[2023-03-15 08:27:04] [INFO ] Deduced a trap composed of 564 places in 548 ms of which 2 ms to minimize.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph788722322300796091.txt' '-o' '/tmp/graph788722322300796091.bin' '-w' '/tmp/graph788722322300796091.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph788722322300796091.bin' '-l' '-1' '-v' '-w' '/tmp/graph788722322300796091.weights' '-q' '0' '-e' '0.001'
[2023-03-15 08:27:04] [INFO ] Decomposing Gal with order
[2023-03-15 08:27:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:27:05] [INFO ] Deduced a trap composed of 576 places in 651 ms of which 2 ms to minimize.
[2023-03-15 08:27:05] [INFO ] Removed a total of 3441 redundant transitions.
[2023-03-15 08:27:05] [INFO ] Flatten gal took : 702 ms
[2023-03-15 08:27:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 720 labels/synchronizations in 122 ms.
[2023-03-15 08:27:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17424603365571577819.gal : 45 ms
[2023-03-15 08:27:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6901769574160873246.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17424603365571577819.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6901769574160873246.prop' '--nowitness'
[2023-03-15 08:27:05] [INFO ] Deduced a trap composed of 570 places in 561 ms of which 2 ms to minimize.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
[2023-03-15 08:27:06] [INFO ] Deduced a trap composed of 570 places in 560 ms of which 1 ms to minimize.
Loading property file /tmp/ReachabilityCardinality6901769574160873246.prop.
[2023-03-15 08:27:07] [INFO ] Deduced a trap composed of 574 places in 608 ms of which 2 ms to minimize.
[2023-03-15 08:27:07] [INFO ] Deduced a trap composed of 578 places in 598 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 55
[2023-03-15 08:27:08] [INFO ] Deduced a trap composed of 566 places in 593 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :55 after 1122
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1122 after 1124
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1124 after 1128
[2023-03-15 08:27:09] [INFO ] Deduced a trap composed of 570 places in 601 ms of which 1 ms to minimize.
[2023-03-15 08:27:09] [INFO ] Deduced a trap composed of 582 places in 609 ms of which 1 ms to minimize.
[2023-03-15 08:27:10] [INFO ] Deduced a trap composed of 568 places in 604 ms of which 1 ms to minimize.
[2023-03-15 08:27:11] [INFO ] Deduced a trap composed of 578 places in 608 ms of which 2 ms to minimize.
[2023-03-15 08:27:11] [INFO ] Deduced a trap composed of 578 places in 602 ms of which 1 ms to minimize.
[2023-03-15 08:27:12] [INFO ] Deduced a trap composed of 566 places in 598 ms of which 1 ms to minimize.
[2023-03-15 08:27:13] [INFO ] Deduced a trap composed of 578 places in 594 ms of which 1 ms to minimize.
[2023-03-15 08:27:13] [INFO ] Deduced a trap composed of 558 places in 626 ms of which 1 ms to minimize.
[2023-03-15 08:27:14] [INFO ] Deduced a trap composed of 566 places in 602 ms of which 1 ms to minimize.
[2023-03-15 08:27:15] [INFO ] Deduced a trap composed of 574 places in 623 ms of which 7 ms to minimize.
[2023-03-15 08:27:16] [INFO ] Deduced a trap composed of 570 places in 610 ms of which 1 ms to minimize.
[2023-03-15 08:27:16] [INFO ] Deduced a trap composed of 572 places in 591 ms of which 1 ms to minimize.
[2023-03-15 08:27:17] [INFO ] Deduced a trap composed of 550 places in 607 ms of which 2 ms to minimize.
[2023-03-15 08:27:18] [INFO ] Deduced a trap composed of 586 places in 597 ms of which 1 ms to minimize.
[2023-03-15 08:27:18] [INFO ] Deduced a trap composed of 576 places in 593 ms of which 1 ms to minimize.
[2023-03-15 08:27:19] [INFO ] Deduced a trap composed of 560 places in 602 ms of which 2 ms to minimize.
[2023-03-15 08:27:20] [INFO ] Deduced a trap composed of 578 places in 604 ms of which 2 ms to minimize.
[2023-03-15 08:27:20] [INFO ] Deduced a trap composed of 568 places in 602 ms of which 2 ms to minimize.
[2023-03-15 08:27:21] [INFO ] Deduced a trap composed of 574 places in 603 ms of which 1 ms to minimize.
[2023-03-15 08:27:22] [INFO ] Deduced a trap composed of 586 places in 594 ms of which 1 ms to minimize.
[2023-03-15 08:27:22] [INFO ] Deduced a trap composed of 564 places in 583 ms of which 1 ms to minimize.
[2023-03-15 08:27:23] [INFO ] Deduced a trap composed of 566 places in 585 ms of which 1 ms to minimize.
[2023-03-15 08:27:24] [INFO ] Deduced a trap composed of 566 places in 585 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1128 after 6310
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6310 after 6327
[2023-03-15 08:30:11] [INFO ] Trap strengthening (SAT) tested/added 84/84 trap constraints in 223965 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
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-15 08:30:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 08:30:11] [INFO ] After 225017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1430 transition count 2592
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 1430 transition count 2591
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 1429 transition count 2591
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1429 transition count 2590
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 1428 transition count 2590
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 1428 transition count 2580
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 1418 transition count 2580
Applied a total of 33 rules in 284 ms. Remains 1418 /1430 variables (removed 12) and now considering 2580/2601 (removed 21) transitions.
Running SMT prover for 1 properties.
[2023-03-15 08:30:12] [INFO ] Invariant cache hit.
[2023-03-15 08:30:12] [INFO ] [Real]Absence check using 175 positive place invariants in 296 ms returned sat
[2023-03-15 08:30:12] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 31 ms returned sat
[2023-03-15 08:30:12] [INFO ] After 696ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:30:12] [INFO ] [Nat]Absence check using 175 positive place invariants in 42 ms returned sat
[2023-03-15 08:30:12] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 31 ms returned sat
[2023-03-15 08:30:13] [INFO ] After 731ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:30:14] [INFO ] Deduced a trap composed of 564 places in 559 ms of which 2 ms to minimize.
[2023-03-15 08:30:14] [INFO ] Deduced a trap composed of 576 places in 558 ms of which 1 ms to minimize.
[2023-03-15 08:30:15] [INFO ] Deduced a trap composed of 576 places in 562 ms of which 1 ms to minimize.
[2023-03-15 08:30:16] [INFO ] Deduced a trap composed of 586 places in 560 ms of which 1 ms to minimize.
[2023-03-15 08:30:16] [INFO ] Deduced a trap composed of 570 places in 579 ms of which 1 ms to minimize.
[2023-03-15 08:30:17] [INFO ] Deduced a trap composed of 566 places in 549 ms of which 1 ms to minimize.
[2023-03-15 08:30:18] [INFO ] Deduced a trap composed of 574 places in 552 ms of which 1 ms to minimize.
[2023-03-15 08:30:18] [INFO ] Deduced a trap composed of 562 places in 549 ms of which 1 ms to minimize.
[2023-03-15 08:30:19] [INFO ] Deduced a trap composed of 574 places in 560 ms of which 1 ms to minimize.
[2023-03-15 08:30:20] [INFO ] Deduced a trap composed of 572 places in 553 ms of which 1 ms to minimize.
[2023-03-15 08:30:20] [INFO ] Deduced a trap composed of 574 places in 553 ms of which 1 ms to minimize.
[2023-03-15 08:30:21] [INFO ] Deduced a trap composed of 572 places in 557 ms of which 1 ms to minimize.
[2023-03-15 08:30:22] [INFO ] Deduced a trap composed of 578 places in 555 ms of which 1 ms to minimize.
[2023-03-15 08:30:22] [INFO ] Deduced a trap composed of 568 places in 549 ms of which 1 ms to minimize.
[2023-03-15 08:30:23] [INFO ] Deduced a trap composed of 574 places in 562 ms of which 1 ms to minimize.
[2023-03-15 08:30:24] [INFO ] Deduced a trap composed of 560 places in 557 ms of which 2 ms to minimize.
[2023-03-15 08:30:24] [INFO ] Deduced a trap composed of 572 places in 551 ms of which 1 ms to minimize.
[2023-03-15 08:30:25] [INFO ] Deduced a trap composed of 574 places in 560 ms of which 1 ms to minimize.
[2023-03-15 08:30:25] [INFO ] Deduced a trap composed of 574 places in 556 ms of which 1 ms to minimize.
[2023-03-15 08:30:26] [INFO ] Deduced a trap composed of 570 places in 550 ms of which 1 ms to minimize.
[2023-03-15 08:30:27] [INFO ] Deduced a trap composed of 578 places in 563 ms of which 1 ms to minimize.
[2023-03-15 08:30:27] [INFO ] Deduced a trap composed of 570 places in 550 ms of which 1 ms to minimize.
[2023-03-15 08:30:28] [INFO ] Deduced a trap composed of 572 places in 562 ms of which 1 ms to minimize.
[2023-03-15 08:30:29] [INFO ] Deduced a trap composed of 572 places in 594 ms of which 2 ms to minimize.
[2023-03-15 08:30:29] [INFO ] Deduced a trap composed of 570 places in 558 ms of which 1 ms to minimize.
[2023-03-15 08:30:30] [INFO ] Deduced a trap composed of 574 places in 552 ms of which 2 ms to minimize.
[2023-03-15 08:30:31] [INFO ] Deduced a trap composed of 572 places in 564 ms of which 1 ms to minimize.
[2023-03-15 08:30:31] [INFO ] Deduced a trap composed of 578 places in 562 ms of which 1 ms to minimize.
[2023-03-15 08:30:32] [INFO ] Deduced a trap composed of 584 places in 563 ms of which 1 ms to minimize.
[2023-03-15 08:30:33] [INFO ] Deduced a trap composed of 572 places in 552 ms of which 1 ms to minimize.
[2023-03-15 08:30:33] [INFO ] Deduced a trap composed of 566 places in 558 ms of which 1 ms to minimize.
[2023-03-15 08:30:34] [INFO ] Deduced a trap composed of 570 places in 563 ms of which 1 ms to minimize.
[2023-03-15 08:30:35] [INFO ] Deduced a trap composed of 568 places in 555 ms of which 2 ms to minimize.
[2023-03-15 08:30:35] [INFO ] Deduced a trap composed of 572 places in 557 ms of which 1 ms to minimize.
[2023-03-15 08:30:36] [INFO ] Deduced a trap composed of 568 places in 558 ms of which 1 ms to minimize.
[2023-03-15 08:30:37] [INFO ] Deduced a trap composed of 570 places in 596 ms of which 1 ms to minimize.
[2023-03-15 08:30:37] [INFO ] Deduced a trap composed of 574 places in 605 ms of which 2 ms to minimize.
[2023-03-15 08:30:38] [INFO ] Deduced a trap composed of 560 places in 600 ms of which 1 ms to minimize.
[2023-03-15 08:30:39] [INFO ] Deduced a trap composed of 564 places in 592 ms of which 1 ms to minimize.
[2023-03-15 08:30:39] [INFO ] Deduced a trap composed of 566 places in 612 ms of which 1 ms to minimize.
[2023-03-15 08:30:40] [INFO ] Deduced a trap composed of 574 places in 597 ms of which 1 ms to minimize.
[2023-03-15 08:30:41] [INFO ] Deduced a trap composed of 560 places in 597 ms of which 1 ms to minimize.
[2023-03-15 08:30:41] [INFO ] Deduced a trap composed of 574 places in 607 ms of which 1 ms to minimize.
[2023-03-15 08:30:42] [INFO ] Deduced a trap composed of 580 places in 615 ms of which 1 ms to minimize.
[2023-03-15 08:30:43] [INFO ] Deduced a trap composed of 574 places in 623 ms of which 1 ms to minimize.
[2023-03-15 08:30:43] [INFO ] Deduced a trap composed of 568 places in 614 ms of which 1 ms to minimize.
[2023-03-15 08:30:44] [INFO ] Deduced a trap composed of 568 places in 615 ms of which 2 ms to minimize.
[2023-03-15 08:30:45] [INFO ] Deduced a trap composed of 556 places in 625 ms of which 2 ms to minimize.
[2023-03-15 08:30:46] [INFO ] Deduced a trap composed of 564 places in 631 ms of which 1 ms to minimize.
[2023-03-15 08:30:46] [INFO ] Deduced a trap composed of 568 places in 604 ms of which 1 ms to minimize.
[2023-03-15 08:30:47] [INFO ] Deduced a trap composed of 572 places in 606 ms of which 2 ms to minimize.
[2023-03-15 08:30:48] [INFO ] Deduced a trap composed of 562 places in 614 ms of which 1 ms to minimize.
[2023-03-15 08:30:48] [INFO ] Deduced a trap composed of 578 places in 607 ms of which 1 ms to minimize.
[2023-03-15 08:30:49] [INFO ] Deduced a trap composed of 582 places in 589 ms of which 1 ms to minimize.
[2023-03-15 08:30:50] [INFO ] Deduced a trap composed of 580 places in 610 ms of which 1 ms to minimize.
[2023-03-15 08:30:50] [INFO ] Deduced a trap composed of 568 places in 597 ms of which 1 ms to minimize.
[2023-03-15 08:30:51] [INFO ] Deduced a trap composed of 582 places in 602 ms of which 2 ms to minimize.
[2023-03-15 08:30:52] [INFO ] Deduced a trap composed of 584 places in 595 ms of which 1 ms to minimize.
[2023-03-15 08:30:52] [INFO ] Deduced a trap composed of 574 places in 602 ms of which 2 ms to minimize.
[2023-03-15 08:30:53] [INFO ] Deduced a trap composed of 580 places in 604 ms of which 1 ms to minimize.
[2023-03-15 08:30:54] [INFO ] Deduced a trap composed of 570 places in 617 ms of which 1 ms to minimize.
[2023-03-15 08:30:55] [INFO ] Deduced a trap composed of 566 places in 615 ms of which 1 ms to minimize.
[2023-03-15 08:30:55] [INFO ] Deduced a trap composed of 564 places in 610 ms of which 1 ms to minimize.
[2023-03-15 08:30:56] [INFO ] Deduced a trap composed of 562 places in 608 ms of which 1 ms to minimize.
[2023-03-15 08:30:57] [INFO ] Deduced a trap composed of 588 places in 616 ms of which 1 ms to minimize.
[2023-03-15 08:30:57] [INFO ] Deduced a trap composed of 580 places in 620 ms of which 1 ms to minimize.
[2023-03-15 08:30:58] [INFO ] Deduced a trap composed of 572 places in 615 ms of which 1 ms to minimize.
[2023-03-15 08:30:59] [INFO ] Deduced a trap composed of 566 places in 608 ms of which 2 ms to minimize.
[2023-03-15 08:30:59] [INFO ] Deduced a trap composed of 570 places in 620 ms of which 1 ms to minimize.
[2023-03-15 08:31:00] [INFO ] Deduced a trap composed of 562 places in 587 ms of which 1 ms to minimize.
[2023-03-15 08:31:01] [INFO ] Deduced a trap composed of 572 places in 600 ms of which 1 ms to minimize.
[2023-03-15 08:31:01] [INFO ] Deduced a trap composed of 556 places in 595 ms of which 2 ms to minimize.
[2023-03-15 08:31:02] [INFO ] Deduced a trap composed of 574 places in 590 ms of which 1 ms to minimize.
[2023-03-15 08:31:03] [INFO ] Deduced a trap composed of 568 places in 599 ms of which 1 ms to minimize.
[2023-03-15 08:31:04] [INFO ] Deduced a trap composed of 568 places in 585 ms of which 1 ms to minimize.
[2023-03-15 08:31:04] [INFO ] Deduced a trap composed of 562 places in 596 ms of which 1 ms to minimize.
[2023-03-15 08:31:05] [INFO ] Deduced a trap composed of 564 places in 598 ms of which 2 ms to minimize.
[2023-03-15 08:33:57] [INFO ] Trap strengthening (SAT) tested/added 77/77 trap constraints in 224093 ms
[2023-03-15 08:33:57] [INFO ] After 224934ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 08:33:57] [INFO ] After 225187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-15 08:33:58] [INFO ] Flatten gal took : 377 ms
[2023-03-15 08:33:59] [INFO ] Flatten gal took : 185 ms
[2023-03-15 08:33:59] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability11877090198218550291.gal : 45 ms
[2023-03-15 08:33:59] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability6737619988203727894.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability11877090198218550291.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability6737619988203727894.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityFireability6737619988203727894.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
Detected timeout of ITS tools.
[2023-03-15 08:34:02] [INFO ] Flatten gal took : 168 ms
[2023-03-15 08:34:02] [INFO ] Applying decomposition
[2023-03-15 08:34:02] [INFO ] Flatten gal took : 140 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5814148602429785914.txt' '-o' '/tmp/graph5814148602429785914.bin' '-w' '/tmp/graph5814148602429785914.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5814148602429785914.bin' '-l' '-1' '-v' '-w' '/tmp/graph5814148602429785914.weights' '-q' '0' '-e' '0.001'
[2023-03-15 08:34:03] [INFO ] Decomposing Gal with order
[2023-03-15 08:34:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:34:03] [INFO ] Removed a total of 4720 redundant transitions.
[2023-03-15 08:34:04] [INFO ] Flatten gal took : 680 ms
[2023-03-15 08:34:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 700 labels/synchronizations in 219 ms.
[2023-03-15 08:34:04] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability16975410442603444691.gal : 40 ms
[2023-03-15 08:34:04] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12118044393253136167.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability16975410442603444691.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12118044393253136167.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityFireability12118044393253136167.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16299069002726364102
[2023-03-15 08:34:07] [INFO ] Built C files in 137ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16299069002726364102
Running compilation step : cd /tmp/ltsmin16299069002726364102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16299069002726364102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 2 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16299069002726364102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 2 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-15 08:34:11] [INFO ] Flatten gal took : 1993 ms
[2023-03-15 08:34:12] [INFO ] Flatten gal took : 344 ms
[2023-03-15 08:34:12] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4854052089831409050.gal : 36 ms
[2023-03-15 08:34:12] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability18350510988078050300.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability4854052089831409050.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability18350510988078050300.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityFireability18350510988078050300.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 160
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :176 after 184
Detected timeout of ITS tools.
[2023-03-15 08:34:42] [INFO ] Flatten gal took : 231 ms
[2023-03-15 08:34:42] [INFO ] Applying decomposition
[2023-03-15 08:34:42] [INFO ] Flatten gal took : 260 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph359471033144526995.txt' '-o' '/tmp/graph359471033144526995.bin' '-w' '/tmp/graph359471033144526995.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph359471033144526995.bin' '-l' '-1' '-v' '-w' '/tmp/graph359471033144526995.weights' '-q' '0' '-e' '0.001'
[2023-03-15 08:34:43] [INFO ] Decomposing Gal with order
[2023-03-15 08:34:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:34:43] [INFO ] Removed a total of 2639 redundant transitions.
[2023-03-15 08:34:43] [INFO ] Flatten gal took : 343 ms
[2023-03-15 08:34:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 702 labels/synchronizations in 75 ms.
[2023-03-15 08:34:44] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4814082026840939503.gal : 33 ms
[2023-03-15 08:34:44] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability10657561875190068194.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability4814082026840939503.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability10657561875190068194.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability10657561875190068194.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2131
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4685201618132253734
[2023-03-15 08:35:14] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4685201618132253734
Running compilation step : cd /tmp/ltsmin4685201618132253734;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '6' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4685201618132253734;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '6' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 6 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4685201618132253734;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '6' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 6 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-15 08:35:20] [INFO ] Flatten gal took : 97 ms
[2023-03-15 08:35:20] [INFO ] Flatten gal took : 96 ms
[2023-03-15 08:35:20] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7105567754426358998.gal : 20 ms
[2023-03-15 08:35:20] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7495284730906767836.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability7105567754426358998.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability7495284730906767836.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityFireability7495284730906767836.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 160
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :176 after 184
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :184 after 16085
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :16085 after 19377
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :19377 after 22325
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :22325 after 28565
Detected timeout of ITS tools.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :28565 after 34986
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :34986 after 119617
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :119617 after 188617
Detected timeout of ITS tools.
[2023-03-15 08:40:20] [INFO ] Flatten gal took : 108 ms
[2023-03-15 08:40:20] [INFO ] Applying decomposition
[2023-03-15 08:40:20] [INFO ] Flatten gal took : 115 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10994981576518518056.txt' '-o' '/tmp/graph10994981576518518056.bin' '-w' '/tmp/graph10994981576518518056.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10994981576518518056.bin' '-l' '-1' '-v' '-w' '/tmp/graph10994981576518518056.weights' '-q' '0' '-e' '0.001'
[2023-03-15 08:40:22] [INFO ] Decomposing Gal with order
[2023-03-15 08:40:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:40:23] [INFO ] Removed a total of 4720 redundant transitions.
[2023-03-15 08:40:23] [INFO ] Flatten gal took : 569 ms
[2023-03-15 08:40:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 701 labels/synchronizations in 67 ms.
[2023-03-15 08:40:23] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability17281707002505232533.gal : 28 ms
[2023-03-15 08:40:23] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8800253811581129385.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability17281707002505232533.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability8800253811581129385.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability8800253811581129385.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2048
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1840939503892070142
[2023-03-15 08:45:24] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1840939503892070142
Running compilation step : cd /tmp/ltsmin1840939503892070142;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '60' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 6071 ms.
Running link step : cd /tmp/ltsmin1840939503892070142;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin1840939503892070142;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 12173076 kB
After kill :
MemTotal: 16393216 kB
MemFree: 13635196 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="PolyORBNT-COL-S10J80"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
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 itstools"
echo " Input is PolyORBNT-COL-S10J80, 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 r307-tall-167873961400442"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J80.tgz
mv PolyORBNT-COL-S10J80 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 ;