./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 273a578a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b8273370cd4ec5730806cf9b8f54c915e93daab6c48b9546d3920e402afdc55 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-273a578-m [2024-02-19 15:21:52,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 15:21:52,742 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-19 15:21:52,746 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 15:21:52,746 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 15:21:52,771 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 15:21:52,772 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 15:21:52,772 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 15:21:52,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 15:21:52,776 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 15:21:52,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 15:21:52,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 15:21:52,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 15:21:52,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 15:21:52,778 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 15:21:52,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 15:21:52,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 15:21:52,779 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 15:21:52,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 15:21:52,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 15:21:52,779 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 15:21:52,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 15:21:52,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 15:21:52,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 15:21:52,781 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 15:21:52,781 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 15:21:52,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 15:21:52,781 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 15:21:52,782 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 15:21:52,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 15:21:52,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 15:21:52,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 15:21:52,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:21:52,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 15:21:52,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 15:21:52,784 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 15:21:52,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 15:21:52,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 15:21:52,785 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 15:21:52,785 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 15:21:52,785 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 15:21:52,786 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 15:21:52,786 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 15:21:52,786 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4b8273370cd4ec5730806cf9b8f54c915e93daab6c48b9546d3920e402afdc55 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 15:21:53,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 15:21:53,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 15:21:53,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 15:21:53,090 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 15:21:53,090 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 15:21:53,091 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c [2024-02-19 15:21:54,221 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 15:21:54,362 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 15:21:54,363 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c [2024-02-19 15:21:54,369 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fea2fdca1/0c727b568e5741eeab0bb862f634beed/FLAG9c8ce8bfa [2024-02-19 15:21:54,379 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fea2fdca1/0c727b568e5741eeab0bb862f634beed [2024-02-19 15:21:54,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 15:21:54,382 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 15:21:54,383 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 15:21:54,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 15:21:54,386 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 15:21:54,387 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:21:54" (1/1) ... [2024-02-19 15:21:54,388 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@784bb29b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:21:54, skipping insertion in model container [2024-02-19 15:21:54,388 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:21:54" (1/1) ... [2024-02-19 15:21:54,403 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:21:54,534 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c[2691,2704] [2024-02-19 15:21:54,548 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:21:54,557 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 15:21:54,582 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c[2691,2704] [2024-02-19 15:21:54,586 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:21:54,601 INFO L206 MainTranslator]: Completed translation [2024-02-19 15:21:54,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:21:54 WrapperNode [2024-02-19 15:21:54,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 15:21:54,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 15:21:54,603 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 15:21:54,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 15:21:54,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:21:54" (1/1) ... [2024-02-19 15:21:54,624 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:21:54" (1/1) ... [2024-02-19 15:21:54,650 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 156 [2024-02-19 15:21:54,650 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 15:21:54,651 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 15:21:54,651 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 15:21:54,651 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 15:21:54,664 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:21:54" (1/1) ... [2024-02-19 15:21:54,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:21:54" (1/1) ... [2024-02-19 15:21:54,677 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:21:54" (1/1) ... [2024-02-19 15:21:54,701 INFO L175 MemorySlicer]: Split 17 memory accesses to 5 slices as follows [2, 2, 2, 9, 2]. 53 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 7 writes are split as follows [0, 1, 1, 4, 1]. [2024-02-19 15:21:54,703 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:21:54" (1/1) ... [2024-02-19 15:21:54,703 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:21:54" (1/1) ... [2024-02-19 15:21:54,713 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:21:54" (1/1) ... [2024-02-19 15:21:54,727 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:21:54" (1/1) ... [2024-02-19 15:21:54,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:21:54" (1/1) ... [2024-02-19 15:21:54,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:21:54" (1/1) ... [2024-02-19 15:21:54,731 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 15:21:54,736 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 15:21:54,736 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 15:21:54,737 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 15:21:54,737 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:21:54" (1/1) ... [2024-02-19 15:21:54,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:21:54,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:21:54,806 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-19 15:21:54,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-19 15:21:54,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 15:21:54,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 15:21:54,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 15:21:54,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 15:21:54,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-19 15:21:54,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-19 15:21:54,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-19 15:21:54,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-19 15:21:54,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-19 15:21:54,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-19 15:21:54,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-19 15:21:54,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-19 15:21:54,940 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 15:21:54,940 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 15:21:54,941 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 15:21:54,941 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 15:21:54,941 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-19 15:21:54,941 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-19 15:21:54,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 15:21:54,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 15:21:54,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-19 15:21:54,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-19 15:21:54,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-19 15:21:54,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-19 15:21:54,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-19 15:21:54,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-19 15:21:54,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 15:21:54,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 15:21:54,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 15:21:54,946 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-19 15:21:55,060 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 15:21:55,061 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 15:21:55,299 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 15:21:55,311 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 15:21:55,601 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 15:21:55,601 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-02-19 15:21:55,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:21:55 BoogieIcfgContainer [2024-02-19 15:21:55,602 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 15:21:55,603 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 15:21:55,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 15:21:55,618 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 15:21:55,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 03:21:54" (1/3) ... [2024-02-19 15:21:55,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ab6b819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:21:55, skipping insertion in model container [2024-02-19 15:21:55,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:21:54" (2/3) ... [2024-02-19 15:21:55,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ab6b819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:21:55, skipping insertion in model container [2024-02-19 15:21:55,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:21:55" (3/3) ... [2024-02-19 15:21:55,620 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2024-02-19 15:21:55,635 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 15:21:55,635 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 15:21:55,635 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 15:21:55,676 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-19 15:21:55,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 41 transitions, 103 flow [2024-02-19 15:21:55,750 INFO L124 PetriNetUnfolderBase]: 7/38 cut-off events. [2024-02-19 15:21:55,751 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-19 15:21:55,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 38 events. 7/38 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 35 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2024-02-19 15:21:55,755 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 41 transitions, 103 flow [2024-02-19 15:21:55,758 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 37 transitions, 92 flow [2024-02-19 15:21:55,771 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 15:21:55,777 INFO L369 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@56231287, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 15:21:55,778 INFO L370 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-02-19 15:21:55,793 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 15:21:55,794 INFO L124 PetriNetUnfolderBase]: 7/36 cut-off events. [2024-02-19 15:21:55,794 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-19 15:21:55,794 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:21:55,795 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:21:55,795 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:21:55,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:21:55,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1925612326, now seen corresponding path program 1 times [2024-02-19 15:21:55,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:21:55,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578046629] [2024-02-19 15:21:55,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:21:55,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:21:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:21:56,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:21:56,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:21:56,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578046629] [2024-02-19 15:21:56,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578046629] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:21:56,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:21:56,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:21:56,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947396794] [2024-02-19 15:21:56,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:21:56,398 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:21:56,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:21:56,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:21:56,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:21:56,427 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2024-02-19 15:21:56,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:21:56,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:21:56,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2024-02-19 15:21:56,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:21:56,636 INFO L124 PetriNetUnfolderBase]: 618/1027 cut-off events. [2024-02-19 15:21:56,636 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2024-02-19 15:21:56,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1909 conditions, 1027 events. 618/1027 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4778 event pairs, 83 based on Foata normal form. 1/855 useless extension candidates. Maximal degree in co-relation 1417. Up to 614 conditions per place. [2024-02-19 15:21:56,647 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 40 selfloop transitions, 3 changer transitions 1/54 dead transitions. [2024-02-19 15:21:56,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 229 flow [2024-02-19 15:21:56,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:21:56,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:21:56,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-02-19 15:21:56,657 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6829268292682927 [2024-02-19 15:21:56,660 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2024-02-19 15:21:56,660 INFO L507 AbstractCegarLoop]: Abstraction has has 42 places, 54 transitions, 229 flow [2024-02-19 15:21:56,661 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:21:56,661 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:21:56,661 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:21:56,661 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 15:21:56,662 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:21:56,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:21:56,663 INFO L85 PathProgramCache]: Analyzing trace with hash -125618846, now seen corresponding path program 1 times [2024-02-19 15:21:56,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:21:56,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633358180] [2024-02-19 15:21:56,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:21:56,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:21:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:21:56,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:21:56,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:21:56,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633358180] [2024-02-19 15:21:56,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633358180] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:21:56,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:21:56,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:21:56,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364082687] [2024-02-19 15:21:56,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:21:56,803 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:21:56,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:21:56,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:21:56,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:21:56,817 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-02-19 15:21:56,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 54 transitions, 229 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:21:56,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:21:56,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-02-19 15:21:56,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:21:57,063 INFO L124 PetriNetUnfolderBase]: 1128/1940 cut-off events. [2024-02-19 15:21:57,063 INFO L125 PetriNetUnfolderBase]: For 530/987 co-relation queries the response was YES. [2024-02-19 15:21:57,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5011 conditions, 1940 events. 1128/1940 cut-off events. For 530/987 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10739 event pairs, 223 based on Foata normal form. 0/1722 useless extension candidates. Maximal degree in co-relation 2190. Up to 922 conditions per place. [2024-02-19 15:21:57,073 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 85 selfloop transitions, 13 changer transitions 4/111 dead transitions. [2024-02-19 15:21:57,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 111 transitions, 692 flow [2024-02-19 15:21:57,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 15:21:57,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 15:21:57,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2024-02-19 15:21:57,075 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5772357723577236 [2024-02-19 15:21:57,076 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2024-02-19 15:21:57,076 INFO L507 AbstractCegarLoop]: Abstraction has has 47 places, 111 transitions, 692 flow [2024-02-19 15:21:57,076 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:21:57,077 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:21:57,077 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:21:57,077 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 15:21:57,077 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:21:57,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:21:57,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1745104030, now seen corresponding path program 1 times [2024-02-19 15:21:57,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:21:57,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044874299] [2024-02-19 15:21:57,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:21:57,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:21:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:21:57,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:21:57,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:21:57,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044874299] [2024-02-19 15:21:57,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044874299] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:21:57,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514085699] [2024-02-19 15:21:57,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:21:57,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:21:57,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:21:57,195 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:21:57,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-19 15:21:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:21:57,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 15:21:57,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:21:57,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:21:57,378 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:21:57,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:21:57,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514085699] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-19 15:21:57,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:21:57,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-02-19 15:21:57,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681598395] [2024-02-19 15:21:57,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:21:57,423 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:21:57,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:21:57,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:21:57,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-02-19 15:21:57,433 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-02-19 15:21:57,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 111 transitions, 692 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:21:57,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:21:57,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-02-19 15:21:57,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:21:57,801 INFO L124 PetriNetUnfolderBase]: 2022/3403 cut-off events. [2024-02-19 15:21:57,801 INFO L125 PetriNetUnfolderBase]: For 3723/5828 co-relation queries the response was YES. [2024-02-19 15:21:57,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11147 conditions, 3403 events. 2022/3403 cut-off events. For 3723/5828 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 20075 event pairs, 266 based on Foata normal form. 112/3157 useless extension candidates. Maximal degree in co-relation 3518. Up to 1502 conditions per place. [2024-02-19 15:21:57,820 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 194 selfloop transitions, 16 changer transitions 11/230 dead transitions. [2024-02-19 15:21:57,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 230 transitions, 1905 flow [2024-02-19 15:21:57,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 15:21:57,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 15:21:57,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2024-02-19 15:21:57,822 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.573170731707317 [2024-02-19 15:21:57,822 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2024-02-19 15:21:57,823 INFO L507 AbstractCegarLoop]: Abstraction has has 52 places, 230 transitions, 1905 flow [2024-02-19 15:21:57,823 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:21:57,823 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:21:57,823 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:21:57,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-02-19 15:21:58,034 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:21:58,035 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:21:58,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:21:58,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1324674157, now seen corresponding path program 1 times [2024-02-19 15:21:58,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:21:58,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976832045] [2024-02-19 15:21:58,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:21:58,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:21:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:21:58,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:21:58,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:21:58,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976832045] [2024-02-19 15:21:58,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976832045] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:21:58,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:21:58,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:21:58,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680837185] [2024-02-19 15:21:58,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:21:58,137 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:21:58,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:21:58,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:21:58,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:21:58,150 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-02-19 15:21:58,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 230 transitions, 1905 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:21:58,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:21:58,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-02-19 15:21:58,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:21:58,478 INFO L124 PetriNetUnfolderBase]: 1795/2826 cut-off events. [2024-02-19 15:21:58,478 INFO L125 PetriNetUnfolderBase]: For 5531/5787 co-relation queries the response was YES. [2024-02-19 15:21:58,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11667 conditions, 2826 events. 1795/2826 cut-off events. For 5531/5787 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 14563 event pairs, 378 based on Foata normal form. 117/2685 useless extension candidates. Maximal degree in co-relation 5698. Up to 1358 conditions per place. [2024-02-19 15:21:58,493 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 61 selfloop transitions, 6 changer transitions 119/195 dead transitions. [2024-02-19 15:21:58,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 195 transitions, 1979 flow [2024-02-19 15:21:58,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 15:21:58,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 15:21:58,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2024-02-19 15:21:58,496 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5284552845528455 [2024-02-19 15:21:58,498 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2024-02-19 15:21:58,498 INFO L507 AbstractCegarLoop]: Abstraction has has 57 places, 195 transitions, 1979 flow [2024-02-19 15:21:58,498 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:21:58,498 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:21:58,498 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:21:58,498 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-19 15:21:58,499 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:21:58,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:21:58,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1414943988, now seen corresponding path program 1 times [2024-02-19 15:21:58,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:21:58,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580854287] [2024-02-19 15:21:58,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:21:58,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:21:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:21:58,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:21:58,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:21:58,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580854287] [2024-02-19 15:21:58,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580854287] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:21:58,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782738423] [2024-02-19 15:21:58,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:21:58,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:21:58,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:21:58,625 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:21:58,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-19 15:21:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:21:58,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 15:21:58,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:21:58,819 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:21:58,832 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:21:58,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:21:58,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782738423] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-19 15:21:58,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:21:58,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2024-02-19 15:21:58,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657622230] [2024-02-19 15:21:58,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:21:58,866 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:21:58,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:21:58,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:21:58,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-02-19 15:21:58,873 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-02-19 15:21:58,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 195 transitions, 1979 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:21:58,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:21:58,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-02-19 15:21:58,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:21:59,209 INFO L124 PetriNetUnfolderBase]: 1637/2719 cut-off events. [2024-02-19 15:21:59,209 INFO L125 PetriNetUnfolderBase]: For 8872/9389 co-relation queries the response was YES. [2024-02-19 15:21:59,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12677 conditions, 2719 events. 1637/2719 cut-off events. For 8872/9389 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 14545 event pairs, 197 based on Foata normal form. 278/2720 useless extension candidates. Maximal degree in co-relation 6792. Up to 1353 conditions per place. [2024-02-19 15:21:59,224 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 90 selfloop transitions, 6 changer transitions 114/219 dead transitions. [2024-02-19 15:21:59,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 219 transitions, 2633 flow [2024-02-19 15:21:59,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:21:59,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:21:59,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2024-02-19 15:21:59,226 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5707317073170731 [2024-02-19 15:21:59,226 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 21 predicate places. [2024-02-19 15:21:59,227 INFO L507 AbstractCegarLoop]: Abstraction has has 61 places, 219 transitions, 2633 flow [2024-02-19 15:21:59,227 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:21:59,227 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:21:59,227 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:21:59,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-02-19 15:21:59,439 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:21:59,440 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:21:59,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:21:59,440 INFO L85 PathProgramCache]: Analyzing trace with hash -2026454305, now seen corresponding path program 1 times [2024-02-19 15:21:59,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:21:59,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853956510] [2024-02-19 15:21:59,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:21:59,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:21:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:21:59,537 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:21:59,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:21:59,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853956510] [2024-02-19 15:21:59,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853956510] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:21:59,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195849950] [2024-02-19 15:21:59,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:21:59,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:21:59,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:21:59,539 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:21:59,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-02-19 15:21:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:21:59,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 15:21:59,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:21:59,686 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:21:59,687 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:21:59,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:21:59,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195849950] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-19 15:21:59,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:21:59,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-02-19 15:21:59,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836272848] [2024-02-19 15:21:59,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:21:59,718 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:21:59,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:21:59,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:21:59,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-02-19 15:21:59,727 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-02-19 15:21:59,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 219 transitions, 2633 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:21:59,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:21:59,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-02-19 15:21:59,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:21:59,980 INFO L124 PetriNetUnfolderBase]: 1458/2398 cut-off events. [2024-02-19 15:21:59,981 INFO L125 PetriNetUnfolderBase]: For 11549/12119 co-relation queries the response was YES. [2024-02-19 15:21:59,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12887 conditions, 2398 events. 1458/2398 cut-off events. For 11549/12119 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 12218 event pairs, 122 based on Foata normal form. 151/2337 useless extension candidates. Maximal degree in co-relation 8801. Up to 1276 conditions per place. [2024-02-19 15:21:59,997 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 105 selfloop transitions, 11 changer transitions 99/226 dead transitions. [2024-02-19 15:21:59,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 226 transitions, 3104 flow [2024-02-19 15:21:59,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:21:59,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:21:59,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2024-02-19 15:21:59,999 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5951219512195122 [2024-02-19 15:21:59,999 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 25 predicate places. [2024-02-19 15:22:00,000 INFO L507 AbstractCegarLoop]: Abstraction has has 65 places, 226 transitions, 3104 flow [2024-02-19 15:22:00,000 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:22:00,000 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:22:00,000 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:22:00,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-02-19 15:22:00,212 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:22:00,213 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:22:00,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:22:00,213 INFO L85 PathProgramCache]: Analyzing trace with hash -443110799, now seen corresponding path program 1 times [2024-02-19 15:22:00,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:22:00,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996404524] [2024-02-19 15:22:00,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:22:00,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:22:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:22:01,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:22:01,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:22:01,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996404524] [2024-02-19 15:22:01,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996404524] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:22:01,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274558457] [2024-02-19 15:22:01,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:22:01,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:22:01,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:22:01,283 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:22:01,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-02-19 15:22:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:22:01,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 39 conjunts are in the unsatisfiable core [2024-02-19 15:22:01,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:22:01,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-02-19 15:22:01,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:22:01,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:22:01,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:22:01,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:22:01,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:22:01,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-02-19 15:22:01,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:22:01,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-02-19 15:22:01,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:22:01,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:22:01,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:22:01,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-02-19 15:22:01,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:22:01,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:22:01,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:22:01,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:22:01,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:22:01,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-02-19 15:22:01,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:22:01,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-02-19 15:22:01,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:22:01,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2024-02-19 15:22:01,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:22:01,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-02-19 15:22:01,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:22:01,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:22:01,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:22:01,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:22:01,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:22:01,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-02-19 15:22:01,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:22:01,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-02-19 15:22:01,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:22:01,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:22:01,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:22:01,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:22:01,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:22:01,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-02-19 15:22:01,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:22:01,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:22:01,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:22:01,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-02-19 15:22:01,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:22:01,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-02-19 15:22:01,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:22:01,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:22:01,645 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-02-19 15:22:01,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-02-19 15:22:01,686 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-02-19 15:22:01,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-02-19 15:22:01,874 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-02-19 15:22:01,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2024-02-19 15:22:02,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:22:02,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27 [2024-02-19 15:22:02,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:22:02,208 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:22:02,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:22:02,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 356 treesize of output 336 [2024-02-19 15:22:03,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 159 [2024-02-19 15:22:03,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:22:03,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 75 treesize of output 149 [2024-02-19 15:22:04,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:22:04,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 113 [2024-02-19 15:22:07,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:22:07,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:22:07,351 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2024-02-19 15:22:07,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 27 [2024-02-19 15:22:08,399 INFO L349 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2024-02-19 15:22:08,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 163 treesize of output 1 [2024-02-19 15:22:08,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:22:08,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 245 treesize of output 231 [2024-02-19 15:22:08,818 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:22:32,176 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:22:32,246 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:22:32,345 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:22:32,462 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:22:32,568 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:22:32,640 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:22:33,017 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:22:33,798 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:22:35,500 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:22:35,689 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:22:36,847 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:22:36,905 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:22:36,986 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:22:39,317 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:22:39,428 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:22:40,355 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:22:40,415 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:22:44,184 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:22:44,239 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:22:44,310 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:22:44,370 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:22:53,263 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:22:56,198 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:23:20,715 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:23:21,124 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:24:00,826 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:24:00,889 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:24:00,954 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:24:01,082 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:24:01,143 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:24:01,497 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:24:03,146 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:24:06,043 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:24:06,180 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:24:06,934 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:24:08,464 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:24:18,733 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:24:18,952 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:24:24,342 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:24:24,447 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:24:26,276 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:24:26,731 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:24:28,811 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:24:28,877 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:24:29,427 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:25:23,600 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:26:11,110 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:26:11,193 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:26:11,879 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:26:12,063 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:26:12,070 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:26:12,374 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:26:12,377 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:26:12,385 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:26:12,743 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:26:12,747 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:26:12,750 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:26:12,758 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:26:13,303 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:26:13,640 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:26:13,929 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:26:14,071 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:26:15,672 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:26:15,809 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:26:15,868 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:26:15,940 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:26:15,999 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:26:16,355 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:26:16,415 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:26:16,487 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:26:16,566 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:26:16,876 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:26:16,935 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:26:16,995 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:26:17,141 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:26:27,821 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:26:28,338 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:26:28,736 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:26:28,815 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:26:44,618 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:26:45,053 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:26:45,331 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:26:45,447 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:27:03,264 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:03,331 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:27:03,399 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:03,476 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:27:04,052 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:04,147 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:27:04,249 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:04,345 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:04,520 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:04,525 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:04,783 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:27:04,788 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:27:04,943 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:04,947 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:05,124 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:27:05,130 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:27:05,135 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:27:05,294 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:05,303 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:05,308 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:05,596 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:05,599 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:05,604 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:05,773 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:27:05,777 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:27:05,783 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:27:05,788 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:27:05,933 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:05,940 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:05,948 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:05,953 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:06,154 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:06,162 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:06,165 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:06,170 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:37,184 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:27:37,251 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-02-19 15:27:37,336 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:27:37,470 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:27:37,682 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:37,685 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:37,866 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:37,868 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:37,870 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:37,972 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:37,977 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:37,979 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:37,981 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:38,384 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:38,390 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:38,395 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:38,397 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:38,399 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:39,021 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:39,077 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:39,795 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:40,311 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:40,382 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:42,806 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:42,980 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:48,728 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:48,822 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:48,893 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:27:48,967 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:54,279 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:27:54,436 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:54,558 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:27:54,786 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:28:09,556 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:28:09,696 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:28:13,360 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:28:13,428 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:28:13,514 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:28:13,583 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:28:13,764 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:28:13,939 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:28:14,005 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:28:28,189 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:28:44,251 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:28:44,329 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:28:44,699 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:28:44,758 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:28:44,826 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:28:45,210 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:28:45,327 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:28:45,412 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:28:45,717 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:28:45,722 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:28:45,838 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:28:45,844 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:28:45,934 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:28:45,940 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:28:46,028 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:28:46,035 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:28:46,041 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:28:46,265 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:28:46,271 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:28:46,277 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:28:46,878 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:28:46,884 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:28:46,889 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:28:47,625 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:28:47,631 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:28:47,637 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:28:47,642 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:28:47,735 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:28:47,741 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:28:47,750 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:28:47,756 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:28:47,928 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:28:47,935 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:28:47,941 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:28:47,946 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:28:48,074 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:28:52,822 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:06,365 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:06,428 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:06,497 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:29:06,576 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:06,820 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:07,165 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:07,287 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:07,386 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:29:07,484 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:07,489 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:07,587 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:29:07,593 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:29:07,799 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:07,802 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:07,808 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:07,901 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:29:07,909 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:29:07,915 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:29:08,137 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:08,143 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:08,146 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:08,151 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:08,355 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:29:08,363 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:29:08,397 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:29:08,402 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:29:09,627 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:09,702 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:09,772 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:29:09,835 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:29:10,563 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:10,637 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:29:10,692 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:29:11,320 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:11,402 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:29:11,464 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:29:11,605 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:12,796 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:29:12,919 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:42,364 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:49,745 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:29:49,951 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:50,124 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:50,128 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:55,378 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:55,675 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:55,809 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:56,042 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:56,317 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:56,620 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:57,291 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:57,558 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:57,629 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:57,780 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:58,025 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:58,290 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:58,857 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:29:58,965 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-02-19 15:29:59,036 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:29:59,122 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:29:59,281 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:59,291 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:59,353 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:59,358 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:59,367 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:59,504 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:59,507 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:59,512 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:59,522 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:59,717 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:59,722 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:59,725 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:59,730 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:59,740 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:14,083 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:14,406 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:14,417 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:18,610 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:31,577 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:31,750 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:40,259 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:40,343 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:30:40,426 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:40,510 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:40,596 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:41,033 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:41,282 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:30:41,385 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:41,507 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:30:41,513 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:30:41,626 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:41,632 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:41,828 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:41,834 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:42,054 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:42,063 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:42,069 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:42,187 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:42,194 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:42,200 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:42,309 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:30:42,320 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:30:42,326 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:30:42,460 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:30:42,469 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:30:42,475 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:30:42,480 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:30:42,584 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:42,592 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:42,601 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:42,606 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:42,732 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:42,741 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:42,747 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:42,753 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:31:01,102 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:31:09,814 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:31:17,912 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:31:18,651 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:31:18,745 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:31:19,002 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:31:19,341 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:31:19,427 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:31:19,605 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:31:21,215 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:31:21,303 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:31:21,428 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:31:21,491 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:31:30,425 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:31:30,582 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:31:34,614 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:31:57,570 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:31:57,777 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:31:58,348 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:31:58,496 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:31:58,739 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:00,938 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:01,001 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:01,795 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:01,981 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:01,986 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:02,846 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:02,849 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:02,854 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:03,338 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:03,345 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:03,348 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:03,353 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:06,000 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:06,333 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:06,625 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:06,849 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:07,005 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:07,059 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:32:07,258 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:07,366 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:07,495 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:07,611 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:07,693 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:32:07,766 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:07,894 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:08,148 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:32:08,238 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:32:08,318 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:32:08,435 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:32:28,243 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:30,532 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:31,639 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:31,844 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:32,121 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:32,189 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:32,189 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-02-19 15:32:36,301 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:32:36,472 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:32:36,758 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:32:36,931 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:43,442 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:32:43,539 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:43,601 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:43,673 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:43,760 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:43,932 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:32:44,035 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:44,858 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:32:45,008 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:45,128 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:32:45,204 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:32:45,454 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:32:45,598 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:32:51,973 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:52,106 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:56,314 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:56,382 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:56,465 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:56,609 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:33:00,928 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:33:06,711 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:33:07,160 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:33:07,724 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:33:07,799 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:33:07,973 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:33:08,095 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:33:12,762 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:33:13,011 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:33:22,645 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:33:22,936 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:33:29,256 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:33:29,540 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:33:30,815 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:33:30,889 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:33:34,718 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:33:34,826 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:33:34,908 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:33:35,028 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:33:50,193 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:33:50,592 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:33:50,804 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:33:51,005 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:01,160 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:07,502 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:16,702 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:19,300 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:34:19,384 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:34:19,503 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-02-19 15:34:19,611 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:34:19,808 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:19,810 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:20,397 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:20,403 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:20,405 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:20,601 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:20,604 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:20,611 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:20,613 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:20,752 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:20,758 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:20,761 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:20,767 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:20,769 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:30,141 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:30,480 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:30,540 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:30,672 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:30,723 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:30,812 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:30,922 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:38,698 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:39,017 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:39,393 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:39,522 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:34:39,824 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:40,271 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:40,530 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:40,960 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:34:41,111 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:35:27,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:35:27,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 71 [2024-02-19 15:35:28,888 INFO L349 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2024-02-19 15:35:28,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 1 [2024-02-19 15:35:28,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:35:28,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 36 [2024-02-19 15:35:29,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:35:29,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2024-02-19 15:35:30,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:35:30,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 43 [2024-02-19 15:35:40,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-02-19 15:35:40,804 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2024-02-19 15:35:40,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 50 [2024-02-19 15:35:49,260 INFO L349 Elim1Store]: treesize reduction 44, result has 27.9 percent of original size [2024-02-19 15:35:49,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 65 Killed by 15