./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2725e330d17b26eb9ce2dcee483f6c78572e140dfdc07b8b5f8c08e6f3c60756 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 04:35:48,494 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:35:48,592 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 04:35:48,599 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:35:48,599 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:35:48,641 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:35:48,642 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:35:48,642 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:35:48,643 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:35:48,644 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:35:48,645 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:35:48,645 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:35:48,645 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:35:48,646 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 04:35:48,648 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:35:48,648 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:35:48,648 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 04:35:48,649 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 04:35:48,649 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:35:48,649 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 04:35:48,650 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 04:35:48,654 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 04:35:48,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:35:48,655 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 04:35:48,655 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:35:48,656 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:35:48,656 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:35:48,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:35:48,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 04:35:48,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:35:48,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 04:35:48,673 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:35:48,673 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:35:48,673 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 04:35:48,673 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:35:48,674 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:35:48,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:35:48,674 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:35:48,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:35:48,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:35:48,676 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:35:48,677 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 04:35:48,677 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 04:35:48,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 04:35:48,678 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:35:48,678 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:35:48,678 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 04:35:48,678 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje 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 -> Taipan 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 -> 2725e330d17b26eb9ce2dcee483f6c78572e140dfdc07b8b5f8c08e6f3c60756 [2024-11-09 04:35:49,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:35:49,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:35:49,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:35:49,060 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:35:49,061 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:35:49,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i Unable to find full path for "g++" [2024-11-09 04:35:51,003 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:35:51,245 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:35:51,246 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i [2024-11-09 04:35:51,260 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/data/ae2c13b05/00a0558e2d2f45d2ab4cea652e64a4ba/FLAG25457ebda [2024-11-09 04:35:51,279 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/data/ae2c13b05/00a0558e2d2f45d2ab4cea652e64a4ba [2024-11-09 04:35:51,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:35:51,284 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:35:51,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:35:51,286 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:35:51,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:35:51,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:35:51" (1/1) ... [2024-11-09 04:35:51,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dd284c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:35:51, skipping insertion in model container [2024-11-09 04:35:51,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:35:51" (1/1) ... [2024-11-09 04:35:51,356 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:35:51,747 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i[24020,24033] [2024-11-09 04:35:51,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:35:51,768 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:35:51,829 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i[24020,24033] [2024-11-09 04:35:51,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:35:51,865 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:35:51,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:35:51 WrapperNode [2024-11-09 04:35:51,866 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:35:51,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:35:51,867 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:35:51,867 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:35:51,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:35:51" (1/1) ... [2024-11-09 04:35:51,890 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:35:51" (1/1) ... [2024-11-09 04:35:51,921 INFO L138 Inliner]: procedures = 126, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 169 [2024-11-09 04:35:51,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:35:51,922 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:35:51,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:35:51,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:35:51,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:35:51" (1/1) ... [2024-11-09 04:35:51,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:35:51" (1/1) ... [2024-11-09 04:35:51,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:35:51" (1/1) ... [2024-11-09 04:35:51,948 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:35:51" (1/1) ... [2024-11-09 04:35:51,960 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:35:51" (1/1) ... [2024-11-09 04:35:51,964 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:35:51" (1/1) ... [2024-11-09 04:35:51,966 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:35:51" (1/1) ... [2024-11-09 04:35:51,968 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:35:51" (1/1) ... [2024-11-09 04:35:51,971 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:35:51,975 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:35:51,975 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:35:51,975 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:35:51,976 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:35:51" (1/1) ... [2024-11-09 04:35:51,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:35:52,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:35:52,020 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:35:52,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:35:52,072 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-09 04:35:52,072 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-09 04:35:52,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 04:35:52,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 04:35:52,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 04:35:52,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:35:52,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 04:35:52,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 04:35:52,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 04:35:52,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 04:35:52,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:35:52,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:35:52,279 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:35:52,281 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:35:52,347 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-09 04:35:52,691 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-11-09 04:35:52,693 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:35:52,787 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:35:52,787 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-09 04:35:52,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:35:52 BoogieIcfgContainer [2024-11-09 04:35:52,788 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:35:52,790 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:35:52,790 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:35:52,793 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:35:52,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:35:51" (1/3) ... [2024-11-09 04:35:52,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a5fb2f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:35:52, skipping insertion in model container [2024-11-09 04:35:52,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:35:51" (2/3) ... [2024-11-09 04:35:52,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a5fb2f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:35:52, skipping insertion in model container [2024-11-09 04:35:52,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:35:52" (3/3) ... [2024-11-09 04:35:52,797 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_and_skiplist_2lvl-2.i [2024-11-09 04:35:52,815 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:35:52,815 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 04:35:52,886 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:35:52,893 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@18d7ae56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:35:52,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 04:35:52,897 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 30 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:35:52,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 04:35:52,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:35:52,906 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:35:52,907 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:35:52,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:35:52,913 INFO L85 PathProgramCache]: Analyzing trace with hash 525365468, now seen corresponding path program 1 times [2024-11-09 04:35:52,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:35:52,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653629538] [2024-11-09 04:35:52,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:35:52,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:35:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:35:53,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:35:53,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:35:53,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653629538] [2024-11-09 04:35:53,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653629538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:35:53,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:35:53,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:35:53,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698462935] [2024-11-09 04:35:53,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:35:53,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 04:35:53,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:35:53,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 04:35:53,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 04:35:53,142 INFO L87 Difference]: Start difference. First operand has 32 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 30 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-11-09 04:35:53,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:35:53,216 INFO L93 Difference]: Finished difference Result 53 states and 77 transitions. [2024-11-09 04:35:53,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 04:35:53,220 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) Word has length 9 [2024-11-09 04:35:53,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:35:53,227 INFO L225 Difference]: With dead ends: 53 [2024-11-09 04:35:53,227 INFO L226 Difference]: Without dead ends: 14 [2024-11-09 04:35:53,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 04:35:53,237 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:35:53,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:35:53,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-09 04:35:53,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-09 04:35:53,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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-11-09 04:35:53,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-11-09 04:35:53,266 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2024-11-09 04:35:53,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:35:53,266 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-11-09 04:35:53,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-11-09 04:35:53,267 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-11-09 04:35:53,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 04:35:53,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:35:53,268 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:35:53,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 04:35:53,268 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:35:53,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:35:53,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1725847051, now seen corresponding path program 1 times [2024-11-09 04:35:53,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:35:53,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237531900] [2024-11-09 04:35:53,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:35:53,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:35:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:35:53,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:35:53,806 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:35:53,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237531900] [2024-11-09 04:35:53,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237531900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:35:53,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:35:53,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:35:53,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571062057] [2024-11-09 04:35:53,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:35:53,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:35:53,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:35:53,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:35:53,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:35:53,811 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-11-09 04:35:53,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:35:53,900 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-11-09 04:35:53,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:35:53,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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) Word has length 10 [2024-11-09 04:35:53,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:35:53,901 INFO L225 Difference]: With dead ends: 25 [2024-11-09 04:35:53,902 INFO L226 Difference]: Without dead ends: 23 [2024-11-09 04:35:53,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:35:53,903 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 13 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:35:53,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 20 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:35:53,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-09 04:35:53,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2024-11-09 04:35:53,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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-11-09 04:35:53,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-11-09 04:35:53,909 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 10 [2024-11-09 04:35:53,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:35:53,910 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-09 04:35:53,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-11-09 04:35:53,910 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-11-09 04:35:53,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 04:35:53,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:35:53,911 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:35:53,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 04:35:53,912 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:35:53,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:35:53,913 INFO L85 PathProgramCache]: Analyzing trace with hash -2071775780, now seen corresponding path program 1 times [2024-11-09 04:35:53,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:35:53,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693720576] [2024-11-09 04:35:53,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:35:53,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:35:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:35:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:35:54,256 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:35:54,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693720576] [2024-11-09 04:35:54,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693720576] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:35:54,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679976776] [2024-11-09 04:35:54,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:35:54,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:35:54,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:35:54,261 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:35:54,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 04:35:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:35:54,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 04:35:54,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:35:54,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-09 04:35:54,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-09 04:35:54,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:35:54,632 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:35:54,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 21 [2024-11-09 04:35:54,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:54,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:54,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:35:54,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679976776] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:35:54,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1716953430] [2024-11-09 04:35:54,743 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-09 04:35:54,743 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:35:54,747 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:35:54,753 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:35:54,754 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:35:55,114 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:35:56,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1716953430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:35:56,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:35:56,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 5, 5] total 14 [2024-11-09 04:35:56,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791308832] [2024-11-09 04:35:56,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:35:56,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 04:35:56,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:35:56,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 04:35:56,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=136, Unknown=1, NotChecked=0, Total=182 [2024-11-09 04:35:56,162 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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-11-09 04:35:58,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:36:00,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:36:02,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:36:04,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:36:04,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:36:04,968 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2024-11-09 04:36:04,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 04:36:04,969 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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) Word has length 14 [2024-11-09 04:36:04,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:36:04,970 INFO L225 Difference]: With dead ends: 26 [2024-11-09 04:36:04,970 INFO L226 Difference]: Without dead ends: 16 [2024-11-09 04:36:04,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=45, Invalid=136, Unknown=1, NotChecked=0, Total=182 [2024-11-09 04:36:04,971 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-09 04:36:04,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 8 Unknown, 0 Unchecked, 8.8s Time] [2024-11-09 04:36:04,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-09 04:36:04,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-09 04:36:04,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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-11-09 04:36:04,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-11-09 04:36:04,976 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2024-11-09 04:36:04,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:36:04,976 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-11-09 04:36:04,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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-11-09 04:36:04,977 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2024-11-09 04:36:04,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 04:36:04,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:36:04,978 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:36:04,998 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 04:36:05,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:36:05,182 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:36:05,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:36:05,182 INFO L85 PathProgramCache]: Analyzing trace with hash 522066094, now seen corresponding path program 1 times [2024-11-09 04:36:05,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:36:05,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730042670] [2024-11-09 04:36:05,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:36:05,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:36:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:36:05,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:36:05,642 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:36:05,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730042670] [2024-11-09 04:36:05,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730042670] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:36:05,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087739883] [2024-11-09 04:36:05,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:36:05,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:36:05,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:36:05,645 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:36:05,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 04:36:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:36:05,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 04:36:05,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:36:05,760 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-11-09 04:36:05,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-09 04:36:05,839 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 04:36:05,839 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 11 treesize of output 11 [2024-11-09 04:36:05,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 11 [2024-11-09 04:36:05,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 16 treesize of output 11 [2024-11-09 04:36:05,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:36:05,946 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:36:06,030 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_117 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (or (not (= v_ArrVal_114 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_114 .cse0))))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_114) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_117) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2024-11-09 04:36:06,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:36:06,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 70 treesize of output 74 [2024-11-09 04:36:06,074 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 50 treesize of output 46 [2024-11-09 04:36:06,141 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 143 treesize of output 137 [2024-11-09 04:36:06,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:36:06,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087739883] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:36:06,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2136761944] [2024-11-09 04:36:06,304 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2024-11-09 04:36:06,305 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:36:06,305 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:36:06,305 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:36:06,306 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:36:07,258 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:36:26,508 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '418#(and (exists ((|v_ULTIMATE.start_main_~p~0#1.offset_38| Int) (|v_#memory_$Pointer$.base_31| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_31| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.base_40| Int) (|v_#memory_$Pointer$.base_71| (Array Int (Array Int Int))) (|v_#memory_int_93| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_70| (Array Int (Array Int Int)))) (and (<= 1 |#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.base_71| |v_ULTIMATE.start_main_~p~0#1.base_40| (store (select |v_#memory_$Pointer$.base_71| |v_ULTIMATE.start_main_~p~0#1.base_40|) |v_ULTIMATE.start_main_~p~0#1.offset_38| (select (select |v_#memory_$Pointer$.base_31| |v_ULTIMATE.start_main_~p~0#1.base_40|) |v_ULTIMATE.start_main_~p~0#1.offset_38|))) |v_#memory_$Pointer$.base_31|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_31| |v_ULTIMATE.start_main_~p~0#1.base_40| (store (select |v_#memory_$Pointer$.offset_31| |v_ULTIMATE.start_main_~p~0#1.base_40|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_38| 4) 0))) (= (store |v_#memory_$Pointer$.offset_70| |v_ULTIMATE.start_main_~p~0#1.base_40| (store (select |v_#memory_$Pointer$.offset_70| |v_ULTIMATE.start_main_~p~0#1.base_40|) |v_ULTIMATE.start_main_~p~0#1.offset_38| (select (select |v_#memory_$Pointer$.offset_31| |v_ULTIMATE.start_main_~p~0#1.base_40|) |v_ULTIMATE.start_main_~p~0#1.offset_38|))) |v_#memory_$Pointer$.offset_31|) (= |#memory_int| (store |v_#memory_int_93| |v_ULTIMATE.start_main_~p~0#1.base_40| (store (store (select |v_#memory_int_93| |v_ULTIMATE.start_main_~p~0#1.base_40|) |v_ULTIMATE.start_main_~p~0#1.offset_38| 1) (+ |v_ULTIMATE.start_main_~p~0#1.offset_38| 4) (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_40|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_38| 4))))) (exists ((|v_#memory_$Pointer$.base_70| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_69| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int) (|v_#memory_int_92| (Array Int (Array Int Int)))) (and (not (= (select (select |v_#memory_$Pointer$.base_71| |v_ULTIMATE.start_main_~p~0#1.base_39|) 4) 0)) (= |v_#memory_$Pointer$.offset_70| (store |v_#memory_$Pointer$.offset_69| |v_ULTIMATE.start_main_~p~0#1.base_39| (store (select |v_#memory_$Pointer$.offset_69| |v_ULTIMATE.start_main_~p~0#1.base_39|) 4 0))) (= |v_ULTIMATE.start_main_~p~0#1.offset_38| (select (select |v_#memory_$Pointer$.offset_70| |v_ULTIMATE.start_main_~p~0#1.base_39|) 4)) (= (select (select |v_#memory_$Pointer$.base_71| |v_ULTIMATE.start_main_~p~0#1.base_39|) 4) |v_ULTIMATE.start_main_~p~0#1.base_40|) (= |v_#memory_$Pointer$.base_71| (store |v_#memory_$Pointer$.base_70| |v_ULTIMATE.start_main_~p~0#1.base_39| (store (select |v_#memory_$Pointer$.base_70| |v_ULTIMATE.start_main_~p~0#1.base_39|) 4 (select (select |v_#memory_$Pointer$.base_71| |v_ULTIMATE.start_main_~p~0#1.base_39|) 4)))) (= (store |v_#memory_int_92| |v_ULTIMATE.start_main_~p~0#1.base_39| (store (select |v_#memory_int_92| |v_ULTIMATE.start_main_~p~0#1.base_39|) 4 (select (select |v_#memory_int_93| |v_ULTIMATE.start_main_~p~0#1.base_39|) 4))) |v_#memory_int_93|))) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_31| |v_ULTIMATE.start_main_~p~0#1.base_40| (store (select |v_#memory_$Pointer$.base_31| |v_ULTIMATE.start_main_~p~0#1.base_40|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_38| 4) 0))))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 1)) (not (= 0 |ULTIMATE.start_main_~p~0#1.base|)))' at error location [2024-11-09 04:36:26,508 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:36:26,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:36:26,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-09 04:36:26,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151286771] [2024-11-09 04:36:26,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:36:26,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 04:36:26,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:36:26,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 04:36:26,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=359, Unknown=8, NotChecked=38, Total=462 [2024-11-09 04:36:26,512 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 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-11-09 04:36:27,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:36:27,003 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2024-11-09 04:36:27,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 04:36:27,004 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 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) Word has length 14 [2024-11-09 04:36:27,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:36:27,005 INFO L225 Difference]: With dead ends: 29 [2024-11-09 04:36:27,005 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 04:36:27,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=92, Invalid=553, Unknown=9, NotChecked=48, Total=702 [2024-11-09 04:36:27,007 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 20 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:36:27,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 34 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 74 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2024-11-09 04:36:27,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 04:36:27,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2024-11-09 04:36:27,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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-11-09 04:36:27,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-11-09 04:36:27,013 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2024-11-09 04:36:27,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:36:27,014 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-11-09 04:36:27,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 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-11-09 04:36:27,014 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-11-09 04:36:27,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 04:36:27,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:36:27,015 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:36:27,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 04:36:27,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:36:27,220 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:36:27,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:36:27,220 INFO L85 PathProgramCache]: Analyzing trace with hash -993550315, now seen corresponding path program 1 times [2024-11-09 04:36:27,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:36:27,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012529100] [2024-11-09 04:36:27,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:36:27,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:36:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:36:27,825 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:36:27,825 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:36:27,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012529100] [2024-11-09 04:36:27,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012529100] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:36:27,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865714816] [2024-11-09 04:36:27,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:36:27,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:36:27,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:36:27,828 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:36:27,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 04:36:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:36:27,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 04:36:27,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:36:27,939 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-11-09 04:36:28,034 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 04:36:28,034 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 11 treesize of output 11 [2024-11-09 04:36:28,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-11-09 04:36:28,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-11-09 04:36:28,195 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 04:36:28,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 78 [2024-11-09 04:36:28,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 46 treesize of output 15 [2024-11-09 04:36:28,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 32 treesize of output 19 [2024-11-09 04:36:28,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 31 treesize of output 19 [2024-11-09 04:36:28,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 11 [2024-11-09 04:36:28,330 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:36:28,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:36:28,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 452 treesize of output 408 [2024-11-09 04:36:28,437 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_180 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_181 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2024-11-09 04:36:28,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:36:28,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 22 treesize of output 23 [2024-11-09 04:36:28,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:36:28,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 35 [2024-11-09 04:36:28,493 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 7 treesize of output 3 [2024-11-09 04:36:28,502 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:36:28,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 22 treesize of output 1 [2024-11-09 04:36:28,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 04:36:28,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865714816] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:36:28,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1394765528] [2024-11-09 04:36:28,644 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2024-11-09 04:36:28,644 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:36:28,645 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:36:28,645 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:36:28,645 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:36:33,674 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:36:36,315 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '500#true' at error location [2024-11-09 04:36:36,315 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:36:36,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:36:36,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-11-09 04:36:36,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964543329] [2024-11-09 04:36:36,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:36:36,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 04:36:36,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:36:36,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 04:36:36,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=530, Unknown=1, NotChecked=46, Total=650 [2024-11-09 04:36:36,317 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 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-11-09 04:36:37,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:36:37,539 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2024-11-09 04:36:37,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 04:36:37,540 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 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) Word has length 18 [2024-11-09 04:36:37,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:36:37,541 INFO L225 Difference]: With dead ends: 33 [2024-11-09 04:36:37,541 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 04:36:37,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=123, Invalid=810, Unknown=1, NotChecked=58, Total=992 [2024-11-09 04:36:37,543 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 32 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:36:37,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 77 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 176 Invalid, 0 Unknown, 27 Unchecked, 0.2s Time] [2024-11-09 04:36:37,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 04:36:37,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2024-11-09 04:36:37,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 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-11-09 04:36:37,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2024-11-09 04:36:37,548 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 18 [2024-11-09 04:36:37,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:36:37,548 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-11-09 04:36:37,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 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-11-09 04:36:37,549 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2024-11-09 04:36:37,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 04:36:37,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:36:37,549 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:36:37,564 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 04:36:37,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:36:37,750 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:36:37,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:36:37,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1600291559, now seen corresponding path program 2 times [2024-11-09 04:36:37,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:36:37,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843575197] [2024-11-09 04:36:37,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:36:37,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:36:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:36:38,301 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:36:38,301 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:36:38,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843575197] [2024-11-09 04:36:38,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843575197] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:36:38,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987409656] [2024-11-09 04:36:38,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 04:36:38,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:36:38,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:36:38,304 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:36:38,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 04:36:38,432 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 04:36:38,432 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:36:38,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 04:36:38,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:36:38,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-09 04:36:38,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 11 [2024-11-09 04:36:38,607 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 04:36:38,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 18 [2024-11-09 04:36:38,672 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 04:36:38,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 04:36:38,735 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 04:36:38,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2024-11-09 04:36:38,760 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 04:36:38,760 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:36:38,844 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_276 Int) (v_ArrVal_272 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_272))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_59|) |c_ULTIMATE.start_main_~t~0#1.offset| 1) (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4) v_ArrVal_276))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse1 (select v_ArrVal_272 .cse1))) v_ArrVal_272)))) is different from false [2024-11-09 04:36:38,871 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_276 Int) (v_ArrVal_272 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (not (= v_ArrVal_272 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 1) .cse0 (select v_ArrVal_272 .cse0))))) (= (select (select (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_272))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 1) 4 v_ArrVal_276))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2024-11-09 04:36:38,912 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_60| Int) (v_ArrVal_276 Int) (v_ArrVal_272 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_269))) (or (= (select (select (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60| v_ArrVal_272))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 1) 4 v_ArrVal_276))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_269 (let ((.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2 (select v_ArrVal_269 .cse2))))) (not (= v_ArrVal_272 (let ((.cse3 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (store (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60|) |c_ULTIMATE.start_main_~t~0#1.offset| 1) .cse3 (select v_ArrVal_272 .cse3)))))))) is different from false [2024-11-09 04:36:39,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:36:39,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 5916 treesize of output 5848 [2024-11-09 04:36:39,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:36:39,187 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 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-09 04:36:43,718 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:43,724 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:43,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-09 04:36:44,578 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 04:36:44,578 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 12 treesize of output 11 [2024-11-09 04:36:44,698 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 04:36:44,699 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 75 treesize of output 69 [2024-11-09 04:36:44,805 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 04:36:44,806 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 70 treesize of output 66 [2024-11-09 04:36:44,991 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:36:44,991 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 90 treesize of output 94 [2024-11-09 04:36:45,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:36:45,294 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 73 treesize of output 77 [2024-11-09 04:36:45,769 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:45,771 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:45,774 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:45,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-09 04:36:46,115 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:46,121 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:46,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-09 04:36:46,459 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 04:36:46,459 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 86 treesize of output 82 [2024-11-09 04:36:46,550 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 04:36:46,550 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 144 treesize of output 139 [2024-11-09 04:36:46,667 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 04:36:46,668 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 86 treesize of output 82 [2024-11-09 04:36:46,759 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 04:36:46,759 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 139 treesize of output 133 [2024-11-09 04:36:47,194 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:47,205 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 04:36:47,205 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 83 treesize of output 79 [2024-11-09 04:36:47,278 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 04:36:47,279 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 109 treesize of output 105 [2024-11-09 04:36:47,460 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:47,477 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 04:36:47,477 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 83 treesize of output 79 [2024-11-09 04:36:47,906 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 90 treesize of output 86 [2024-11-09 04:36:47,925 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 90 treesize of output 86 [2024-11-09 04:36:49,252 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,253 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,256 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 1494 treesize of output 1478 [2024-11-09 04:36:49,327 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 129 treesize of output 123 [2024-11-09 04:36:49,350 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 480 treesize of output 472 [2024-11-09 04:36:49,405 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,408 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,411 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 23 treesize of output 21 [2024-11-09 04:36:49,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:49,421 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,422 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:49,427 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,428 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,434 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,437 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 27 treesize of output 25 [2024-11-09 04:36:49,448 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,451 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 155 treesize of output 151 [2024-11-09 04:36:49,464 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,468 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 168 treesize of output 162 [2024-11-09 04:36:49,482 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,486 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 27 treesize of output 25 [2024-11-09 04:36:49,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:49,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:49,502 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,503 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:49,507 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,508 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:49,517 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,521 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:49,526 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,527 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:49,536 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,538 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:49,542 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,543 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,554 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,558 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 168 treesize of output 162 [2024-11-09 04:36:49,570 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,573 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 14 treesize of output 12 [2024-11-09 04:36:49,590 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,593 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 27 treesize of output 25 [2024-11-09 04:36:49,607 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,614 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 183 treesize of output 181 [2024-11-09 04:36:49,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:49,645 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,649 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 168 treesize of output 162 [2024-11-09 04:36:49,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:49,669 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,669 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:49,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:49,677 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:49,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:49,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:49,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:49,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:49,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:49,717 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,720 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 263 treesize of output 259 [2024-11-09 04:36:49,732 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 48 treesize of output 46 [2024-11-09 04:36:49,750 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,751 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:49,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:49,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:49,760 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:49,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:49,770 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,772 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 23 treesize of output 21 [2024-11-09 04:36:49,795 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:49,833 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 353 treesize of output 331 [2024-11-09 04:36:49,872 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,873 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:49,878 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,880 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:49,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:49,891 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:49,967 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,967 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,968 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,969 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,969 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,970 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,972 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:49,974 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,974 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,976 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:49,980 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,981 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,984 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:49,987 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,988 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,988 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,989 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,990 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,991 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,992 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:49,995 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,995 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,996 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,997 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:49,998 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:50,000 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,001 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,003 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:50,006 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,006 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,007 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,008 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,009 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:50,014 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,014 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,016 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:50,021 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,022 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,023 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,023 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,025 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:50,028 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,029 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,029 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,030 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,032 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:50,036 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,037 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,038 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,038 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,039 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,040 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,042 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:50,049 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,049 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,052 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:50,057 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,057 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,058 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,059 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,060 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:50,063 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,064 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,065 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,065 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,067 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:50,075 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,075 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,076 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,077 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,077 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,078 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,080 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:50,083 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,084 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,086 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:50,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:50,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:50,099 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,100 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,101 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,101 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,103 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:50,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:50,110 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,113 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 23 treesize of output 21 [2024-11-09 04:36:50,123 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,124 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,126 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:50,129 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,129 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,131 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:50,134 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,134 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,136 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:50,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:50,147 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,153 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,153 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,155 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:50,158 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,159 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,160 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:50,163 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,163 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,165 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:50,168 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,168 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,170 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:50,173 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,174 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,174 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,175 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,177 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:50,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:50,192 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,193 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,195 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:50,201 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,202 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,203 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,203 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,205 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:50,208 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,208 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,209 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,210 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,212 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:50,214 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,215 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,215 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,216 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,218 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:50,225 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,225 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,226 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,227 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,228 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:50,231 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,231 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,232 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,234 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:50,236 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,237 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,237 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,238 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,240 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:50,243 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,243 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,247 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:36:50,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:50,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:50,260 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:36:50,318 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-09 04:36:50,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987409656] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:36:50,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1997266634] [2024-11-09 04:36:50,322 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2024-11-09 04:36:50,322 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:36:50,323 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:36:50,323 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:36:50,323 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:36:55,107 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:37:08,573 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '837#(and (exists ((|v_#memory_$Pointer$.base_31| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_31| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.base_65| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_63| Int) (|v_#memory_int_121| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_100| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_101| (Array Int (Array Int Int)))) (and (<= 1 |#StackHeapBarrier|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_31| |v_ULTIMATE.start_main_~p~0#1.base_65| (store (select |v_#memory_$Pointer$.offset_31| |v_ULTIMATE.start_main_~p~0#1.base_65|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_63| 4) 0))) (exists ((|v_#memory_$Pointer$.base_99| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.base_64| Int) (|v_#memory_$Pointer$.offset_100| (Array Int (Array Int Int))) (|v_#memory_int_120| (Array Int (Array Int Int)))) (and (not (= (select (select |v_#memory_$Pointer$.base_100| |v_ULTIMATE.start_main_~p~0#1.base_64|) 4) 0)) (= (store |v_#memory_$Pointer$.offset_100| |v_ULTIMATE.start_main_~p~0#1.base_64| (store (select |v_#memory_$Pointer$.offset_100| |v_ULTIMATE.start_main_~p~0#1.base_64|) 4 0)) |v_#memory_$Pointer$.offset_101|) (= (store |v_#memory_int_120| |v_ULTIMATE.start_main_~p~0#1.base_64| (store (select |v_#memory_int_120| |v_ULTIMATE.start_main_~p~0#1.base_64|) 4 (select (select |v_#memory_int_121| |v_ULTIMATE.start_main_~p~0#1.base_64|) 4))) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_~p~0#1.base_65| (select (select |v_#memory_$Pointer$.base_100| |v_ULTIMATE.start_main_~p~0#1.base_64|) 4)) (= |v_#memory_$Pointer$.base_100| (store |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_main_~p~0#1.base_64| (store (select |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_main_~p~0#1.base_64|) 4 (select (select |v_#memory_$Pointer$.base_100| |v_ULTIMATE.start_main_~p~0#1.base_64|) 4)))) (= |v_ULTIMATE.start_main_~p~0#1.offset_63| (select (select |v_#memory_$Pointer$.offset_101| |v_ULTIMATE.start_main_~p~0#1.base_64|) 4)))) (= (store |v_#memory_$Pointer$.offset_101| |v_ULTIMATE.start_main_~p~0#1.base_65| (store (select |v_#memory_$Pointer$.offset_101| |v_ULTIMATE.start_main_~p~0#1.base_65|) |v_ULTIMATE.start_main_~p~0#1.offset_63| (select (select |v_#memory_$Pointer$.offset_31| |v_ULTIMATE.start_main_~p~0#1.base_65|) |v_ULTIMATE.start_main_~p~0#1.offset_63|))) |v_#memory_$Pointer$.offset_31|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_31| |v_ULTIMATE.start_main_~p~0#1.base_65| (store (select |v_#memory_$Pointer$.base_31| |v_ULTIMATE.start_main_~p~0#1.base_65|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_63| 4) 0))) (= |#memory_int| (store |v_#memory_int_121| |v_ULTIMATE.start_main_~p~0#1.base_65| (store (store (select |v_#memory_int_121| |v_ULTIMATE.start_main_~p~0#1.base_65|) |v_ULTIMATE.start_main_~p~0#1.offset_63| 1) (+ |v_ULTIMATE.start_main_~p~0#1.offset_63| 4) (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_65|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_63| 4))))) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (= (store |v_#memory_$Pointer$.base_100| |v_ULTIMATE.start_main_~p~0#1.base_65| (store (select |v_#memory_$Pointer$.base_100| |v_ULTIMATE.start_main_~p~0#1.base_65|) |v_ULTIMATE.start_main_~p~0#1.offset_63| (select (select |v_#memory_$Pointer$.base_31| |v_ULTIMATE.start_main_~p~0#1.base_65|) |v_ULTIMATE.start_main_~p~0#1.offset_63|))) |v_#memory_$Pointer$.base_31|))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 1)) (not (= 0 |ULTIMATE.start_main_~p~0#1.base|)))' at error location [2024-11-09 04:37:08,573 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:37:08,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:37:08,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 21 [2024-11-09 04:37:08,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834219766] [2024-11-09 04:37:08,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:37:08,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 04:37:08,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:37:08,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 04:37:08,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=633, Unknown=10, NotChecked=162, Total=930 [2024-11-09 04:37:08,575 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 21 states have internal predecessors, (47), 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-11-09 04:37:08,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:37:08,908 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2024-11-09 04:37:08,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:37:08,909 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 21 states have internal predecessors, (47), 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) Word has length 18 [2024-11-09 04:37:08,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:37:08,909 INFO L225 Difference]: With dead ends: 34 [2024-11-09 04:37:08,910 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 04:37:08,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=168, Invalid=823, Unknown=13, NotChecked=186, Total=1190 [2024-11-09 04:37:08,911 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:37:08,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 50 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 54 Unchecked, 0.1s Time] [2024-11-09 04:37:08,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 04:37:08,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-11-09 04:37:08,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 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-11-09 04:37:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2024-11-09 04:37:08,916 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 18 [2024-11-09 04:37:08,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:37:08,917 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-11-09 04:37:08,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 21 states have internal predecessors, (47), 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-11-09 04:37:08,917 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2024-11-09 04:37:08,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 04:37:08,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:37:08,918 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:37:08,940 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 04:37:09,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:37:09,123 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:37:09,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:37:09,123 INFO L85 PathProgramCache]: Analyzing trace with hash -503243780, now seen corresponding path program 2 times [2024-11-09 04:37:09,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:37:09,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398498044] [2024-11-09 04:37:09,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:37:09,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:37:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:37:09,767 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:37:09,767 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:37:09,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398498044] [2024-11-09 04:37:09,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398498044] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:37:09,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923379739] [2024-11-09 04:37:09,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 04:37:09,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:37:09,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:37:09,769 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:37:09,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 04:37:09,880 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 04:37:09,880 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:37:09,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-09 04:37:09,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:37:09,891 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-11-09 04:37:09,929 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 04:37:09,929 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 11 treesize of output 11 [2024-11-09 04:37:09,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-09 04:37:09,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-11-09 04:37:10,070 INFO L349 Elim1Store]: treesize reduction 18, result has 21.7 percent of original size [2024-11-09 04:37:10,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-09 04:37:10,078 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 12 treesize of output 11 [2024-11-09 04:37:10,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 21 treesize of output 23 [2024-11-09 04:37:10,100 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 12 treesize of output 11 [2024-11-09 04:37:10,383 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:37:10,383 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:37:10,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:10,541 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2024-11-09 04:37:10,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:10,551 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2024-11-09 04:37:10,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:10,575 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2024-11-09 04:37:10,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:10,585 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2024-11-09 04:37:10,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:10,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 60 treesize of output 61 [2024-11-09 04:37:10,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:10,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 50 treesize of output 41 [2024-11-09 04:37:10,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:10,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 72 treesize of output 71 [2024-11-09 04:37:11,189 INFO L349 Elim1Store]: treesize reduction 42, result has 82.1 percent of original size [2024-11-09 04:37:11,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 208 treesize of output 335 [2024-11-09 04:37:11,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:11,275 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 162 treesize of output 182 [2024-11-09 04:37:11,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:11,316 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 125 treesize of output 97 [2024-11-09 04:37:21,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:21,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 60 treesize of output 61 [2024-11-09 04:37:21,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:21,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 50 treesize of output 41 [2024-11-09 04:37:21,379 INFO L349 Elim1Store]: treesize reduction 84, result has 25.0 percent of original size [2024-11-09 04:37:21,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 111 [2024-11-09 04:37:21,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:37:21,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 43 treesize of output 37 [2024-11-09 04:37:21,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:37:21,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:37:21,428 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 67 [2024-11-09 04:37:21,436 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 8 treesize of output 4 [2024-11-09 04:37:21,859 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:37:21,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923379739] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:37:21,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [742108047] [2024-11-09 04:37:21,862 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2024-11-09 04:37:21,862 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:37:21,862 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:37:21,863 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:37:21,863 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:37:22,764 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:37:27,720 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '930#true' at error location [2024-11-09 04:37:27,721 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:37:27,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:37:27,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2024-11-09 04:37:27,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841500279] [2024-11-09 04:37:27,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:37:27,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 04:37:27,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:37:27,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 04:37:27,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=434, Unknown=10, NotChecked=0, Total=506 [2024-11-09 04:37:27,723 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 16 states have internal predecessors, (49), 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-11-09 04:37:28,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:37:28,056 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2024-11-09 04:37:28,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:37:28,057 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 16 states have internal predecessors, (49), 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) Word has length 22 [2024-11-09 04:37:28,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:37:28,057 INFO L225 Difference]: With dead ends: 41 [2024-11-09 04:37:28,058 INFO L226 Difference]: Without dead ends: 25 [2024-11-09 04:37:28,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=77, Invalid=513, Unknown=10, NotChecked=0, Total=600 [2024-11-09 04:37:28,059 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 14 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:37:28,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 72 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:37:28,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-09 04:37:28,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2024-11-09 04:37:28,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 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-11-09 04:37:28,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-11-09 04:37:28,064 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 22 [2024-11-09 04:37:28,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:37:28,065 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-11-09 04:37:28,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 16 states have internal predecessors, (49), 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-11-09 04:37:28,065 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-11-09 04:37:28,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 04:37:28,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:37:28,066 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:37:28,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 04:37:28,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:37:28,267 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:37:28,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:37:28,268 INFO L85 PathProgramCache]: Analyzing trace with hash 468338126, now seen corresponding path program 3 times [2024-11-09 04:37:28,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:37:28,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965720288] [2024-11-09 04:37:28,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:37:28,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:37:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:37:29,053 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:37:29,054 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:37:29,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965720288] [2024-11-09 04:37:29,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965720288] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:37:29,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571022748] [2024-11-09 04:37:29,054 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 04:37:29,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:37:29,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:37:29,055 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:37:29,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 04:37:29,193 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 04:37:29,193 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:37:29,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-09 04:37:29,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:37:29,205 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-11-09 04:37:29,323 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 04:37:29,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 04:37:29,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-09 04:37:29,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-11-09 04:37:29,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-09 04:37:29,574 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 04:37:29,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 24 [2024-11-09 04:37:29,599 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-09 04:37:29,599 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 20 treesize of output 22 [2024-11-09 04:37:29,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:37:29,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 04:37:29,756 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-11-09 04:37:29,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 89 [2024-11-09 04:37:29,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 27 treesize of output 22 [2024-11-09 04:37:29,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-11-09 04:37:29,943 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-09 04:37:29,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 85 [2024-11-09 04:37:29,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:37:29,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 41 [2024-11-09 04:37:29,961 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 16 treesize of output 15 [2024-11-09 04:37:29,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-09 04:37:30,103 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 04:37:30,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 40 [2024-11-09 04:37:30,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 04:37:30,124 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:37:30,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:37:30,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:30,200 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2024-11-09 04:37:30,320 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int)) (v_ArrVal_432 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_432) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_439) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_440) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.offset|)) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 1) (not (= v_ArrVal_432 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_432 .cse0)))) (not (= 0 (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))))))) is different from false [2024-11-09 04:37:30,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:30,356 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2024-11-09 04:37:30,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:30,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 282 treesize of output 286 [2024-11-09 04:37:30,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:30,399 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 246 treesize of output 234 [2024-11-09 04:37:30,408 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 226 treesize of output 190 [2024-11-09 04:37:30,477 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 527 treesize of output 473 [2024-11-09 04:37:30,583 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 8 treesize of output 4 [2024-11-09 04:37:30,589 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 8 treesize of output 4 [2024-11-09 04:37:30,603 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 30 treesize of output 22 [2024-11-09 04:37:30,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:30,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 25 treesize of output 26 [2024-11-09 04:37:30,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:30,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 140 treesize of output 133 [2024-11-09 04:37:30,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:30,773 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 34 treesize of output 34 [2024-11-09 04:37:30,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:30,789 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 35 treesize of output 33 [2024-11-09 04:37:30,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:30,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 29 treesize of output 30 [2024-11-09 04:37:30,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:30,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 164 treesize of output 157 [2024-11-09 04:37:31,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:31,005 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 72 treesize of output 64 [2024-11-09 04:37:31,013 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 28 treesize of output 20 [2024-11-09 04:37:31,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:31,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 34 treesize of output 35 [2024-11-09 04:37:31,087 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:37:31,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:31,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 47 treesize of output 46 [2024-11-09 04:37:31,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:31,119 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 41 treesize of output 33 [2024-11-09 04:37:32,077 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 04:37:32,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571022748] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:37:32,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [394053347] [2024-11-09 04:37:32,079 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2024-11-09 04:37:32,079 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:37:32,080 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:37:32,080 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:37:32,080 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:37:36,823 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:37:49,303 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1161#true' at error location [2024-11-09 04:37:49,304 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:37:49,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:37:49,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2024-11-09 04:37:49,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021111412] [2024-11-09 04:37:49,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:37:49,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 04:37:49,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:37:49,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 04:37:49,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=807, Unknown=9, NotChecked=58, Total=992 [2024-11-09 04:37:49,307 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 25 states have internal predecessors, (60), 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-11-09 04:37:50,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:37:50,218 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2024-11-09 04:37:50,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 04:37:50,218 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 25 states have internal predecessors, (60), 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) Word has length 22 [2024-11-09 04:37:50,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:37:50,219 INFO L225 Difference]: With dead ends: 40 [2024-11-09 04:37:50,219 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 04:37:50,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=179, Invalid=1147, Unknown=10, NotChecked=70, Total=1406 [2024-11-09 04:37:50,221 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:37:50,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 94 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 219 Invalid, 0 Unknown, 32 Unchecked, 0.4s Time] [2024-11-09 04:37:50,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 04:37:50,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2024-11-09 04:37:50,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 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-11-09 04:37:50,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2024-11-09 04:37:50,227 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 22 [2024-11-09 04:37:50,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:37:50,227 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2024-11-09 04:37:50,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 25 states have internal predecessors, (60), 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-11-09 04:37:50,228 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2024-11-09 04:37:50,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 04:37:50,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:37:50,229 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:37:50,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 04:37:50,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:37:50,430 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:37:50,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:37:50,430 INFO L85 PathProgramCache]: Analyzing trace with hash -143114955, now seen corresponding path program 4 times [2024-11-09 04:37:50,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:37:50,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214737213] [2024-11-09 04:37:50,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:37:50,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:37:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:37:51,485 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:37:51,486 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:37:51,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214737213] [2024-11-09 04:37:51,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214737213] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:37:51,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906502163] [2024-11-09 04:37:51,486 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 04:37:51,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:37:51,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:37:51,488 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:37:51,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 04:37:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:37:51,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-09 04:37:51,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:37:51,631 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-11-09 04:37:51,694 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 04:37:51,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 04:37:51,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-11-09 04:37:51,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-09 04:37:51,839 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 04:37:51,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 24 [2024-11-09 04:37:51,860 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-09 04:37:51,860 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 20 treesize of output 22 [2024-11-09 04:37:51,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:37:51,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 04:37:51,960 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-11-09 04:37:51,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 71 [2024-11-09 04:37:51,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 11 [2024-11-09 04:37:52,091 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-09 04:37:52,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 102 [2024-11-09 04:37:52,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 23 [2024-11-09 04:37:52,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:37:52,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 37 [2024-11-09 04:37:52,342 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 04:37:52,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 37 [2024-11-09 04:37:52,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-09 04:37:52,383 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:37:52,383 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:37:52,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1028 treesize of output 912 [2024-11-09 04:37:52,511 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_539 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_539))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_539 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_541)) (.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_539))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse4 (+ (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4))) (or (not (= (select (select .cse2 .cse3) .cse4) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (not (= (select (select .cse5 .cse3) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_ArrVal_539 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (= (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_541))) (select (select .cse6 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_539) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ (select (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4))) |c_ULTIMATE.start_main_~p~0#1.offset|)))) is different from false [2024-11-09 04:37:52,585 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse7 |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_539 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_105| Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 |v_ULTIMATE.start_main_~p~0#1.offset_105|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_541)) (.cse3 (store .cse5 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_539))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse2 (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 4))) (or (not (= (select (select .cse0 .cse1) .cse2) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_105|))) (not (= (select (select .cse3 .cse1) .cse2) |c_ULTIMATE.start_main_~t~0#1.base|)))))) (forall ((v_ArrVal_539 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_105| Int) (v_ArrVal_541 (Array Int Int))) (= (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 |v_ULTIMATE.start_main_~p~0#1.offset_105|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_541))) (select (select .cse8 (select (select (store .cse5 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_539) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (+ (select (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 4))) |v_ULTIMATE.start_main_~p~0#1.offset_105|)) (forall ((v_ArrVal_539 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_105| Int) (v_ArrVal_541 (Array Int Int))) (= (select (let ((.cse9 (store .cse5 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_539))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 |v_ULTIMATE.start_main_~p~0#1.offset_105|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 4)) |c_ULTIMATE.start_main_~t~0#1.base|))))) is different from false [2024-11-09 04:37:52,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:52,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 222 treesize of output 256 [2024-11-09 04:37:52,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:52,689 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 200 treesize of output 179 [2024-11-09 04:37:52,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 27 treesize of output 13 [2024-11-09 04:37:52,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 27 treesize of output 13 [2024-11-09 04:37:52,792 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 13 treesize of output 1 [2024-11-09 04:37:52,830 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 14 treesize of output 1 [2024-11-09 04:37:53,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:53,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 85 treesize of output 86 [2024-11-09 04:37:53,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:53,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 75 treesize of output 66 [2024-11-09 04:37:53,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:53,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 452 treesize of output 445 [2024-11-09 04:37:54,404 INFO L349 Elim1Store]: treesize reduction 390, result has 58.3 percent of original size [2024-11-09 04:37:54,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 12120 treesize of output 11127 [2024-11-09 04:37:54,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:54,696 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 658 treesize of output 562 [2024-11-09 04:37:54,753 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 358 treesize of output 286 [2024-11-09 04:37:54,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:54,871 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 464 treesize of output 380 [2024-11-09 04:37:54,946 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 247 treesize of output 171 [2024-11-09 04:41:57,698 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-09 04:41:57,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2024-11-09 04:41:57,700 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2024-11-09 04:41:57,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1893951846] [2024-11-09 04:41:57,702 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2024-11-09 04:41:57,706 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:41:57,706 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:41:57,707 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:41:57,707 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:41:57,713 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:132) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.checkSatTerm(SmtUtils.java:326) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:220) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.ExplicitValueDomain.isEqBottom(ExplicitValueDomain.java:73) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.CompoundDomain.isEqBottom(CompoundDomain.java:84) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 44 more [2024-11-09 04:41:57,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:41:57,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-11-09 04:41:57,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142215091] [2024-11-09 04:41:57,720 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 04:41:57,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 04:41:57,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:41:57,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 04:41:57,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=371, Unknown=2, NotChecked=78, Total=506 [2024-11-09 04:41:57,724 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 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-11-09 04:41:57,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=371, Unknown=2, NotChecked=78, Total=506 [2024-11-09 04:41:57,728 INFO L432 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:41:57,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 04:41:57,758 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 04:41:57,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:41:57,930 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertCodeBlock(IncrementalHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:278) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1655) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:658) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:385) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 36 more [2024-11-09 04:41:57,933 INFO L158 Benchmark]: Toolchain (without parser) took 366648.91ms. Allocated memory was 134.2MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 69.4MB in the beginning and 817.7MB in the end (delta: -748.3MB). Peak memory consumption was 294.7MB. Max. memory is 16.1GB. [2024-11-09 04:41:57,933 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 134.2MB. Free memory was 106.5MB in the beginning and 106.4MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 04:41:57,933 INFO L158 Benchmark]: CACSL2BoogieTranslator took 580.41ms. Allocated memory was 134.2MB in the beginning and 186.6MB in the end (delta: 52.4MB). Free memory was 69.3MB in the beginning and 140.8MB in the end (delta: -71.5MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2024-11-09 04:41:57,933 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.34ms. Allocated memory is still 186.6MB. Free memory was 140.8MB in the beginning and 138.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 04:41:57,934 INFO L158 Benchmark]: Boogie Preprocessor took 51.66ms. Allocated memory is still 186.6MB. Free memory was 138.7MB in the beginning and 136.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 04:41:57,934 INFO L158 Benchmark]: RCFGBuilder took 813.09ms. Allocated memory is still 186.6MB. Free memory was 136.6MB in the beginning and 128.7MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 04:41:57,934 INFO L158 Benchmark]: TraceAbstraction took 365142.37ms. Allocated memory was 186.6MB in the beginning and 1.2GB in the end (delta: 987.8MB). Free memory was 127.7MB in the beginning and 817.7MB in the end (delta: -690.0MB). Peak memory consumption was 300.9MB. Max. memory is 16.1GB. [2024-11-09 04:41:57,936 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 134.2MB. Free memory was 106.5MB in the beginning and 106.4MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 580.41ms. Allocated memory was 134.2MB in the beginning and 186.6MB in the end (delta: 52.4MB). Free memory was 69.3MB in the beginning and 140.8MB in the end (delta: -71.5MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.34ms. Allocated memory is still 186.6MB. Free memory was 140.8MB in the beginning and 138.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.66ms. Allocated memory is still 186.6MB. Free memory was 138.7MB in the beginning and 136.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 813.09ms. Allocated memory is still 186.6MB. Free memory was 136.6MB in the beginning and 128.7MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 365142.37ms. Allocated memory was 186.6MB in the beginning and 1.2GB in the end (delta: 987.8MB). Free memory was 127.7MB in the beginning and 817.7MB in the end (delta: -690.0MB). Peak memory consumption was 300.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2725e330d17b26eb9ce2dcee483f6c78572e140dfdc07b8b5f8c08e6f3c60756 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 04:42:00,272 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:42:00,331 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-09 04:42:00,336 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:42:00,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:42:00,377 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:42:00,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:42:00,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:42:00,379 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:42:00,383 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:42:00,384 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:42:00,384 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:42:00,384 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:42:00,385 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:42:00,385 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:42:00,385 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:42:00,386 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:42:00,386 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 04:42:00,387 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:42:00,387 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:42:00,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:42:00,388 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 04:42:00,388 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:42:00,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 04:42:00,389 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 04:42:00,389 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 04:42:00,390 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:42:00,390 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 04:42:00,390 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:42:00,391 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 04:42:00,391 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:42:00,391 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:42:00,392 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 04:42:00,392 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:42:00,393 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:42:00,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:42:00,393 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:42:00,393 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:42:00,394 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 04:42:00,394 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 04:42:00,394 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 04:42:00,395 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:42:00,395 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:42:00,395 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje 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 -> Taipan 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 -> 2725e330d17b26eb9ce2dcee483f6c78572e140dfdc07b8b5f8c08e6f3c60756 [2024-11-09 04:42:00,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:42:00,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:42:00,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:42:00,794 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:42:00,794 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:42:00,800 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i Unable to find full path for "g++" [2024-11-09 04:42:02,953 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:42:03,262 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:42:03,263 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i [2024-11-09 04:42:03,277 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/data/c8c9f047c/c87c67c5536a443a92b12cdddc6b7713/FLAG988ba97cb [2024-11-09 04:42:03,524 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/data/c8c9f047c/c87c67c5536a443a92b12cdddc6b7713 [2024-11-09 04:42:03,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:42:03,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:42:03,531 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:42:03,532 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:42:03,538 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:42:03,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:42:03" (1/1) ... [2024-11-09 04:42:03,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b522c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:42:03, skipping insertion in model container [2024-11-09 04:42:03,541 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:42:03" (1/1) ... [2024-11-09 04:42:03,600 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:42:03,956 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i[24020,24033] [2024-11-09 04:42:03,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:42:04,001 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:42:04,104 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i[24020,24033] [2024-11-09 04:42:04,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:42:04,138 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:42:04,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:42:04 WrapperNode [2024-11-09 04:42:04,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:42:04,140 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:42:04,140 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:42:04,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:42:04,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:42:04" (1/1) ... [2024-11-09 04:42:04,171 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:42:04" (1/1) ... [2024-11-09 04:42:04,211 INFO L138 Inliner]: procedures = 129, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2024-11-09 04:42:04,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:42:04,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:42:04,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:42:04,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:42:04,222 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:42:04" (1/1) ... [2024-11-09 04:42:04,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:42:04" (1/1) ... [2024-11-09 04:42:04,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:42:04" (1/1) ... [2024-11-09 04:42:04,232 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:42:04" (1/1) ... [2024-11-09 04:42:04,253 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:42:04" (1/1) ... [2024-11-09 04:42:04,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:42:04" (1/1) ... [2024-11-09 04:42:04,265 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:42:04" (1/1) ... [2024-11-09 04:42:04,270 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:42:04" (1/1) ... [2024-11-09 04:42:04,277 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:42:04,278 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:42:04,278 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:42:04,278 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:42:04,279 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:42:04" (1/1) ... [2024-11-09 04:42:04,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:42:04,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:42:04,310 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:42:04,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:42:04,340 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-09 04:42:04,340 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-09 04:42:04,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-09 04:42:04,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 04:42:04,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:42:04,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 04:42:04,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 04:42:04,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-09 04:42:04,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 04:42:04,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 04:42:04,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:42:04,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:42:04,463 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:42:04,465 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:42:04,516 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-09 04:42:05,634 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-11-09 04:42:05,635 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:42:05,647 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:42:05,647 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-09 04:42:05,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:42:05 BoogieIcfgContainer [2024-11-09 04:42:05,648 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:42:05,650 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:42:05,650 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:42:05,653 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:42:05,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:42:03" (1/3) ... [2024-11-09 04:42:05,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6381da66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:42:05, skipping insertion in model container [2024-11-09 04:42:05,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:42:04" (2/3) ... [2024-11-09 04:42:05,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6381da66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:42:05, skipping insertion in model container [2024-11-09 04:42:05,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:42:05" (3/3) ... [2024-11-09 04:42:05,656 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_and_skiplist_2lvl-2.i [2024-11-09 04:42:05,672 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:42:05,672 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 04:42:05,729 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:42:05,736 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@d253c6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:42:05,736 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 04:42:05,740 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 39 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:42:05,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 04:42:05,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:42:05,747 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:42:05,748 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:42:05,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:42:05,752 INFO L85 PathProgramCache]: Analyzing trace with hash 70427278, now seen corresponding path program 1 times [2024-11-09 04:42:05,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:42:05,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1960589437] [2024-11-09 04:42:05,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:42:05,767 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:42:05,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:42:05,776 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 04:42:05,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 04:42:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:42:05,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 04:42:05,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:05,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:42:05,920 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:42:05,925 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:42:05,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1960589437] [2024-11-09 04:42:05,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1960589437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:42:05,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:42:05,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:42:05,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541977990] [2024-11-09 04:42:05,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:42:05,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 04:42:05,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:42:05,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 04:42:05,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 04:42:05,985 INFO L87 Difference]: Start difference. First operand has 41 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 39 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-11-09 04:42:06,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:42:06,009 INFO L93 Difference]: Finished difference Result 70 states and 100 transitions. [2024-11-09 04:42:06,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 04:42:06,012 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) Word has length 10 [2024-11-09 04:42:06,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:42:06,019 INFO L225 Difference]: With dead ends: 70 [2024-11-09 04:42:06,020 INFO L226 Difference]: Without dead ends: 15 [2024-11-09 04:42:06,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 04:42:06,030 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:42:06,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 04:42:06,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-09 04:42:06,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-09 04:42:06,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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-11-09 04:42:06,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-09 04:42:06,066 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2024-11-09 04:42:06,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:42:06,067 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-09 04:42:06,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-11-09 04:42:06,069 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-11-09 04:42:06,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 04:42:06,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:42:06,070 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:42:06,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 04:42:06,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:42:06,271 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:42:06,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:42:06,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1350938243, now seen corresponding path program 1 times [2024-11-09 04:42:06,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:42:06,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733564820] [2024-11-09 04:42:06,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:42:06,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:42:06,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:42:06,276 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 04:42:06,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 04:42:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:42:06,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 04:42:06,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:06,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 7 [2024-11-09 04:42:06,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:42:06,594 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:42:06,594 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:42:06,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733564820] [2024-11-09 04:42:06,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733564820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:42:06,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:42:06,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:42:06,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961887511] [2024-11-09 04:42:06,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:42:06,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:42:06,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:42:06,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:42:06,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:42:06,600 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-11-09 04:42:06,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:42:06,798 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2024-11-09 04:42:06,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:42:06,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) Word has length 11 [2024-11-09 04:42:06,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:42:06,799 INFO L225 Difference]: With dead ends: 26 [2024-11-09 04:42:06,799 INFO L226 Difference]: Without dead ends: 24 [2024-11-09 04:42:06,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:42:06,801 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:42:06,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:42:06,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-09 04:42:06,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2024-11-09 04:42:06,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-11-09 04:42:06,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-11-09 04:42:06,807 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 11 [2024-11-09 04:42:06,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:42:06,807 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-11-09 04:42:06,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-11-09 04:42:06,807 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2024-11-09 04:42:06,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 04:42:06,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:42:06,808 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:42:06,812 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 04:42:07,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:42:07,011 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:42:07,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:42:07,012 INFO L85 PathProgramCache]: Analyzing trace with hash 706102122, now seen corresponding path program 1 times [2024-11-09 04:42:07,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:42:07,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2007210613] [2024-11-09 04:42:07,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:42:07,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:42:07,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:42:07,015 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 04:42:07,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 04:42:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:42:07,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 04:42:07,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:07,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2024-11-09 04:42:07,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2024-11-09 04:42:07,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:42:07,347 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:42:07,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 21 [2024-11-09 04:42:07,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:42:07,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:42:07,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:42:07,482 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:42:07,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2007210613] [2024-11-09 04:42:07,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2007210613] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:42:07,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2120914636] [2024-11-09 04:42:07,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:42:07,483 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 04:42:07,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 04:42:07,486 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 04:42:07,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-09 04:42:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:42:07,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 04:42:07,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:07,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-09 04:42:07,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-09 04:42:07,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:42:07,865 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:42:07,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 21 [2024-11-09 04:42:07,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:42:07,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:42:07,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:42:07,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2120914636] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:42:07,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151324336] [2024-11-09 04:42:07,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:42:07,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:42:07,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:42:07,974 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:42:07,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 04:42:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:42:08,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 04:42:08,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:08,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-09 04:42:08,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-09 04:42:08,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:42:08,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:42:08,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 21 [2024-11-09 04:42:08,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:42:08,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:42:08,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:42:08,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151324336] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:42:08,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 04:42:08,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6, 5, 6, 5] total 8 [2024-11-09 04:42:08,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486895966] [2024-11-09 04:42:08,310 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 04:42:08,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 04:42:08,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:42:08,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 04:42:08,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:42:08,312 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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-11-09 04:42:08,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:42:08,564 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2024-11-09 04:42:08,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:42:08,565 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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) Word has length 15 [2024-11-09 04:42:08,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:42:08,566 INFO L225 Difference]: With dead ends: 31 [2024-11-09 04:42:08,566 INFO L226 Difference]: Without dead ends: 19 [2024-11-09 04:42:08,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:42:08,568 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 10 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:42:08,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 43 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:42:08,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-09 04:42:08,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2024-11-09 04:42:08,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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-11-09 04:42:08,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-11-09 04:42:08,577 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2024-11-09 04:42:08,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:42:08,578 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-11-09 04:42:08,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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-11-09 04:42:08,579 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2024-11-09 04:42:08,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 04:42:08,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:42:08,581 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:42:08,605 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 04:42:08,784 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 04:42:08,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-11-09 04:42:09,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 04:42:09,182 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:42:09,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:42:09,183 INFO L85 PathProgramCache]: Analyzing trace with hash -995023300, now seen corresponding path program 1 times [2024-11-09 04:42:09,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:42:09,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500171126] [2024-11-09 04:42:09,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:42:09,184 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:42:09,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:42:09,187 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 04:42:09,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 04:42:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:42:09,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 04:42:09,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:09,314 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 7 [2024-11-09 04:42:09,420 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 04:42:09,420 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 13 treesize of output 13 [2024-11-09 04:42:09,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-09 04:42:09,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 04:42:09,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 16 treesize of output 11 [2024-11-09 04:42:09,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:42:09,635 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:42:09,663 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_109 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2024-11-09 04:42:09,742 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_107 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_107) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (not (= v_ArrVal_107 (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_107 .cse0))))))) is different from false [2024-11-09 04:42:09,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:09,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 70 treesize of output 74 [2024-11-09 04:42:09,832 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 50 treesize of output 46 [2024-11-09 04:42:09,936 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 89 treesize of output 85 [2024-11-09 04:42:10,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 04:42:10,168 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:42:10,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500171126] [2024-11-09 04:42:10,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1500171126] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:42:10,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1666133626] [2024-11-09 04:42:10,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:42:10,169 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 04:42:10,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 04:42:10,172 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 04:42:10,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-09 04:42:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:42:10,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 04:42:10,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:10,352 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 7 [2024-11-09 04:42:10,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-09 04:42:10,520 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 04:42:10,521 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 13 treesize of output 13 [2024-11-09 04:42:10,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-11-09 04:42:10,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 8 [2024-11-09 04:42:10,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 04:42:10,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 16 treesize of output 11 [2024-11-09 04:42:10,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:42:10,795 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:42:10,915 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_143 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_140 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_140 .cse0))) v_ArrVal_140)) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_140) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_143) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2024-11-09 04:42:10,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:10,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 70 treesize of output 74 [2024-11-09 04:42:10,982 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 50 treesize of output 46 [2024-11-09 04:42:11,061 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 89 treesize of output 85 [2024-11-09 04:42:11,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:42:11,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1666133626] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:42:11,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420417724] [2024-11-09 04:42:11,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:42:11,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:42:11,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:42:11,232 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:42:11,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 04:42:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:42:11,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 04:42:11,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:11,337 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 7 [2024-11-09 04:42:11,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-09 04:42:11,425 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 04:42:11,425 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 13 treesize of output 13 [2024-11-09 04:42:11,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 04:42:11,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 16 treesize of output 11 [2024-11-09 04:42:11,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:42:11,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:42:11,544 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_177) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))) is different from false [2024-11-09 04:42:11,579 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_175 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_177 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_175 (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_175 .cse0))))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_177) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)))) is different from false [2024-11-09 04:42:11,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:11,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 70 treesize of output 74 [2024-11-09 04:42:11,657 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 58 treesize of output 54 [2024-11-09 04:42:11,680 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 5 treesize of output 3 [2024-11-09 04:42:11,720 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 48 treesize of output 46 [2024-11-09 04:42:11,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 04:42:11,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420417724] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:42:11,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 04:42:11,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 20 [2024-11-09 04:42:11,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710051239] [2024-11-09 04:42:11,848 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 04:42:11,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 04:42:11,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:42:11,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 04:42:11,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=169, Unknown=8, NotChecked=150, Total=380 [2024-11-09 04:42:11,850 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 20 states, 20 states have (on average 2.35) internal successors, (47), 20 states have internal predecessors, (47), 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-11-09 04:42:12,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:42:12,520 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2024-11-09 04:42:12,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 04:42:12,520 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.35) internal successors, (47), 20 states have internal predecessors, (47), 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) Word has length 15 [2024-11-09 04:42:12,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:42:12,521 INFO L225 Difference]: With dead ends: 30 [2024-11-09 04:42:12,521 INFO L226 Difference]: Without dead ends: 28 [2024-11-09 04:42:12,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=300, Unknown=8, NotChecked=200, Total=600 [2024-11-09 04:42:12,522 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:42:12,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 61 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 112 Invalid, 0 Unknown, 123 Unchecked, 0.5s Time] [2024-11-09 04:42:12,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-09 04:42:12,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2024-11-09 04:42:12,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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-11-09 04:42:12,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2024-11-09 04:42:12,528 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 15 [2024-11-09 04:42:12,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:42:12,529 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-11-09 04:42:12,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.35) internal successors, (47), 20 states have internal predecessors, (47), 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-11-09 04:42:12,529 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2024-11-09 04:42:12,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 04:42:12,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:42:12,530 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:42:12,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 04:42:12,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 04:42:12,937 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-11-09 04:42:13,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 04:42:13,135 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:42:13,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:42:13,135 INFO L85 PathProgramCache]: Analyzing trace with hash 668808867, now seen corresponding path program 1 times [2024-11-09 04:42:13,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:42:13,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621362406] [2024-11-09 04:42:13,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:42:13,136 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:42:13,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:42:13,138 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 04:42:13,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 04:42:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:42:13,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 04:42:13,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:13,272 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 7 [2024-11-09 04:42:13,354 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 04:42:13,357 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 13 treesize of output 13 [2024-11-09 04:42:13,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 1 [2024-11-09 04:42:13,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 8 treesize of output 1 [2024-11-09 04:42:13,586 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:42:13,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 100 [2024-11-09 04:42:13,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 58 treesize of output 19 [2024-11-09 04:42:13,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 40 treesize of output 23 [2024-11-09 04:42:13,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 39 treesize of output 21 [2024-11-09 04:42:13,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2024-11-09 04:42:13,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:42:13,787 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:42:13,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 199 treesize of output 177 [2024-11-09 04:42:14,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:14,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 22 treesize of output 23 [2024-11-09 04:42:14,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:14,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 35 [2024-11-09 04:42:14,044 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 7 treesize of output 3 [2024-11-09 04:42:14,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:42:14,066 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:42:14,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:42:14,075 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-11-09 04:42:14,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:42:14,241 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:42:14,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621362406] [2024-11-09 04:42:14,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621362406] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:42:14,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1369736806] [2024-11-09 04:42:14,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:42:14,242 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 04:42:14,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 04:42:14,245 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 04:42:14,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-09 04:42:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:42:14,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 04:42:14,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:14,486 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 7 [2024-11-09 04:42:14,695 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 04:42:14,696 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 13 treesize of output 13 [2024-11-09 04:42:14,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-09 04:42:14,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-11-09 04:42:15,015 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 04:42:15,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 62 [2024-11-09 04:42:15,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 24 treesize of output 11 [2024-11-09 04:42:15,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 11 [2024-11-09 04:42:15,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 15 [2024-11-09 04:42:15,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 3 [2024-11-09 04:42:15,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:42:15,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:42:15,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 452 treesize of output 408 [2024-11-09 04:42:15,383 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2024-11-09 04:42:15,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:15,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 22 treesize of output 23 [2024-11-09 04:42:15,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:15,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 35 [2024-11-09 04:42:15,481 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 7 treesize of output 3 [2024-11-09 04:42:15,493 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:42:15,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2024-11-09 04:42:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 04:42:15,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1369736806] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:42:15,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495085140] [2024-11-09 04:42:15,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:42:15,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:42:15,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:42:15,637 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:42:15,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 04:42:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:42:15,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 04:42:15,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:15,769 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 7 [2024-11-09 04:42:15,866 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 04:42:15,867 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 13 treesize of output 13 [2024-11-09 04:42:15,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-11-09 04:42:15,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-09 04:42:16,065 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 04:42:16,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 62 [2024-11-09 04:42:16,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 11 [2024-11-09 04:42:16,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 24 treesize of output 11 [2024-11-09 04:42:16,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 15 [2024-11-09 04:42:16,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 3 [2024-11-09 04:42:16,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:42:16,215 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:42:16,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 452 treesize of output 408 [2024-11-09 04:42:16,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:16,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 22 treesize of output 23 [2024-11-09 04:42:16,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:16,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 35 [2024-11-09 04:42:16,483 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 7 treesize of output 3 [2024-11-09 04:42:16,518 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:42:16,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 22 treesize of output 1 [2024-11-09 04:42:16,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:42:16,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495085140] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:42:16,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 04:42:16,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9, 9] total 19 [2024-11-09 04:42:16,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302073462] [2024-11-09 04:42:16,697 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 04:42:16,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 04:42:16,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:42:16,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 04:42:16,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=254, Unknown=5, NotChecked=32, Total=342 [2024-11-09 04:42:16,700 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 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-11-09 04:42:17,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:42:17,669 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2024-11-09 04:42:17,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 04:42:17,670 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 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) Word has length 19 [2024-11-09 04:42:17,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:42:17,671 INFO L225 Difference]: With dead ends: 34 [2024-11-09 04:42:17,671 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 04:42:17,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 85 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=91, Invalid=414, Unknown=5, NotChecked=42, Total=552 [2024-11-09 04:42:17,673 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 31 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:42:17,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 72 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 154 Invalid, 0 Unknown, 27 Unchecked, 0.7s Time] [2024-11-09 04:42:17,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 04:42:17,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2024-11-09 04:42:17,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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-11-09 04:42:17,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-11-09 04:42:17,679 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 19 [2024-11-09 04:42:17,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:42:17,680 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-11-09 04:42:17,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 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-11-09 04:42:17,680 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-11-09 04:42:17,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 04:42:17,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:42:17,681 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:42:17,687 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-09 04:42:17,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 04:42:18,088 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2024-11-09 04:42:18,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 04:42:18,286 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:42:18,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:42:18,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1032316555, now seen corresponding path program 2 times [2024-11-09 04:42:18,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:42:18,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1019788891] [2024-11-09 04:42:18,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 04:42:18,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:42:18,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:42:18,288 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 04:42:18,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 04:42:18,432 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 04:42:18,432 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:42:18,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 04:42:18,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:18,447 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 7 [2024-11-09 04:42:18,549 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-09 04:42:18,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 04:42:18,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-09 04:42:18,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 27 treesize of output 11 [2024-11-09 04:42:18,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 16 treesize of output 11 [2024-11-09 04:42:18,715 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 04:42:18,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 04:42:18,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 04:42:18,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 16 treesize of output 11 [2024-11-09 04:42:18,903 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:42:18,904 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:42:18,987 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_343 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_344 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_343) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_344) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2024-11-09 04:42:23,164 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_343 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_344 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_37| (_ BitVec 32)) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_37|))) (not (= v_ArrVal_339 (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_339 .cse0))))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_339) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_343) |v_ULTIMATE.start_main_~t~0#1.base_37| v_ArrVal_344) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2024-11-09 04:42:23,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:23,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 984 treesize of output 974 [2024-11-09 04:42:23,278 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 63 treesize of output 59 [2024-11-09 04:42:23,295 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 54 treesize of output 46 [2024-11-09 04:42:23,380 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 5 treesize of output 3 [2024-11-09 04:42:23,394 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 48 treesize of output 46 [2024-11-09 04:42:25,790 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 04:42:25,791 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:42:25,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1019788891] [2024-11-09 04:42:25,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1019788891] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:42:25,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1246628947] [2024-11-09 04:42:25,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 04:42:25,792 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 04:42:25,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 04:42:25,795 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 04:42:25,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-09 04:42:26,020 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 04:42:26,020 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:42:26,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 04:42:26,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:26,038 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 7 [2024-11-09 04:42:26,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-09 04:42:26,233 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 04:42:26,233 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 13 treesize of output 13 [2024-11-09 04:42:26,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 11 [2024-11-09 04:42:26,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-11-09 04:42:26,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 8 [2024-11-09 04:42:26,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 16 treesize of output 11 [2024-11-09 04:42:26,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 16 treesize of output 11 [2024-11-09 04:42:26,699 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 04:42:26,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2024-11-09 04:42:26,799 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:42:26,800 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:42:28,953 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_393 (_ BitVec 32)) (v_ArrVal_394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_399 (_ BitVec 32))) (= (_ bv1 32) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_394))) (store .cse0 v_ArrVal_393 (store (store (select .cse0 v_ArrVal_393) |c_ULTIMATE.start_main_~t~0#1.offset| (_ bv1 32)) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|) v_ArrVal_399))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2024-11-09 04:42:29,194 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_393 (_ BitVec 32)) (v_ArrVal_394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_399 (_ BitVec 32))) (or (not (= v_ArrVal_391 (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_391 .cse0))))) (= (_ bv1 32) (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_391) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_394))) (store .cse1 v_ArrVal_393 (store (store (select .cse1 v_ArrVal_393) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_ArrVal_399))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2024-11-09 04:42:29,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:29,403 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 9480 treesize of output 9246 [2024-11-09 04:42:29,522 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 862 treesize of output 830 [2024-11-09 04:42:31,846 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 5 treesize of output 3 [2024-11-09 04:42:31,859 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 5 treesize of output 3 [2024-11-09 04:42:32,303 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 2291 treesize of output 2261 [2024-11-09 04:42:32,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:42:32,558 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 114 treesize of output 108 [2024-11-09 04:42:32,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:42:32,586 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 101 treesize of output 97 [2024-11-09 04:42:32,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:42:32,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:42:32,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:42:32,630 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 99 treesize of output 95 [2024-11-09 04:42:32,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:42:32,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:42:32,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:42:32,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:42:32,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:42:32,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:42:32,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:42:32,769 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:42:32,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:42:32,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:42:32,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:42:32,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:42:32,811 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:42:32,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:42:32,816 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 23 treesize of output 21 [2024-11-09 04:42:32,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:42:32,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:42:35,065 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 04:42:35,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1246628947] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:42:35,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399674941] [2024-11-09 04:42:35,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 04:42:35,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:42:35,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:42:35,067 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:42:35,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 04:42:35,193 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 04:42:35,193 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:42:35,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 04:42:35,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:35,203 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 7 [2024-11-09 04:42:35,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-09 04:42:35,305 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-09 04:42:35,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 04:42:35,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 04:42:35,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 16 treesize of output 11 [2024-11-09 04:42:35,428 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 04:42:35,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 04:42:35,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 16 treesize of output 11 [2024-11-09 04:42:35,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 16 treesize of output 11 [2024-11-09 04:42:35,507 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:42:35,507 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:42:35,669 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_344 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_48| (_ BitVec 32)) (v_ArrVal_451 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_48|))) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_451) |v_ULTIMATE.start_main_~t~0#1.base_48| v_ArrVal_344) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2024-11-09 04:42:35,711 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_344 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_48| (_ BitVec 32)) (v_ArrVal_451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_48|))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_448) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_451) |v_ULTIMATE.start_main_~t~0#1.base_48| v_ArrVal_344) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= v_ArrVal_448 (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_448 .cse0))))))) is different from false [2024-11-09 04:42:35,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:35,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 984 treesize of output 974 [2024-11-09 04:42:35,806 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 118 treesize of output 110 [2024-11-09 04:42:35,819 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 50 treesize of output 46 [2024-11-09 04:42:35,890 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 117 treesize of output 111 [2024-11-09 04:42:38,256 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-09 04:42:38,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399674941] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:42:38,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 04:42:38,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10, 10, 10] total 31 [2024-11-09 04:42:38,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634211207] [2024-11-09 04:42:38,257 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 04:42:38,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 04:42:38,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:42:38,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 04:42:38,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=473, Unknown=43, NotChecked=306, Total=930 [2024-11-09 04:42:38,259 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 31 states, 31 states have (on average 2.193548387096774) internal successors, (68), 31 states have internal predecessors, (68), 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-11-09 04:42:39,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:42:39,549 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2024-11-09 04:42:39,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 04:42:39,549 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.193548387096774) internal successors, (68), 31 states have internal predecessors, (68), 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) Word has length 19 [2024-11-09 04:42:39,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:42:39,550 INFO L225 Difference]: With dead ends: 37 [2024-11-09 04:42:39,550 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 04:42:39,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=192, Invalid=719, Unknown=43, NotChecked=378, Total=1332 [2024-11-09 04:42:39,552 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 22 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 04:42:39,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 97 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 202 Invalid, 0 Unknown, 146 Unchecked, 0.9s Time] [2024-11-09 04:42:39,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 04:42:39,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2024-11-09 04:42:39,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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-11-09 04:42:39,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-11-09 04:42:39,558 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 19 [2024-11-09 04:42:39,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:42:39,558 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-11-09 04:42:39,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.193548387096774) internal successors, (68), 31 states have internal predecessors, (68), 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-11-09 04:42:39,559 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-11-09 04:42:39,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 04:42:39,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:42:39,559 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:42:39,573 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-09 04:42:39,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-09 04:42:39,963 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2024-11-09 04:42:40,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 04:42:40,160 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:42:40,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:42:40,161 INFO L85 PathProgramCache]: Analyzing trace with hash -64177270, now seen corresponding path program 2 times [2024-11-09 04:42:40,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:42:40,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093577608] [2024-11-09 04:42:40,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 04:42:40,161 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:42:40,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:42:40,162 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 04:42:40,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-09 04:42:40,284 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 04:42:40,284 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:42:40,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 04:42:40,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:40,302 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 7 [2024-11-09 04:42:40,382 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 04:42:40,383 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 13 treesize of output 13 [2024-11-09 04:42:40,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-09 04:42:40,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-11-09 04:42:40,566 INFO L349 Elim1Store]: treesize reduction 18, result has 21.7 percent of original size [2024-11-09 04:42:40,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-09 04:42:40,573 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 12 treesize of output 11 [2024-11-09 04:42:40,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 21 treesize of output 23 [2024-11-09 04:42:40,593 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 12 treesize of output 11 [2024-11-09 04:42:40,893 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:42:40,893 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:42:41,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:41,046 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2024-11-09 04:42:41,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:41,055 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2024-11-09 04:42:41,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:41,089 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2024-11-09 04:42:41,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:41,102 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2024-11-09 04:42:41,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:41,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 60 treesize of output 61 [2024-11-09 04:42:41,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:41,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 50 treesize of output 41 [2024-11-09 04:42:41,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:41,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 195 [2024-11-09 04:42:41,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:41,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 210 treesize of output 185 [2024-11-09 04:42:41,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:41,597 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 178 treesize of output 162 [2024-11-09 04:42:41,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:41,737 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 160 treesize of output 176 [2024-11-09 04:42:47,704 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:42:47,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 60 treesize of output 1 [2024-11-09 04:42:48,035 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:42:48,035 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:42:48,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093577608] [2024-11-09 04:42:48,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093577608] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:42:48,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [147528010] [2024-11-09 04:42:48,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 04:42:48,036 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 04:42:48,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 04:42:48,039 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 04:42:48,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-09 04:42:48,263 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 04:42:48,264 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:42:48,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 04:42:48,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:48,289 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 7 [2024-11-09 04:42:48,336 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 04:42:48,336 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 13 treesize of output 13 [2024-11-09 04:42:48,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-11-09 04:42:48,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-09 04:42:48,459 INFO L349 Elim1Store]: treesize reduction 18, result has 21.7 percent of original size [2024-11-09 04:42:48,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-09 04:42:48,466 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 12 treesize of output 11 [2024-11-09 04:42:48,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 21 treesize of output 23 [2024-11-09 04:42:48,478 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 12 treesize of output 11 [2024-11-09 04:42:48,691 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:42:48,691 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:42:48,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:48,795 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2024-11-09 04:42:48,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:48,806 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2024-11-09 04:42:48,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:48,836 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2024-11-09 04:42:48,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:48,847 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2024-11-09 04:42:49,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:49,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 60 treesize of output 61 [2024-11-09 04:42:49,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:49,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 50 treesize of output 41 [2024-11-09 04:42:49,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:49,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 195 [2024-11-09 04:42:49,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:49,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 210 treesize of output 185 [2024-11-09 04:42:49,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:49,363 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 178 treesize of output 162 [2024-11-09 04:42:49,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:49,556 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 160 treesize of output 176 [2024-11-09 04:42:55,946 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:42:55,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 60 treesize of output 1 [2024-11-09 04:42:56,170 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:42:56,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [147528010] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:42:56,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49766660] [2024-11-09 04:42:56,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 04:42:56,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:42:56,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:42:56,172 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:42:56,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-09 04:42:56,308 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 04:42:56,308 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:42:56,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 04:42:56,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:56,319 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 7 [2024-11-09 04:42:56,392 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 04:42:56,392 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 13 treesize of output 13 [2024-11-09 04:42:56,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-11-09 04:42:56,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-09 04:42:56,531 INFO L349 Elim1Store]: treesize reduction 18, result has 21.7 percent of original size [2024-11-09 04:42:56,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-09 04:42:56,539 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 12 treesize of output 11 [2024-11-09 04:42:56,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 21 treesize of output 23 [2024-11-09 04:42:56,558 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 12 treesize of output 11 [2024-11-09 04:42:56,788 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:42:56,788 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:42:56,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:56,906 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2024-11-09 04:42:56,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:56,919 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2024-11-09 04:42:56,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:56,951 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2024-11-09 04:42:56,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:56,963 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2024-11-09 04:42:57,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:57,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 60 treesize of output 61 [2024-11-09 04:42:57,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:57,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 50 treesize of output 41 [2024-11-09 04:42:57,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:57,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 195 [2024-11-09 04:42:57,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:57,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 210 treesize of output 185 [2024-11-09 04:42:57,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:57,424 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 178 treesize of output 162 [2024-11-09 04:42:57,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:57,597 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 160 treesize of output 176 [2024-11-09 04:43:04,268 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:43:04,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 60 treesize of output 1 [2024-11-09 04:43:05,180 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:43:05,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49766660] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:43:05,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 04:43:05,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9, 9] total 15 [2024-11-09 04:43:05,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804854611] [2024-11-09 04:43:05,181 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 04:43:05,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 04:43:05,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:43:05,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 04:43:05,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=169, Unknown=5, NotChecked=0, Total=210 [2024-11-09 04:43:05,182 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 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-11-09 04:43:05,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:43:05,910 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2024-11-09 04:43:05,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:43:05,911 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 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) Word has length 23 [2024-11-09 04:43:05,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:43:05,911 INFO L225 Difference]: With dead ends: 42 [2024-11-09 04:43:05,912 INFO L226 Difference]: Without dead ends: 26 [2024-11-09 04:43:05,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 111 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=50, Invalid=217, Unknown=5, NotChecked=0, Total=272 [2024-11-09 04:43:05,913 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:43:05,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 103 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 04:43:05,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-09 04:43:05,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-11-09 04:43:05,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 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-11-09 04:43:05,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2024-11-09 04:43:05,917 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 23 [2024-11-09 04:43:05,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:43:05,918 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2024-11-09 04:43:05,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 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-11-09 04:43:05,918 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2024-11-09 04:43:05,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 04:43:05,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:43:05,919 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:43:05,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2024-11-09 04:43:06,132 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-09 04:43:06,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-09 04:43:06,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:43:06,520 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:43:06,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:43:06,520 INFO L85 PathProgramCache]: Analyzing trace with hash 907404636, now seen corresponding path program 3 times [2024-11-09 04:43:06,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:43:06,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [109827114] [2024-11-09 04:43:06,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 04:43:06,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:43:06,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:43:06,524 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 04:43:06,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-09 04:43:06,661 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 04:43:06,661 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:43:06,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-09 04:43:06,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:43:06,673 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 7 [2024-11-09 04:43:06,760 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 04:43:06,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-09 04:43:06,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-11-09 04:43:06,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 8 treesize of output 1 [2024-11-09 04:43:07,002 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 04:43:07,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 35 treesize of output 26 [2024-11-09 04:43:07,039 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-09 04:43:07,040 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 24 treesize of output 26 [2024-11-09 04:43:07,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:43:07,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 04:43:07,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-09 04:43:07,299 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2024-11-09 04:43:07,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 147 [2024-11-09 04:43:07,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 124 [2024-11-09 04:43:07,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2024-11-09 04:43:07,573 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2024-11-09 04:43:07,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 136 [2024-11-09 04:43:07,637 INFO L349 Elim1Store]: treesize reduction 46, result has 24.6 percent of original size [2024-11-09 04:43:07,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 154 treesize of output 148 [2024-11-09 04:43:07,653 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 22 treesize of output 21 [2024-11-09 04:43:07,687 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 22 treesize of output 21 [2024-11-09 04:43:07,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 19 [2024-11-09 04:43:07,973 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-09 04:43:07,974 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 56 [2024-11-09 04:43:07,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 22 [2024-11-09 04:43:08,041 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:43:08,041 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:43:08,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:08,192 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 72 [2024-11-09 04:43:08,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:08,203 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 62 [2024-11-09 04:43:09,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:09,913 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 191 [2024-11-09 04:43:10,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:10,346 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 930 treesize of output 961 [2024-11-09 04:43:10,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:10,396 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 584 treesize of output 548 [2024-11-09 04:43:10,414 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 539 treesize of output 503 [2024-11-09 04:43:10,436 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 503 treesize of output 467 [2024-11-09 04:43:11,436 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 21 treesize of output 3 [2024-11-09 04:43:12,667 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 21 treesize of output 3 [2024-11-09 04:43:12,701 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 160 treesize of output 142 [2024-11-09 04:43:12,778 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 181 treesize of output 145 [2024-11-09 04:43:12,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:12,894 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 599 treesize of output 586 [2024-11-09 04:43:13,904 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 160 treesize of output 142 [2024-11-09 04:43:13,950 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 21 treesize of output 3 [2024-11-09 04:43:14,072 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 358 treesize of output 322 [2024-11-09 04:43:14,150 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 21 treesize of output 3 [2024-11-09 04:43:14,402 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 358 treesize of output 322 [2024-11-09 04:43:14,450 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 379 treesize of output 325 [2024-11-09 04:43:14,705 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 160 treesize of output 142 [2024-11-09 04:43:14,772 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 21 treesize of output 3 [2024-11-09 04:43:14,903 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 358 treesize of output 322 [2024-11-09 04:43:15,002 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 21 treesize of output 3 [2024-11-09 04:43:15,288 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 21 treesize of output 3 [2024-11-09 04:43:15,349 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 358 treesize of output 322 [2024-11-09 04:43:15,378 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 222 treesize of output 186 [2024-11-09 04:43:15,477 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 8 treesize of output 4 [2024-11-09 04:43:15,533 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 8 treesize of output 4 [2024-11-09 04:43:15,675 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 8 treesize of output 4 [2024-11-09 04:43:16,142 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 8 treesize of output 4 [2024-11-09 04:43:16,218 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 8 treesize of output 4 [2024-11-09 04:43:20,964 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_29 .cse3))) (or (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse1 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (= (_ bv0 32) .cse0)))) (not (= (_ bv0 1) (select |c_#valid| .cse1)))))) (forall ((v_prenex_142 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_142 (_ bv4 32)))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select v_arrayElimArr_29 .cse3))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29)) (.cse6 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse5 v_prenex_142) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= (select (select (store .cse4 .cse5 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse5)))) (= .cse6 |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse4 .cse5 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse5))) (= .cse6 (_ bv0 32)))))))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select v_arrayElimArr_29 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse7))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_142 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (not (= (_ bv0 32) (select v_prenex_142 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse7 v_prenex_142) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29))) (let ((.cse8 (select (select (store .cse9 .cse7 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse8 (select (select (store .cse9 .cse7 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (= .cse8 |c_ULTIMATE.start_main_~p~0#1.base|)))))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select v_arrayElimArr_29 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse10))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse10 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= .cse11 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse11 .cse10)) (= (_ bv0 32) .cse11))))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select v_arrayElimArr_29 .cse3))) (or (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse12 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| .cse12))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29))) (let ((.cse13 (select (select (store .cse14 .cse12 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse13 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse14 .cse12 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse13) (= (_ bv0 32) .cse13)))))))) (forall ((v_prenex_142 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_142 (_ bv4 32)))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select v_arrayElimArr_29 .cse3))) (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29)) (.cse17 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse16 v_prenex_142) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= (select (select (store .cse15 .cse16 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))) (= .cse17 |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse15 .cse16 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse16))) (= .cse17 (_ bv0 32)))))))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (select v_arrayElimArr_29 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse18))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_299 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse18 v_prenex_299) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_299 (_ bv4 32)))))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse18 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= .cse19 .cse18)) (= .cse19 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (forall ((v_prenex_298 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_300 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30)) (.cse20 (select v_arrayElimArr_29 .cse3))) (let ((.cse21 (select (select (store .cse22 .cse20 v_prenex_298) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse20 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse20)))) (= .cse21 (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| .cse20))) (= .cse21 (select (select (store .cse22 .cse20 v_prenex_300) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse21 |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (not (= (_ bv0 32) (select v_prenex_298 (_ bv4 32)))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29)) (.cse24 (select v_arrayElimArr_29 .cse3))) (or (= (select (select (store .cse23 .cse24 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse24))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_142 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (not (= (_ bv0 32) (select v_prenex_142 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse24 v_prenex_142) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (= (select (select (store .cse23 .cse24 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select v_arrayElimArr_29 .cse3))) (or (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse25 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| .cse25))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse25 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (forall ((v_prenex_298 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (select v_arrayElimArr_29 .cse3))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse26 v_prenex_298) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse26 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))) (= .cse27 (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| .cse26))) (= .cse27 |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (not (= (_ bv0 32) (select v_prenex_298 (_ bv4 32)))))) (forall ((v_prenex_298 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (select v_arrayElimArr_29 .cse3))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse28 v_prenex_298) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse28 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse28)))) (= .cse29 (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| .cse28))) (= .cse29 |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (not (= (_ bv0 32) (select v_prenex_298 (_ bv4 32)))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (select v_arrayElimArr_29 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse30))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_300 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (not (= (_ bv0 32) (select v_prenex_300 (_ bv4 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse30 v_prenex_300) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse30 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (select v_arrayElimArr_29 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse31))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_300 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30))) (let ((.cse32 (select (select (store .cse33 .cse31 v_prenex_300) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (not (= (_ bv0 32) (select v_prenex_300 (_ bv4 32)))) (= (_ bv0 32) .cse32) (= (select (select (store .cse33 .cse31 v_prenex_298) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse32))))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse31 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_prenex_142 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_142 (_ bv4 32)))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (select v_arrayElimArr_29 .cse3))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse35 v_prenex_142) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse34 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 1) (select |c_#valid| .cse35))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse37 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29))) (let ((.cse36 (select (select (store .cse37 .cse35 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse36 (select (select (store .cse37 .cse35 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= .cse36 .cse35)))))) (= .cse34 (_ bv0 32)))))) (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (select v_arrayElimArr_29 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse38))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29))) (let ((.cse39 (select (select (store .cse40 .cse38 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= .cse39 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select (store .cse40 .cse38 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse39) (= (_ bv0 32) .cse39)))))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (select v_arrayElimArr_29 .cse3))) (or (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse42 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (not (= .cse41 .cse42)) (= (_ bv0 32) .cse41)))) (not (= (_ bv0 1) (select |c_#valid| .cse42)))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (select v_arrayElimArr_29 .cse3))) (or (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse43 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse43)))) (not (= (_ bv0 1) (select |c_#valid| .cse43))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_142 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (not (= (_ bv0 32) (select v_prenex_142 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse43 v_prenex_142) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32))))))) (forall ((v_prenex_298 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_298 (_ bv4 32)))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_300 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse46 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30)) (.cse44 (select v_arrayElimArr_29 .cse3))) (let ((.cse45 (select (select (store .cse46 .cse44 v_prenex_298) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse44 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))) (= .cse45 (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| .cse44))) (= .cse45 (select (select (store .cse46 .cse44 v_prenex_300) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse45 |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (select v_arrayElimArr_29 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse47))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse49 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29))) (let ((.cse48 (select (select (store .cse49 .cse47 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse48 (select (select (store .cse49 .cse47 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= .cse48 .cse47)) (= .cse48 |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_142 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse47 v_prenex_142) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (= .cse50 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_142 (_ bv4 32)))) (= .cse50 (_ bv0 32)))))))) (forall ((v_prenex_142 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_142 (_ bv4 32)))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse52 (select v_arrayElimArr_29 .cse3))) (let ((.cse51 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse52 v_prenex_142) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse51 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 1) (select |c_#valid| .cse52))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse54 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29))) (let ((.cse53 (select (select (store .cse54 .cse52 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse53 (select (select (store .cse54 .cse52 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= .cse53 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (= .cse51 (_ bv0 32)))))))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse55 (select v_arrayElimArr_29 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse55))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse57 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29))) (let ((.cse56 (select (select (store .cse57 .cse55 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse56 (select (select (store .cse57 .cse55 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= .cse56 .cse55)))))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_142 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (not (= (_ bv0 32) (select v_prenex_142 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse55 v_prenex_142) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32))))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29)) (.cse59 (select v_arrayElimArr_29 .cse3))) (or (= (select (select (store .cse58 .cse59 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse59))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse60 (select (select (store .cse58 .cse59 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= .cse60 .cse59)) (= .cse60 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_142 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse61 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse59 v_prenex_142) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (= .cse61 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_142 (_ bv4 32)))) (= .cse61 (_ bv0 32)))))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (select v_arrayElimArr_29 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse62))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29))) (let ((.cse64 (select (select (store .cse63 .cse62 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse63 .cse62 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse64) (not (= .cse64 .cse62)) (= (_ bv0 32) .cse64)))))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse66 (select v_arrayElimArr_29 .cse3))) (or (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse65 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse66 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse65 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) .cse65)))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse66 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| .cse66)))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse68 (select v_arrayElimArr_29 .cse3))) (or (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_300 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse67 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (= (select (select (store .cse67 .cse68 v_prenex_299) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_299 (_ bv4 32)))) (= (select (select (store .cse67 .cse68 v_prenex_298) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse67 .cse68 v_prenex_300) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (_ bv0 1) (select |c_#valid| .cse68))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse69 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse68 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= .cse69 .cse68)) (= .cse69 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse70 (select v_arrayElimArr_29 .cse3))) (or (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse70 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse70)))) (not (= (_ bv0 1) (select |c_#valid| .cse70))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_300 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_142 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse71 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (not (= (_ bv0 32) (select v_prenex_142 (_ bv4 32)))) (= (select (select (store .cse71 .cse70 v_prenex_142) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (= (select (select (store .cse71 .cse70 v_prenex_298) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse71 .cse70 v_prenex_300) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse72 (select v_arrayElimArr_29 .cse3))) (or (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse72 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| .cse72))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse73 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29))) (let ((.cse74 (select (select (store .cse73 .cse72 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse73 .cse72 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse74) (= (_ bv0 32) .cse74)))))))))) is different from false [2024-11-09 04:43:23,174 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_29 .cse3))) (or (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse1 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (= (_ bv0 32) .cse0)))) (not (= (_ bv0 1) (select |c_#valid| .cse1)))))) (forall ((v_prenex_142 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_142 (_ bv4 32)))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select v_arrayElimArr_29 .cse3))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29)) (.cse6 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse5 v_prenex_142) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= (select (select (store .cse4 .cse5 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse5)))) (= .cse6 |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse4 .cse5 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse5))) (= .cse6 (_ bv0 32)))))))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select v_arrayElimArr_29 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse7))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_142 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (not (= (_ bv0 32) (select v_prenex_142 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse7 v_prenex_142) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29))) (let ((.cse8 (select (select (store .cse9 .cse7 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse8 (select (select (store .cse9 .cse7 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (= .cse8 |c_ULTIMATE.start_main_~p~0#1.base|)))))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select v_arrayElimArr_29 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse10))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse10 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= .cse11 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse11 .cse10)) (= (_ bv0 32) .cse11))))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select v_arrayElimArr_29 .cse3))) (or (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse12 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| .cse12))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29))) (let ((.cse13 (select (select (store .cse14 .cse12 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse13 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse14 .cse12 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse13) (= (_ bv0 32) .cse13)))))))) (forall ((v_prenex_142 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_142 (_ bv4 32)))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select v_arrayElimArr_29 .cse3))) (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29)) (.cse17 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse16 v_prenex_142) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= (select (select (store .cse15 .cse16 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))) (= .cse17 |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse15 .cse16 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse16))) (= .cse17 (_ bv0 32)))))))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (select v_arrayElimArr_29 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse18))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_299 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse18 v_prenex_299) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_299 (_ bv4 32)))))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse18 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= .cse19 .cse18)) (= .cse19 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (forall ((v_prenex_298 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_300 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30)) (.cse20 (select v_arrayElimArr_29 .cse3))) (let ((.cse21 (select (select (store .cse22 .cse20 v_prenex_298) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse20 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse20)))) (= .cse21 (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| .cse20))) (= .cse21 (select (select (store .cse22 .cse20 v_prenex_300) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse21 |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (not (= (_ bv0 32) (select v_prenex_298 (_ bv4 32)))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29)) (.cse24 (select v_arrayElimArr_29 .cse3))) (or (= (select (select (store .cse23 .cse24 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse24))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_142 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (not (= (_ bv0 32) (select v_prenex_142 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse24 v_prenex_142) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (= (select (select (store .cse23 .cse24 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select v_arrayElimArr_29 .cse3))) (or (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse25 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| .cse25))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse25 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (forall ((v_prenex_298 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (select v_arrayElimArr_29 .cse3))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse26 v_prenex_298) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse26 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))) (= .cse27 (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| .cse26))) (= .cse27 |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (not (= (_ bv0 32) (select v_prenex_298 (_ bv4 32)))))) (forall ((v_prenex_298 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (select v_arrayElimArr_29 .cse3))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse28 v_prenex_298) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse28 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse28)))) (= .cse29 (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| .cse28))) (= .cse29 |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (not (= (_ bv0 32) (select v_prenex_298 (_ bv4 32)))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (select v_arrayElimArr_29 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse30))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_300 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (not (= (_ bv0 32) (select v_prenex_300 (_ bv4 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse30 v_prenex_300) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse30 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (select v_arrayElimArr_29 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse31))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_300 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30))) (let ((.cse32 (select (select (store .cse33 .cse31 v_prenex_300) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (not (= (_ bv0 32) (select v_prenex_300 (_ bv4 32)))) (= (_ bv0 32) .cse32) (= (select (select (store .cse33 .cse31 v_prenex_298) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse32))))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse31 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_prenex_142 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_142 (_ bv4 32)))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (select v_arrayElimArr_29 .cse3))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse35 v_prenex_142) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse34 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 1) (select |c_#valid| .cse35))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse37 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29))) (let ((.cse36 (select (select (store .cse37 .cse35 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse36 (select (select (store .cse37 .cse35 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= .cse36 .cse35)))))) (= .cse34 (_ bv0 32)))))) (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (select v_arrayElimArr_29 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse38))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29))) (let ((.cse39 (select (select (store .cse40 .cse38 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= .cse39 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select (store .cse40 .cse38 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse39) (= (_ bv0 32) .cse39)))))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (select v_arrayElimArr_29 .cse3))) (or (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse42 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (not (= .cse41 .cse42)) (= (_ bv0 32) .cse41)))) (not (= (_ bv0 1) (select |c_#valid| .cse42)))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (select v_arrayElimArr_29 .cse3))) (or (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse43 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse43)))) (not (= (_ bv0 1) (select |c_#valid| .cse43))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_142 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (not (= (_ bv0 32) (select v_prenex_142 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse43 v_prenex_142) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32))))))) (forall ((v_prenex_298 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_298 (_ bv4 32)))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_300 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse46 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30)) (.cse44 (select v_arrayElimArr_29 .cse3))) (let ((.cse45 (select (select (store .cse46 .cse44 v_prenex_298) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse44 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))) (= .cse45 (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| .cse44))) (= .cse45 (select (select (store .cse46 .cse44 v_prenex_300) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse45 |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (select v_arrayElimArr_29 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse47))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse49 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29))) (let ((.cse48 (select (select (store .cse49 .cse47 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse48 (select (select (store .cse49 .cse47 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= .cse48 .cse47)) (= .cse48 |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_142 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse47 v_prenex_142) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (= .cse50 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_142 (_ bv4 32)))) (= .cse50 (_ bv0 32)))))))) (forall ((v_prenex_142 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_142 (_ bv4 32)))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse52 (select v_arrayElimArr_29 .cse3))) (let ((.cse51 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse52 v_prenex_142) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse51 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 1) (select |c_#valid| .cse52))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse54 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29))) (let ((.cse53 (select (select (store .cse54 .cse52 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse53 (select (select (store .cse54 .cse52 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= .cse53 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (= .cse51 (_ bv0 32)))))))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse55 (select v_arrayElimArr_29 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse55))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse57 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29))) (let ((.cse56 (select (select (store .cse57 .cse55 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse56 (select (select (store .cse57 .cse55 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= .cse56 .cse55)))))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_142 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (not (= (_ bv0 32) (select v_prenex_142 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse55 v_prenex_142) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32))))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29)) (.cse59 (select v_arrayElimArr_29 .cse3))) (or (= (select (select (store .cse58 .cse59 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse59))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse60 (select (select (store .cse58 .cse59 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= .cse60 .cse59)) (= .cse60 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_142 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse61 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse59 v_prenex_142) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (= .cse61 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_142 (_ bv4 32)))) (= .cse61 (_ bv0 32)))))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (select v_arrayElimArr_29 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse62))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29))) (let ((.cse64 (select (select (store .cse63 .cse62 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse63 .cse62 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse64) (not (= .cse64 .cse62)) (= (_ bv0 32) .cse64)))))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse66 (select v_arrayElimArr_29 .cse3))) (or (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse65 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse66 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse65 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) .cse65)))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse66 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| .cse66)))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse68 (select v_arrayElimArr_29 .cse3))) (or (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_300 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse67 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (= (select (select (store .cse67 .cse68 v_prenex_299) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_299 (_ bv4 32)))) (= (select (select (store .cse67 .cse68 v_prenex_298) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse67 .cse68 v_prenex_300) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (_ bv0 1) (select |c_#valid| .cse68))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse69 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse68 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= .cse69 .cse68)) (= .cse69 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse70 (select v_arrayElimArr_29 .cse3))) (or (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_140 (_ bv4 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse70 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse70)))) (not (= (_ bv0 1) (select |c_#valid| .cse70))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_300 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_142 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse71 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (not (= (_ bv0 32) (select v_prenex_142 (_ bv4 32)))) (= (select (select (store .cse71 .cse70 v_prenex_142) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (= (select (select (store .cse71 .cse70 v_prenex_298) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse71 .cse70 v_prenex_300) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse72 (select v_arrayElimArr_29 .cse3))) (or (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_30 .cse3))) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse72 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| .cse72))) (forall ((v_prenex_140 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse73 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29))) (let ((.cse74 (select (select (store .cse73 .cse72 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse73 .cse72 v_prenex_140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse74) (= (_ bv0 32) .cse74)))))))))) is different from true [2024-11-09 04:43:29,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 415 treesize of output 403 [2024-11-09 04:43:30,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:30,084 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 409 treesize of output 383 [2024-11-09 04:43:30,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:30,207 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 439 treesize of output 327 [2024-11-09 04:43:30,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:30,361 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 275 treesize of output 263 [2024-11-09 04:43:30,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:30,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 34 treesize of output 35 [2024-11-09 04:43:30,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:30,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 205 treesize of output 198 [2024-11-09 04:43:30,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:30,811 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 343 treesize of output 255 [2024-11-09 04:43:30,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:30,950 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 61 treesize of output 59 [2024-11-09 04:43:34,118 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:43:34,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 131 treesize of output 1 [2024-11-09 04:43:34,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:43:34,268 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:43:34,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 68 treesize of output 1 [2024-11-09 04:43:34,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:34,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 109 treesize of output 89 [2024-11-09 04:43:34,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:34,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 321 treesize of output 308 [2024-11-09 04:43:34,550 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 307 treesize of output 239 [2024-11-09 04:43:34,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:34,688 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 235 treesize of output 217 [2024-11-09 04:43:34,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:34,801 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 215 treesize of output 143 [2024-11-09 04:43:36,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3783 treesize of output 3603 [2024-11-09 04:43:36,962 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 04:43:36,963 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 166 treesize of output 1 [2024-11-09 04:43:37,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 362 treesize of output 350 [2024-11-09 04:43:37,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:37,242 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 166 treesize of output 162 [2024-11-09 04:43:37,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:37,368 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 247 treesize of output 215 [2024-11-09 04:43:37,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:37,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 64 treesize of output 54 [2024-11-09 04:43:37,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:37,576 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 132 treesize of output 122 [2024-11-09 04:43:37,655 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:43:37,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:37,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 72 treesize of output 65 [2024-11-09 04:43:37,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:37,986 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 161 treesize of output 133 [2024-11-09 04:43:39,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:43:39,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:39,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 97 treesize of output 77 [2024-11-09 04:43:40,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:40,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1129 treesize of output 1050 [2024-11-09 04:43:40,062 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 39 treesize of output 27 [2024-11-09 04:43:40,089 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 19 treesize of output 11 [2024-11-09 04:43:40,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:43:40,168 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 43 [2024-11-09 04:43:40,197 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 24 treesize of output 16 [2024-11-09 04:43:40,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:43:40,322 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2024-11-09 04:43:40,378 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:43:40,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:43:40,449 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:43:40,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 139 treesize of output 1 [2024-11-09 04:43:40,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 787 treesize of output 763 [2024-11-09 04:43:40,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:40,708 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 440 treesize of output 356 [2024-11-09 04:43:40,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:40,884 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 275 treesize of output 263 [2024-11-09 04:43:41,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:41,063 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 257 treesize of output 231 [2024-11-09 04:43:41,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:41,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 64 treesize of output 54 [2024-11-09 04:43:41,193 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:43:41,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:41,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 72 treesize of output 65 [2024-11-09 04:43:41,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:41,518 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 270 treesize of output 226 [2024-11-09 04:43:44,646 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:43:44,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 97 treesize of output 1 [2024-11-09 04:43:44,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 362 treesize of output 350 [2024-11-09 04:43:44,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:44,921 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 166 treesize of output 162 [2024-11-09 04:43:45,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:45,043 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 214 treesize of output 186 [2024-11-09 04:43:45,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:45,199 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 132 treesize of output 122 [2024-11-09 04:43:45,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:45,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 34 treesize of output 35 [2024-11-09 04:43:45,320 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:43:45,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:45,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 47 treesize of output 46 [2024-11-09 04:43:45,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:45,635 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 150 treesize of output 126 [2024-11-09 04:43:47,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:43:47,048 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:43:47,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 98 treesize of output 1 [2024-11-09 04:43:47,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3836 treesize of output 3656 [2024-11-09 04:43:47,277 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 04:43:47,277 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 534 treesize of output 1 [2024-11-09 04:43:47,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:43:47,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:47,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 106 treesize of output 86 [2024-11-09 04:43:47,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:47,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1978 treesize of output 1827 [2024-11-09 04:43:47,737 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 81 treesize of output 61 [2024-11-09 04:43:47,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:43:47,780 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 54 [2024-11-09 04:43:47,807 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 24 treesize of output 16 [2024-11-09 04:43:47,838 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 45 treesize of output 29 [2024-11-09 04:43:47,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:43:47,942 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2024-11-09 04:43:48,025 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:43:48,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 76 treesize of output 70 [2024-11-09 04:43:48,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:48,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 68 treesize of output 58 [2024-11-09 04:43:48,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:48,243 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 143 treesize of output 115 [2024-11-09 04:43:48,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:48,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 166 treesize of output 159 [2024-11-09 04:43:48,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:48,622 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 154 treesize of output 118 [2024-11-09 04:43:48,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:48,762 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 58 treesize of output 54 [2024-11-09 04:43:48,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:48,905 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 110 treesize of output 100 [2024-11-09 04:43:50,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3783 treesize of output 3603 [2024-11-09 04:43:50,862 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 04:43:50,862 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 166 treesize of output 1 [2024-11-09 04:43:50,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:43:51,015 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:43:51,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 106 treesize of output 1 [2024-11-09 04:43:51,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 787 treesize of output 763 [2024-11-09 04:43:51,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:51,373 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 473 treesize of output 385 [2024-11-09 04:43:51,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:51,574 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 275 treesize of output 263 [2024-11-09 04:43:51,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:51,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 93 treesize of output 73 [2024-11-09 04:43:51,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:51,805 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 257 treesize of output 231 [2024-11-09 04:43:51,869 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:43:52,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:52,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 72 treesize of output 65 [2024-11-09 04:43:52,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:52,212 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 270 treesize of output 226 [2024-11-09 04:43:55,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:55,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 76 treesize of output 66 [2024-11-09 04:43:55,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:55,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 438 treesize of output 419 [2024-11-09 04:43:55,461 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 190 treesize of output 154 [2024-11-09 04:43:55,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:55,570 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 154 treesize of output 118 [2024-11-09 04:43:55,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:55,703 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 89 treesize of output 79 [2024-11-09 04:43:58,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 4071 treesize of output 3891 [2024-11-09 04:43:58,103 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 04:43:58,103 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 166 treesize of output 1 [2024-11-09 04:43:58,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:58,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 67 treesize of output 57 [2024-11-09 04:43:58,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:58,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 365 treesize of output 346 [2024-11-09 04:43:58,403 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 153 treesize of output 133 [2024-11-09 04:43:58,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:58,541 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 71 treesize of output 61 [2024-11-09 04:43:58,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:58,650 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 117 treesize of output 97 [2024-11-09 04:43:59,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3836 treesize of output 3656 [2024-11-09 04:43:59,216 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 04:43:59,216 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 588 treesize of output 1 [2024-11-09 04:43:59,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 362 treesize of output 350 [2024-11-09 04:43:59,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:59,509 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 166 treesize of output 162 [2024-11-09 04:43:59,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:59,641 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 238 treesize of output 210 [2024-11-09 04:43:59,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:59,802 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 132 treesize of output 122 [2024-11-09 04:43:59,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:59,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 59 treesize of output 49 [2024-11-09 04:43:59,926 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:44:00,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:44:00,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 35 [2024-11-09 04:44:00,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:44:00,351 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 131 treesize of output 115 [2024-11-09 04:44:01,288 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:44:01,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 139 treesize of output 1 [2024-11-09 04:44:01,333 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:44:01,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 130 treesize of output 1 [2024-11-09 04:44:01,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 362 treesize of output 350 [2024-11-09 04:44:01,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:44:01,626 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 166 treesize of output 162 [2024-11-09 04:44:01,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:44:01,787 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 152 treesize of output 142 [2024-11-09 04:44:01,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:44:01,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 33 treesize of output 34 [2024-11-09 04:44:02,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:44:02,019 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 179 treesize of output 155 [2024-11-09 04:44:02,070 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:44:02,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:44:02,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 35 [2024-11-09 04:44:02,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:44:02,535 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 131 treesize of output 115 [2024-11-09 04:44:03,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 415 treesize of output 403 [2024-11-09 04:44:03,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:44:03,868 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 409 treesize of output 383 [2024-11-09 04:44:04,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:44:04,001 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 431 treesize of output 323 [2024-11-09 04:44:04,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:44:04,172 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 275 treesize of output 263 [2024-11-09 04:44:04,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:44:04,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 30 treesize of output 31 [2024-11-09 04:44:04,303 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:44:04,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:44:04,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 39 treesize of output 38 [2024-11-09 04:44:04,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:44:04,629 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 283 treesize of output 219 [2024-11-09 04:44:06,488 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:44:06,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 76 treesize of output 70 [2024-11-09 04:44:06,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:44:06,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 33 treesize of output 34 [2024-11-09 04:44:06,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:44:06,700 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 119 treesize of output 95 [2024-11-09 04:44:06,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:44:06,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 86 treesize of output 85 [2024-11-09 04:44:07,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:44:07,071 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 80 treesize of output 64 [2024-11-09 04:44:07,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:44:07,208 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 58 treesize of output 54 [2024-11-09 04:44:07,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:44:07,350 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 56 treesize of output 54 [2024-11-09 04:44:17,815 WARN L286 SmtUtils]: Spent 6.01s on a formula simplification. DAG size of input: 200 DAG size of output: 197 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 04:44:37,457 WARN L286 SmtUtils]: Spent 5.60s on a formula simplification that was a NOOP. DAG size: 251 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 04:44:47,767 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-09 04:44:47,767 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:44:47,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [109827114] [2024-11-09 04:44:47,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [109827114] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:44:47,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1459529124] [2024-11-09 04:44:47,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 04:44:47,767 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 04:44:47,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 04:44:47,769 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 04:44:47,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-11-09 04:44:48,008 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 04:44:48,008 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:44:48,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-09 04:44:48,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:44:48,038 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 7 [2024-11-09 04:44:48,625 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 04:44:48,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-09 04:44:49,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-09 04:44:49,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-11-09 04:44:50,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-09 04:44:50,687 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 04:44:50,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 35 treesize of output 26 [2024-11-09 04:44:50,927 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-09 04:44:50,928 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 24 treesize of output 26 [2024-11-09 04:44:51,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:44:51,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 04:44:52,091 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-11-09 04:44:52,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 89 [2024-11-09 04:44:52,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-11-09 04:44:52,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 27 treesize of output 22 [2024-11-09 04:44:53,870 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2024-11-09 04:44:53,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 84 [2024-11-09 04:44:53,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-09 04:44:54,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:44:54,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 41 [2024-11-09 04:44:54,144 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 16 treesize of output 15 [2024-11-09 04:44:54,328 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 16 treesize of output 15 [2024-11-09 04:44:56,270 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2024-11-09 04:44:56,271 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 46 [2024-11-09 04:44:56,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 04:44:56,877 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:44:56,877 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:44:57,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:44:57,431 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 72 [2024-11-09 04:44:57,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:44:57,485 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 62 [2024-11-09 04:44:57,908 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) (.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (and (forall ((v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_55) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (forall ((v_ArrVal_685 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv1 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_685) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) .cse1)) (not (= (_ bv0 32) (select v_arrayElimArr_54 .cse2))))) (= (_ bv0 32) .cse1) (not (= (select v_arrayElimArr_55 .cse2) (_ bv0 32)))))) (forall ((v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_55 .cse2) (_ bv0 32))) (forall ((v_ArrVal_685 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (= (_ bv1 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_685) .cse3) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_55) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (= (_ bv0 32) .cse3) (not (= (_ bv0 32) (select v_arrayElimArr_54 .cse2)))))))))) is different from false [2024-11-09 04:45:03,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:03,068 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 191 [2024-11-09 04:45:03,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:03,822 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 930 treesize of output 961 [2024-11-09 04:45:03,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:03,910 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 584 treesize of output 548 [2024-11-09 04:45:03,955 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 539 treesize of output 503 [2024-11-09 04:45:04,001 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 503 treesize of output 467 [2024-11-09 04:45:10,287 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 21 treesize of output 3 [2024-11-09 04:45:10,409 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 21 treesize of output 3 [2024-11-09 04:45:13,049 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 358 treesize of output 322 [2024-11-09 04:45:13,386 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 358 treesize of output 322 [2024-11-09 04:45:13,597 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 379 treesize of output 325 [2024-11-09 04:45:13,750 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 21 treesize of output 3 [2024-11-09 04:45:14,435 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 379 treesize of output 325 [2024-11-09 04:45:15,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:15,020 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 643 treesize of output 674 [2024-11-09 04:45:22,338 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 21 treesize of output 3 [2024-11-09 04:45:22,477 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 379 treesize of output 325 [2024-11-09 04:45:22,706 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 358 treesize of output 322 [2024-11-09 04:45:23,289 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 358 treesize of output 322 [2024-11-09 04:45:23,463 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 21 treesize of output 3 [2024-11-09 04:45:23,540 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 379 treesize of output 325 [2024-11-09 04:45:23,636 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 358 treesize of output 322 [2024-11-09 04:45:24,452 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 21 treesize of output 3 [2024-11-09 04:45:24,575 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 358 treesize of output 322 [2024-11-09 04:45:24,745 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 379 treesize of output 325 [2024-11-09 04:45:24,868 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 21 treesize of output 3 [2024-11-09 04:45:25,213 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 21 treesize of output 3 [2024-11-09 04:45:25,518 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 21 treesize of output 3 [2024-11-09 04:45:25,622 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 399 treesize of output 345 [2024-11-09 04:45:26,062 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 21 treesize of output 3 [2024-11-09 04:45:27,707 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 8 treesize of output 4 [2024-11-09 04:45:27,816 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 8 treesize of output 4 [2024-11-09 04:45:27,956 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 8 treesize of output 4 [2024-11-09 04:45:28,091 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 8 treesize of output 4 [2024-11-09 04:45:28,464 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 8 treesize of output 4 [2024-11-09 04:45:32,070 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 49 treesize of output 37 [2024-11-09 04:45:35,527 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) (.cse1 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (and (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_56 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse0))) (forall ((v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse0 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32)))))) (forall ((v_prenex_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57))) (let ((.cse2 (select (select (store .cse4 .cse0 v_arrayElimArr_55) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse2 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (not (= (select v_arrayElimArr_55 (_ bv4 32)) (_ bv0 32))) (= .cse2 (select (select (store .cse4 .cse0 v_prenex_795) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_543 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_543 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57) .cse5 v_prenex_543) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (forall ((v_prenex_541 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_541 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse5 v_prenex_541) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|))) (not (= (_ bv0 1) (select |c_#valid| .cse5)))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_796 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57))) (let ((.cse6 (select (select (store .cse7 .cse8 v_prenex_795) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (not (= (select v_prenex_795 (_ bv4 32)) (_ bv0 32))) (= .cse6 |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse7 .cse8 v_prenex_796) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse6))))) (not (= (_ bv0 1) (select |c_#valid| .cse8))) (forall ((v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse8 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32))))))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57))) (let ((.cse11 (select (select (store .cse9 .cse10 v_prenex_795) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (= (select (select (store .cse9 .cse10 v_arrayElimArr_55) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse11) (not (= (select v_prenex_795 (_ bv4 32)) (_ bv0 32))) (= .cse11 |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select |c_#valid| .cse10))) (forall ((v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse10 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32))))))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_543 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_543 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57) .cse12 v_prenex_543) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (forall ((v_prenex_541 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_541 (_ bv4 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse12 v_prenex_541) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse12)))) (not (= (_ bv0 1) (select |c_#valid| .cse12)))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_796 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57))) (let ((.cse13 (select (select (store .cse16 .cse17 v_arrayElimArr_55) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse15 (select (select (store .cse16 .cse17 v_prenex_796) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse14 (select (select (store .cse16 .cse17 v_prenex_795) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (= .cse13 .cse14) (not (= (select v_prenex_795 (_ bv4 32)) (_ bv0 32))) (= .cse15 .cse13) (= .cse14 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse15 .cse14))))) (not (= (_ bv0 1) (select |c_#valid| .cse17))) (forall ((v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse17 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32))))))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_541 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56))) (let ((.cse18 (select (select (store .cse19 .cse20 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse18 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32)))) (= .cse18 (select (select (store .cse19 .cse20 v_prenex_541) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (= .cse18 |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (_ bv0 1) (select |c_#valid| .cse20)))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57) .cse21 v_arrayElimArr_55) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (not (= (select v_arrayElimArr_55 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse21))) (forall ((v_prenex_541 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56))) (let ((.cse22 (select (select (store .cse23 .cse21 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse22 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32)))) (= .cse22 (select (select (store .cse23 .cse21 v_prenex_541) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (not (= (select v_prenex_795 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57) .cse24 v_prenex_795) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| .cse24))) (forall ((v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse24 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32))))))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57) .cse25 v_arrayElimArr_55) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (not (= (select v_arrayElimArr_55 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse25))) (forall ((v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse25 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32))))))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_796 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57))) (let ((.cse26 (select (select (store .cse27 .cse28 v_prenex_796) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse29 (select (select (store .cse27 .cse28 v_prenex_795) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (not (= (select v_prenex_795 (_ bv4 32)) (_ bv0 32))) (= .cse26 (select (select (store .cse27 .cse28 v_arrayElimArr_55) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (= .cse29 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse26 .cse29))))) (not (= (_ bv0 1) (select |c_#valid| .cse28))) (forall ((v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse28 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32))))))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_543 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_543 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57) .cse30 v_prenex_543) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (forall ((v_prenex_541 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56))) (let ((.cse32 (select (select (store .cse31 .cse30 v_prenex_541) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= (select (select (store .cse31 .cse30 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse32) (not (= (_ bv0 32) (select v_prenex_541 (_ bv4 32)))) (= .cse32 |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (_ bv0 1) (select |c_#valid| .cse30)))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (select v_arrayElimArr_56 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse33))) (forall ((v_prenex_541 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56))) (let ((.cse34 (select (select (store .cse35 .cse33 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse34 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32)))) (not (= .cse34 .cse33)) (= .cse34 (select (select (store .cse35 .cse33 v_prenex_541) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse37 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_796 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57))) (let ((.cse38 (select (select (store .cse36 .cse37 v_prenex_795) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (= (select (select (store .cse36 .cse37 v_arrayElimArr_55) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse38) (not (= (select v_prenex_795 (_ bv4 32)) (_ bv0 32))) (= .cse38 |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse36 .cse37 v_prenex_796) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse38))))) (not (= (_ bv0 1) (select |c_#valid| .cse37))) (forall ((v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse37 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32))))))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_796 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57))) (let ((.cse39 (select (select (store .cse41 .cse42 v_arrayElimArr_55) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse40 (select (select (store .cse41 .cse42 v_prenex_795) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (= .cse39 .cse40) (not (= (select v_prenex_795 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse41 .cse42 v_prenex_796) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse39) (= .cse40 |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select |c_#valid| .cse42))) (forall ((v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse42 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32))))))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_541 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56))) (let ((.cse45 (select (select (store .cse43 .cse44 v_prenex_541) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= (select (select (store .cse43 .cse44 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse45) (not (= (_ bv0 32) (select v_prenex_541 (_ bv4 32)))) (not (= .cse45 .cse44)))))) (forall ((v_prenex_543 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_543 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57) .cse44 v_prenex_543) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| .cse44)))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse49 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_541 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56))) (let ((.cse46 (select (select (store .cse48 .cse49 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse47 (select (select (store .cse48 .cse49 v_prenex_541) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse46 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32)))) (= .cse46 .cse47) (= .cse47 |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57) .cse49 v_arrayElimArr_55) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (not (= (select v_arrayElimArr_55 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse49)))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse51 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse51 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse50 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32)))) (= .cse50 |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (_ bv0 1) (select |c_#valid| .cse51)))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse54 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_796 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse53 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57))) (let ((.cse52 (select (select (store .cse53 .cse54 v_arrayElimArr_55) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse52 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (not (= (select v_arrayElimArr_55 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse53 .cse54 v_prenex_796) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse52))))) (not (= (_ bv0 1) (select |c_#valid| .cse54))) (forall ((v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse54 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32))))))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_541 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse57 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56))) (let ((.cse55 (select (select (store .cse57 .cse58 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse56 (select (select (store .cse57 .cse58 v_prenex_541) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse55 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32)))) (= .cse55 .cse56) (= .cse55 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse56 |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (_ bv0 1) (select |c_#valid| .cse58)))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse60 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse59 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse60 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse59 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32)))) (not (= .cse59 .cse60))))) (not (= (_ bv0 1) (select |c_#valid| .cse60)))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse61 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_543 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_543 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57) .cse61 v_prenex_543) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (forall ((v_prenex_541 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse61 v_prenex_541) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_prenex_541 (_ bv4 32)))) (not (= .cse62 .cse61)) (= .cse62 |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (_ bv0 1) (select |c_#valid| .cse61)))))) (forall ((v_prenex_543 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_422 (_ BitVec 32)) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57) v_arrayElimCell_422 v_prenex_543) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_prenex_543 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_422))) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse63) (= (_ bv0 32) .cse63)))))) is different from false [2024-11-09 04:45:37,543 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) (.cse1 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (and (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_56 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse0))) (forall ((v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse0 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32)))))) (forall ((v_prenex_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57))) (let ((.cse2 (select (select (store .cse4 .cse0 v_arrayElimArr_55) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse2 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (not (= (select v_arrayElimArr_55 (_ bv4 32)) (_ bv0 32))) (= .cse2 (select (select (store .cse4 .cse0 v_prenex_795) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_543 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_543 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57) .cse5 v_prenex_543) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (forall ((v_prenex_541 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_541 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse5 v_prenex_541) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|))) (not (= (_ bv0 1) (select |c_#valid| .cse5)))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_796 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57))) (let ((.cse6 (select (select (store .cse7 .cse8 v_prenex_795) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (not (= (select v_prenex_795 (_ bv4 32)) (_ bv0 32))) (= .cse6 |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse7 .cse8 v_prenex_796) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse6))))) (not (= (_ bv0 1) (select |c_#valid| .cse8))) (forall ((v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse8 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32))))))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57))) (let ((.cse11 (select (select (store .cse9 .cse10 v_prenex_795) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (= (select (select (store .cse9 .cse10 v_arrayElimArr_55) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse11) (not (= (select v_prenex_795 (_ bv4 32)) (_ bv0 32))) (= .cse11 |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select |c_#valid| .cse10))) (forall ((v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse10 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32))))))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_543 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_543 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57) .cse12 v_prenex_543) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (forall ((v_prenex_541 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_541 (_ bv4 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse12 v_prenex_541) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse12)))) (not (= (_ bv0 1) (select |c_#valid| .cse12)))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_796 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57))) (let ((.cse13 (select (select (store .cse16 .cse17 v_arrayElimArr_55) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse15 (select (select (store .cse16 .cse17 v_prenex_796) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse14 (select (select (store .cse16 .cse17 v_prenex_795) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (= .cse13 .cse14) (not (= (select v_prenex_795 (_ bv4 32)) (_ bv0 32))) (= .cse15 .cse13) (= .cse14 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse15 .cse14))))) (not (= (_ bv0 1) (select |c_#valid| .cse17))) (forall ((v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse17 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32))))))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_541 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56))) (let ((.cse18 (select (select (store .cse19 .cse20 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse18 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32)))) (= .cse18 (select (select (store .cse19 .cse20 v_prenex_541) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (= .cse18 |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (_ bv0 1) (select |c_#valid| .cse20)))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57) .cse21 v_arrayElimArr_55) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (not (= (select v_arrayElimArr_55 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse21))) (forall ((v_prenex_541 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56))) (let ((.cse22 (select (select (store .cse23 .cse21 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse22 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32)))) (= .cse22 (select (select (store .cse23 .cse21 v_prenex_541) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (not (= (select v_prenex_795 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57) .cse24 v_prenex_795) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| .cse24))) (forall ((v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse24 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32))))))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57) .cse25 v_arrayElimArr_55) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (not (= (select v_arrayElimArr_55 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse25))) (forall ((v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse25 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32))))))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_796 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57))) (let ((.cse26 (select (select (store .cse27 .cse28 v_prenex_796) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse29 (select (select (store .cse27 .cse28 v_prenex_795) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (not (= (select v_prenex_795 (_ bv4 32)) (_ bv0 32))) (= .cse26 (select (select (store .cse27 .cse28 v_arrayElimArr_55) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (= .cse29 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse26 .cse29))))) (not (= (_ bv0 1) (select |c_#valid| .cse28))) (forall ((v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse28 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32))))))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_543 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_543 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57) .cse30 v_prenex_543) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (forall ((v_prenex_541 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56))) (let ((.cse32 (select (select (store .cse31 .cse30 v_prenex_541) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= (select (select (store .cse31 .cse30 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse32) (not (= (_ bv0 32) (select v_prenex_541 (_ bv4 32)))) (= .cse32 |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (_ bv0 1) (select |c_#valid| .cse30)))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (select v_arrayElimArr_56 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse33))) (forall ((v_prenex_541 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56))) (let ((.cse34 (select (select (store .cse35 .cse33 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse34 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32)))) (not (= .cse34 .cse33)) (= .cse34 (select (select (store .cse35 .cse33 v_prenex_541) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse37 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_796 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57))) (let ((.cse38 (select (select (store .cse36 .cse37 v_prenex_795) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (= (select (select (store .cse36 .cse37 v_arrayElimArr_55) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse38) (not (= (select v_prenex_795 (_ bv4 32)) (_ bv0 32))) (= .cse38 |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse36 .cse37 v_prenex_796) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse38))))) (not (= (_ bv0 1) (select |c_#valid| .cse37))) (forall ((v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse37 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32))))))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_796 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57))) (let ((.cse39 (select (select (store .cse41 .cse42 v_arrayElimArr_55) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse40 (select (select (store .cse41 .cse42 v_prenex_795) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (= .cse39 .cse40) (not (= (select v_prenex_795 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse41 .cse42 v_prenex_796) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse39) (= .cse40 |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select |c_#valid| .cse42))) (forall ((v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse42 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32))))))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_541 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56))) (let ((.cse45 (select (select (store .cse43 .cse44 v_prenex_541) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= (select (select (store .cse43 .cse44 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse45) (not (= (_ bv0 32) (select v_prenex_541 (_ bv4 32)))) (not (= .cse45 .cse44)))))) (forall ((v_prenex_543 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_543 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57) .cse44 v_prenex_543) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| .cse44)))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse49 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_541 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56))) (let ((.cse46 (select (select (store .cse48 .cse49 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse47 (select (select (store .cse48 .cse49 v_prenex_541) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse46 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32)))) (= .cse46 .cse47) (= .cse47 |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57) .cse49 v_arrayElimArr_55) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (not (= (select v_arrayElimArr_55 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse49)))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse51 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse51 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse50 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32)))) (= .cse50 |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (_ bv0 1) (select |c_#valid| .cse51)))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse54 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_796 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse53 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57))) (let ((.cse52 (select (select (store .cse53 .cse54 v_arrayElimArr_55) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse52 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (not (= (select v_arrayElimArr_55 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse53 .cse54 v_prenex_796) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse52))))) (not (= (_ bv0 1) (select |c_#valid| .cse54))) (forall ((v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse54 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32))))))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_541 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse57 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56))) (let ((.cse55 (select (select (store .cse57 .cse58 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse56 (select (select (store .cse57 .cse58 v_prenex_541) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse55 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32)))) (= .cse55 .cse56) (= .cse55 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse56 |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (_ bv0 1) (select |c_#valid| .cse58)))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse60 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse59 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse60 v_arrayElimArr_54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse59 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_54 (_ bv4 32)))) (not (= .cse59 .cse60))))) (not (= (_ bv0 1) (select |c_#valid| .cse60)))))) (forall ((v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse61 (select v_arrayElimArr_56 .cse3))) (or (forall ((v_prenex_543 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_543 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57) .cse61 v_prenex_543) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (forall ((v_prenex_541 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_56) .cse61 v_prenex_541) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_prenex_541 (_ bv4 32)))) (not (= .cse62 .cse61)) (= .cse62 |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (_ bv0 1) (select |c_#valid| .cse61)))))) (forall ((v_prenex_543 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_422 (_ BitVec 32)) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57) v_arrayElimCell_422 v_prenex_543) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_prenex_543 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_422))) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse63) (= (_ bv0 32) .cse63)))))) is different from true [2024-11-09 04:45:43,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:43,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 195 treesize of output 135 [2024-11-09 04:45:43,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:43,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3163 treesize of output 2868 [2024-11-09 04:45:43,535 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 8 treesize of output 4 [2024-11-09 04:45:43,569 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 63 treesize of output 47 [2024-11-09 04:45:43,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:43,721 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 84 treesize of output 66 [2024-11-09 04:45:43,755 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 47 treesize of output 31 [2024-11-09 04:45:43,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:43,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 29 treesize of output 30 [2024-11-09 04:45:43,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:45:43,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 12 [2024-11-09 04:45:44,129 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 04:45:44,130 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 14 treesize of output 11 [2024-11-09 04:45:44,188 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 19 treesize of output 11 [2024-11-09 04:45:44,338 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:45:44,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 140 treesize of output 1 [2024-11-09 04:45:44,399 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:45:44,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 85 treesize of output 1 [2024-11-09 04:45:44,462 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:45:44,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 90 treesize of output 1 [2024-11-09 04:45:44,524 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:45:44,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 85 treesize of output 1 [2024-11-09 04:45:44,584 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:45:44,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 140 treesize of output 1 [2024-11-09 04:45:44,646 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:45:44,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 85 treesize of output 1 [2024-11-09 04:45:44,707 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:45:44,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 85 treesize of output 1 [2024-11-09 04:45:44,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:44,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 29 treesize of output 30 [2024-11-09 04:45:44,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:44,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 34 treesize of output 35 [2024-11-09 04:45:45,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:45,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 164 treesize of output 157 [2024-11-09 04:45:45,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:45,338 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 38 treesize of output 38 [2024-11-09 04:45:45,399 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:45:45,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:45,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 47 treesize of output 46 [2024-11-09 04:45:45,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:45,770 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 98 treesize of output 82 [2024-11-09 04:45:45,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:45,935 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 35 treesize of output 33 [2024-11-09 04:45:47,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:47,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 29 treesize of output 30 [2024-11-09 04:45:47,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:47,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 29 treesize of output 30 [2024-11-09 04:45:47,956 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:45:48,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:48,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 35 [2024-11-09 04:45:48,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:48,319 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 20 treesize of output 20 [2024-11-09 04:45:48,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:48,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 86 treesize of output 85 [2024-11-09 04:45:48,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:48,968 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 80 treesize of output 64 [2024-11-09 04:45:49,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:49,116 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 56 treesize of output 54 [2024-11-09 04:45:49,980 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:45:49,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 143 treesize of output 1 [2024-11-09 04:45:50,043 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:45:50,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 140 treesize of output 1 [2024-11-09 04:45:50,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:50,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 29 treesize of output 30 [2024-11-09 04:45:50,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:50,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 64 treesize of output 54 [2024-11-09 04:45:50,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:50,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 86 treesize of output 85 [2024-11-09 04:45:50,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:50,683 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 76 treesize of output 74 [2024-11-09 04:45:50,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:50,865 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 41 treesize of output 41 [2024-11-09 04:45:50,924 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:45:51,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:51,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 72 treesize of output 65 [2024-11-09 04:45:51,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:51,288 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 109 treesize of output 81 [2024-11-09 04:45:54,066 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:45:54,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 85 treesize of output 1 [2024-11-09 04:45:54,132 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:45:54,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 114 treesize of output 1 [2024-11-09 04:45:54,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:54,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 59 treesize of output 49 [2024-11-09 04:45:54,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:54,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 317 treesize of output 298 [2024-11-09 04:45:54,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:54,656 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 71 treesize of output 61 [2024-11-09 04:45:54,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:54,815 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 117 treesize of output 97 [2024-11-09 04:45:56,806 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:45:56,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 114 treesize of output 1 [2024-11-09 04:45:56,863 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:45:56,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 119 treesize of output 1 [2024-11-09 04:45:56,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:56,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 29 treesize of output 30 [2024-11-09 04:45:57,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:57,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 29 treesize of output 30 [2024-11-09 04:45:57,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:57,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 86 treesize of output 85 [2024-11-09 04:45:57,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:57,526 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 76 treesize of output 74 [2024-11-09 04:45:57,594 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:45:57,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:57,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 35 [2024-11-09 04:45:58,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:58,084 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 83 treesize of output 67 [2024-11-09 04:45:58,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:58,258 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 33 treesize of output 33 [2024-11-09 04:45:59,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:59,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 29 treesize of output 30 [2024-11-09 04:45:59,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:59,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 29 treesize of output 30 [2024-11-09 04:45:59,295 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:45:59,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:59,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 35 [2024-11-09 04:45:59,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:59,644 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 20 treesize of output 20 [2024-11-09 04:46:00,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:46:00,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 86 treesize of output 85 [2024-11-09 04:46:00,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:46:00,347 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 80 treesize of output 64 [2024-11-09 04:46:00,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:46:00,510 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 56 treesize of output 54 [2024-11-09 04:46:01,984 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:46:01,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 85 treesize of output 1 [2024-11-09 04:46:02,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:46:02,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 51 treesize of output 41 [2024-11-09 04:46:02,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:46:02,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 269 treesize of output 250 [2024-11-09 04:46:02,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:46:02,620 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 59 treesize of output 55 [2024-11-09 04:46:02,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:46:02,875 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 63 treesize of output 53 [2024-11-09 04:46:03,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:46:03,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 64 treesize of output 54 [2024-11-09 04:46:03,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:46:03,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 182 treesize of output 175 [2024-11-09 04:46:04,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:46:04,190 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 166 treesize of output 156 [2024-11-09 04:46:04,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:46:04,376 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 154 treesize of output 102 [2024-11-09 04:46:18,536 WARN L286 SmtUtils]: Spent 5.66s on a formula simplification. DAG size of input: 163 DAG size of output: 160 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 04:46:55,379 WARN L286 SmtUtils]: Spent 11.50s on a formula simplification that was a NOOP. DAG size: 226 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 04:47:20,622 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-09 04:47:20,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1459529124] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:47:20,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066504743] [2024-11-09 04:47:20,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 04:47:20,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:47:20,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:47:20,626 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:47:20,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf2c798a-3962-40d2-8b02-480315213455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-09 04:47:21,324 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 04:47:21,324 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:47:21,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-09 04:47:21,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:47:21,376 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 7 [2024-11-09 04:47:22,603 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 04:47:22,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-09 04:47:23,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-09 04:47:23,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-11-09 04:47:24,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-09 04:47:24,673 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 04:47:24,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 15 [2024-11-09 04:47:25,097 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 04:47:25,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 35 treesize of output 26 [2024-11-09 04:47:25,576 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-09 04:47:25,577 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 24 treesize of output 26 [2024-11-09 04:47:27,544 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-11-09 04:47:27,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 89 [2024-11-09 04:47:27,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-11-09 04:47:28,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 27 treesize of output 22 [2024-11-09 04:47:29,974 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2024-11-09 04:47:29,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 84 [2024-11-09 04:47:30,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:47:30,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 41 [2024-11-09 04:47:30,175 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 16 treesize of output 15 [2024-11-09 04:47:30,436 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 16 treesize of output 15 [2024-11-09 04:47:30,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-09 04:47:32,262 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2024-11-09 04:47:32,263 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 46 [2024-11-09 04:47:32,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 04:47:33,961 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:47:33,961 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:47:34,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:47:34,903 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 72 [2024-11-09 04:47:35,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:47:35,003 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 62 [2024-11-09 04:47:48,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:47:48,496 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 191 [2024-11-09 04:47:49,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:47:49,634 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 930 treesize of output 961 [2024-11-09 04:47:49,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:47:49,750 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 584 treesize of output 548 [2024-11-09 04:47:49,806 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 539 treesize of output 503 [2024-11-09 04:47:49,856 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 503 treesize of output 467 [2024-11-09 04:47:57,359 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 21 treesize of output 3 [2024-11-09 04:47:57,725 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 21 treesize of output 3 [2024-11-09 04:48:00,807 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 358 treesize of output 322 [2024-11-09 04:48:01,611 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 21 treesize of output 3 [2024-11-09 04:48:02,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:48:02,451 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 421 treesize of output 470 [2024-11-09 04:48:16,263 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 358 treesize of output 322 [2024-11-09 04:48:16,955 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 358 treesize of output 322 [2024-11-09 04:48:17,208 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 21 treesize of output 3 [2024-11-09 04:48:17,969 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 379 treesize of output 325 [2024-11-09 04:48:18,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:48:18,671 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 445 treesize of output 494 [2024-11-09 04:48:26,619 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 358 treesize of output 322 [2024-11-09 04:48:27,068 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 358 treesize of output 322 [2024-11-09 04:48:27,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:48:27,730 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 445 treesize of output 494 [2024-11-09 04:48:34,144 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 160 treesize of output 142 [2024-11-09 04:48:35,254 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 160 treesize of output 142 [2024-11-09 04:48:35,577 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 21 treesize of output 3 [2024-11-09 04:48:36,182 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 21 treesize of output 3 [2024-11-09 04:48:36,598 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 358 treesize of output 322 [2024-11-09 04:48:36,655 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 21 treesize of output 3 [2024-11-09 04:48:36,933 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 21 treesize of output 3 [2024-11-09 04:48:37,001 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 181 treesize of output 145 [2024-11-09 04:48:37,226 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 21 treesize of output 3 [2024-11-09 04:48:37,261 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:48:37,262 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:48:37,266 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:48:37,273 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:48:37,603 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 160 treesize of output 142 [2024-11-09 04:48:38,512 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 160 treesize of output 142 [2024-11-09 04:48:39,019 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 160 treesize of output 142 [2024-11-09 04:48:39,745 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 160 treesize of output 142 [2024-11-09 04:48:39,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2024-11-09 04:48:40,119 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 181 treesize of output 145 [2024-11-09 04:48:43,488 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 8 treesize of output 4 [2024-11-09 04:48:43,857 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 8 treesize of output 4 [2024-11-09 04:48:50,052 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 8 treesize of output 4 [2024-11-09 04:49:01,548 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 49 treesize of output 37 [2024-11-09 04:49:09,145 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_89 .cse3))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse0 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 1) (select |c_#valid| .cse0))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse0 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= .cse2 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse2 .cse0)))))))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1265 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1264 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse4 (select (select (store .cse6 .cse7 v_prenex_1264) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse5 (select (select (store .cse6 .cse7 v_prenex_1021) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse4 .cse5) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (not (= .cse4 .cse3)) (not (= (_ bv0 32) (select v_prenex_1264 (_ bv4 32)))) (= (select (select (store .cse6 .cse7 v_prenex_1265) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse5))))) (not (= (_ bv0 1) (select |c_#valid| .cse7))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse9 (select (select (store .cse10 .cse7 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse8 (select (select (store .cse10 .cse7 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= .cse8 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse9 (_ bv0 32)) (= .cse9 .cse8)))))))) (forall ((v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select v_arrayElimArr_89 .cse3))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse11 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 1) (select |c_#valid| .cse11))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse12 (select (select (store .cse13 .cse11 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= .cse12 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse13 .cse11 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse12) (not (= .cse12 .cse11))))))))))) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1344 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1345 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse14 (select (select (store .cse15 .cse16 v_prenex_1344) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= .cse14 |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse15 .cse16 v_prenex_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse14) (not (= (_ bv0 32) (select v_prenex_1344 (_ bv4 32)))))))) (not (= (_ bv0 1) (select |c_#valid| .cse16))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse16 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32))))))) (forall ((v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select v_arrayElimArr_89 .cse3))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse17 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 1) (select |c_#valid| .cse17))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse18 (select (select (store .cse19 .cse17 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= .cse18 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select (store .cse19 .cse17 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse18) (not (= .cse18 .cse17))))))))))) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select v_arrayElimArr_89 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse20))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse22 (select (select (store .cse23 .cse20 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse21 (select (select (store .cse23 .cse20 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= .cse21 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse22 (_ bv0 32)) (= .cse22 .cse21))))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1264 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse24 (select (select (store .cse25 .cse20 v_prenex_1264) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse24 (select (select (store .cse25 .cse20 v_prenex_1021) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (not (= .cse24 .cse3)) (not (= (_ bv0 32) (select v_prenex_1264 (_ bv4 32))))))))))) (forall ((v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (select v_arrayElimArr_89 .cse3))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse26 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 1) (select |c_#valid| .cse26))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse26 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))))) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select v_arrayElimArr_89 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse27))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1344 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1345 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse28 (select (select (store .cse29 .cse27 v_prenex_1344) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= .cse28 |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse29 .cse27 v_prenex_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse28) (= .cse28 (select (select (store .cse29 .cse27 v_prenex_1021) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_prenex_1344 (_ bv4 32)))))))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse27 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (select v_arrayElimArr_89 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse30))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse32 (select (select (store .cse33 .cse30 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse31 (select (select (store .cse33 .cse30 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= .cse31 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse32 (_ bv0 32)) (= .cse32 .cse31))))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1265 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1264 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse34 (select (select (store .cse35 .cse30 v_prenex_1264) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse34 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= .cse34 (select (select (store .cse35 .cse30 v_prenex_1265) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_prenex_1264 (_ bv4 32))))))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1265 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1264 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse36 (select (select (store .cse38 .cse39 v_prenex_1264) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse37 (select (select (store .cse38 .cse39 v_prenex_1021) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse36 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse36 .cse37) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (not (= (_ bv0 32) (select v_prenex_1264 (_ bv4 32)))) (= (select (select (store .cse38 .cse39 v_prenex_1265) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse37))))) (not (= (_ bv0 1) (select |c_#valid| .cse39))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse41 (select (select (store .cse42 .cse39 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse40 (select (select (store .cse42 .cse39 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= .cse40 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse41 (_ bv0 32)) (= .cse41 .cse40)))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse43 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))))) (not (= (_ bv0 1) (select |c_#valid| .cse43))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse43 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= .cse44 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse44 .cse43)))))))) (forall ((v_arrayElimCell_565 (_ BitVec 32)) (v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse45 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) v_arrayElimCell_565 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= (_ bv0 32) .cse45) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_565))) (= .cse45 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse46 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89)) (.cse47 (select v_arrayElimArr_89 .cse3))) (or (= (select (select (store .cse46 .cse47 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse47))) (forall ((v_prenex_1386 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1387 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse49 (select (select (store .cse48 .cse47 v_prenex_1386) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= (select (select (store .cse48 .cse47 v_prenex_1387) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse49) (not (= (_ bv0 32) (select v_prenex_1386 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse49))))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= (select (select (store .cse46 .cse47 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1264 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse50 v_prenex_1264) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (not (= (_ bv0 32) (select v_prenex_1264 (_ bv4 32)))))) (not (= (_ bv0 1) (select |c_#valid| .cse50))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse53 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse52 (select (select (store .cse53 .cse50 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse51 (select (select (store .cse53 .cse50 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= .cse51 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse52 (_ bv0 32)) (= .cse52 .cse51)))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse55 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89)) (.cse54 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse54 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))))) (not (= (_ bv0 1) (select |c_#valid| .cse54))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse55 .cse54 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse55 .cse54 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse56 (select v_arrayElimArr_89 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse56))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1344 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse57 (select (select (store .cse58 .cse56 v_prenex_1344) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= .cse57 (select (select (store .cse58 .cse56 v_prenex_1021) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= .cse57 .cse3)) (not (= (_ bv0 32) (select v_prenex_1344 (_ bv4 32)))))))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse56 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32))))))) (forall ((v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse59 (select v_arrayElimArr_89 .cse3))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse59 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse61 (select (select (store .cse62 .cse59 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse60 (select (select (store .cse62 .cse59 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= .cse60 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse61 .cse60) (not (= .cse60 .cse59))))) (= .cse61 |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (_ bv0 1) (select |c_#valid| .cse59)))))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))))))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89)) (.cse64 (select v_arrayElimArr_89 .cse3))) (or (= (select (select (store .cse63 .cse64 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse64))) (forall ((v_prenex_1386 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_1386 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse64 v_prenex_1386) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= (select (select (store .cse63 .cse64 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32))))))) (forall ((v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse67 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89)) (.cse65 (select v_arrayElimArr_89 .cse3))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse65 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 1) (select |c_#valid| .cse65))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse66 (select (select (store .cse67 .cse65 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= .cse66 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse66 .cse65))))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse67 .cse65 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse68 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1344 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse68 v_prenex_1344) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_1344 (_ bv4 32)))))) (not (= (_ bv0 1) (select |c_#valid| .cse68))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse68 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse69 (select v_arrayElimArr_89 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse69))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse72 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse71 (select (select (store .cse72 .cse69 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse70 (select (select (store .cse72 .cse69 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= .cse70 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse71 (_ bv0 32)) (= .cse71 .cse70))))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1265 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1264 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse74 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse73 (select (select (store .cse74 .cse69 v_prenex_1264) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse73 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse73 (select (select (store .cse74 .cse69 v_prenex_1021) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= .cse73 (select (select (store .cse74 .cse69 v_prenex_1265) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_prenex_1264 (_ bv4 32))))))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse76 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89)) (.cse75 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse75 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))))) (not (= (_ bv0 1) (select |c_#valid| .cse75))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse76 .cse75 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse77 (select (select (store .cse76 .cse75 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= .cse77 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (not (= .cse77 .cse75)))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse78 (select v_arrayElimArr_89 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse78))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse78 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1344 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1345 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse79 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse80 (select (select (store .cse79 .cse78 v_prenex_1344) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= (select (select (store .cse79 .cse78 v_prenex_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse80) (not (= .cse80 .cse3)) (not (= (_ bv0 32) (select v_prenex_1344 (_ bv4 32))))))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse81 (select v_arrayElimArr_89 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse81))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse82 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse81 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (not (= .cse82 .cse81)) (= .cse82 (_ bv0 32)))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse85 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1344 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse84 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse83 (select (select (store .cse84 .cse85 v_prenex_1344) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= .cse83 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse83 (select (select (store .cse84 .cse85 v_prenex_1021) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_prenex_1344 (_ bv4 32)))))))) (not (= (_ bv0 1) (select |c_#valid| .cse85))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse85 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse86 (select v_arrayElimArr_89 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse86))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse89 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse88 (select (select (store .cse89 .cse86 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse87 (select (select (store .cse89 .cse86 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= .cse87 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse88 (_ bv0 32)) (= .cse88 .cse87))))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_1021 (_ bv4 32)) (_ bv0 32))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse86 v_prenex_1021) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse90 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse90 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))))) (not (= (_ bv0 1) (select |c_#valid| .cse90))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse90 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse91 (select v_arrayElimArr_89 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse91))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse92 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse91 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse92 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= .cse92 (_ bv0 32)))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse96 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse95 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse93 (select (select (store .cse95 .cse96 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse94 (select (select (store .cse95 .cse96 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse93 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= .cse94 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse93 (_ bv0 32)) (= .cse93 .cse94))))) (not (= (_ bv0 1) (select |c_#valid| .cse96)))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse97 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1264 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse97 v_prenex_1264) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse3)) (not (= (_ bv0 32) (select v_prenex_1264 (_ bv4 32)))))) (not (= (_ bv0 1) (select |c_#valid| .cse97))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse100 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse99 (select (select (store .cse100 .cse97 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse98 (select (select (store .cse100 .cse97 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= .cse98 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse99 (_ bv0 32)) (= .cse99 .cse98)))))))) (forall ((v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse101 (select v_arrayElimArr_89 .cse3))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse101 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 1) (select |c_#valid| .cse101))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse102 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse101 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= .cse102 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (not (= .cse102 .cse101)))))))))) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))))) (forall ((v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse103 (select v_arrayElimArr_89 .cse3))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse103 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 1) (select |c_#valid| .cse103))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse105 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse104 (select (select (store .cse105 .cse103 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= .cse104 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select (store .cse105 .cse103 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse104)))))))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse106 (select v_arrayElimArr_89 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse106))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse109 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse108 (select (select (store .cse109 .cse106 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse107 (select (select (store .cse109 .cse106 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= .cse107 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse108 (_ bv0 32)) (= .cse108 .cse107))))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1264 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse111 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse110 (select (select (store .cse111 .cse106 v_prenex_1264) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse110 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse110 (select (select (store .cse111 .cse106 v_prenex_1021) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (not (= (_ bv0 32) (select v_prenex_1264 (_ bv4 32))))))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse112 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse112 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))))) (not (= (_ bv0 1) (select |c_#valid| .cse112))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse114 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse113 (select (select (store .cse114 .cse112 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= .cse113 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select (store .cse114 .cse112 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse113)))))))) (forall ((v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse118 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse117 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse115 (select (select (store .cse117 .cse118 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse115 |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse116 (select (select (store .cse117 .cse118 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= .cse116 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse115 .cse116)))))))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse118 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 1) (select |c_#valid| .cse118)))))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse119 (select v_arrayElimArr_89 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse119))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_1021 (_ bv4 32)) (_ bv0 32))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse119 v_prenex_1021) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse119 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32))))))) (forall ((v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse121 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89)) (.cse120 (select v_arrayElimArr_89 .cse3))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse120 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 1) (select |c_#valid| .cse120))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse121 .cse120 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse121 .cse120 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|))))))) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse124 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89)) (.cse122 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse122 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))))) (not (= (_ bv0 1) (select |c_#valid| .cse122))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse123 (select (select (store .cse124 .cse122 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= .cse123 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse123 .cse122))))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse124 .cse122 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse126 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1344 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse125 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse127 (select (select (store .cse125 .cse126 v_prenex_1021) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_prenex_1021 (_ bv4 32)) (_ bv0 32))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= (select (select (store .cse125 .cse126 v_prenex_1344) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse127) (= .cse127 |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select |c_#valid| .cse126))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse126 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32))))))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse128 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89)) (.cse129 (select v_arrayElimArr_89 .cse3))) (or (= (select (select (store .cse128 .cse129 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse129))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1387 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse131 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse130 (select (select (store .cse131 .cse129 v_prenex_1021) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_prenex_1021 (_ bv4 32)) (_ bv0 32))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= .cse130 (select (select (store .cse131 .cse129 v_prenex_1387) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (= .cse130 |c_ULTIMATE.start_main_~p~0#1.offset|))))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= (select (select (store .cse128 .cse129 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse132 (select v_arrayElimArr_89 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse132))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse135 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse134 (select (select (store .cse135 .cse132 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse133 (select (select (store .cse135 .cse132 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= .cse133 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse134 (_ bv0 32)) (= .cse134 .cse133))))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1265 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1264 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse137 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse136 (select (select (store .cse137 .cse132 v_prenex_1264) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (not (= .cse136 .cse3)) (= .cse136 (select (select (store .cse137 .cse132 v_prenex_1265) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_prenex_1264 (_ bv4 32))))))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse138 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse138 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse141 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse139 (select (select (store .cse141 .cse138 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse140 (select (select (store .cse141 .cse138 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= .cse139 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse140 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse139 .cse140))))) (not (= (_ bv0 1) (select |c_#valid| .cse138)))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse142 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1344 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse142 v_prenex_1344) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse3)) (not (= (_ bv0 32) (select v_prenex_1344 (_ bv4 32)))))) (not (= (_ bv0 1) (select |c_#valid| .cse142))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse142 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32))))))))) is different from false [2024-11-09 04:49:11,470 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_89 .cse3))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse0 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 1) (select |c_#valid| .cse0))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse0 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= .cse2 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse2 .cse0)))))))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1265 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1264 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse4 (select (select (store .cse6 .cse7 v_prenex_1264) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse5 (select (select (store .cse6 .cse7 v_prenex_1021) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse4 .cse5) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (not (= .cse4 .cse3)) (not (= (_ bv0 32) (select v_prenex_1264 (_ bv4 32)))) (= (select (select (store .cse6 .cse7 v_prenex_1265) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse5))))) (not (= (_ bv0 1) (select |c_#valid| .cse7))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse9 (select (select (store .cse10 .cse7 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse8 (select (select (store .cse10 .cse7 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= .cse8 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse9 (_ bv0 32)) (= .cse9 .cse8)))))))) (forall ((v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select v_arrayElimArr_89 .cse3))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse11 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 1) (select |c_#valid| .cse11))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse12 (select (select (store .cse13 .cse11 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= .cse12 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse13 .cse11 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse12) (not (= .cse12 .cse11))))))))))) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1344 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1345 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse14 (select (select (store .cse15 .cse16 v_prenex_1344) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= .cse14 |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse15 .cse16 v_prenex_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse14) (not (= (_ bv0 32) (select v_prenex_1344 (_ bv4 32)))))))) (not (= (_ bv0 1) (select |c_#valid| .cse16))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse16 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32))))))) (forall ((v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select v_arrayElimArr_89 .cse3))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse17 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 1) (select |c_#valid| .cse17))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse18 (select (select (store .cse19 .cse17 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= .cse18 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select (store .cse19 .cse17 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse18) (not (= .cse18 .cse17))))))))))) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select v_arrayElimArr_89 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse20))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse22 (select (select (store .cse23 .cse20 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse21 (select (select (store .cse23 .cse20 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= .cse21 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse22 (_ bv0 32)) (= .cse22 .cse21))))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1264 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse24 (select (select (store .cse25 .cse20 v_prenex_1264) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse24 (select (select (store .cse25 .cse20 v_prenex_1021) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (not (= .cse24 .cse3)) (not (= (_ bv0 32) (select v_prenex_1264 (_ bv4 32))))))))))) (forall ((v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (select v_arrayElimArr_89 .cse3))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse26 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 1) (select |c_#valid| .cse26))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse26 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))))) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select v_arrayElimArr_89 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse27))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1344 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1345 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse28 (select (select (store .cse29 .cse27 v_prenex_1344) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= .cse28 |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse29 .cse27 v_prenex_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse28) (= .cse28 (select (select (store .cse29 .cse27 v_prenex_1021) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_prenex_1344 (_ bv4 32)))))))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse27 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (select v_arrayElimArr_89 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse30))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse32 (select (select (store .cse33 .cse30 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse31 (select (select (store .cse33 .cse30 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= .cse31 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse32 (_ bv0 32)) (= .cse32 .cse31))))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1265 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1264 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse34 (select (select (store .cse35 .cse30 v_prenex_1264) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse34 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= .cse34 (select (select (store .cse35 .cse30 v_prenex_1265) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_prenex_1264 (_ bv4 32))))))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1265 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1264 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse36 (select (select (store .cse38 .cse39 v_prenex_1264) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse37 (select (select (store .cse38 .cse39 v_prenex_1021) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse36 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse36 .cse37) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (not (= (_ bv0 32) (select v_prenex_1264 (_ bv4 32)))) (= (select (select (store .cse38 .cse39 v_prenex_1265) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse37))))) (not (= (_ bv0 1) (select |c_#valid| .cse39))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse41 (select (select (store .cse42 .cse39 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse40 (select (select (store .cse42 .cse39 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= .cse40 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse41 (_ bv0 32)) (= .cse41 .cse40)))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse43 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))))) (not (= (_ bv0 1) (select |c_#valid| .cse43))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse43 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= .cse44 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse44 .cse43)))))))) (forall ((v_arrayElimCell_565 (_ BitVec 32)) (v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse45 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) v_arrayElimCell_565 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= (_ bv0 32) .cse45) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_565))) (= .cse45 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse46 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89)) (.cse47 (select v_arrayElimArr_89 .cse3))) (or (= (select (select (store .cse46 .cse47 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse47))) (forall ((v_prenex_1386 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1387 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse49 (select (select (store .cse48 .cse47 v_prenex_1386) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= (select (select (store .cse48 .cse47 v_prenex_1387) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse49) (not (= (_ bv0 32) (select v_prenex_1386 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse49))))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= (select (select (store .cse46 .cse47 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1264 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse50 v_prenex_1264) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (not (= (_ bv0 32) (select v_prenex_1264 (_ bv4 32)))))) (not (= (_ bv0 1) (select |c_#valid| .cse50))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse53 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse52 (select (select (store .cse53 .cse50 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse51 (select (select (store .cse53 .cse50 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= .cse51 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse52 (_ bv0 32)) (= .cse52 .cse51)))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse55 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89)) (.cse54 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse54 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))))) (not (= (_ bv0 1) (select |c_#valid| .cse54))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse55 .cse54 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse55 .cse54 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse56 (select v_arrayElimArr_89 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse56))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1344 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse57 (select (select (store .cse58 .cse56 v_prenex_1344) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= .cse57 (select (select (store .cse58 .cse56 v_prenex_1021) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= .cse57 .cse3)) (not (= (_ bv0 32) (select v_prenex_1344 (_ bv4 32)))))))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse56 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32))))))) (forall ((v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse59 (select v_arrayElimArr_89 .cse3))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse59 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse61 (select (select (store .cse62 .cse59 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse60 (select (select (store .cse62 .cse59 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= .cse60 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse61 .cse60) (not (= .cse60 .cse59))))) (= .cse61 |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (_ bv0 1) (select |c_#valid| .cse59)))))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))))))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89)) (.cse64 (select v_arrayElimArr_89 .cse3))) (or (= (select (select (store .cse63 .cse64 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse64))) (forall ((v_prenex_1386 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_1386 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse64 v_prenex_1386) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= (select (select (store .cse63 .cse64 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32))))))) (forall ((v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse67 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89)) (.cse65 (select v_arrayElimArr_89 .cse3))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse65 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 1) (select |c_#valid| .cse65))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse66 (select (select (store .cse67 .cse65 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= .cse66 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse66 .cse65))))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse67 .cse65 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse68 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1344 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse68 v_prenex_1344) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_1344 (_ bv4 32)))))) (not (= (_ bv0 1) (select |c_#valid| .cse68))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse68 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse69 (select v_arrayElimArr_89 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse69))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse72 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse71 (select (select (store .cse72 .cse69 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse70 (select (select (store .cse72 .cse69 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= .cse70 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse71 (_ bv0 32)) (= .cse71 .cse70))))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1265 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1264 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse74 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse73 (select (select (store .cse74 .cse69 v_prenex_1264) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse73 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse73 (select (select (store .cse74 .cse69 v_prenex_1021) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= .cse73 (select (select (store .cse74 .cse69 v_prenex_1265) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_prenex_1264 (_ bv4 32))))))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse76 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89)) (.cse75 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse75 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))))) (not (= (_ bv0 1) (select |c_#valid| .cse75))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse76 .cse75 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse77 (select (select (store .cse76 .cse75 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= .cse77 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (not (= .cse77 .cse75)))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse78 (select v_arrayElimArr_89 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse78))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse78 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32)))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1344 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1345 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse79 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse80 (select (select (store .cse79 .cse78 v_prenex_1344) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= (select (select (store .cse79 .cse78 v_prenex_1345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse80) (not (= .cse80 .cse3)) (not (= (_ bv0 32) (select v_prenex_1344 (_ bv4 32))))))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse81 (select v_arrayElimArr_89 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse81))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse82 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse81 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (not (= .cse82 .cse81)) (= .cse82 (_ bv0 32)))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse85 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1344 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse84 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse83 (select (select (store .cse84 .cse85 v_prenex_1344) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= .cse83 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse83 (select (select (store .cse84 .cse85 v_prenex_1021) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_prenex_1344 (_ bv4 32)))))))) (not (= (_ bv0 1) (select |c_#valid| .cse85))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse85 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse86 (select v_arrayElimArr_89 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse86))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse89 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse88 (select (select (store .cse89 .cse86 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse87 (select (select (store .cse89 .cse86 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= .cse87 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse88 (_ bv0 32)) (= .cse88 .cse87))))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_1021 (_ bv4 32)) (_ bv0 32))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse86 v_prenex_1021) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse90 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse90 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))))) (not (= (_ bv0 1) (select |c_#valid| .cse90))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse90 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse91 (select v_arrayElimArr_89 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse91))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse92 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse91 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse92 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= .cse92 (_ bv0 32)))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse96 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse95 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse93 (select (select (store .cse95 .cse96 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse94 (select (select (store .cse95 .cse96 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse93 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= .cse94 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse93 (_ bv0 32)) (= .cse93 .cse94))))) (not (= (_ bv0 1) (select |c_#valid| .cse96)))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse97 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1264 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse97 v_prenex_1264) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse3)) (not (= (_ bv0 32) (select v_prenex_1264 (_ bv4 32)))))) (not (= (_ bv0 1) (select |c_#valid| .cse97))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse100 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse99 (select (select (store .cse100 .cse97 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse98 (select (select (store .cse100 .cse97 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= .cse98 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse99 (_ bv0 32)) (= .cse99 .cse98)))))))) (forall ((v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse101 (select v_arrayElimArr_89 .cse3))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse101 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 1) (select |c_#valid| .cse101))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse102 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse101 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= .cse102 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (not (= .cse102 .cse101)))))))))) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))))) (forall ((v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse103 (select v_arrayElimArr_89 .cse3))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse103 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 1) (select |c_#valid| .cse103))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse105 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse104 (select (select (store .cse105 .cse103 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= .cse104 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select (store .cse105 .cse103 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse104)))))))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse106 (select v_arrayElimArr_89 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse106))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse109 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse108 (select (select (store .cse109 .cse106 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse107 (select (select (store .cse109 .cse106 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= .cse107 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse108 (_ bv0 32)) (= .cse108 .cse107))))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1264 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse111 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse110 (select (select (store .cse111 .cse106 v_prenex_1264) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse110 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse110 (select (select (store .cse111 .cse106 v_prenex_1021) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (not (= (_ bv0 32) (select v_prenex_1264 (_ bv4 32))))))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse112 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse112 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))))) (not (= (_ bv0 1) (select |c_#valid| .cse112))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse114 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse113 (select (select (store .cse114 .cse112 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= .cse113 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select (store .cse114 .cse112 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse113)))))))) (forall ((v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse118 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse117 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse115 (select (select (store .cse117 .cse118 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse115 |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse116 (select (select (store .cse117 .cse118 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= .cse116 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse115 .cse116)))))))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse118 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 1) (select |c_#valid| .cse118)))))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse119 (select v_arrayElimArr_89 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse119))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_prenex_1021 (_ bv4 32)) (_ bv0 32))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse119 v_prenex_1021) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse119 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32))))))) (forall ((v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse121 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89)) (.cse120 (select v_arrayElimArr_89 .cse3))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse120 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 1) (select |c_#valid| .cse120))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse121 .cse120 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse121 .cse120 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|))))))) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse124 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89)) (.cse122 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse122 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))))) (not (= (_ bv0 1) (select |c_#valid| .cse122))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse123 (select (select (store .cse124 .cse122 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= .cse123 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse123 .cse122))))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse124 .cse122 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse126 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1344 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse125 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse127 (select (select (store .cse125 .cse126 v_prenex_1021) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_prenex_1021 (_ bv4 32)) (_ bv0 32))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= (select (select (store .cse125 .cse126 v_prenex_1344) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse127) (= .cse127 |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select |c_#valid| .cse126))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse126 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32))))))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse128 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89)) (.cse129 (select v_arrayElimArr_89 .cse3))) (or (= (select (select (store .cse128 .cse129 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse129))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1387 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse131 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse130 (select (select (store .cse131 .cse129 v_prenex_1021) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_prenex_1021 (_ bv4 32)) (_ bv0 32))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (= .cse130 (select (select (store .cse131 .cse129 v_prenex_1387) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (= .cse130 |c_ULTIMATE.start_main_~p~0#1.offset|))))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= (select (select (store .cse128 .cse129 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse132 (select v_arrayElimArr_89 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse132))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse135 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse134 (select (select (store .cse135 .cse132 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse133 (select (select (store .cse135 .cse132 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= .cse133 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse134 (_ bv0 32)) (= .cse134 .cse133))))) (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1265 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1264 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse137 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90))) (let ((.cse136 (select (select (store .cse137 .cse132 v_prenex_1264) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (not (= .cse136 .cse3)) (= .cse136 (select (select (store .cse137 .cse132 v_prenex_1265) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_prenex_1264 (_ bv4 32))))))))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse138 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse138 v_arrayElimArr_28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse141 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89))) (let ((.cse139 (select (select (store .cse141 .cse138 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (.cse140 (select (select (store .cse141 .cse138 v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (= .cse139 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse140 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse139 .cse140))))) (not (= (_ bv0 1) (select |c_#valid| .cse138)))))) (forall ((v_arrayElimArr_89 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse142 (select v_arrayElimArr_89 .cse3))) (or (forall ((v_arrayElimArr_90 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_1344 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_90 .cse3))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_90) .cse142 v_prenex_1344) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse3)) (not (= (_ bv0 32) (select v_prenex_1344 (_ bv4 32)))))) (not (= (_ bv0 1) (select |c_#valid| .cse142))) (forall ((v_prenex_1020 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_1020 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_89) .cse142 v_prenex_1020) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv0 32))))))))) is different from true [2024-11-09 04:49:33,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:33,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 29 treesize of output 30 [2024-11-09 04:49:33,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:33,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 85 treesize of output 65 [2024-11-09 04:49:33,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:49:33,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 12 [2024-11-09 04:49:34,187 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 04:49:34,188 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 14 treesize of output 11 [2024-11-09 04:49:34,292 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 8 treesize of output 4 [2024-11-09 04:49:34,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:34,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 479 treesize of output 442 [2024-11-09 04:49:34,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:34,789 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 129 treesize of output 105 [2024-11-09 04:49:34,851 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 42 treesize of output 34 [2024-11-09 04:49:34,912 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:49:34,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 71 [2024-11-09 04:49:35,819 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:49:35,914 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:49:35,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 85 treesize of output 1 [2024-11-09 04:49:36,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:36,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 51 treesize of output 41 [2024-11-09 04:49:36,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:36,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 269 treesize of output 250 [2024-11-09 04:49:36,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:36,652 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 59 treesize of output 55 [2024-11-09 04:49:36,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:36,929 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 63 treesize of output 53 [2024-11-09 04:49:37,986 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:49:38,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:38,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 29 treesize of output 30 [2024-11-09 04:49:38,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:38,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 59 treesize of output 49 [2024-11-09 04:49:38,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:38,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 86 treesize of output 85 [2024-11-09 04:49:39,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:39,093 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 76 treesize of output 74 [2024-11-09 04:49:39,191 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:49:39,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:39,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 35 [2024-11-09 04:49:39,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:39,806 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 83 treesize of output 67 [2024-11-09 04:49:40,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:40,075 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 33 treesize of output 33 [2024-11-09 04:49:42,220 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:49:42,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 29 treesize of output 1 [2024-11-09 04:49:42,316 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:49:42,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 85 treesize of output 1 [2024-11-09 04:49:42,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:42,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 29 treesize of output 30 [2024-11-09 04:49:42,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:42,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 64 treesize of output 54 [2024-11-09 04:49:43,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:43,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 164 treesize of output 157 [2024-11-09 04:49:43,184 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:49:43,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:43,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 72 treesize of output 65 [2024-11-09 04:49:43,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:43,804 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 38 treesize of output 38 [2024-11-09 04:49:44,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:44,152 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 109 treesize of output 89 [2024-11-09 04:49:44,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:44,437 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 35 treesize of output 33 [2024-11-09 04:49:47,801 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:49:47,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:47,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 59 treesize of output 49 [2024-11-09 04:49:48,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:48,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 317 treesize of output 298 [2024-11-09 04:49:48,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:48,691 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 133 treesize of output 113 [2024-11-09 04:49:49,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:49,067 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 63 treesize of output 53 [2024-11-09 04:49:53,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:53,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 29 treesize of output 30 [2024-11-09 04:49:53,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:53,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 93 treesize of output 73 [2024-11-09 04:49:54,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:54,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 164 treesize of output 157 [2024-11-09 04:49:54,295 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:49:54,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:54,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 72 treesize of output 65 [2024-11-09 04:49:55,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:55,189 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 38 treesize of output 38 [2024-11-09 04:49:55,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:55,566 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 109 treesize of output 89 [2024-11-09 04:49:55,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:49:55,942 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 35 treesize of output 33 [2024-11-09 04:49:59,859 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:49:59,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 85 treesize of output 1 [2024-11-09 04:49:59,893 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:49:59,929 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:50:00,023 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:50:00,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 29 treesize of output 1 [2024-11-09 04:50:00,058 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:50:00,150 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:50:00,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 88 treesize of output 1 [2024-11-09 04:50:00,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:50:00,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 29 treesize of output 30 [2024-11-09 04:50:00,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:50:00,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 93 treesize of output 73 [2024-11-09 04:50:00,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:50:00,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 164 treesize of output 157 [2024-11-09 04:50:01,032 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:50:01,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:50:01,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 72 treesize of output 65 [2024-11-09 04:50:01,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:50:01,709 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 38 treesize of output 38 [2024-11-09 04:50:01,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:50:01,988 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 109 treesize of output 89 [2024-11-09 04:50:02,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:50:02,265 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 35 treesize of output 33 [2024-11-09 04:50:05,873 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:50:05,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 143 treesize of output 1 [2024-11-09 04:50:06,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:50:06,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 29 treesize of output 30 [2024-11-09 04:50:06,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:50:06,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 29 treesize of output 30 [2024-11-09 04:50:06,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:50:06,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 164 treesize of output 157 [2024-11-09 04:50:07,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:50:07,290 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 38 treesize of output 38 [2024-11-09 04:50:07,433 INFO L173 IndexEqualityManager]: detected equality via solver