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.r309-tall-167873963000442.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 lolaxred
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 r309-tall-167873963000442
=====================================================================

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

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=lolaxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-COL-S10J80
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 00:37:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-22 00:37:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 00:37:35] [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-22 00:37:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 00:37:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 483 ms
[2023-03-22 00:37:35] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1694 PT places and 13742.0 transition bindings in 97 ms.
[2023-03-22 00:37:36] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 13580 transitions 119919 arcs in 309 ms.
[2023-03-22 00:37:36] [INFO ] Unfolded 38 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-22 00:37:36] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-22 00:37:36] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-22 00:37:36] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 80 places in 45 ms
Reduce places removed 80 places and 80 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 559 resets, run finished after 1375 ms. (steps per millisecond=7 ) properties (out of 36) seen :6
Incomplete Best-First random walk after 1001 steps, including 9 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 23 ms. (steps per millisecond=43 ) 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 23 ms. (steps per millisecond=43 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 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 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 30) 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 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 30) 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 30) 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 30) 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 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=10 ) properties (out of 30) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :2
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
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
Incomplete Best-First random walk after 1001 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 11 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 25) 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 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
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 80 ms. (steps per millisecond=12 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 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 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
[2023-03-22 00:37:38] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
// Phase 1: matrix 3381 rows 1614 cols
[2023-03-22 00:37:38] [INFO ] Computed 192 place invariants in 217 ms
[2023-03-22 00:37:42] [INFO ] [Real]Absence check using 185 positive place invariants in 83 ms returned sat
[2023-03-22 00:37:42] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 46 ms returned sat
[2023-03-22 00:37:45] [INFO ] After 2474ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:23
[2023-03-22 00:37:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:37:45] [INFO ] After 381ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2 real:23
[2023-03-22 00:37:46] [INFO ] After 768ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:23
Attempting to minimize the solution found.
Minimization took 270 ms.
[2023-03-22 00:37:46] [INFO ] After 5578ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:23
[2023-03-22 00:37:47] [INFO ] [Nat]Absence check using 185 positive place invariants in 70 ms returned sat
[2023-03-22 00:37:47] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 48 ms returned sat
[2023-03-22 00:38:11] [INFO ] After 23244ms 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: Broken pipe ...
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-22 00:38:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:38:11] [INFO ] After 25039ms 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 543 ms.
Support contains 1413 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1604 transition count 3388
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 1602 transition count 3388
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 1602 transition count 3387
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 1601 transition count 3387
Applied a total of 16 rules in 255 ms. Remains 1601 /1614 variables (removed 13) and now considering 3387/3390 (removed 3) transitions.
[2023-03-22 00:38:12] [INFO ] Flow matrix only has 3378 transitions (discarded 9 similar events)
// Phase 1: matrix 3378 rows 1601 cols
[2023-03-22 00:38:12] [INFO ] Computed 182 place invariants in 125 ms
[2023-03-22 00:38:15] [INFO ] Dead Transitions using invariants and state equation in 2628 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 : 1601/1614 places, 2772/3390 transitions.
Applied a total of 0 rules in 60 ms. Remains 1601 /1601 variables (removed 0) and now considering 2772/2772 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2952 ms. Remains : 1601/1614 places, 2772/3390 transitions.
Incomplete random walk after 1000000 steps, including 66561 resets, run finished after 8971 ms. (steps per millisecond=111 ) properties (out of 25) seen :24
Incomplete Best-First random walk after 1000001 steps, including 9189 resets, run finished after 2123 ms. (steps per millisecond=471 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:38:26] [INFO ] Flow matrix only has 2763 transitions (discarded 9 similar events)
// Phase 1: matrix 2763 rows 1601 cols
[2023-03-22 00:38:26] [INFO ] Computed 182 place invariants in 66 ms
[2023-03-22 00:38:26] [INFO ] [Real]Absence check using 176 positive place invariants in 62 ms returned sat
[2023-03-22 00:38:26] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 49 ms returned sat
[2023-03-22 00:38:26] [INFO ] After 323ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:38:26] [INFO ] [Nat]Absence check using 176 positive place invariants in 55 ms returned sat
[2023-03-22 00:38:26] [INFO ] [Nat]Absence check using 176 positive and 6 generalized place invariants in 31 ms returned sat
[2023-03-22 00:38:27] [INFO ] After 976ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:38:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:38:28] [INFO ] After 122ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:38:29] [INFO ] Deduced a trap composed of 750 places in 1678 ms of which 2 ms to minimize.
[2023-03-22 00:38:30] [INFO ] Deduced a trap composed of 756 places in 811 ms of which 2 ms to minimize.
[2023-03-22 00:38:31] [INFO ] Deduced a trap composed of 748 places in 817 ms of which 3 ms to minimize.
[2023-03-22 00:38:32] [INFO ] Deduced a trap composed of 750 places in 749 ms of which 3 ms to minimize.
[2023-03-22 00:38:33] [INFO ] Deduced a trap composed of 758 places in 746 ms of which 1 ms to minimize.
[2023-03-22 00:38:34] [INFO ] Deduced a trap composed of 746 places in 759 ms of which 5 ms to minimize.
[2023-03-22 00:38:35] [INFO ] Deduced a trap composed of 746 places in 734 ms of which 2 ms to minimize.
[2023-03-22 00:38:35] [INFO ] Deduced a trap composed of 738 places in 754 ms of which 1 ms to minimize.
[2023-03-22 00:38:36] [INFO ] Deduced a trap composed of 742 places in 735 ms of which 2 ms to minimize.
[2023-03-22 00:38:37] [INFO ] Deduced a trap composed of 738 places in 708 ms of which 1 ms to minimize.
[2023-03-22 00:38:38] [INFO ] Deduced a trap composed of 752 places in 727 ms of which 2 ms to minimize.
[2023-03-22 00:38:39] [INFO ] Deduced a trap composed of 744 places in 748 ms of which 2 ms to minimize.
[2023-03-22 00:38:40] [INFO ] Deduced a trap composed of 748 places in 726 ms of which 2 ms to minimize.
[2023-03-22 00:38:40] [INFO ] Deduced a trap composed of 750 places in 719 ms of which 1 ms to minimize.
[2023-03-22 00:38:42] [INFO ] Deduced a trap composed of 728 places in 768 ms of which 2 ms to minimize.
[2023-03-22 00:38:43] [INFO ] Deduced a trap composed of 744 places in 739 ms of which 1 ms to minimize.
[2023-03-22 00:38:44] [INFO ] Deduced a trap composed of 746 places in 712 ms of which 1 ms to minimize.
[2023-03-22 00:38:44] [INFO ] Deduced a trap composed of 734 places in 720 ms of which 1 ms to minimize.
[2023-03-22 00:38:45] [INFO ] Deduced a trap composed of 748 places in 719 ms of which 1 ms to minimize.
[2023-03-22 00:38:46] [INFO ] Deduced a trap composed of 760 places in 789 ms of which 2 ms to minimize.
[2023-03-22 00:38:55] [INFO ] Trap strengthening (SAT) tested/added 20/20 trap constraints in 27573 ms
[2023-03-22 00:38:55] [INFO ] After 27732ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:38:55] [INFO ] After 29006ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 40 ms.
Support contains 1 out of 1601 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1601/1601 places, 2772/2772 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 1601 transition count 2688
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 168 place count 1517 transition count 2688
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 168 place count 1517 transition count 2604
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 336 place count 1433 transition count 2604
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 337 place count 1432 transition count 2603
Iterating global reduction 2 with 1 rules applied. Total rules applied 338 place count 1432 transition count 2603
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 342 place count 1430 transition count 2601
Applied a total of 342 rules in 616 ms. Remains 1430 /1601 variables (removed 171) and now considering 2601/2772 (removed 171) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 616 ms. Remains : 1430/1601 places, 2601/2772 transitions.
Incomplete random walk after 1000000 steps, including 72667 resets, run finished after 11101 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6428 resets, run finished after 2082 ms. (steps per millisecond=480 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3306188 steps, run timeout after 39001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 3306188 steps, saw 549717 distinct states, run finished after 39003 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:39:48] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2023-03-22 00:39:48] [INFO ] Computed 182 place invariants in 58 ms
[2023-03-22 00:39:48] [INFO ] [Real]Absence check using 175 positive place invariants in 45 ms returned sat
[2023-03-22 00:39:48] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-22 00:39:48] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:39:48] [INFO ] [Nat]Absence check using 175 positive place invariants in 43 ms returned sat
[2023-03-22 00:39:48] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 40 ms returned sat
[2023-03-22 00:39:53] [INFO ] After 4766ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:39:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:39:53] [INFO ] After 71ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:39:54] [INFO ] Deduced a trap composed of 574 places in 607 ms of which 1 ms to minimize.
[2023-03-22 00:39:55] [INFO ] Deduced a trap composed of 566 places in 583 ms of which 1 ms to minimize.
[2023-03-22 00:39:55] [INFO ] Deduced a trap composed of 568 places in 571 ms of which 1 ms to minimize.
[2023-03-22 00:39:56] [INFO ] Deduced a trap composed of 578 places in 586 ms of which 1 ms to minimize.
[2023-03-22 00:39:57] [INFO ] Deduced a trap composed of 570 places in 578 ms of which 1 ms to minimize.
[2023-03-22 00:39:58] [INFO ] Deduced a trap composed of 572 places in 592 ms of which 1 ms to minimize.
[2023-03-22 00:39:58] [INFO ] Deduced a trap composed of 574 places in 593 ms of which 1 ms to minimize.
[2023-03-22 00:39:59] [INFO ] Deduced a trap composed of 580 places in 574 ms of which 1 ms to minimize.
[2023-03-22 00:40:00] [INFO ] Deduced a trap composed of 582 places in 585 ms of which 1 ms to minimize.
[2023-03-22 00:40:00] [INFO ] Deduced a trap composed of 588 places in 579 ms of which 2 ms to minimize.
[2023-03-22 00:40:01] [INFO ] Deduced a trap composed of 568 places in 578 ms of which 1 ms to minimize.
[2023-03-22 00:40:02] [INFO ] Deduced a trap composed of 558 places in 576 ms of which 2 ms to minimize.
[2023-03-22 00:40:03] [INFO ] Deduced a trap composed of 568 places in 583 ms of which 2 ms to minimize.
[2023-03-22 00:40:04] [INFO ] Deduced a trap composed of 582 places in 590 ms of which 9 ms to minimize.
[2023-03-22 00:40:05] [INFO ] Deduced a trap composed of 562 places in 582 ms of which 1 ms to minimize.
[2023-03-22 00:40:06] [INFO ] Deduced a trap composed of 560 places in 575 ms of which 1 ms to minimize.
[2023-03-22 00:40:06] [INFO ] Deduced a trap composed of 570 places in 578 ms of which 1 ms to minimize.
[2023-03-22 00:40:07] [INFO ] Deduced a trap composed of 570 places in 570 ms of which 1 ms to minimize.
[2023-03-22 00:40:08] [INFO ] Deduced a trap composed of 572 places in 567 ms of which 2 ms to minimize.
[2023-03-22 00:40:08] [INFO ] Deduced a trap composed of 582 places in 568 ms of which 1 ms to minimize.
[2023-03-22 00:40:09] [INFO ] Deduced a trap composed of 572 places in 576 ms of which 2 ms to minimize.
[2023-03-22 00:40:10] [INFO ] Deduced a trap composed of 586 places in 573 ms of which 1 ms to minimize.
[2023-03-22 00:40:10] [INFO ] Deduced a trap composed of 570 places in 593 ms of which 1 ms to minimize.
[2023-03-22 00:40:11] [INFO ] Deduced a trap composed of 576 places in 574 ms of which 1 ms to minimize.
[2023-03-22 00:40:12] [INFO ] Deduced a trap composed of 584 places in 570 ms of which 1 ms to minimize.
[2023-03-22 00:40:13] [INFO ] Deduced a trap composed of 580 places in 591 ms of which 4 ms to minimize.
[2023-03-22 00:40:13] [INFO ] Deduced a trap composed of 572 places in 579 ms of which 2 ms to minimize.
[2023-03-22 00:40:14] [INFO ] Deduced a trap composed of 574 places in 568 ms of which 1 ms to minimize.
[2023-03-22 00:40:15] [INFO ] Deduced a trap composed of 572 places in 568 ms of which 1 ms to minimize.
[2023-03-22 00:40:19] [INFO ] Deduced a trap composed of 580 places in 591 ms of which 1 ms to minimize.
[2023-03-22 00:40:19] [INFO ] Deduced a trap composed of 574 places in 579 ms of which 1 ms to minimize.
[2023-03-22 00:40:20] [INFO ] Deduced a trap composed of 578 places in 567 ms of which 2 ms to minimize.
[2023-03-22 00:40:21] [INFO ] Deduced a trap composed of 562 places in 572 ms of which 1 ms to minimize.
[2023-03-22 00:40:21] [INFO ] Deduced a trap composed of 574 places in 586 ms of which 1 ms to minimize.
[2023-03-22 00:40:22] [INFO ] Deduced a trap composed of 568 places in 586 ms of which 1 ms to minimize.
[2023-03-22 00:40:23] [INFO ] Deduced a trap composed of 578 places in 579 ms of which 4 ms to minimize.
[2023-03-22 00:40:32] [INFO ] Trap strengthening (SAT) tested/added 36/36 trap constraints in 38363 ms
[2023-03-22 00:40:32] [INFO ] After 38695ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:40:32] [INFO ] After 43725ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 19 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.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 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 73 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-22 00:40:32] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-22 00:40:32] [INFO ] Invariant cache hit.
[2023-03-22 00:40:34] [INFO ] Implicit Places using invariants in 1413 ms returned []
[2023-03-22 00:40:34] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-22 00:40:34] [INFO ] Invariant cache hit.
[2023-03-22 00:40:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:40:41] [INFO ] Implicit Places using invariants and state equation in 7505 ms returned []
Implicit Place search using SMT with State Equation took 8922 ms to find 0 implicit places.
[2023-03-22 00:40:41] [INFO ] Redundant transitions in 140 ms returned []
[2023-03-22 00:40:41] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-22 00:40:41] [INFO ] Invariant cache hit.
[2023-03-22 00:40:43] [INFO ] Dead Transitions using invariants and state equation in 1369 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10512 ms. Remains : 1430/1430 places, 2601/2601 transitions.
Incomplete random walk after 100000 steps, including 7241 resets, run finished after 1192 ms. (steps per millisecond=83 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:40:44] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-22 00:40:44] [INFO ] Invariant cache hit.
[2023-03-22 00:40:44] [INFO ] [Real]Absence check using 175 positive place invariants in 42 ms returned sat
[2023-03-22 00:40:44] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 37 ms returned sat
[2023-03-22 00:40:45] [INFO ] After 882ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:40:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:40:45] [INFO ] After 66ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-22 00:40:45] [INFO ] After 203ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:40:45] [INFO ] After 1306ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:40:45] [INFO ] [Nat]Absence check using 175 positive place invariants in 41 ms returned sat
[2023-03-22 00:40:45] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 44 ms returned sat
[2023-03-22 00:40:46] [INFO ] After 772ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:40:47] [INFO ] After 649ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:40:47] [INFO ] Deduced a trap composed of 560 places in 616 ms of which 1 ms to minimize.
[2023-03-22 00:40:48] [INFO ] Deduced a trap composed of 566 places in 586 ms of which 2 ms to minimize.
[2023-03-22 00:40:49] [INFO ] Deduced a trap composed of 582 places in 591 ms of which 1 ms to minimize.
[2023-03-22 00:40:50] [INFO ] Deduced a trap composed of 564 places in 583 ms of which 1 ms to minimize.
[2023-03-22 00:40:50] [INFO ] Deduced a trap composed of 566 places in 582 ms of which 1 ms to minimize.
[2023-03-22 00:40:51] [INFO ] Deduced a trap composed of 582 places in 572 ms of which 1 ms to minimize.
[2023-03-22 00:40:52] [INFO ] Deduced a trap composed of 580 places in 577 ms of which 2 ms to minimize.
[2023-03-22 00:40:52] [INFO ] Deduced a trap composed of 570 places in 578 ms of which 1 ms to minimize.
[2023-03-22 00:40:53] [INFO ] Deduced a trap composed of 580 places in 645 ms of which 1 ms to minimize.
[2023-03-22 00:40:54] [INFO ] Deduced a trap composed of 568 places in 590 ms of which 5 ms to minimize.
[2023-03-22 00:40:55] [INFO ] Deduced a trap composed of 558 places in 578 ms of which 3 ms to minimize.
[2023-03-22 00:40:56] [INFO ] Deduced a trap composed of 574 places in 578 ms of which 2 ms to minimize.
[2023-03-22 00:40:56] [INFO ] Deduced a trap composed of 566 places in 584 ms of which 1 ms to minimize.
[2023-03-22 00:40:57] [INFO ] Deduced a trap composed of 568 places in 575 ms of which 1 ms to minimize.
[2023-03-22 00:40:58] [INFO ] Deduced a trap composed of 570 places in 581 ms of which 2 ms to minimize.
[2023-03-22 00:40:58] [INFO ] Deduced a trap composed of 570 places in 580 ms of which 1 ms to minimize.
[2023-03-22 00:40:59] [INFO ] Deduced a trap composed of 568 places in 577 ms of which 2 ms to minimize.
[2023-03-22 00:41:00] [INFO ] Deduced a trap composed of 574 places in 585 ms of which 1 ms to minimize.
[2023-03-22 00:41:01] [INFO ] Deduced a trap composed of 568 places in 568 ms of which 1 ms to minimize.
[2023-03-22 00:41:01] [INFO ] Deduced a trap composed of 580 places in 573 ms of which 1 ms to minimize.
[2023-03-22 00:41:02] [INFO ] Deduced a trap composed of 570 places in 572 ms of which 1 ms to minimize.
[2023-03-22 00:41:03] [INFO ] Deduced a trap composed of 566 places in 592 ms of which 1 ms to minimize.
[2023-03-22 00:41:03] [INFO ] Deduced a trap composed of 578 places in 559 ms of which 1 ms to minimize.
[2023-03-22 00:41:04] [INFO ] Deduced a trap composed of 564 places in 571 ms of which 1 ms to minimize.
[2023-03-22 00:41:05] [INFO ] Deduced a trap composed of 570 places in 567 ms of which 1 ms to minimize.
[2023-03-22 00:41:06] [INFO ] Deduced a trap composed of 566 places in 572 ms of which 1 ms to minimize.
[2023-03-22 00:41:06] [INFO ] Deduced a trap composed of 578 places in 561 ms of which 1 ms to minimize.
[2023-03-22 00:41:08] [INFO ] Deduced a trap composed of 574 places in 566 ms of which 1 ms to minimize.
[2023-03-22 00:41:09] [INFO ] Deduced a trap composed of 570 places in 580 ms of which 1 ms to minimize.
[2023-03-22 00:41:10] [INFO ] Deduced a trap composed of 568 places in 570 ms of which 1 ms to minimize.
[2023-03-22 00:41:11] [INFO ] Deduced a trap composed of 574 places in 582 ms of which 1 ms to minimize.
[2023-03-22 00:41:11] [INFO ] Deduced a trap composed of 570 places in 570 ms of which 1 ms to minimize.
[2023-03-22 00:41:12] [INFO ] Deduced a trap composed of 564 places in 573 ms of which 1 ms to minimize.
[2023-03-22 00:41:13] [INFO ] Deduced a trap composed of 568 places in 587 ms of which 1 ms to minimize.
[2023-03-22 00:41:13] [INFO ] Deduced a trap composed of 586 places in 582 ms of which 1 ms to minimize.
[2023-03-22 00:41:14] [INFO ] Deduced a trap composed of 572 places in 613 ms of which 1 ms to minimize.
[2023-03-22 00:41:15] [INFO ] Deduced a trap composed of 572 places in 561 ms of which 1 ms to minimize.
[2023-03-22 00:41:16] [INFO ] Deduced a trap composed of 564 places in 577 ms of which 2 ms to minimize.
[2023-03-22 00:41:16] [INFO ] Deduced a trap composed of 586 places in 593 ms of which 1 ms to minimize.
[2023-03-22 00:41:17] [INFO ] Deduced a trap composed of 572 places in 585 ms of which 1 ms to minimize.
[2023-03-22 00:41:18] [INFO ] Deduced a trap composed of 574 places in 570 ms of which 1 ms to minimize.
[2023-03-22 00:41:18] [INFO ] Deduced a trap composed of 570 places in 569 ms of which 1 ms to minimize.
[2023-03-22 00:41:19] [INFO ] Deduced a trap composed of 570 places in 576 ms of which 1 ms to minimize.
[2023-03-22 00:41:20] [INFO ] Deduced a trap composed of 574 places in 615 ms of which 1 ms to minimize.
[2023-03-22 00:41:20] [INFO ] Deduced a trap composed of 570 places in 570 ms of which 1 ms to minimize.
[2023-03-22 00:41:22] [INFO ] Deduced a trap composed of 584 places in 594 ms of which 1 ms to minimize.
[2023-03-22 00:41:23] [INFO ] Deduced a trap composed of 572 places in 597 ms of which 2 ms to minimize.
[2023-03-22 00:41:25] [INFO ] Deduced a trap composed of 568 places in 591 ms of which 1 ms to minimize.
[2023-03-22 00:41:27] [INFO ] Deduced a trap composed of 566 places in 591 ms of which 1 ms to minimize.
[2023-03-22 00:41:29] [INFO ] Deduced a trap composed of 564 places in 586 ms of which 2 ms to minimize.
[2023-03-22 00:41:30] [INFO ] Deduced a trap composed of 562 places in 584 ms of which 2 ms to minimize.
[2023-03-22 00:41:31] [INFO ] Deduced a trap composed of 572 places in 572 ms of which 1 ms to minimize.
[2023-03-22 00:41:32] [INFO ] Deduced a trap composed of 558 places in 587 ms of which 1 ms to minimize.
[2023-03-22 00:41:32] [INFO ] Deduced a trap composed of 568 places in 573 ms of which 1 ms to minimize.
[2023-03-22 00:41:33] [INFO ] Deduced a trap composed of 574 places in 587 ms of which 1 ms to minimize.
[2023-03-22 00:41:37] [INFO ] Deduced a trap composed of 570 places in 576 ms of which 2 ms to minimize.
[2023-03-22 00:41:41] [INFO ] Deduced a trap composed of 576 places in 581 ms of which 2 ms to minimize.
[2023-03-22 00:41:42] [INFO ] Deduced a trap composed of 568 places in 572 ms of which 1 ms to minimize.
[2023-03-22 00:41:47] [INFO ] Deduced a trap composed of 568 places in 567 ms of which 1 ms to minimize.
[2023-03-22 00:41:56] [INFO ] Trap strengthening (SAT) tested/added 59/59 trap constraints in 69383 ms
[2023-03-22 00:41:57] [INFO ] After 70985ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:41:57] [INFO ] After 71981ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 72675 resets, run finished after 11175 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6418 resets, run finished after 2032 ms. (steps per millisecond=492 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3324513 steps, run timeout after 39001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 3324513 steps, saw 552652 distinct states, run finished after 39001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:42:49] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-22 00:42:49] [INFO ] Invariant cache hit.
[2023-03-22 00:42:50] [INFO ] [Real]Absence check using 175 positive place invariants in 40 ms returned sat
[2023-03-22 00:42:50] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 36 ms returned sat
[2023-03-22 00:42:50] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:42:50] [INFO ] [Nat]Absence check using 175 positive place invariants in 40 ms returned sat
[2023-03-22 00:42:50] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 48 ms returned sat
[2023-03-22 00:42:51] [INFO ] After 823ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:42:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:42:51] [INFO ] After 718ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:42:52] [INFO ] Deduced a trap composed of 560 places in 584 ms of which 2 ms to minimize.
[2023-03-22 00:42:53] [INFO ] Deduced a trap composed of 566 places in 582 ms of which 1 ms to minimize.
[2023-03-22 00:42:54] [INFO ] Deduced a trap composed of 582 places in 579 ms of which 1 ms to minimize.
[2023-03-22 00:42:54] [INFO ] Deduced a trap composed of 564 places in 579 ms of which 1 ms to minimize.
[2023-03-22 00:42:55] [INFO ] Deduced a trap composed of 566 places in 566 ms of which 2 ms to minimize.
[2023-03-22 00:42:56] [INFO ] Deduced a trap composed of 582 places in 578 ms of which 1 ms to minimize.
[2023-03-22 00:42:56] [INFO ] Deduced a trap composed of 580 places in 593 ms of which 1 ms to minimize.
[2023-03-22 00:42:57] [INFO ] Deduced a trap composed of 570 places in 573 ms of which 1 ms to minimize.
[2023-03-22 00:42:58] [INFO ] Deduced a trap composed of 580 places in 618 ms of which 1 ms to minimize.
[2023-03-22 00:42:59] [INFO ] Deduced a trap composed of 568 places in 586 ms of which 1 ms to minimize.
[2023-03-22 00:43:00] [INFO ] Deduced a trap composed of 558 places in 585 ms of which 1 ms to minimize.
[2023-03-22 00:43:00] [INFO ] Deduced a trap composed of 574 places in 582 ms of which 2 ms to minimize.
[2023-03-22 00:43:01] [INFO ] Deduced a trap composed of 566 places in 569 ms of which 1 ms to minimize.
[2023-03-22 00:43:02] [INFO ] Deduced a trap composed of 568 places in 574 ms of which 1 ms to minimize.
[2023-03-22 00:43:02] [INFO ] Deduced a trap composed of 570 places in 570 ms of which 1 ms to minimize.
[2023-03-22 00:43:03] [INFO ] Deduced a trap composed of 570 places in 589 ms of which 1 ms to minimize.
[2023-03-22 00:43:04] [INFO ] Deduced a trap composed of 568 places in 577 ms of which 1 ms to minimize.
[2023-03-22 00:43:04] [INFO ] Deduced a trap composed of 574 places in 587 ms of which 1 ms to minimize.
[2023-03-22 00:43:05] [INFO ] Deduced a trap composed of 568 places in 576 ms of which 1 ms to minimize.
[2023-03-22 00:43:06] [INFO ] Deduced a trap composed of 580 places in 567 ms of which 2 ms to minimize.
[2023-03-22 00:43:07] [INFO ] Deduced a trap composed of 570 places in 588 ms of which 1 ms to minimize.
[2023-03-22 00:43:07] [INFO ] Deduced a trap composed of 566 places in 600 ms of which 1 ms to minimize.
[2023-03-22 00:43:08] [INFO ] Deduced a trap composed of 578 places in 598 ms of which 1 ms to minimize.
[2023-03-22 00:43:09] [INFO ] Deduced a trap composed of 564 places in 600 ms of which 1 ms to minimize.
[2023-03-22 00:43:10] [INFO ] Deduced a trap composed of 570 places in 587 ms of which 1 ms to minimize.
[2023-03-22 00:43:10] [INFO ] Deduced a trap composed of 566 places in 587 ms of which 1 ms to minimize.
[2023-03-22 00:43:11] [INFO ] Deduced a trap composed of 578 places in 578 ms of which 1 ms to minimize.
[2023-03-22 00:43:13] [INFO ] Deduced a trap composed of 574 places in 587 ms of which 1 ms to minimize.
[2023-03-22 00:43:14] [INFO ] Deduced a trap composed of 570 places in 574 ms of which 1 ms to minimize.
[2023-03-22 00:43:15] [INFO ] Deduced a trap composed of 568 places in 570 ms of which 1 ms to minimize.
[2023-03-22 00:43:15] [INFO ] Deduced a trap composed of 574 places in 570 ms of which 1 ms to minimize.
[2023-03-22 00:43:16] [INFO ] Deduced a trap composed of 570 places in 583 ms of which 1 ms to minimize.
[2023-03-22 00:43:17] [INFO ] Deduced a trap composed of 564 places in 582 ms of which 1 ms to minimize.
[2023-03-22 00:43:17] [INFO ] Deduced a trap composed of 568 places in 580 ms of which 1 ms to minimize.
[2023-03-22 00:43:18] [INFO ] Deduced a trap composed of 586 places in 581 ms of which 2 ms to minimize.
[2023-03-22 00:43:19] [INFO ] Deduced a trap composed of 572 places in 643 ms of which 1 ms to minimize.
[2023-03-22 00:43:20] [INFO ] Deduced a trap composed of 572 places in 575 ms of which 1 ms to minimize.
[2023-03-22 00:43:20] [INFO ] Deduced a trap composed of 564 places in 579 ms of which 1 ms to minimize.
[2023-03-22 00:43:21] [INFO ] Deduced a trap composed of 586 places in 582 ms of which 1 ms to minimize.
[2023-03-22 00:43:22] [INFO ] Deduced a trap composed of 572 places in 582 ms of which 1 ms to minimize.
[2023-03-22 00:43:22] [INFO ] Deduced a trap composed of 574 places in 575 ms of which 2 ms to minimize.
[2023-03-22 00:43:23] [INFO ] Deduced a trap composed of 570 places in 576 ms of which 1 ms to minimize.
[2023-03-22 00:43:24] [INFO ] Deduced a trap composed of 570 places in 582 ms of which 1 ms to minimize.
[2023-03-22 00:43:24] [INFO ] Deduced a trap composed of 574 places in 583 ms of which 1 ms to minimize.
[2023-03-22 00:43:25] [INFO ] Deduced a trap composed of 570 places in 577 ms of which 1 ms to minimize.
[2023-03-22 00:43:27] [INFO ] Deduced a trap composed of 584 places in 580 ms of which 1 ms to minimize.
[2023-03-22 00:43:28] [INFO ] Deduced a trap composed of 572 places in 590 ms of which 2 ms to minimize.
[2023-03-22 00:43:30] [INFO ] Deduced a trap composed of 568 places in 574 ms of which 1 ms to minimize.
[2023-03-22 00:43:32] [INFO ] Deduced a trap composed of 566 places in 586 ms of which 1 ms to minimize.
[2023-03-22 00:43:34] [INFO ] Deduced a trap composed of 564 places in 596 ms of which 1 ms to minimize.
[2023-03-22 00:43:35] [INFO ] Deduced a trap composed of 562 places in 577 ms of which 2 ms to minimize.
[2023-03-22 00:43:35] [INFO ] Deduced a trap composed of 572 places in 586 ms of which 1 ms to minimize.
[2023-03-22 00:43:36] [INFO ] Deduced a trap composed of 558 places in 579 ms of which 1 ms to minimize.
[2023-03-22 00:43:37] [INFO ] Deduced a trap composed of 568 places in 592 ms of which 1 ms to minimize.
[2023-03-22 00:43:38] [INFO ] Deduced a trap composed of 574 places in 603 ms of which 2 ms to minimize.
[2023-03-22 00:43:42] [INFO ] Deduced a trap composed of 570 places in 570 ms of which 1 ms to minimize.
[2023-03-22 00:43:46] [INFO ] Deduced a trap composed of 576 places in 578 ms of which 1 ms to minimize.
[2023-03-22 00:43:47] [INFO ] Deduced a trap composed of 568 places in 584 ms of which 1 ms to minimize.
[2023-03-22 00:43:52] [INFO ] Deduced a trap composed of 568 places in 592 ms of which 1 ms to minimize.
[2023-03-22 00:44:01] [INFO ] Trap strengthening (SAT) tested/added 59/59 trap constraints in 69729 ms
[2023-03-22 00:44:02] [INFO ] After 71634ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:44:02] [INFO ] After 72715ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 20 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 71 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 93 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-22 00:44:02] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-22 00:44:02] [INFO ] Invariant cache hit.
[2023-03-22 00:44:04] [INFO ] Implicit Places using invariants in 1384 ms returned []
[2023-03-22 00:44:04] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-22 00:44:04] [INFO ] Invariant cache hit.
[2023-03-22 00:44:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:44:16] [INFO ] Implicit Places using invariants and state equation in 11706 ms returned []
Implicit Place search using SMT with State Equation took 13091 ms to find 0 implicit places.
[2023-03-22 00:44:16] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-22 00:44:16] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-22 00:44:16] [INFO ] Invariant cache hit.
[2023-03-22 00:44:17] [INFO ] Dead Transitions using invariants and state equation in 1330 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14587 ms. Remains : 1430/1430 places, 2601/2601 transitions.
Incomplete random walk after 100000 steps, including 7347 resets, run finished after 1119 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:44:18] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-22 00:44:18] [INFO ] Invariant cache hit.
[2023-03-22 00:44:18] [INFO ] [Real]Absence check using 175 positive place invariants in 40 ms returned sat
[2023-03-22 00:44:18] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 42 ms returned sat
[2023-03-22 00:44:19] [INFO ] After 884ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:44:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:44:19] [INFO ] After 67ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-22 00:44:19] [INFO ] After 212ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:44:19] [INFO ] After 1317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:44:20] [INFO ] [Nat]Absence check using 175 positive place invariants in 40 ms returned sat
[2023-03-22 00:44:20] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 38 ms returned sat
[2023-03-22 00:44:20] [INFO ] After 786ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:44:21] [INFO ] After 656ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:44:22] [INFO ] Deduced a trap composed of 560 places in 575 ms of which 1 ms to minimize.
[2023-03-22 00:44:22] [INFO ] Deduced a trap composed of 566 places in 565 ms of which 2 ms to minimize.
[2023-03-22 00:44:23] [INFO ] Deduced a trap composed of 582 places in 577 ms of which 1 ms to minimize.
[2023-03-22 00:44:24] [INFO ] Deduced a trap composed of 564 places in 571 ms of which 1 ms to minimize.
[2023-03-22 00:44:25] [INFO ] Deduced a trap composed of 566 places in 574 ms of which 1 ms to minimize.
[2023-03-22 00:44:25] [INFO ] Deduced a trap composed of 582 places in 574 ms of which 1 ms to minimize.
[2023-03-22 00:44:26] [INFO ] Deduced a trap composed of 580 places in 577 ms of which 1 ms to minimize.
[2023-03-22 00:44:27] [INFO ] Deduced a trap composed of 570 places in 586 ms of which 1 ms to minimize.
[2023-03-22 00:44:28] [INFO ] Deduced a trap composed of 580 places in 624 ms of which 1 ms to minimize.
[2023-03-22 00:44:28] [INFO ] Deduced a trap composed of 568 places in 582 ms of which 1 ms to minimize.
[2023-03-22 00:44:29] [INFO ] Deduced a trap composed of 558 places in 572 ms of which 2 ms to minimize.
[2023-03-22 00:44:30] [INFO ] Deduced a trap composed of 574 places in 577 ms of which 1 ms to minimize.
[2023-03-22 00:44:31] [INFO ] Deduced a trap composed of 566 places in 603 ms of which 1 ms to minimize.
[2023-03-22 00:44:31] [INFO ] Deduced a trap composed of 568 places in 605 ms of which 1 ms to minimize.
[2023-03-22 00:44:32] [INFO ] Deduced a trap composed of 570 places in 588 ms of which 1 ms to minimize.
[2023-03-22 00:44:33] [INFO ] Deduced a trap composed of 570 places in 577 ms of which 1 ms to minimize.
[2023-03-22 00:44:33] [INFO ] Deduced a trap composed of 568 places in 577 ms of which 1 ms to minimize.
[2023-03-22 00:44:34] [INFO ] Deduced a trap composed of 574 places in 596 ms of which 1 ms to minimize.
[2023-03-22 00:44:35] [INFO ] Deduced a trap composed of 568 places in 593 ms of which 2 ms to minimize.
[2023-03-22 00:44:36] [INFO ] Deduced a trap composed of 580 places in 592 ms of which 1 ms to minimize.
[2023-03-22 00:44:36] [INFO ] Deduced a trap composed of 570 places in 594 ms of which 2 ms to minimize.
[2023-03-22 00:44:37] [INFO ] Deduced a trap composed of 566 places in 582 ms of which 1 ms to minimize.
[2023-03-22 00:44:38] [INFO ] Deduced a trap composed of 578 places in 574 ms of which 2 ms to minimize.
[2023-03-22 00:44:39] [INFO ] Deduced a trap composed of 564 places in 587 ms of which 1 ms to minimize.
[2023-03-22 00:44:39] [INFO ] Deduced a trap composed of 570 places in 579 ms of which 1 ms to minimize.
[2023-03-22 00:44:40] [INFO ] Deduced a trap composed of 566 places in 570 ms of which 1 ms to minimize.
[2023-03-22 00:44:41] [INFO ] Deduced a trap composed of 578 places in 573 ms of which 1 ms to minimize.
[2023-03-22 00:44:42] [INFO ] Deduced a trap composed of 574 places in 568 ms of which 1 ms to minimize.
[2023-03-22 00:44:44] [INFO ] Deduced a trap composed of 570 places in 581 ms of which 1 ms to minimize.
[2023-03-22 00:44:44] [INFO ] Deduced a trap composed of 568 places in 569 ms of which 1 ms to minimize.
[2023-03-22 00:44:45] [INFO ] Deduced a trap composed of 574 places in 575 ms of which 1 ms to minimize.
[2023-03-22 00:44:46] [INFO ] Deduced a trap composed of 570 places in 586 ms of which 3 ms to minimize.
[2023-03-22 00:44:46] [INFO ] Deduced a trap composed of 564 places in 583 ms of which 1 ms to minimize.
[2023-03-22 00:44:47] [INFO ] Deduced a trap composed of 568 places in 575 ms of which 1 ms to minimize.
[2023-03-22 00:44:48] [INFO ] Deduced a trap composed of 586 places in 604 ms of which 1 ms to minimize.
[2023-03-22 00:44:49] [INFO ] Deduced a trap composed of 572 places in 644 ms of which 1 ms to minimize.
[2023-03-22 00:44:49] [INFO ] Deduced a trap composed of 572 places in 566 ms of which 1 ms to minimize.
[2023-03-22 00:44:50] [INFO ] Deduced a trap composed of 564 places in 579 ms of which 1 ms to minimize.
[2023-03-22 00:44:51] [INFO ] Deduced a trap composed of 586 places in 597 ms of which 1 ms to minimize.
[2023-03-22 00:44:51] [INFO ] Deduced a trap composed of 572 places in 574 ms of which 1 ms to minimize.
[2023-03-22 00:44:52] [INFO ] Deduced a trap composed of 574 places in 597 ms of which 1 ms to minimize.
[2023-03-22 00:44:53] [INFO ] Deduced a trap composed of 570 places in 578 ms of which 1 ms to minimize.
[2023-03-22 00:44:53] [INFO ] Deduced a trap composed of 570 places in 587 ms of which 1 ms to minimize.
[2023-03-22 00:44:54] [INFO ] Deduced a trap composed of 574 places in 569 ms of which 1 ms to minimize.
[2023-03-22 00:44:55] [INFO ] Deduced a trap composed of 570 places in 560 ms of which 1 ms to minimize.
[2023-03-22 00:44:57] [INFO ] Deduced a trap composed of 584 places in 581 ms of which 2 ms to minimize.
[2023-03-22 00:44:58] [INFO ] Deduced a trap composed of 572 places in 569 ms of which 2 ms to minimize.
[2023-03-22 00:45:00] [INFO ] Deduced a trap composed of 568 places in 569 ms of which 2 ms to minimize.
[2023-03-22 00:45:01] [INFO ] Deduced a trap composed of 566 places in 572 ms of which 1 ms to minimize.
[2023-03-22 00:45:04] [INFO ] Deduced a trap composed of 564 places in 584 ms of which 2 ms to minimize.
[2023-03-22 00:45:04] [INFO ] Deduced a trap composed of 562 places in 560 ms of which 1 ms to minimize.
[2023-03-22 00:45:05] [INFO ] Deduced a trap composed of 572 places in 566 ms of which 1 ms to minimize.
[2023-03-22 00:45:06] [INFO ] Deduced a trap composed of 558 places in 577 ms of which 1 ms to minimize.
[2023-03-22 00:45:06] [INFO ] Deduced a trap composed of 568 places in 566 ms of which 1 ms to minimize.
[2023-03-22 00:45:07] [INFO ] Deduced a trap composed of 574 places in 570 ms of which 1 ms to minimize.
[2023-03-22 00:45:11] [INFO ] Deduced a trap composed of 570 places in 576 ms of which 1 ms to minimize.
[2023-03-22 00:45:16] [INFO ] Deduced a trap composed of 576 places in 587 ms of which 2 ms to minimize.
[2023-03-22 00:45:16] [INFO ] Deduced a trap composed of 568 places in 575 ms of which 1 ms to minimize.
[2023-03-22 00:45:21] [INFO ] Deduced a trap composed of 568 places in 584 ms of which 1 ms to minimize.
[2023-03-22 00:45:30] [INFO ] Trap strengthening (SAT) tested/added 59/59 trap constraints in 69409 ms
[2023-03-22 00:45:32] [INFO ] After 71100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:45:32] [INFO ] After 72095ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 740 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 248473 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 248473 steps, saw 41268 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:45:35] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-22 00:45:35] [INFO ] Invariant cache hit.
[2023-03-22 00:45:35] [INFO ] [Real]Absence check using 175 positive place invariants in 40 ms returned sat
[2023-03-22 00:45:35] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 37 ms returned sat
[2023-03-22 00:45:35] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:45:35] [INFO ] [Nat]Absence check using 175 positive place invariants in 42 ms returned sat
[2023-03-22 00:45:35] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 37 ms returned sat
[2023-03-22 00:45:36] [INFO ] After 820ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:45:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:45:36] [INFO ] After 418ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:45:37] [INFO ] Deduced a trap composed of 578 places in 570 ms of which 1 ms to minimize.
[2023-03-22 00:45:38] [INFO ] Deduced a trap composed of 568 places in 581 ms of which 1 ms to minimize.
[2023-03-22 00:45:39] [INFO ] Deduced a trap composed of 576 places in 579 ms of which 1 ms to minimize.
[2023-03-22 00:45:39] [INFO ] Deduced a trap composed of 584 places in 633 ms of which 2 ms to minimize.
[2023-03-22 00:45:40] [INFO ] Deduced a trap composed of 570 places in 579 ms of which 1 ms to minimize.
[2023-03-22 00:45:41] [INFO ] Deduced a trap composed of 570 places in 581 ms of which 1 ms to minimize.
[2023-03-22 00:45:41] [INFO ] Deduced a trap composed of 582 places in 620 ms of which 1 ms to minimize.
[2023-03-22 00:45:42] [INFO ] Deduced a trap composed of 576 places in 591 ms of which 1 ms to minimize.
[2023-03-22 00:45:43] [INFO ] Deduced a trap composed of 586 places in 585 ms of which 2 ms to minimize.
[2023-03-22 00:45:43] [INFO ] Deduced a trap composed of 578 places in 588 ms of which 2 ms to minimize.
[2023-03-22 00:45:44] [INFO ] Deduced a trap composed of 578 places in 588 ms of which 1 ms to minimize.
[2023-03-22 00:45:45] [INFO ] Deduced a trap composed of 562 places in 571 ms of which 1 ms to minimize.
[2023-03-22 00:45:45] [INFO ] Deduced a trap composed of 578 places in 578 ms of which 1 ms to minimize.
[2023-03-22 00:45:46] [INFO ] Deduced a trap composed of 570 places in 583 ms of which 1 ms to minimize.
[2023-03-22 00:45:47] [INFO ] Deduced a trap composed of 568 places in 567 ms of which 3 ms to minimize.
[2023-03-22 00:45:48] [INFO ] Deduced a trap composed of 580 places in 572 ms of which 1 ms to minimize.
[2023-03-22 00:45:50] [INFO ] Deduced a trap composed of 578 places in 582 ms of which 1 ms to minimize.
[2023-03-22 00:45:51] [INFO ] Deduced a trap composed of 578 places in 571 ms of which 1 ms to minimize.
[2023-03-22 00:45:55] [INFO ] Deduced a trap composed of 574 places in 579 ms of which 1 ms to minimize.
[2023-03-22 00:45:55] [INFO ] Deduced a trap composed of 570 places in 585 ms of which 1 ms to minimize.
[2023-03-22 00:45:56] [INFO ] Deduced a trap composed of 574 places in 587 ms of which 1 ms to minimize.
[2023-03-22 00:45:57] [INFO ] Deduced a trap composed of 572 places in 562 ms of which 2 ms to minimize.
[2023-03-22 00:45:58] [INFO ] Deduced a trap composed of 572 places in 567 ms of which 1 ms to minimize.
[2023-03-22 00:45:59] [INFO ] Deduced a trap composed of 560 places in 596 ms of which 1 ms to minimize.
[2023-03-22 00:45:59] [INFO ] Deduced a trap composed of 572 places in 578 ms of which 1 ms to minimize.
[2023-03-22 00:46:00] [INFO ] Deduced a trap composed of 556 places in 576 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-22 00:46:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:46:00] [INFO ] After 25525ms 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 73 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-22 00:46:01] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-22 00:46:01] [INFO ] Invariant cache hit.
[2023-03-22 00:46:02] [INFO ] Dead Transitions using invariants and state equation in 1340 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1414 ms. Remains : 1430/1430 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 720 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 249231 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 249231 steps, saw 41387 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:46:05] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-22 00:46:05] [INFO ] Invariant cache hit.
[2023-03-22 00:46:05] [INFO ] [Real]Absence check using 175 positive place invariants in 42 ms returned sat
[2023-03-22 00:46:05] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 36 ms returned sat
[2023-03-22 00:46:05] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:46:05] [INFO ] [Nat]Absence check using 175 positive place invariants in 43 ms returned sat
[2023-03-22 00:46:06] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 38 ms returned sat
[2023-03-22 00:46:06] [INFO ] After 833ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:46:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:46:07] [INFO ] After 422ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:46:07] [INFO ] Deduced a trap composed of 578 places in 566 ms of which 1 ms to minimize.
[2023-03-22 00:46:08] [INFO ] Deduced a trap composed of 568 places in 571 ms of which 1 ms to minimize.
[2023-03-22 00:46:09] [INFO ] Deduced a trap composed of 576 places in 588 ms of which 1 ms to minimize.
[2023-03-22 00:46:10] [INFO ] Deduced a trap composed of 584 places in 636 ms of which 1 ms to minimize.
[2023-03-22 00:46:10] [INFO ] Deduced a trap composed of 570 places in 592 ms of which 1 ms to minimize.
[2023-03-22 00:46:11] [INFO ] Deduced a trap composed of 570 places in 591 ms of which 1 ms to minimize.
[2023-03-22 00:46:12] [INFO ] Deduced a trap composed of 582 places in 661 ms of which 1 ms to minimize.
[2023-03-22 00:46:12] [INFO ] Deduced a trap composed of 576 places in 585 ms of which 1 ms to minimize.
[2023-03-22 00:46:13] [INFO ] Deduced a trap composed of 586 places in 577 ms of which 2 ms to minimize.
[2023-03-22 00:46:14] [INFO ] Deduced a trap composed of 578 places in 572 ms of which 1 ms to minimize.
[2023-03-22 00:46:14] [INFO ] Deduced a trap composed of 578 places in 577 ms of which 2 ms to minimize.
[2023-03-22 00:46:15] [INFO ] Deduced a trap composed of 562 places in 586 ms of which 1 ms to minimize.
[2023-03-22 00:46:16] [INFO ] Deduced a trap composed of 578 places in 571 ms of which 1 ms to minimize.
[2023-03-22 00:46:17] [INFO ] Deduced a trap composed of 570 places in 575 ms of which 1 ms to minimize.
[2023-03-22 00:46:17] [INFO ] Deduced a trap composed of 568 places in 588 ms of which 2 ms to minimize.
[2023-03-22 00:46:18] [INFO ] Deduced a trap composed of 580 places in 603 ms of which 1 ms to minimize.
[2023-03-22 00:46:21] [INFO ] Deduced a trap composed of 578 places in 580 ms of which 1 ms to minimize.
[2023-03-22 00:46:22] [INFO ] Deduced a trap composed of 578 places in 593 ms of which 2 ms to minimize.
[2023-03-22 00:46:25] [INFO ] Deduced a trap composed of 574 places in 581 ms of which 1 ms to minimize.
[2023-03-22 00:46:26] [INFO ] Deduced a trap composed of 570 places in 579 ms of which 1 ms to minimize.
[2023-03-22 00:46:27] [INFO ] Deduced a trap composed of 574 places in 589 ms of which 1 ms to minimize.
[2023-03-22 00:46:28] [INFO ] Deduced a trap composed of 572 places in 591 ms of which 1 ms to minimize.
[2023-03-22 00:46:29] [INFO ] Deduced a trap composed of 572 places in 589 ms of which 1 ms to minimize.
[2023-03-22 00:46:29] [INFO ] Deduced a trap composed of 560 places in 577 ms of which 1 ms to minimize.
[2023-03-22 00:46:30] [INFO ] Deduced a trap composed of 572 places in 577 ms of which 1 ms to minimize.
[2023-03-22 00:46:30] [INFO ] Trap strengthening (SAT) tested/added 25/25 trap constraints in 23479 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.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-22 00:46:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:46:30] [INFO ] After 25025ms 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 63 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 60 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-22 00:46:30] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-22 00:46:30] [INFO ] Invariant cache hit.
[2023-03-22 00:46:32] [INFO ] Implicit Places using invariants in 1319 ms returned []
[2023-03-22 00:46:32] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-22 00:46:32] [INFO ] Invariant cache hit.
[2023-03-22 00:46:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:46:40] [INFO ] Implicit Places using invariants and state equation in 8633 ms returned []
Implicit Place search using SMT with State Equation took 9953 ms to find 0 implicit places.
[2023-03-22 00:46:40] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-22 00:46:40] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-22 00:46:40] [INFO ] Invariant cache hit.
[2023-03-22 00:46:42] [INFO ] Dead Transitions using invariants and state equation in 1326 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11427 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 1 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 269 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-22 00:46:42] [INFO ] Computed 182 place invariants in 56 ms
[2023-03-22 00:46:42] [INFO ] [Real]Absence check using 175 positive place invariants in 42 ms returned sat
[2023-03-22 00:46:42] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 34 ms returned sat
[2023-03-22 00:46:42] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:46:43] [INFO ] [Nat]Absence check using 175 positive place invariants in 42 ms returned sat
[2023-03-22 00:46:43] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 36 ms returned sat
[2023-03-22 00:46:43] [INFO ] After 731ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:46:44] [INFO ] Deduced a trap composed of 566 places in 540 ms of which 1 ms to minimize.
[2023-03-22 00:46:45] [INFO ] Deduced a trap composed of 576 places in 550 ms of which 1 ms to minimize.
[2023-03-22 00:46:45] [INFO ] Deduced a trap composed of 566 places in 546 ms of which 1 ms to minimize.
[2023-03-22 00:46:46] [INFO ] Deduced a trap composed of 572 places in 563 ms of which 1 ms to minimize.
[2023-03-22 00:46:47] [INFO ] Deduced a trap composed of 566 places in 548 ms of which 2 ms to minimize.
[2023-03-22 00:46:47] [INFO ] Deduced a trap composed of 560 places in 550 ms of which 1 ms to minimize.
[2023-03-22 00:46:48] [INFO ] Deduced a trap composed of 572 places in 556 ms of which 2 ms to minimize.
[2023-03-22 00:46:48] [INFO ] Deduced a trap composed of 574 places in 549 ms of which 1 ms to minimize.
[2023-03-22 00:46:49] [INFO ] Deduced a trap composed of 564 places in 541 ms of which 1 ms to minimize.
[2023-03-22 00:46:50] [INFO ] Deduced a trap composed of 566 places in 544 ms of which 1 ms to minimize.
[2023-03-22 00:46:51] [INFO ] Deduced a trap composed of 566 places in 595 ms of which 1 ms to minimize.
[2023-03-22 00:46:51] [INFO ] Deduced a trap composed of 586 places in 599 ms of which 1 ms to minimize.
[2023-03-22 00:46:52] [INFO ] Deduced a trap composed of 572 places in 590 ms of which 2 ms to minimize.
[2023-03-22 00:46:53] [INFO ] Deduced a trap composed of 576 places in 593 ms of which 1 ms to minimize.
[2023-03-22 00:46:54] [INFO ] Deduced a trap composed of 568 places in 600 ms of which 1 ms to minimize.
[2023-03-22 00:46:54] [INFO ] Deduced a trap composed of 558 places in 590 ms of which 1 ms to minimize.
[2023-03-22 00:46:55] [INFO ] Deduced a trap composed of 560 places in 604 ms of which 1 ms to minimize.
[2023-03-22 00:46:56] [INFO ] Deduced a trap composed of 558 places in 597 ms of which 1 ms to minimize.
[2023-03-22 00:46:56] [INFO ] Deduced a trap composed of 556 places in 591 ms of which 1 ms to minimize.
[2023-03-22 00:46:58] [INFO ] Deduced a trap composed of 564 places in 555 ms of which 2 ms to minimize.
[2023-03-22 00:46:59] [INFO ] Deduced a trap composed of 582 places in 534 ms of which 1 ms to minimize.
[2023-03-22 00:46:59] [INFO ] Deduced a trap composed of 568 places in 544 ms of which 1 ms to minimize.
[2023-03-22 00:47:00] [INFO ] Deduced a trap composed of 580 places in 544 ms of which 1 ms to minimize.
[2023-03-22 00:47:01] [INFO ] Deduced a trap composed of 576 places in 553 ms of which 1 ms to minimize.
[2023-03-22 00:47:01] [INFO ] Deduced a trap composed of 556 places in 537 ms of which 1 ms to minimize.
[2023-03-22 00:47:02] [INFO ] Deduced a trap composed of 558 places in 545 ms of which 2 ms to minimize.
[2023-03-22 00:47:03] [INFO ] Deduced a trap composed of 568 places in 546 ms of which 1 ms to minimize.
[2023-03-22 00:47:03] [INFO ] Deduced a trap composed of 572 places in 549 ms of which 2 ms to minimize.
[2023-03-22 00:47:04] [INFO ] Deduced a trap composed of 574 places in 549 ms of which 1 ms to minimize.
[2023-03-22 00:47:05] [INFO ] Deduced a trap composed of 562 places in 545 ms of which 1 ms to minimize.
[2023-03-22 00:47:05] [INFO ] Deduced a trap composed of 570 places in 557 ms of which 1 ms to minimize.
[2023-03-22 00:47:06] [INFO ] Deduced a trap composed of 574 places in 548 ms of which 1 ms to minimize.
[2023-03-22 00:47:07] [INFO ] Deduced a trap composed of 572 places in 585 ms of which 1 ms to minimize.
[2023-03-22 00:47:07] [INFO ] Deduced a trap composed of 574 places in 569 ms of which 1 ms to minimize.
[2023-03-22 00:47:08] [INFO ] Deduced a trap composed of 558 places in 544 ms of which 1 ms to minimize.
[2023-03-22 00:47:09] [INFO ] Deduced a trap composed of 568 places in 542 ms of which 1 ms to minimize.
[2023-03-22 00:47:09] [INFO ] Deduced a trap composed of 564 places in 548 ms of which 2 ms to minimize.
[2023-03-22 00:47:10] [INFO ] Deduced a trap composed of 564 places in 545 ms of which 1 ms to minimize.
[2023-03-22 00:47:11] [INFO ] Deduced a trap composed of 570 places in 546 ms of which 1 ms to minimize.
[2023-03-22 00:47:11] [INFO ] Deduced a trap composed of 570 places in 543 ms of which 1 ms to minimize.
[2023-03-22 00:47:12] [INFO ] Deduced a trap composed of 570 places in 596 ms of which 1 ms to minimize.
[2023-03-22 00:47:13] [INFO ] Deduced a trap composed of 562 places in 550 ms of which 1 ms to minimize.
[2023-03-22 00:47:13] [INFO ] Deduced a trap composed of 570 places in 603 ms of which 1 ms to minimize.
[2023-03-22 00:47:14] [INFO ] Deduced a trap composed of 566 places in 614 ms of which 1 ms to minimize.
[2023-03-22 00:47:15] [INFO ] Deduced a trap composed of 570 places in 613 ms of which 1 ms to minimize.
[2023-03-22 00:47:16] [INFO ] Deduced a trap composed of 590 places in 598 ms of which 1 ms to minimize.
[2023-03-22 00:47:16] [INFO ] Deduced a trap composed of 584 places in 548 ms of which 1 ms to minimize.
[2023-03-22 00:47:17] [INFO ] Deduced a trap composed of 582 places in 542 ms of which 1 ms to minimize.
[2023-03-22 00:47:18] [INFO ] Deduced a trap composed of 570 places in 558 ms of which 1 ms to minimize.
[2023-03-22 00:47:26] [INFO ] Deduced a trap composed of 576 places in 535 ms of which 1 ms to minimize.
[2023-03-22 00:47:26] [INFO ] Deduced a trap composed of 568 places in 573 ms of which 1 ms to minimize.
[2023-03-22 00:47:30] [INFO ] Deduced a trap composed of 554 places in 547 ms of which 1 ms to minimize.
[2023-03-22 00:47:30] [INFO ] Deduced a trap composed of 574 places in 542 ms of which 2 ms to minimize.
[2023-03-22 00:47:31] [INFO ] Deduced a trap composed of 574 places in 544 ms of which 1 ms to minimize.
[2023-03-22 00:47:32] [INFO ] Deduced a trap composed of 574 places in 547 ms of which 2 ms to minimize.
[2023-03-22 00:47:33] [INFO ] Deduced a trap composed of 582 places in 544 ms of which 1 ms to minimize.
[2023-03-22 00:47:33] [INFO ] Deduced a trap composed of 574 places in 542 ms of which 1 ms to minimize.
[2023-03-22 00:47:34] [INFO ] Deduced a trap composed of 560 places in 597 ms of which 1 ms to minimize.
[2023-03-22 00:47:35] [INFO ] Deduced a trap composed of 574 places in 585 ms of which 1 ms to minimize.
[2023-03-22 00:47:35] [INFO ] Deduced a trap composed of 586 places in 586 ms of which 1 ms to minimize.
[2023-03-22 00:47:36] [INFO ] Deduced a trap composed of 562 places in 590 ms of which 2 ms to minimize.
[2023-03-22 00:47:37] [INFO ] Deduced a trap composed of 556 places in 586 ms of which 1 ms to minimize.
[2023-03-22 00:47:37] [INFO ] Deduced a trap composed of 560 places in 598 ms of which 1 ms to minimize.
[2023-03-22 00:47:38] [INFO ] Deduced a trap composed of 570 places in 599 ms of which 1 ms to minimize.
[2023-03-22 00:47:39] [INFO ] Deduced a trap composed of 568 places in 575 ms of which 1 ms to minimize.
[2023-03-22 00:47:39] [INFO ] Deduced a trap composed of 568 places in 610 ms of which 1 ms to minimize.
[2023-03-22 00:47:40] [INFO ] Deduced a trap composed of 566 places in 600 ms of which 1 ms to minimize.
[2023-03-22 00:47:41] [INFO ] Deduced a trap composed of 564 places in 577 ms of which 2 ms to minimize.
[2023-03-22 00:47:41] [INFO ] Deduced a trap composed of 566 places in 562 ms of which 1 ms to minimize.
[2023-03-22 00:47:42] [INFO ] Deduced a trap composed of 562 places in 583 ms of which 1 ms to minimize.
[2023-03-22 00:47:43] [INFO ] Deduced a trap composed of 568 places in 588 ms of which 1 ms to minimize.
[2023-03-22 00:47:43] [INFO ] Deduced a trap composed of 558 places in 592 ms of which 1 ms to minimize.
[2023-03-22 00:47:44] [INFO ] Deduced a trap composed of 554 places in 608 ms of which 1 ms to minimize.
[2023-03-22 00:47:45] [INFO ] Deduced a trap composed of 572 places in 582 ms of which 1 ms to minimize.
[2023-03-22 00:47:45] [INFO ] Deduced a trap composed of 576 places in 585 ms of which 1 ms to minimize.
[2023-03-22 00:47:46] [INFO ] Deduced a trap composed of 570 places in 587 ms of which 1 ms to minimize.
[2023-03-22 00:47:47] [INFO ] Deduced a trap composed of 558 places in 592 ms of which 2 ms to minimize.
[2023-03-22 00:47:48] [INFO ] Deduced a trap composed of 572 places in 595 ms of which 2 ms to minimize.
[2023-03-22 00:47:50] [INFO ] Deduced a trap composed of 576 places in 536 ms of which 1 ms to minimize.
[2023-03-22 00:47:50] [INFO ] Deduced a trap composed of 572 places in 544 ms of which 1 ms to minimize.
[2023-03-22 00:47:51] [INFO ] Deduced a trap composed of 566 places in 545 ms of which 1 ms to minimize.
[2023-03-22 00:47:51] [INFO ] Deduced a trap composed of 568 places in 547 ms of which 2 ms to minimize.
[2023-03-22 00:47:52] [INFO ] Deduced a trap composed of 560 places in 545 ms of which 1 ms to minimize.
[2023-03-22 00:47:53] [INFO ] Deduced a trap composed of 568 places in 542 ms of which 1 ms to minimize.
[2023-03-22 00:47:53] [INFO ] Deduced a trap composed of 576 places in 548 ms of which 1 ms to minimize.
[2023-03-22 00:47:54] [INFO ] Deduced a trap composed of 570 places in 545 ms of which 1 ms to minimize.
[2023-03-22 00:47:55] [INFO ] Deduced a trap composed of 570 places in 540 ms of which 1 ms to minimize.
[2023-03-22 00:47:55] [INFO ] Deduced a trap composed of 562 places in 562 ms of which 1 ms to minimize.
[2023-03-22 00:47:56] [INFO ] Deduced a trap composed of 568 places in 547 ms of which 1 ms to minimize.
[2023-03-22 00:47:57] [INFO ] Deduced a trap composed of 568 places in 527 ms of which 1 ms to minimize.
[2023-03-22 00:47:57] [INFO ] Deduced a trap composed of 564 places in 528 ms of which 1 ms to minimize.
[2023-03-22 00:47:58] [INFO ] Deduced a trap composed of 576 places in 538 ms of which 1 ms to minimize.
[2023-03-22 00:47:58] [INFO ] Deduced a trap composed of 578 places in 558 ms of which 1 ms to minimize.
[2023-03-22 00:47:59] [INFO ] Deduced a trap composed of 572 places in 537 ms of which 1 ms to minimize.
[2023-03-22 00:48:00] [INFO ] Deduced a trap composed of 556 places in 542 ms of which 1 ms to minimize.
[2023-03-22 00:48:00] [INFO ] Deduced a trap composed of 580 places in 537 ms of which 2 ms to minimize.
[2023-03-22 00:48:01] [INFO ] Deduced a trap composed of 566 places in 528 ms of which 1 ms to minimize.
[2023-03-22 00:48:02] [INFO ] Deduced a trap composed of 562 places in 538 ms of which 1 ms to minimize.
[2023-03-22 00:48:02] [INFO ] Deduced a trap composed of 578 places in 542 ms of which 2 ms to minimize.
[2023-03-22 00:48:03] [INFO ] Deduced a trap composed of 568 places in 600 ms of which 2 ms to minimize.
[2023-03-22 00:48:03] [INFO ] Deduced a trap composed of 562 places in 534 ms of which 1 ms to minimize.
[2023-03-22 00:48:04] [INFO ] Deduced a trap composed of 568 places in 540 ms of which 1 ms to minimize.
[2023-03-22 00:48:05] [INFO ] Deduced a trap composed of 560 places in 539 ms of which 1 ms to minimize.
[2023-03-22 00:48:05] [INFO ] Deduced a trap composed of 562 places in 543 ms of which 1 ms to minimize.
[2023-03-22 00:48:06] [INFO ] Deduced a trap composed of 564 places in 536 ms of which 1 ms to minimize.
[2023-03-22 00:48:06] [INFO ] Deduced a trap composed of 568 places in 541 ms of which 1 ms to minimize.
[2023-03-22 00:48:07] [INFO ] Deduced a trap composed of 564 places in 533 ms of which 1 ms to minimize.
[2023-03-22 00:48:08] [INFO ] Deduced a trap composed of 562 places in 534 ms of which 1 ms to minimize.
[2023-03-22 00:48:08] [INFO ] Deduced a trap composed of 554 places in 532 ms of which 1 ms to minimize.
[2023-03-22 00:48:09] [INFO ] Deduced a trap composed of 578 places in 535 ms of which 1 ms to minimize.
[2023-03-22 00:48:10] [INFO ] Deduced a trap composed of 562 places in 541 ms of which 1 ms to minimize.
[2023-03-22 00:48:10] [INFO ] Deduced a trap composed of 568 places in 560 ms of which 1 ms to minimize.
[2023-03-22 00:48:11] [INFO ] Deduced a trap composed of 582 places in 528 ms of which 1 ms to minimize.
[2023-03-22 00:48:11] [INFO ] Deduced a trap composed of 582 places in 530 ms of which 1 ms to minimize.
[2023-03-22 00:48:12] [INFO ] Deduced a trap composed of 564 places in 546 ms of which 1 ms to minimize.
[2023-03-22 00:48:13] [INFO ] Deduced a trap composed of 560 places in 541 ms of which 1 ms to minimize.
[2023-03-22 00:48:13] [INFO ] Deduced a trap composed of 558 places in 538 ms of which 1 ms to minimize.
[2023-03-22 00:48:14] [INFO ] Deduced a trap composed of 568 places in 535 ms of which 1 ms to minimize.
[2023-03-22 00:48:14] [INFO ] Deduced a trap composed of 592 places in 549 ms of which 1 ms to minimize.
[2023-03-22 00:48:15] [INFO ] Deduced a trap composed of 576 places in 547 ms of which 1 ms to minimize.
[2023-03-22 00:48:16] [INFO ] Deduced a trap composed of 562 places in 561 ms of which 1 ms to minimize.
[2023-03-22 00:48:16] [INFO ] Deduced a trap composed of 572 places in 545 ms of which 1 ms to minimize.
[2023-03-22 00:48:17] [INFO ] Deduced a trap composed of 576 places in 549 ms of which 1 ms to minimize.
[2023-03-22 00:48:18] [INFO ] Deduced a trap composed of 572 places in 540 ms of which 1 ms to minimize.
[2023-03-22 00:48:18] [INFO ] Deduced a trap composed of 588 places in 541 ms of which 1 ms to minimize.
[2023-03-22 00:48:19] [INFO ] Deduced a trap composed of 586 places in 548 ms of which 1 ms to minimize.
[2023-03-22 00:48:19] [INFO ] Deduced a trap composed of 576 places in 549 ms of which 1 ms to minimize.
[2023-03-22 00:48:20] [INFO ] Deduced a trap composed of 566 places in 547 ms of which 1 ms to minimize.
[2023-03-22 00:48:21] [INFO ] Deduced a trap composed of 570 places in 539 ms of which 1 ms to minimize.
[2023-03-22 00:48:21] [INFO ] Deduced a trap composed of 566 places in 548 ms of which 1 ms to minimize.
[2023-03-22 00:48:22] [INFO ] Deduced a trap composed of 570 places in 548 ms of which 2 ms to minimize.
[2023-03-22 00:48:23] [INFO ] Deduced a trap composed of 570 places in 558 ms of which 2 ms to minimize.
[2023-03-22 00:48:23] [INFO ] Deduced a trap composed of 574 places in 539 ms of which 1 ms to minimize.
[2023-03-22 00:48:24] [INFO ] Deduced a trap composed of 572 places in 546 ms of which 1 ms to minimize.
[2023-03-22 00:48:24] [INFO ] Deduced a trap composed of 570 places in 549 ms of which 1 ms to minimize.
[2023-03-22 00:48:25] [INFO ] Deduced a trap composed of 578 places in 542 ms of which 2 ms to minimize.
[2023-03-22 00:48:26] [INFO ] Deduced a trap composed of 578 places in 542 ms of which 1 ms to minimize.
[2023-03-22 00:48:27] [INFO ] Deduced a trap composed of 580 places in 534 ms of which 1 ms to minimize.
[2023-03-22 00:48:28] [INFO ] Deduced a trap composed of 574 places in 538 ms of which 1 ms to minimize.
[2023-03-22 00:50:27] [INFO ] Trap strengthening (SAT) tested/added 139/139 trap constraints in 224037 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.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-22 00:50:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:50:27] [INFO ] After 225029ms 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 257 ms. Remains 1418 /1430 variables (removed 12) and now considering 2580/2601 (removed 21) transitions.
Running SMT prover for 1 properties.
[2023-03-22 00:50:28] [INFO ] Invariant cache hit.
[2023-03-22 00:50:28] [INFO ] [Real]Absence check using 175 positive place invariants in 46 ms returned sat
[2023-03-22 00:50:28] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-22 00:50:28] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:50:28] [INFO ] [Nat]Absence check using 175 positive place invariants in 44 ms returned sat
[2023-03-22 00:50:28] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 32 ms returned sat
[2023-03-22 00:50:29] [INFO ] After 750ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:50:30] [INFO ] Deduced a trap composed of 564 places in 557 ms of which 1 ms to minimize.
[2023-03-22 00:50:30] [INFO ] Deduced a trap composed of 584 places in 550 ms of which 1 ms to minimize.
[2023-03-22 00:50:31] [INFO ] Deduced a trap composed of 576 places in 561 ms of which 1 ms to minimize.
[2023-03-22 00:50:31] [INFO ] Deduced a trap composed of 574 places in 555 ms of which 1 ms to minimize.
[2023-03-22 00:50:32] [INFO ] Deduced a trap composed of 570 places in 537 ms of which 1 ms to minimize.
[2023-03-22 00:50:33] [INFO ] Deduced a trap composed of 570 places in 534 ms of which 1 ms to minimize.
[2023-03-22 00:50:33] [INFO ] Deduced a trap composed of 564 places in 534 ms of which 1 ms to minimize.
[2023-03-22 00:50:34] [INFO ] Deduced a trap composed of 564 places in 548 ms of which 1 ms to minimize.
[2023-03-22 00:50:35] [INFO ] Deduced a trap composed of 570 places in 534 ms of which 1 ms to minimize.
[2023-03-22 00:50:35] [INFO ] Deduced a trap composed of 558 places in 536 ms of which 1 ms to minimize.
[2023-03-22 00:50:36] [INFO ] Deduced a trap composed of 580 places in 529 ms of which 1 ms to minimize.
[2023-03-22 00:50:37] [INFO ] Deduced a trap composed of 566 places in 537 ms of which 1 ms to minimize.
[2023-03-22 00:50:37] [INFO ] Deduced a trap composed of 564 places in 540 ms of which 1 ms to minimize.
[2023-03-22 00:50:38] [INFO ] Deduced a trap composed of 576 places in 533 ms of which 1 ms to minimize.
[2023-03-22 00:50:38] [INFO ] Deduced a trap composed of 562 places in 547 ms of which 2 ms to minimize.
[2023-03-22 00:50:39] [INFO ] Deduced a trap composed of 566 places in 551 ms of which 1 ms to minimize.
[2023-03-22 00:50:40] [INFO ] Deduced a trap composed of 590 places in 562 ms of which 1 ms to minimize.
[2023-03-22 00:50:41] [INFO ] Deduced a trap composed of 562 places in 572 ms of which 1 ms to minimize.
[2023-03-22 00:50:42] [INFO ] Deduced a trap composed of 582 places in 550 ms of which 1 ms to minimize.
[2023-03-22 00:50:43] [INFO ] Deduced a trap composed of 570 places in 545 ms of which 1 ms to minimize.
[2023-03-22 00:50:43] [INFO ] Deduced a trap composed of 570 places in 549 ms of which 1 ms to minimize.
[2023-03-22 00:50:44] [INFO ] Deduced a trap composed of 572 places in 541 ms of which 1 ms to minimize.
[2023-03-22 00:50:45] [INFO ] Deduced a trap composed of 564 places in 542 ms of which 1 ms to minimize.
[2023-03-22 00:50:45] [INFO ] Deduced a trap composed of 566 places in 559 ms of which 1 ms to minimize.
[2023-03-22 00:50:46] [INFO ] Deduced a trap composed of 566 places in 542 ms of which 2 ms to minimize.
[2023-03-22 00:50:46] [INFO ] Deduced a trap composed of 570 places in 531 ms of which 1 ms to minimize.
[2023-03-22 00:50:47] [INFO ] Deduced a trap composed of 578 places in 538 ms of which 1 ms to minimize.
[2023-03-22 00:50:49] [INFO ] Deduced a trap composed of 574 places in 558 ms of which 1 ms to minimize.
[2023-03-22 00:50:49] [INFO ] Deduced a trap composed of 574 places in 551 ms of which 1 ms to minimize.
[2023-03-22 00:50:50] [INFO ] Deduced a trap composed of 578 places in 545 ms of which 1 ms to minimize.
[2023-03-22 00:50:51] [INFO ] Deduced a trap composed of 558 places in 537 ms of which 1 ms to minimize.
[2023-03-22 00:50:51] [INFO ] Deduced a trap composed of 576 places in 556 ms of which 1 ms to minimize.
[2023-03-22 00:50:52] [INFO ] Deduced a trap composed of 572 places in 535 ms of which 1 ms to minimize.
[2023-03-22 00:50:52] [INFO ] Deduced a trap composed of 564 places in 538 ms of which 1 ms to minimize.
[2023-03-22 00:50:53] [INFO ] Deduced a trap composed of 578 places in 524 ms of which 1 ms to minimize.
[2023-03-22 00:50:54] [INFO ] Deduced a trap composed of 560 places in 536 ms of which 1 ms to minimize.
[2023-03-22 00:50:54] [INFO ] Deduced a trap composed of 568 places in 543 ms of which 1 ms to minimize.
[2023-03-22 00:50:55] [INFO ] Deduced a trap composed of 562 places in 541 ms of which 1 ms to minimize.
[2023-03-22 00:50:56] [INFO ] Deduced a trap composed of 574 places in 544 ms of which 1 ms to minimize.
[2023-03-22 00:50:56] [INFO ] Deduced a trap composed of 576 places in 543 ms of which 1 ms to minimize.
[2023-03-22 00:50:57] [INFO ] Deduced a trap composed of 564 places in 586 ms of which 1 ms to minimize.
[2023-03-22 00:50:58] [INFO ] Deduced a trap composed of 568 places in 604 ms of which 1 ms to minimize.
[2023-03-22 00:50:58] [INFO ] Deduced a trap composed of 560 places in 547 ms of which 1 ms to minimize.
[2023-03-22 00:50:59] [INFO ] Deduced a trap composed of 582 places in 548 ms of which 1 ms to minimize.
[2023-03-22 00:50:59] [INFO ] Deduced a trap composed of 580 places in 542 ms of which 1 ms to minimize.
[2023-03-22 00:51:00] [INFO ] Deduced a trap composed of 568 places in 553 ms of which 1 ms to minimize.
[2023-03-22 00:51:01] [INFO ] Deduced a trap composed of 574 places in 559 ms of which 1 ms to minimize.
[2023-03-22 00:51:01] [INFO ] Deduced a trap composed of 552 places in 538 ms of which 1 ms to minimize.
[2023-03-22 00:51:02] [INFO ] Deduced a trap composed of 558 places in 549 ms of which 1 ms to minimize.
[2023-03-22 00:51:03] [INFO ] Deduced a trap composed of 584 places in 555 ms of which 1 ms to minimize.
[2023-03-22 00:51:03] [INFO ] Deduced a trap composed of 570 places in 551 ms of which 1 ms to minimize.
[2023-03-22 00:51:04] [INFO ] Deduced a trap composed of 564 places in 555 ms of which 1 ms to minimize.
[2023-03-22 00:51:04] [INFO ] Deduced a trap composed of 568 places in 550 ms of which 1 ms to minimize.
[2023-03-22 00:51:05] [INFO ] Deduced a trap composed of 574 places in 545 ms of which 1 ms to minimize.
[2023-03-22 00:51:06] [INFO ] Deduced a trap composed of 566 places in 540 ms of which 1 ms to minimize.
[2023-03-22 00:51:06] [INFO ] Deduced a trap composed of 566 places in 543 ms of which 2 ms to minimize.
[2023-03-22 00:51:07] [INFO ] Deduced a trap composed of 566 places in 536 ms of which 1 ms to minimize.
[2023-03-22 00:51:08] [INFO ] Deduced a trap composed of 572 places in 557 ms of which 1 ms to minimize.
[2023-03-22 00:51:08] [INFO ] Deduced a trap composed of 574 places in 548 ms of which 1 ms to minimize.
[2023-03-22 00:51:09] [INFO ] Deduced a trap composed of 564 places in 547 ms of which 1 ms to minimize.
[2023-03-22 00:51:09] [INFO ] Deduced a trap composed of 576 places in 554 ms of which 1 ms to minimize.
[2023-03-22 00:51:10] [INFO ] Deduced a trap composed of 576 places in 563 ms of which 1 ms to minimize.
[2023-03-22 00:51:11] [INFO ] Deduced a trap composed of 576 places in 562 ms of which 2 ms to minimize.
[2023-03-22 00:51:11] [INFO ] Deduced a trap composed of 566 places in 557 ms of which 1 ms to minimize.
[2023-03-22 00:51:12] [INFO ] Deduced a trap composed of 560 places in 543 ms of which 1 ms to minimize.
[2023-03-22 00:51:13] [INFO ] Deduced a trap composed of 560 places in 558 ms of which 2 ms to minimize.
[2023-03-22 00:51:13] [INFO ] Deduced a trap composed of 570 places in 557 ms of which 1 ms to minimize.
[2023-03-22 00:51:14] [INFO ] Deduced a trap composed of 558 places in 531 ms of which 1 ms to minimize.
[2023-03-22 00:51:14] [INFO ] Deduced a trap composed of 574 places in 537 ms of which 1 ms to minimize.
[2023-03-22 00:51:15] [INFO ] Deduced a trap composed of 570 places in 527 ms of which 1 ms to minimize.
[2023-03-22 00:51:16] [INFO ] Deduced a trap composed of 566 places in 533 ms of which 1 ms to minimize.
[2023-03-22 00:51:16] [INFO ] Deduced a trap composed of 564 places in 549 ms of which 2 ms to minimize.
[2023-03-22 00:51:17] [INFO ] Deduced a trap composed of 564 places in 532 ms of which 1 ms to minimize.
[2023-03-22 00:51:18] [INFO ] Deduced a trap composed of 580 places in 547 ms of which 1 ms to minimize.
[2023-03-22 00:51:18] [INFO ] Deduced a trap composed of 558 places in 545 ms of which 2 ms to minimize.
[2023-03-22 00:51:19] [INFO ] Deduced a trap composed of 584 places in 532 ms of which 1 ms to minimize.
[2023-03-22 00:51:19] [INFO ] Deduced a trap composed of 582 places in 541 ms of which 2 ms to minimize.
[2023-03-22 00:51:20] [INFO ] Deduced a trap composed of 572 places in 561 ms of which 1 ms to minimize.
[2023-03-22 00:51:29] [INFO ] Deduced a trap composed of 560 places in 546 ms of which 1 ms to minimize.
[2023-03-22 00:54:13] [INFO ] Trap strengthening (SAT) tested/added 79/79 trap constraints in 224016 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.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-22 00:54:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:54:13] [INFO ] After 225020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Unable to solve all queries for examination QuasiLiveness. Remains :1 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 38 properties from file /home/mcc/execution/QuasiLiveness.xml in 8 ms.
Working with output stream class java.io.PrintStream
Total runtime 998295 ms.
starting LoLA
BK_INPUT PolyORBNT-COL-S10J80
BK_EXAMINATION: QuasiLiveness
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution
GlobalProperty: QuasiLiveness
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 15045756 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16115876 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/model.pnml
lola: reading pnml
lola: PNML file contains High-Level net
lola: finished parsing
lola: closed net file /home/mcc/execution/model.pnml
lola: TR BINDINGS
lola: TR BINDINGS DONE
lola: Places: 1694, Transitions: 13580
lola: @ trans NoJob
lola: @ trans fi1
lola: @ trans fi3
lola: @ trans trans_689
lola: @ trans DummyOR1
lola: @ trans fo3
lola: @ trans fi2
lola: @ trans trans_457
lola: @ trans WillPerformWork
lola: @ trans trans_461
lola: @ trans MustCheck
lola: @ trans trans_508
lola: @ trans trans_509
lola: @ trans trans_534
lola: @ trans fo2
lola: @ trans LeaveCSTCS
lola: @ trans trans_478
lola: @ trans trans_459
lola: @ trans trans_533
lola: @ trans trans_510
lola: @ trans GoPerformWork
lola: @ trans Run
lola: @ trans trans_685
lola: @ trans GoCheckSource
lola: @ trans fo1
lola: @ trans trans_486
lola: @ trans trans_511
lola: @ trans JobExist
lola: @ trans NotifyEventEndOfCheckSources
lola: @ trans EnterCSTCS
lola: @ trans trans_489
lola: @ trans IsEvt
lola: @ trans trans_463
lola: @ trans trans_776
lola: @ trans trans_488
lola: @ trans trans_487
lola: @ trans DummyOR2
lola: @ trans trans_376
lola: STATE EQUATION TRIES TRANSITION t920
lola: LAUNCH SYMM
sara: try reading problem file stateEquationProblem-QuasiLiveness-1410.sara.
lola: reporting
lola: not produced: 1267
lola: find path: 381
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11918
lola: reporting
lola: not produced: 1267
lola: find path: 381
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11918
lola: reporting
lola: not produced: 1267
lola: find path: 381
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11918
lola: reporting
lola: not produced: 1267
lola: find path: 381
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11918
lola: reporting
lola: not produced: 1267
lola: find path: 381
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11918
lola: reporting
lola: not produced: 1267
lola: find path: 381
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11918
lola: reporting
lola: not produced: 1267
lola: find path: 381
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11918
lola: reporting
lola: not produced: 1267
lola: find path: 381
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11918
lola: reporting
lola: not produced: 1267
lola: find path: 381
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11918
lola: reporting
lola: not produced: 1267
lola: find path: 381
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11918
lola: reporting
lola: not produced: 1267
lola: find path: 381
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11918
lola: reporting
lola: not produced: 1267
lola: find path: 381
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11918
lola: reporting
lola: not produced: 1267
lola: find path: 381
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11918
sara: place or transition ordering is non-deterministic
lola: reporting
lola: not produced: 1267
lola: find path: 381
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11918
lola: reporting
lola: not produced: 1267
lola: find path: 381
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11918
lola: reporting
lola: not produced: 1267
lola: find path: 381
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11918
lola: reporting
lola: not produced: 1267
lola: find path: 381
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11918
lola: reporting
lola: not produced: 1267
lola: find path: 381
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11918
lola: reporting
lola: not produced: 1267
lola: find path: 381
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11918
lola: reporting
lola: not produced: 1267
lola: find path: 381
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11918
lola: reporting
lola: not produced: 1267
lola: find path: 381
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11918
lola: reporting
lola: not produced: 1267
lola: find path: 381
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11918
lola: reporting
lola: not produced: 1267
lola: find path: 381
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11918
lola: reporting
lola: not produced: 1267
lola: find path: 381
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11918
lola: reporting
lola: not produced: 1267
lola: find path: 381
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11918
lola: reporting
lola: not produced: 1267
lola: find path: 381
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11918
lola: reporting
lola: not produced: 1267
lola: find path: 381
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11918
lola: reporting
lola: not produced: 1267
lola: find path: 381
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11918
lola: reporting
lola: not produced: 1267
lola: find path: 381
lola: goal oriented search: 13
lola: symmetry: 1
lola: high level: 11918
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: reporting
lola: not produced: 1084
lola: find path: 381
lola: goal oriented search: 18
lola: symmetry: 1
lola: high level: 12096
lola: caught signal Terminated - aborting LoLA

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY


Time elapsed: 799 secs. Pages in use: 30

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="lolaxred"
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 lolaxred"
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 r309-tall-167873963000442"
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 ;