/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/recursified_loop-invariants/recursified_linear-inequality-inv-a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 06:34:26,771 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 06:34:26,829 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 06:34:26,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 06:34:26,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 06:34:26,851 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 06:34:26,852 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 06:34:26,852 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 06:34:26,852 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 06:34:26,853 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 06:34:26,853 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 06:34:26,853 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 06:34:26,854 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 06:34:26,854 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 06:34:26,854 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 06:34:26,855 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 06:34:26,855 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 06:34:26,855 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 06:34:26,856 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 06:34:26,856 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 06:34:26,856 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 06:34:26,860 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 06:34:26,860 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 06:34:26,861 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 06:34:26,861 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 06:34:26,861 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 06:34:26,862 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 06:34:26,862 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 06:34:26,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 06:34:26,862 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 06:34:26,863 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 06:34:26,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 06:34:26,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 06:34:26,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 06:34:26,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:34:26,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 06:34:26,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 06:34:26,864 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 06:34:26,865 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 06:34:26,865 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 06:34:26,865 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 06:34:26,869 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 06:34:26,869 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 06:34:26,869 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 06:34:26,869 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 06:34:26,870 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 06:34:26,870 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 06:34:27,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 06:34:27,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 06:34:27,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 06:34:27,082 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 06:34:27,082 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 06:34:27,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursified_loop-invariants/recursified_linear-inequality-inv-a.c [2023-12-25 06:34:28,269 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 06:34:28,472 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 06:34:28,473 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-invariants/recursified_linear-inequality-inv-a.c [2023-12-25 06:34:28,478 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ac3c3ea4/1a883da79d664e8a8d1f571f4b049813/FLAG7ed950ee1 [2023-12-25 06:34:28,491 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ac3c3ea4/1a883da79d664e8a8d1f571f4b049813 [2023-12-25 06:34:28,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 06:34:28,494 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 06:34:28,497 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 06:34:28,497 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 06:34:28,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 06:34:28,502 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:34:28" (1/1) ... [2023-12-25 06:34:28,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20051c92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:34:28, skipping insertion in model container [2023-12-25 06:34:28,503 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:34:28" (1/1) ... [2023-12-25 06:34:28,522 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 06:34:28,668 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-invariants/recursified_linear-inequality-inv-a.c[1474,1487] [2023-12-25 06:34:28,672 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-invariants/recursified_linear-inequality-inv-a.c[1547,1560] [2023-12-25 06:34:28,674 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:34:28,684 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 06:34:28,698 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-invariants/recursified_linear-inequality-inv-a.c[1474,1487] [2023-12-25 06:34:28,699 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-invariants/recursified_linear-inequality-inv-a.c[1547,1560] [2023-12-25 06:34:28,700 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:34:28,712 INFO L206 MainTranslator]: Completed translation [2023-12-25 06:34:28,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:34:28 WrapperNode [2023-12-25 06:34:28,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 06:34:28,714 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 06:34:28,714 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 06:34:28,714 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 06:34:28,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:34:28" (1/1) ... [2023-12-25 06:34:28,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:34:28" (1/1) ... [2023-12-25 06:34:28,744 INFO L138 Inliner]: procedures = 16, calls = 46, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 79 [2023-12-25 06:34:28,744 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 06:34:28,745 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 06:34:28,745 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 06:34:28,745 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 06:34:28,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:34:28" (1/1) ... [2023-12-25 06:34:28,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:34:28" (1/1) ... [2023-12-25 06:34:28,756 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:34:28" (1/1) ... [2023-12-25 06:34:28,771 INFO L175 MemorySlicer]: Split 18 memory accesses to 5 slices as follows [2, 4, 4, 5, 3]. 28 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 1, 1, 1, 1]. The 3 writes are split as follows [0, 1, 1, 1, 0]. [2023-12-25 06:34:28,772 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:34:28" (1/1) ... [2023-12-25 06:34:28,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:34:28" (1/1) ... [2023-12-25 06:34:28,779 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:34:28" (1/1) ... [2023-12-25 06:34:28,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:34:28" (1/1) ... [2023-12-25 06:34:28,795 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:34:28" (1/1) ... [2023-12-25 06:34:28,796 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:34:28" (1/1) ... [2023-12-25 06:34:28,799 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 06:34:28,800 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 06:34:28,800 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 06:34:28,800 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 06:34:28,801 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:34:28" (1/1) ... [2023-12-25 06:34:28,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:34:28,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:34:28,833 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 06:34:28,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 06:34:28,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 06:34:28,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-25 06:34:28,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-25 06:34:28,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-25 06:34:28,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-25 06:34:28,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-12-25 06:34:28,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 06:34:28,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-25 06:34:28,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-25 06:34:28,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-25 06:34:28,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-25 06:34:28,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-25 06:34:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-25 06:34:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-12-25 06:34:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-12-25 06:34:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-12-25 06:34:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-25 06:34:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-25 06:34:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-25 06:34:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-25 06:34:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-25 06:34:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-12-25 06:34:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 06:34:28,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 06:34:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-25 06:34:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-25 06:34:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-25 06:34:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-25 06:34:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-12-25 06:34:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-25 06:34:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-25 06:34:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-25 06:34:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-25 06:34:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-25 06:34:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-12-25 06:34:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_12_to_15_0 [2023-12-25 06:34:28,867 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_12_to_15_0 [2023-12-25 06:34:28,958 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 06:34:28,960 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 06:34:29,154 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 06:34:29,187 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 06:34:29,187 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-25 06:34:29,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:34:29 BoogieIcfgContainer [2023-12-25 06:34:29,188 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 06:34:29,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 06:34:29,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 06:34:29,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 06:34:29,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 06:34:28" (1/3) ... [2023-12-25 06:34:29,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@488a00f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:34:29, skipping insertion in model container [2023-12-25 06:34:29,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:34:28" (2/3) ... [2023-12-25 06:34:29,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@488a00f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:34:29, skipping insertion in model container [2023-12-25 06:34:29,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:34:29" (3/3) ... [2023-12-25 06:34:29,195 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_linear-inequality-inv-a.c [2023-12-25 06:34:29,210 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 06:34:29,210 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-25 06:34:29,248 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 06:34:29,253 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@2c337b5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 06:34:29,253 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-25 06:34:29,256 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 06:34:29,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-25 06:34:29,263 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:34:29,263 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:34:29,264 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:34:29,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:34:29,268 INFO L85 PathProgramCache]: Analyzing trace with hash 947785726, now seen corresponding path program 1 times [2023-12-25 06:34:29,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:34:29,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256022560] [2023-12-25 06:34:29,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:34:29,279 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 [2023-12-25 06:34:29,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:34:29,284 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:34:29,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-25 06:34:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:34:29,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 06:34:29,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:34:29,538 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 17 treesize of output 9 [2023-12-25 06:34:29,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 06:34:29,562 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:34:29,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:34:29,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256022560] [2023-12-25 06:34:29,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256022560] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:34:29,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:34:29,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 06:34:29,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066827819] [2023-12-25 06:34:29,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:34:29,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 06:34:29,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:34:29,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 06:34:29,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 06:34:29,605 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 06:34:29,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:34:29,718 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2023-12-25 06:34:29,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 06:34:29,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-12-25 06:34:29,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:34:29,726 INFO L225 Difference]: With dead ends: 28 [2023-12-25 06:34:29,726 INFO L226 Difference]: Without dead ends: 22 [2023-12-25 06:34:29,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 06:34:29,732 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:34:29,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 39 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:34:29,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-25 06:34:29,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2023-12-25 06:34:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 06:34:29,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2023-12-25 06:34:29,761 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 10 [2023-12-25 06:34:29,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:34:29,762 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2023-12-25 06:34:29,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 06:34:29,762 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2023-12-25 06:34:29,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-25 06:34:29,763 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:34:29,763 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:34:29,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-25 06:34:29,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-25 06:34:29,967 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:34:29,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:34:29,968 INFO L85 PathProgramCache]: Analyzing trace with hash -683409516, now seen corresponding path program 1 times [2023-12-25 06:34:29,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:34:29,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061788586] [2023-12-25 06:34:29,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:34:29,969 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 [2023-12-25 06:34:29,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:34:29,970 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:34:30,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-25 06:34:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:34:30,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 06:34:30,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:34:30,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 06:34:30,122 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:34:30,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:34:30,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061788586] [2023-12-25 06:34:30,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061788586] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:34:30,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:34:30,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 06:34:30,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140346049] [2023-12-25 06:34:30,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:34:30,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 06:34:30,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:34:30,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 06:34:30,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 06:34:30,128 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 06:34:30,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:34:30,214 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2023-12-25 06:34:30,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 06:34:30,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-12-25 06:34:30,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:34:30,215 INFO L225 Difference]: With dead ends: 22 [2023-12-25 06:34:30,215 INFO L226 Difference]: Without dead ends: 17 [2023-12-25 06:34:30,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 06:34:30,217 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:34:30,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 34 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:34:30,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-25 06:34:30,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-25 06:34:30,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 06:34:30,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2023-12-25 06:34:30,223 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2023-12-25 06:34:30,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:34:30,223 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2023-12-25 06:34:30,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 06:34:30,223 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2023-12-25 06:34:30,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-25 06:34:30,224 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:34:30,224 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:34:30,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-25 06:34:30,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-25 06:34:30,425 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:34:30,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:34:30,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1341401249, now seen corresponding path program 1 times [2023-12-25 06:34:30,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:34:30,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213562104] [2023-12-25 06:34:30,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:34:30,427 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 [2023-12-25 06:34:30,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:34:30,429 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:34:30,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-25 06:34:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:34:30,517 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 06:34:30,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:34:30,679 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 25 treesize of output 17 [2023-12-25 06:34:30,718 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 22 treesize of output 14 [2023-12-25 06:34:30,723 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 17 treesize of output 9 [2023-12-25 06:34:30,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 06:34:30,765 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:34:31,028 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 22 treesize of output 14 [2023-12-25 06:34:31,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:34:31,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213562104] [2023-12-25 06:34:31,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [213562104] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:34:31,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1211952755] [2023-12-25 06:34:31,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:34:31,066 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:34:31,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:34:31,106 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:34:31,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-12-25 06:34:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:34:31,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 06:34:31,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:34:31,352 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 12 treesize of output 8 [2023-12-25 06:34:31,486 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 25 treesize of output 17 [2023-12-25 06:34:31,558 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 30 treesize of output 18 [2023-12-25 06:34:31,565 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 10 [2023-12-25 06:34:31,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 06:34:31,603 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:34:31,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1211952755] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:34:31,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:34:31,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2023-12-25 06:34:31,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953441889] [2023-12-25 06:34:31,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:34:31,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-25 06:34:31,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:34:31,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-25 06:34:31,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-12-25 06:34:31,950 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 06:34:32,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:34:32,422 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2023-12-25 06:34:32,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 06:34:32,424 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 15 [2023-12-25 06:34:32,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:34:32,424 INFO L225 Difference]: With dead ends: 30 [2023-12-25 06:34:32,425 INFO L226 Difference]: Without dead ends: 26 [2023-12-25 06:34:32,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2023-12-25 06:34:32,426 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 06:34:32,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 51 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 06:34:32,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-25 06:34:32,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2023-12-25 06:34:32,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 06:34:32,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2023-12-25 06:34:32,459 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2023-12-25 06:34:32,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:34:32,460 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2023-12-25 06:34:32,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 06:34:32,465 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2023-12-25 06:34:32,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-25 06:34:32,466 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:34:32,466 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:34:32,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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)] Forceful destruction successful, exit code 0 [2023-12-25 06:34:32,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2023-12-25 06:34:32,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 06:34:32,870 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:34:32,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:34:32,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1366238291, now seen corresponding path program 1 times [2023-12-25 06:34:32,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:34:32,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553620366] [2023-12-25 06:34:32,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:34:32,872 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 [2023-12-25 06:34:32,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:34:32,873 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:34:32,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (6)] Waiting until timeout for monitored process [2023-12-25 06:34:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:34:32,951 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 06:34:32,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:34:32,990 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 23 treesize of output 19 [2023-12-25 06:34:32,998 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_9 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_9)))))))) is different from true [2023-12-25 06:34:33,024 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 21 treesize of output 13 [2023-12-25 06:34:33,045 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 17 treesize of output 9 [2023-12-25 06:34:33,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-12-25 06:34:33,062 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:34:33,192 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 12 [2023-12-25 06:34:33,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:34:33,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1553620366] [2023-12-25 06:34:33,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1553620366] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:34:33,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1415286431] [2023-12-25 06:34:33,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:34:33,221 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:34:33,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:34:33,225 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:34:33,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-25 06:34:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:34:33,364 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 06:34:33,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:34:33,406 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 23 treesize of output 19 [2023-12-25 06:34:33,415 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_13 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_13)))))))) is different from true [2023-12-25 06:34:33,451 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 21 treesize of output 13 [2023-12-25 06:34:33,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 17 treesize of output 9 [2023-12-25 06:34:33,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-12-25 06:34:33,500 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:34:33,596 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 12 [2023-12-25 06:34:33,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1415286431] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:34:33,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:34:33,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2023-12-25 06:34:33,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993745995] [2023-12-25 06:34:33,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:34:33,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 06:34:33,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:34:33,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 06:34:33,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=97, Unknown=2, NotChecked=42, Total=182 [2023-12-25 06:34:33,624 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 11 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 06:34:33,695 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_13 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_13))))))) (exists ((v_arrayElimCell_9 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_9)))))))))) is different from true [2023-12-25 06:34:33,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:34:33,738 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2023-12-25 06:34:33,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 06:34:33,738 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 11 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 16 [2023-12-25 06:34:33,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:34:33,739 INFO L225 Difference]: With dead ends: 26 [2023-12-25 06:34:33,739 INFO L226 Difference]: Without dead ends: 21 [2023-12-25 06:34:33,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=114, Unknown=3, NotChecked=72, Total=240 [2023-12-25 06:34:33,741 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:34:33,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 53 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 77 Unchecked, 0.1s Time] [2023-12-25 06:34:33,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-25 06:34:33,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-25 06:34:33,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 06:34:33,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2023-12-25 06:34:33,746 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2023-12-25 06:34:33,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:34:33,746 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2023-12-25 06:34:33,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 11 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 06:34:33,746 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2023-12-25 06:34:33,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-25 06:34:33,747 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:34:33,747 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:34:33,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2023-12-25 06:34:33,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (6)] Forceful destruction successful, exit code 0 [2023-12-25 06:34:34,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-25 06:34:34,151 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:34:34,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:34:34,151 INFO L85 PathProgramCache]: Analyzing trace with hash 2114283542, now seen corresponding path program 2 times [2023-12-25 06:34:34,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:34:34,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2019409816] [2023-12-25 06:34:34,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:34:34,152 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 [2023-12-25 06:34:34,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:34:34,153 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:34:34,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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)] Waiting until timeout for monitored process [2023-12-25 06:34:34,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:34:34,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:34:34,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-25 06:34:34,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:34:34,356 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 23 treesize of output 19 [2023-12-25 06:34:34,516 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_17 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_17)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:34:34,529 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 29 treesize of output 21 [2023-12-25 06:34:34,579 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 26 treesize of output 18 [2023-12-25 06:34:34,582 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 21 treesize of output 13 [2023-12-25 06:34:34,627 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2023-12-25 06:34:34,627 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:34:35,156 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 29 treesize of output 25 [2023-12-25 06:34:35,160 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 25 treesize of output 17 [2023-12-25 06:34:35,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:34:35,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2019409816] [2023-12-25 06:34:35,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2019409816] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:34:35,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1503755638] [2023-12-25 06:34:35,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:34:35,209 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:34:35,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:34:35,210 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:34:35,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-12-25 06:34:35,393 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-25 06:34:35,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401385589] [2023-12-25 06:34:35,394 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:34:35,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 06:34:35,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:34:35,397 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-25 06:34:35,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 1 [2023-12-25 06:34:35,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-25 06:34:35,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:34:35,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:34:35,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-25 06:34:35,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:34:35,562 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 23 treesize of output 19 [2023-12-25 06:34:35,621 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 [2023-12-25 06:34:35,663 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 29 treesize of output 21 [2023-12-25 06:34:35,677 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 26 treesize of output 18 [2023-12-25 06:34:35,681 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 21 treesize of output 13 [2023-12-25 06:34:35,721 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2023-12-25 06:34:35,721 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:34:36,440 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 21 treesize of output 17 [2023-12-25 06:34:36,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401385589] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:34:36,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:34:36,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2023-12-25 06:34:36,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421809715] [2023-12-25 06:34:36,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:34:36,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 06:34:36,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:34:36,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 06:34:36,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=127, Unknown=1, NotChecked=22, Total=182 [2023-12-25 06:34:36,519 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 06:34:37,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:34:37,001 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2023-12-25 06:34:37,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 06:34:37,002 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 20 [2023-12-25 06:34:37,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:34:37,003 INFO L225 Difference]: With dead ends: 30 [2023-12-25 06:34:37,003 INFO L226 Difference]: Without dead ends: 28 [2023-12-25 06:34:37,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=275, Unknown=1, NotChecked=34, Total=380 [2023-12-25 06:34:37,004 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:34:37,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 54 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 52 Unchecked, 0.2s Time] [2023-12-25 06:34:37,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-25 06:34:37,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2023-12-25 06:34:37,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 06:34:37,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-12-25 06:34:37,010 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2023-12-25 06:34:37,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:34:37,010 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-12-25 06:34:37,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 06:34:37,011 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2023-12-25 06:34:37,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-25 06:34:37,011 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:34:37,011 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:34:37,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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)] Forceful destruction successful, exit code 0 [2023-12-25 06:34:37,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-25 06:34:37,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 06:34:37,416 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:34:37,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:34:37,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1118284412, now seen corresponding path program 2 times [2023-12-25 06:34:37,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:34:37,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588451495] [2023-12-25 06:34:37,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:34:37,417 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 [2023-12-25 06:34:37,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:34:37,418 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:34:37,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (11)] Waiting until timeout for monitored process [2023-12-25 06:34:37,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:34:37,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:34:37,552 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-25 06:34:37,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:34:37,597 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 23 treesize of output 19 [2023-12-25 06:34:37,640 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 23 treesize of output 19 [2023-12-25 06:34:37,647 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_29)))))))) is different from true [2023-12-25 06:34:37,673 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_29 (_ BitVec 32)) (v_arrayElimCell_28 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_29)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_28)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:34:37,684 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 25 treesize of output 17 [2023-12-25 06:34:37,716 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 21 treesize of output 13 [2023-12-25 06:34:37,745 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 7 not checked. [2023-12-25 06:34:37,745 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:34:37,988 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 23 treesize of output 19 [2023-12-25 06:34:37,989 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 19 treesize of output 15 [2023-12-25 06:34:38,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:34:38,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588451495] [2023-12-25 06:34:38,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588451495] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:34:38,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [558950478] [2023-12-25 06:34:38,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:34:38,029 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:34:38,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:34:38,030 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:34:38,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2023-12-25 06:34:38,217 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-25 06:34:38,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863174562] [2023-12-25 06:34:38,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:34:38,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 06:34:38,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:34:38,218 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-25 06:34:38,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 1 [2023-12-25 06:34:38,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-25 06:34:38,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:34:38,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:34:38,334 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-25 06:34:38,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:34:38,369 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 23 treesize of output 19 [2023-12-25 06:34:38,406 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 23 treesize of output 19 [2023-12-25 06:34:38,413 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_35 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_35)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:34:38,442 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_28 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_35)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_28)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:34:38,453 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 25 treesize of output 17 [2023-12-25 06:34:38,480 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 21 treesize of output 13 [2023-12-25 06:34:38,486 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 7 not checked. [2023-12-25 06:34:38,486 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:34:38,696 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 23 treesize of output 19 [2023-12-25 06:34:38,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 19 treesize of output 15 [2023-12-25 06:34:38,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863174562] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:34:38,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:34:38,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2023-12-25 06:34:38,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825555130] [2023-12-25 06:34:38,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:34:38,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-25 06:34:38,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:34:38,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-25 06:34:38,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=86, Unknown=4, NotChecked=84, Total=210 [2023-12-25 06:34:38,739 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 12 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-25 06:34:38,925 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_28 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_35)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_28))))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_29 (_ BitVec 32)) (v_arrayElimCell_28 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_29)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_28))))) |c_#memory_int#3|))))) is different from true [2023-12-25 06:34:38,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:34:38,980 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2023-12-25 06:34:38,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 06:34:38,980 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 12 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 21 [2023-12-25 06:34:38,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:34:38,981 INFO L225 Difference]: With dead ends: 28 [2023-12-25 06:34:38,981 INFO L226 Difference]: Without dead ends: 23 [2023-12-25 06:34:38,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=102, Unknown=5, NotChecked=120, Total=272 [2023-12-25 06:34:38,982 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:34:38,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 47 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 109 Unchecked, 0.2s Time] [2023-12-25 06:34:38,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-25 06:34:38,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-25 06:34:38,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 06:34:38,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2023-12-25 06:34:38,989 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 21 [2023-12-25 06:34:38,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:34:38,989 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2023-12-25 06:34:38,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 12 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-25 06:34:38,989 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2023-12-25 06:34:38,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-25 06:34:38,990 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:34:38,990 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:34:38,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (11)] Forceful destruction successful, exit code 0 [2023-12-25 06:34:39,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-25 06:34:39,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 06:34:39,395 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:34:39,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:34:39,395 INFO L85 PathProgramCache]: Analyzing trace with hash -442591433, now seen corresponding path program 3 times [2023-12-25 06:34:39,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:34:39,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295972281] [2023-12-25 06:34:39,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:34:39,396 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 [2023-12-25 06:34:39,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:34:39,398 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:34:39,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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)] Waiting until timeout for monitored process [2023-12-25 06:34:39,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-25 06:34:39,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:34:39,568 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-25 06:34:39,570 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:34:39,627 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 23 treesize of output 19 [2023-12-25 06:34:39,699 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 23 treesize of output 19 [2023-12-25 06:34:39,821 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_40 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_40)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:34:39,842 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_42 (_ BitVec 32)) (v_arrayElimCell_40 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_42)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_40)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))))) is different from true [2023-12-25 06:34:39,857 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 32 treesize of output 24 [2023-12-25 06:34:39,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 29 treesize of output 21 [2023-12-25 06:34:39,911 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 24 treesize of output 16 [2023-12-25 06:34:39,964 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 10 not checked. [2023-12-25 06:34:39,964 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:34:40,648 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 36 treesize of output 32 [2023-12-25 06:34:40,651 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 32 treesize of output 28 [2023-12-25 06:34:40,653 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 28 treesize of output 20 [2023-12-25 06:34:40,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:34:40,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295972281] [2023-12-25 06:34:40,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295972281] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:34:40,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [661173780] [2023-12-25 06:34:40,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:34:40,717 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:34:40,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:34:40,718 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:34:40,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2023-12-25 06:34:40,925 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-25 06:34:40,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729843842] [2023-12-25 06:34:40,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:34:40,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 06:34:40,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:34:40,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 1 [2023-12-25 06:34:40,933 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-25 06:34:40,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-25 06:34:41,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-25 06:34:41,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:34:41,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-25 06:34:41,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:34:41,167 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 23 treesize of output 19 [2023-12-25 06:34:41,234 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 23 treesize of output 19 [2023-12-25 06:34:41,277 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 12 treesize of output 8 [2023-12-25 06:34:41,397 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((v_arrayElimCell_40 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_40)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) .cse1)))))) |c_#memory_int#3|)) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_78| (_ BitVec 8))) (= .cse1 ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_78|))))) is different from true [2023-12-25 06:34:41,420 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((v_arrayElimCell_40 (_ BitVec 32)) (v_arrayElimCell_51 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_40)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) .cse1)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_51)))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_78| (_ BitVec 8))) (= .cse1 ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_78|))))) is different from true [2023-12-25 06:34:41,437 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 32 treesize of output 24 [2023-12-25 06:34:41,536 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 37 treesize of output 25 [2023-12-25 06:34:41,540 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 25 treesize of output 17 [2023-12-25 06:34:45,662 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 10 not checked. [2023-12-25 06:34:45,662 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:34:46,659 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 30 treesize of output 26 [2023-12-25 06:34:46,661 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 26 treesize of output 22 [2023-12-25 06:34:46,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729843842] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:34:46,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:34:46,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2023-12-25 06:34:46,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608699955] [2023-12-25 06:34:46,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:34:46,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-25 06:34:46,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:34:46,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-25 06:34:46,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=201, Unknown=5, NotChecked=124, Total=380 [2023-12-25 06:34:46,743 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 17 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 7 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 06:34:47,217 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse3)))) (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (v_arrayElimCell_40 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_42)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_40)) .cse1 .cse2))))) (exists ((v_arrayElimCell_40 (_ BitVec 32)) (v_arrayElimCell_51 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_40)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_51))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_78| (_ BitVec 8))) (= .cse3 ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_78|)))))) is different from true [2023-12-25 06:34:47,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:34:47,308 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2023-12-25 06:34:47,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 06:34:47,308 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 7 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) Word has length 25 [2023-12-25 06:34:47,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:34:47,309 INFO L225 Difference]: With dead ends: 32 [2023-12-25 06:34:47,309 INFO L226 Difference]: Without dead ends: 30 [2023-12-25 06:34:47,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=96, Invalid=380, Unknown=6, NotChecked=220, Total=702 [2023-12-25 06:34:47,310 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 06:34:47,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 64 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 172 Unchecked, 0.3s Time] [2023-12-25 06:34:47,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-25 06:34:47,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2023-12-25 06:34:47,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 06:34:47,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2023-12-25 06:34:47,315 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 25 [2023-12-25 06:34:47,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:34:47,315 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2023-12-25 06:34:47,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 7 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 06:34:47,315 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2023-12-25 06:34:47,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-25 06:34:47,316 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:34:47,316 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:34:47,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-12-25 06:34:47,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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)] Forceful destruction successful, exit code 0 [2023-12-25 06:34:47,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-25 06:34:47,717 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:34:47,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:34:47,717 INFO L85 PathProgramCache]: Analyzing trace with hash -835428485, now seen corresponding path program 3 times [2023-12-25 06:34:47,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:34:47,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303617883] [2023-12-25 06:34:47,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:34:47,718 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 [2023-12-25 06:34:47,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:34:47,718 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:34:47,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (17)] Waiting until timeout for monitored process [2023-12-25 06:34:47,891 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-25 06:34:47,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:34:47,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-25 06:34:47,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:34:47,948 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 23 treesize of output 19 [2023-12-25 06:34:48,004 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 23 treesize of output 19 [2023-12-25 06:34:48,049 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 23 treesize of output 19 [2023-12-25 06:34:48,059 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_59 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_59)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) is different from true [2023-12-25 06:34:48,088 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_59 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_59)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_57)))))))) is different from true [2023-12-25 06:34:48,109 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_59 (_ BitVec 32)) (v_arrayElimCell_60 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_59)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_60)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_57)))))))) is different from true [2023-12-25 06:34:48,120 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 28 treesize of output 20 [2023-12-25 06:34:48,155 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 24 treesize of output 16 [2023-12-25 06:34:48,190 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 14 not checked. [2023-12-25 06:34:48,190 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:34:48,649 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 30 treesize of output 26 [2023-12-25 06:34:48,653 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 26 treesize of output 22 [2023-12-25 06:34:48,655 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 22 treesize of output 18 [2023-12-25 06:34:48,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:34:48,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303617883] [2023-12-25 06:34:48,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303617883] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:34:48,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1325995040] [2023-12-25 06:34:48,713 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:34:48,714 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:34:48,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:34:48,716 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:34:48,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2023-12-25 06:34:48,928 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-25 06:34:48,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285985912] [2023-12-25 06:34:48,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:34:48,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 06:34:48,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:34:48,929 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-25 06:34:48,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 1 [2023-12-25 06:34:48,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-25 06:34:49,093 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-25 06:34:49,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:34:49,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-25 06:34:49,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:34:49,125 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 23 treesize of output 19 [2023-12-25 06:34:49,154 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 23 treesize of output 19 [2023-12-25 06:34:49,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 23 treesize of output 19 [2023-12-25 06:34:49,191 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_68 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_68)))))))) is different from true [2023-12-25 06:34:49,227 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_68 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_57)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_68)))))))) is different from true [2023-12-25 06:34:49,248 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_69 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_68 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_57)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_69)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_68)))))))) is different from true [2023-12-25 06:34:49,261 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 28 treesize of output 20 [2023-12-25 06:34:49,298 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 24 treesize of output 16 [2023-12-25 06:34:49,306 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 14 not checked. [2023-12-25 06:34:49,307 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:34:49,743 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 30 treesize of output 26 [2023-12-25 06:34:49,746 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 26 treesize of output 22 [2023-12-25 06:34:49,750 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 22 treesize of output 18 [2023-12-25 06:34:49,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285985912] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:34:49,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:34:49,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2023-12-25 06:34:49,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141833976] [2023-12-25 06:34:49,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:34:49,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 06:34:49,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:34:49,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 06:34:49,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=88, Unknown=6, NotChecked=138, Total=272 [2023-12-25 06:34:49,799 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 7 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 06:34:49,960 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_68 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_57)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_68))))))) (exists ((v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_59 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_59)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_57)))))))))) is different from true [2023-12-25 06:34:49,967 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_59 (_ BitVec 32)) (v_arrayElimCell_60 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_59)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_60)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_57))))))) (exists ((v_arrayElimCell_69 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_68 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_57)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_69)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_68)))))))))) is different from true [2023-12-25 06:34:50,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:34:50,041 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2023-12-25 06:34:50,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 06:34:50,042 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 7 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) Word has length 26 [2023-12-25 06:34:50,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:34:50,042 INFO L225 Difference]: With dead ends: 30 [2023-12-25 06:34:50,042 INFO L226 Difference]: Without dead ends: 25 [2023-12-25 06:34:50,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=8, NotChecked=216, Total=380 [2023-12-25 06:34:50,043 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 180 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:34:50,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 180 Unchecked, 0.2s Time] [2023-12-25 06:34:50,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-25 06:34:50,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-25 06:34:50,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 06:34:50,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2023-12-25 06:34:50,048 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 26 [2023-12-25 06:34:50,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:34:50,048 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2023-12-25 06:34:50,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 7 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 06:34:50,048 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2023-12-25 06:34:50,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-25 06:34:50,049 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:34:50,049 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:34:50,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (17)] Forceful destruction successful, exit code 0 [2023-12-25 06:34:50,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-12-25 06:34:50,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 06:34:50,454 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:34:50,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:34:50,454 INFO L85 PathProgramCache]: Analyzing trace with hash -2069291986, now seen corresponding path program 4 times [2023-12-25 06:34:50,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:34:50,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [631297743] [2023-12-25 06:34:50,455 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 06:34:50,455 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 [2023-12-25 06:34:50,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:34:50,456 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:34:50,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (20)] Waiting until timeout for monitored process [2023-12-25 06:34:50,594 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 06:34:50,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:34:50,599 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 56 conjunts are in the unsatisfiable core [2023-12-25 06:34:50,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:34:50,661 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 23 treesize of output 19 [2023-12-25 06:34:50,743 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 23 treesize of output 19 [2023-12-25 06:34:50,792 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 23 treesize of output 19 [2023-12-25 06:34:50,921 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_75 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_75)))))))) is different from true [2023-12-25 06:34:50,942 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_75 (_ BitVec 32)) (v_arrayElimCell_78 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_78)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_75)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:34:50,964 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_79 (_ BitVec 32)) (v_arrayElimCell_75 (_ BitVec 32)) (v_arrayElimCell_78 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_78)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_79)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_75)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:34:50,975 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 35 treesize of output 27 [2023-12-25 06:34:51,055 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 32 treesize of output 24 [2023-12-25 06:34:51,058 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 19 [2023-12-25 06:34:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 18 not checked. [2023-12-25 06:34:53,784 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:34:54,978 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 43 treesize of output 39 [2023-12-25 06:34:54,981 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 31 [2023-12-25 06:34:54,984 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 27 [2023-12-25 06:34:54,985 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 23 [2023-12-25 06:34:55,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:34:55,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [631297743] [2023-12-25 06:34:55,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [631297743] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:34:55,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1577304329] [2023-12-25 06:34:55,075 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 06:34:55,075 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:34:55,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:34:55,076 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:34:55,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-12-25 06:34:55,325 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 06:34:55,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:34:55,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-25 06:34:55,331 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:34:55,393 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 23 treesize of output 19 [2023-12-25 06:34:55,452 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 23 treesize of output 19 [2023-12-25 06:34:55,504 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 23 treesize of output 19 [2023-12-25 06:34:55,573 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 12 treesize of output 8 [2023-12-25 06:34:55,725 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((v_arrayElimCell_75 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) .cse1)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_75)))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_144| (_ BitVec 8))) (= .cse1 ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_144|))))) is different from true [2023-12-25 06:34:55,756 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((v_arrayElimCell_75 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_90)) ((_ zero_extend 24) ((_ extract 7 0) .cse1)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_75)))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_144| (_ BitVec 8))) (= .cse1 ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_144|))))) is different from true [2023-12-25 06:34:55,788 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((v_arrayElimCell_75 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_90)) ((_ zero_extend 24) ((_ extract 7 0) .cse1)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_91)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_75)))))) |c_#memory_int#3|)) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_144| (_ BitVec 8))) (= .cse1 ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_144|))))) is different from true [2023-12-25 06:34:55,815 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 35 treesize of output 27 [2023-12-25 06:34:55,929 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 40 treesize of output 28 [2023-12-25 06:34:55,934 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 28 treesize of output 20 [2023-12-25 06:35:04,228 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 18 not checked. [2023-12-25 06:35:04,228 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:35:05,757 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 37 treesize of output 33 [2023-12-25 06:35:05,760 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 33 treesize of output 29 [2023-12-25 06:35:05,763 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 29 treesize of output 25 [2023-12-25 06:35:06,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1577304329] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:35:06,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:35:06,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2023-12-25 06:35:06,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737283211] [2023-12-25 06:35:06,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:35:06,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 06:35:06,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:35:06,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 06:35:06,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=231, Unknown=8, NotChecked=210, Total=506 [2023-12-25 06:35:06,138 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 20 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 9 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-25 06:35:06,824 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse3)))) (and (exists ((v_arrayElimCell_75 (_ BitVec 32)) (v_arrayElimCell_78 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_78)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_75))))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_75 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_90)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_75))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_144| (_ BitVec 8))) (= .cse3 ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_144|)))))) is different from true [2023-12-25 06:35:06,834 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse3)))) (and (exists ((v_arrayElimCell_79 (_ BitVec 32)) (v_arrayElimCell_75 (_ BitVec 32)) (v_arrayElimCell_78 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_78)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_79)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_75))))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_75 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_90)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_91)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_75))))) |c_#memory_int#3|)) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_144| (_ BitVec 8))) (= .cse3 ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_144|)))))) is different from true [2023-12-25 06:35:07,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:35:07,041 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2023-12-25 06:35:07,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 06:35:07,041 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 9 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) Word has length 30 [2023-12-25 06:35:07,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:35:07,042 INFO L225 Difference]: With dead ends: 34 [2023-12-25 06:35:07,042 INFO L226 Difference]: Without dead ends: 32 [2023-12-25 06:35:07,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=106, Invalid=422, Unknown=10, NotChecked=392, Total=930 [2023-12-25 06:35:07,043 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 06:35:07,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 85 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 272 Unchecked, 0.5s Time] [2023-12-25 06:35:07,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-25 06:35:07,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2023-12-25 06:35:07,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 6 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-25 06:35:07,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2023-12-25 06:35:07,048 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 30 [2023-12-25 06:35:07,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:35:07,048 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2023-12-25 06:35:07,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 9 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-25 06:35:07,049 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2023-12-25 06:35:07,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-25 06:35:07,049 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:35:07,049 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:35:07,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (20)] Forceful destruction successful, exit code 0 [2023-12-25 06:35:07,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2023-12-25 06:35:07,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 06:35:07,455 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:35:07,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:35:07,455 INFO L85 PathProgramCache]: Analyzing trace with hash 276461924, now seen corresponding path program 4 times [2023-12-25 06:35:07,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:35:07,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724967055] [2023-12-25 06:35:07,456 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 06:35:07,456 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 [2023-12-25 06:35:07,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:35:07,457 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:35:07,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (22)] Waiting until timeout for monitored process [2023-12-25 06:35:07,591 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 06:35:07,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:35:07,595 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-25 06:35:07,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:35:07,641 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 23 treesize of output 19 [2023-12-25 06:35:07,683 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 23 treesize of output 19 [2023-12-25 06:35:07,717 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 23 treesize of output 19 [2023-12-25 06:35:07,749 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 23 treesize of output 19 [2023-12-25 06:35:07,756 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_101 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_101)))))))) is different from true [2023-12-25 06:35:07,787 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_101 (_ BitVec 32)) (v_arrayElimCell_98 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_101)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_98)))))))) is different from true [2023-12-25 06:35:07,809 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_101 (_ BitVec 32)) (v_arrayElimCell_98 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_101)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_102)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_98)))))))) is different from true [2023-12-25 06:35:07,825 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_101 (_ BitVec 32)) (v_arrayElimCell_103 (_ BitVec 32)) (v_arrayElimCell_98 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_103)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_101)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_102)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_98)))))))) is different from true [2023-12-25 06:35:07,838 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 31 treesize of output 23 [2023-12-25 06:35:07,879 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 19 [2023-12-25 06:35:07,917 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 23 not checked. [2023-12-25 06:35:07,918 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:35:09,091 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 37 treesize of output 33 [2023-12-25 06:35:09,098 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 33 treesize of output 29 [2023-12-25 06:35:09,100 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 29 treesize of output 25 [2023-12-25 06:35:09,102 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 25 treesize of output 21 [2023-12-25 06:35:09,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:35:09,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724967055] [2023-12-25 06:35:09,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724967055] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:35:09,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [966395799] [2023-12-25 06:35:09,170 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 06:35:09,170 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:35:09,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:35:09,171 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:35:09,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-12-25 06:35:09,391 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 06:35:09,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:35:09,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-25 06:35:09,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:35:09,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 23 treesize of output 19 [2023-12-25 06:35:09,484 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 23 treesize of output 19 [2023-12-25 06:35:09,525 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 23 treesize of output 19 [2023-12-25 06:35:09,582 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 23 treesize of output 19 [2023-12-25 06:35:09,590 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_113 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_113)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) is different from true [2023-12-25 06:35:09,619 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_98 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_113)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_98)))))))) is different from true [2023-12-25 06:35:09,638 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_arrayElimCell_98 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_113)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_114)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_98)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:35:09,672 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_115 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_arrayElimCell_98 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_113)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_114)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_115)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_98)))))))) is different from true [2023-12-25 06:35:09,686 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 31 treesize of output 23 [2023-12-25 06:35:09,746 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 19 [2023-12-25 06:35:10,299 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 23 not checked. [2023-12-25 06:35:10,299 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:35:10,983 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 37 treesize of output 33 [2023-12-25 06:35:10,987 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 33 treesize of output 29 [2023-12-25 06:35:10,991 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 29 treesize of output 25 [2023-12-25 06:35:10,994 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 25 treesize of output 21 [2023-12-25 06:35:11,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [966395799] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:35:11,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:35:11,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2023-12-25 06:35:11,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761446023] [2023-12-25 06:35:11,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:35:11,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 06:35:11,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:35:11,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 06:35:11,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=124, Unknown=8, NotChecked=232, Total=420 [2023-12-25 06:35:11,069 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 18 states, 15 states have (on average 1.6) internal successors, (24), 18 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 9 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-25 06:35:11,275 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_101 (_ BitVec 32)) (v_arrayElimCell_98 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_101)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_98))))))) (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_98 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_113)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_98)))))))))) is different from true [2023-12-25 06:35:11,284 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_arrayElimCell_98 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_113)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_114)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_98))))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_101 (_ BitVec 32)) (v_arrayElimCell_98 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_101)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_102)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_98)))))))))) is different from true [2023-12-25 06:35:11,294 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_101 (_ BitVec 32)) (v_arrayElimCell_103 (_ BitVec 32)) (v_arrayElimCell_98 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_103)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_101)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_102)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_98))))))) (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_115 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_arrayElimCell_98 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_113)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_114)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_115)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_98)))))))))) is different from true [2023-12-25 06:35:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:35:11,412 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2023-12-25 06:35:11,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 06:35:11,413 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 1.6) internal successors, (24), 18 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 9 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) Word has length 31 [2023-12-25 06:35:11,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:35:11,413 INFO L225 Difference]: With dead ends: 32 [2023-12-25 06:35:11,413 INFO L226 Difference]: Without dead ends: 27 [2023-12-25 06:35:11,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=70, Invalid=145, Unknown=11, NotChecked=374, Total=600 [2023-12-25 06:35:11,414 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:35:11,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 56 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 272 Unchecked, 0.2s Time] [2023-12-25 06:35:11,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-25 06:35:11,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-25 06:35:11,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 06:35:11,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2023-12-25 06:35:11,421 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2023-12-25 06:35:11,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:35:11,421 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2023-12-25 06:35:11,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 1.6) internal successors, (24), 18 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 9 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-25 06:35:11,422 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2023-12-25 06:35:11,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-25 06:35:11,422 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:35:11,422 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:35:11,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2023-12-25 06:35:11,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (22)] Forceful destruction successful, exit code 0 [2023-12-25 06:35:11,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-25 06:35:11,826 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:35:11,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:35:11,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1644200719, now seen corresponding path program 5 times [2023-12-25 06:35:11,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:35:11,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828592092] [2023-12-25 06:35:11,827 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 06:35:11,828 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 [2023-12-25 06:35:11,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:35:11,829 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:35:11,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (24)] Waiting until timeout for monitored process [2023-12-25 06:35:12,071 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-12-25 06:35:12,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:35:12,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-25 06:35:12,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:35:12,151 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 23 treesize of output 19 [2023-12-25 06:35:12,234 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 23 treesize of output 19 [2023-12-25 06:35:12,301 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 23 treesize of output 19 [2023-12-25 06:35:12,367 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 23 treesize of output 19 [2023-12-25 06:35:12,505 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_122 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_122)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))))) is different from true [2023-12-25 06:35:12,524 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_126 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_122)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_126)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))))) is different from true [2023-12-25 06:35:12,561 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_126 (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_122)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_126)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_127)))))))) is different from true [2023-12-25 06:35:12,594 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_126 (_ BitVec 32)) (v_arrayElimCell_128 (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_122)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_126)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_127)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_128)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:35:12,613 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 38 treesize of output 30 [2023-12-25 06:35:12,733 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 35 treesize of output 27 [2023-12-25 06:35:12,738 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 30 treesize of output 22 [2023-12-25 06:35:12,834 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 28 not checked. [2023-12-25 06:35:12,834 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:35:16,994 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 50 treesize of output 42 [2023-12-25 06:35:16,997 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 42 treesize of output 38 [2023-12-25 06:35:17,000 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 38 treesize of output 34 [2023-12-25 06:35:17,006 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 34 treesize of output 30 [2023-12-25 06:35:17,019 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 30 treesize of output 26 [2023-12-25 06:35:17,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:35:17,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828592092] [2023-12-25 06:35:17,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828592092] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:35:17,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1553763852] [2023-12-25 06:35:17,123 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 06:35:17,123 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:35:17,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:35:17,124 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:35:17,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-12-25 06:35:17,417 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-12-25 06:35:17,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:35:17,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 72 conjunts are in the unsatisfiable core [2023-12-25 06:35:17,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:35:17,515 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 23 treesize of output 19 [2023-12-25 06:35:17,575 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 23 treesize of output 19 [2023-12-25 06:35:17,637 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 23 treesize of output 19 [2023-12-25 06:35:17,696 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 23 treesize of output 19 [2023-12-25 06:35:17,751 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 [2023-12-25 06:35:17,811 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_141 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_122)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_141)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))))) is different from true [2023-12-25 06:35:17,832 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_142 (_ BitVec 32)) (v_arrayElimCell_141 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_122)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_141)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_142)))))))) is different from true [2023-12-25 06:35:17,854 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_142 (_ BitVec 32)) (v_arrayElimCell_141 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32)) (v_arrayElimCell_143 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_122)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_141)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_143)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_142)))))))) is different from true [2023-12-25 06:35:17,871 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 38 treesize of output 30 [2023-12-25 06:35:17,982 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 35 treesize of output 27 [2023-12-25 06:35:17,988 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 30 treesize of output 22 [2023-12-25 06:35:27,304 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 28 not checked. [2023-12-25 06:35:27,304 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:35:29,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 42 treesize of output 38 [2023-12-25 06:35:29,442 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 38 treesize of output 34 [2023-12-25 06:35:29,445 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 34 treesize of output 30 [2023-12-25 06:35:29,448 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 30 treesize of output 26 [2023-12-25 06:35:31,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1553763852] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:35:31,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:35:31,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2023-12-25 06:35:31,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101868482] [2023-12-25 06:35:31,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:35:31,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 06:35:31,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:35:31,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 06:35:31,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=203, Unknown=9, NotChecked=238, Total=506 [2023-12-25 06:35:31,498 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 20 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 9 states have return successors, (10), 10 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-25 06:35:32,302 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_126 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_122)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_126)) .cse1 .cse2))))) (exists ((v_arrayElimCell_141 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_122)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_141)) .cse2)))))))) is different from true [2023-12-25 06:35:32,315 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_126 (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_122)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_126)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_127))))))) (exists ((v_arrayElimCell_142 (_ BitVec 32)) (v_arrayElimCell_141 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_122)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_141)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_142)))))))))) is different from true [2023-12-25 06:35:32,327 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_126 (_ BitVec 32)) (v_arrayElimCell_128 (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_122)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_126)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_127)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_128))))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_142 (_ BitVec 32)) (v_arrayElimCell_141 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32)) (v_arrayElimCell_143 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_122)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_141)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_143)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_142)))))))))) is different from true [2023-12-25 06:35:32,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:35:32,691 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2023-12-25 06:35:32,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 06:35:32,692 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 9 states have return successors, (10), 10 states have call predecessors, (10), 4 states have call successors, (10) Word has length 35 [2023-12-25 06:35:32,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:35:32,693 INFO L225 Difference]: With dead ends: 36 [2023-12-25 06:35:32,693 INFO L226 Difference]: Without dead ends: 34 [2023-12-25 06:35:32,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 47 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=104, Invalid=386, Unknown=12, NotChecked=490, Total=992 [2023-12-25 06:35:32,694 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 333 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 06:35:32,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 333 Unchecked, 0.7s Time] [2023-12-25 06:35:32,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-25 06:35:32,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2023-12-25 06:35:32,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 7 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-25 06:35:32,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2023-12-25 06:35:32,699 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 35 [2023-12-25 06:35:32,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:35:32,699 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2023-12-25 06:35:32,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 9 states have return successors, (10), 10 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-25 06:35:32,700 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2023-12-25 06:35:32,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-25 06:35:32,700 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:35:32,700 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:35:32,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (24)] Forceful destruction successful, exit code 0 [2023-12-25 06:35:32,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2023-12-25 06:35:33,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 06:35:33,109 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:35:33,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:35:33,109 INFO L85 PathProgramCache]: Analyzing trace with hash -569381213, now seen corresponding path program 5 times [2023-12-25 06:35:33,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:35:33,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40423431] [2023-12-25 06:35:33,110 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 06:35:33,110 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 [2023-12-25 06:35:33,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:35:33,111 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:35:33,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (26)] Waiting until timeout for monitored process [2023-12-25 06:35:33,335 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-12-25 06:35:33,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:35:33,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-25 06:35:33,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:35:33,388 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 23 treesize of output 19 [2023-12-25 06:35:33,444 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 23 treesize of output 19 [2023-12-25 06:35:33,487 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 23 treesize of output 19 [2023-12-25 06:35:33,540 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 23 treesize of output 19 [2023-12-25 06:35:33,581 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 23 treesize of output 19 [2023-12-25 06:35:33,590 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_155 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_155)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) is different from true [2023-12-25 06:35:33,625 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_155 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_155)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151)))))))) is different from true [2023-12-25 06:35:33,644 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_156 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_155 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_155)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_156)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:35:33,667 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_157 (_ BitVec 32)) (v_arrayElimCell_156 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_155 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_155)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_157)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_156)))))))) is different from true [2023-12-25 06:35:33,702 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_157 (_ BitVec 32)) (v_arrayElimCell_156 (_ BitVec 32)) (v_arrayElimCell_158 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_155 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_158)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_155)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_157)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_156)))))))) is different from true [2023-12-25 06:35:33,721 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 34 treesize of output 26 [2023-12-25 06:35:33,820 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 30 treesize of output 22 [2023-12-25 06:35:33,901 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 34 not checked. [2023-12-25 06:35:33,901 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:35:35,109 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 44 treesize of output 40 [2023-12-25 06:35:35,113 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 40 treesize of output 36 [2023-12-25 06:35:35,116 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 36 treesize of output 32 [2023-12-25 06:35:35,119 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 32 treesize of output 28 [2023-12-25 06:35:35,122 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 28 treesize of output 24 [2023-12-25 06:35:35,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:35:35,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40423431] [2023-12-25 06:35:35,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40423431] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:35:35,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [991269196] [2023-12-25 06:35:35,234 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 06:35:35,235 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:35:35,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:35:35,236 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:35:35,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-12-25 06:35:35,561 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-12-25 06:35:35,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:35:35,566 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-25 06:35:35,567 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:35:35,624 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 23 treesize of output 19 [2023-12-25 06:35:35,678 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 23 treesize of output 19 [2023-12-25 06:35:35,725 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 23 treesize of output 19 [2023-12-25 06:35:35,772 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 23 treesize of output 19 [2023-12-25 06:35:35,816 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 23 treesize of output 19 [2023-12-25 06:35:35,825 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_170 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_170)))))))) is different from true [2023-12-25 06:35:35,867 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_170)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151)))))))) is different from true [2023-12-25 06:35:35,890 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_171 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_170)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_171)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151)))))))) is different from true [2023-12-25 06:35:35,918 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_171 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_172 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_172)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_170)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_171)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151)))))))) is different from true [2023-12-25 06:35:35,950 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_171 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_173 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_172 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_172)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_170)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_173)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_171)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151)))))))) is different from true [2023-12-25 06:35:35,974 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 34 treesize of output 26 [2023-12-25 06:35:36,048 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 30 treesize of output 22 [2023-12-25 06:35:36,101 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 34 not checked. [2023-12-25 06:35:36,101 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:35:37,087 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 44 treesize of output 40 [2023-12-25 06:35:37,098 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 40 treesize of output 36 [2023-12-25 06:35:37,103 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 36 treesize of output 32 [2023-12-25 06:35:37,107 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 32 treesize of output 28 [2023-12-25 06:35:37,111 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 28 treesize of output 24 [2023-12-25 06:35:37,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [991269196] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:35:37,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:35:37,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2023-12-25 06:35:37,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820703056] [2023-12-25 06:35:37,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:35:37,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 06:35:37,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:35:37,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 06:35:37,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=126, Unknown=10, NotChecked=310, Total=506 [2023-12-25 06:35:37,202 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 20 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 20 states have internal predecessors, (26), 5 states have call successors, (5), 1 states have call predecessors, (5), 11 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) [2023-12-25 06:35:37,523 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_170)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151))))))) (exists ((v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_155 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_155)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151)))))))))) is different from true [2023-12-25 06:35:37,531 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_171 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_170)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_171)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151))))))) (exists ((v_arrayElimCell_156 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_155 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_155)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_156))))) |c_#memory_int#3|))))) is different from true [2023-12-25 06:35:37,540 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_157 (_ BitVec 32)) (v_arrayElimCell_156 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_155 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_155)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_157)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_156))))))) (exists ((v_arrayElimCell_171 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_172 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_172)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_170)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_171)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151)))))))))) is different from true [2023-12-25 06:35:37,550 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_157 (_ BitVec 32)) (v_arrayElimCell_156 (_ BitVec 32)) (v_arrayElimCell_158 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_155 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_158)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_155)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_157)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_156))))))) (exists ((v_arrayElimCell_171 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_173 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_172 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_172)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_170)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_173)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_171)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151)))))))))) is different from true [2023-12-25 06:35:37,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:35:37,699 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2023-12-25 06:35:37,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 06:35:37,699 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 20 states have internal predecessors, (26), 5 states have call successors, (5), 1 states have call predecessors, (5), 11 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) Word has length 36 [2023-12-25 06:35:37,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:35:37,700 INFO L225 Difference]: With dead ends: 34 [2023-12-25 06:35:37,700 INFO L226 Difference]: Without dead ends: 29 [2023-12-25 06:35:37,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 50 SyntacticMatches, 10 SemanticMatches, 26 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=148, Unknown=14, NotChecked=518, Total=756 [2023-12-25 06:35:37,701 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 363 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 06:35:37,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 63 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 363 Unchecked, 0.4s Time] [2023-12-25 06:35:37,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-25 06:35:37,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-25 06:35:37,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-25 06:35:37,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2023-12-25 06:35:37,706 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 36 [2023-12-25 06:35:37,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:35:37,706 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2023-12-25 06:35:37,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 20 states have internal predecessors, (26), 5 states have call successors, (5), 1 states have call predecessors, (5), 11 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) [2023-12-25 06:35:37,706 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2023-12-25 06:35:37,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-25 06:35:37,707 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:35:37,707 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:35:37,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2023-12-25 06:35:37,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (26)] Forceful destruction successful, exit code 0 [2023-12-25 06:35:38,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-25 06:35:38,113 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:35:38,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:35:38,113 INFO L85 PathProgramCache]: Analyzing trace with hash 524889158, now seen corresponding path program 6 times [2023-12-25 06:35:38,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:35:38,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015017257] [2023-12-25 06:35:38,113 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 06:35:38,113 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 [2023-12-25 06:35:38,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:35:38,114 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:35:38,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (28)] Waiting until timeout for monitored process [2023-12-25 06:35:38,436 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-12-25 06:35:38,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:35:38,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 80 conjunts are in the unsatisfiable core [2023-12-25 06:35:38,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:35:38,525 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 23 treesize of output 19 [2023-12-25 06:35:38,632 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 23 treesize of output 19 [2023-12-25 06:35:38,701 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 23 treesize of output 19 [2023-12-25 06:35:38,769 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 23 treesize of output 19 [2023-12-25 06:35:38,836 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 23 treesize of output 19 [2023-12-25 06:35:39,001 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_181 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_181)))))))) is different from true [2023-12-25 06:35:39,022 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_181 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_186)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_181)))))))) is different from true [2023-12-25 06:35:39,044 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_181 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_186)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_187)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_181)))))))) is different from true [2023-12-25 06:35:39,067 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_181 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_arrayElimCell_188 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_186)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_187)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_188)))))))) is different from true [2023-12-25 06:35:39,104 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_189 (_ BitVec 32)) (v_arrayElimCell_181 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_arrayElimCell_188 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_186)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_189)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_187)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_188)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:35:39,125 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 41 treesize of output 33 [2023-12-25 06:35:39,273 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 38 treesize of output 30 [2023-12-25 06:35:39,279 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 33 treesize of output 25 [2023-12-25 06:35:47,440 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 40 trivial. 40 not checked. [2023-12-25 06:35:47,440 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:35:49,422 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 57 treesize of output 53 [2023-12-25 06:35:49,426 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 53 treesize of output 45 [2023-12-25 06:35:49,431 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 45 treesize of output 41 [2023-12-25 06:35:49,434 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 41 treesize of output 37 [2023-12-25 06:35:49,437 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 37 treesize of output 33 [2023-12-25 06:35:49,440 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 33 treesize of output 29 [2023-12-25 06:35:49,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:35:49,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015017257] [2023-12-25 06:35:49,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015017257] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:35:49,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1377376537] [2023-12-25 06:35:49,557 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 06:35:49,557 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:35:49,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:35:49,558 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:35:49,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-12-25 06:35:50,001 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-25 06:35:50,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939964385] [2023-12-25 06:35:50,002 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 06:35:50,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 06:35:50,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:35:50,005 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-25 06:35:50,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-12-25 06:35:50,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 1 [2023-12-25 06:35:50,592 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-12-25 06:35:50,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:35:50,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 82 conjunts are in the unsatisfiable core [2023-12-25 06:35:50,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:35:50,649 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 23 treesize of output 19 [2023-12-25 06:35:50,726 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 23 treesize of output 19 [2023-12-25 06:35:50,791 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 23 treesize of output 19 [2023-12-25 06:35:50,850 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 23 treesize of output 19 [2023-12-25 06:35:50,911 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 23 treesize of output 19 [2023-12-25 06:35:50,970 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 12 treesize of output 8 [2023-12-25 06:35:51,088 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_317| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_317|) .cse0)) (exists ((v_arrayElimCell_181 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) .cse0)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_181)))))))))) is different from true [2023-12-25 06:35:51,121 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_317| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_317|) .cse0)) (exists ((v_arrayElimCell_204 (_ BitVec 32)) (v_arrayElimCell_181 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_204)) (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) .cse0)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_181)))))))))) is different from true [2023-12-25 06:35:51,147 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_317| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_317|) .cse0)) (exists ((v_arrayElimCell_205 (_ BitVec 32)) (v_arrayElimCell_204 (_ BitVec 32)) (v_arrayElimCell_181 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_204)) (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) .cse0)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_205)))))) |c_#memory_int#3|)))) is different from true [2023-12-25 06:35:51,175 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_317| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_317|) .cse0)) (exists ((v_arrayElimCell_205 (_ BitVec 32)) (v_arrayElimCell_204 (_ BitVec 32)) (v_arrayElimCell_206 (_ BitVec 32)) (v_arrayElimCell_181 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_204)) (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) .cse0)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_206)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_205)))))))))) is different from true [2023-12-25 06:35:51,207 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((v_arrayElimCell_205 (_ BitVec 32)) (v_arrayElimCell_204 (_ BitVec 32)) (v_arrayElimCell_207 (_ BitVec 32)) (v_arrayElimCell_206 (_ BitVec 32)) (v_arrayElimCell_181 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_204)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_207)) ((_ zero_extend 24) ((_ extract 7 0) .cse1)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_206)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_205)))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_317| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_317|) .cse1)))) is different from true [2023-12-25 06:35:51,224 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 41 treesize of output 33 [2023-12-25 06:35:55,367 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 46 treesize of output 34 [2023-12-25 06:35:55,375 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 34 treesize of output 26 [2023-12-25 06:36:07,556 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 40 trivial. 40 not checked. [2023-12-25 06:36:07,557 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:36:10,216 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 51 treesize of output 47 [2023-12-25 06:36:10,218 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 47 treesize of output 43 [2023-12-25 06:36:10,221 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 43 treesize of output 39 [2023-12-25 06:36:10,224 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 35 [2023-12-25 06:36:10,226 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 35 treesize of output 31 [2023-12-25 06:36:11,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939964385] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:36:11,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:36:11,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2023-12-25 06:36:11,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284324033] [2023-12-25 06:36:11,615 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:36:11,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 06:36:11,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:36:11,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 06:36:11,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=204, Unknown=15, NotChecked=370, Total=650 [2023-12-25 06:36:11,616 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 23 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 13 states have return successors, (14), 14 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-25 06:36:12,344 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse2 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) .cse0)))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_317| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_317|) .cse0)) (exists ((v_arrayElimCell_204 (_ BitVec 32)) (v_arrayElimCell_181 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_204)) .cse2 .cse3 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_181))))))) (exists ((v_arrayElimCell_181 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_186)) .cse3 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_181)))))))))) is different from true [2023-12-25 06:36:12,356 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse2 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) .cse0)))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_317| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_317|) .cse0)) (exists ((v_arrayElimCell_181 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_186)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_187)) .cse3 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_181))))))) (exists ((v_arrayElimCell_205 (_ BitVec 32)) (v_arrayElimCell_204 (_ BitVec 32)) (v_arrayElimCell_181 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_204)) .cse2 .cse3 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_205))))) |c_#memory_int#3|))))) is different from true [2023-12-25 06:36:12,366 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse2 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) .cse0)))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_317| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_317|) .cse0)) (exists ((v_arrayElimCell_181 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_arrayElimCell_188 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_186)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_187)) .cse3 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_188))))))) (exists ((v_arrayElimCell_205 (_ BitVec 32)) (v_arrayElimCell_204 (_ BitVec 32)) (v_arrayElimCell_206 (_ BitVec 32)) (v_arrayElimCell_181 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_204)) .cse2 .cse3 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_206)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_205)))))))))) is different from true [2023-12-25 06:36:12,377 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse3)))) (and (exists ((v_arrayElimCell_205 (_ BitVec 32)) (v_arrayElimCell_204 (_ BitVec 32)) (v_arrayElimCell_207 (_ BitVec 32)) (v_arrayElimCell_206 (_ BitVec 32)) (v_arrayElimCell_181 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_204)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_207)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_206)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_205))))))) (exists ((v_arrayElimCell_189 (_ BitVec 32)) (v_arrayElimCell_181 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_arrayElimCell_188 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_186)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_189)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_187)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_188))))) |c_#memory_int#3|)) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_317| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_317|) .cse3))))) is different from true [2023-12-25 06:36:16,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:36:20,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:36:20,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:36:20,685 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2023-12-25 06:36:20,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 06:36:20,685 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 13 states have return successors, (14), 14 states have call predecessors, (14), 4 states have call successors, (14) Word has length 40 [2023-12-25 06:36:20,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:36:20,686 INFO L225 Difference]: With dead ends: 38 [2023-12-25 06:36:20,686 INFO L226 Difference]: Without dead ends: 36 [2023-12-25 06:36:20,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 53 SyntacticMatches, 10 SemanticMatches, 34 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 27.0s TimeCoverageRelationStatistics Valid=113, Invalid=386, Unknown=19, NotChecked=742, Total=1260 [2023-12-25 06:36:20,687 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 475 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2023-12-25 06:36:20,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 79 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 2 Unknown, 475 Unchecked, 8.6s Time] [2023-12-25 06:36:20,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-25 06:36:20,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2023-12-25 06:36:20,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 8 states have return successors, (10), 9 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-25 06:36:20,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2023-12-25 06:36:20,692 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 40 [2023-12-25 06:36:20,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:36:20,693 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2023-12-25 06:36:20,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 13 states have return successors, (14), 14 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-25 06:36:20,693 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2023-12-25 06:36:20,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-25 06:36:20,694 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:36:20,694 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:36:20,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (28)] Forceful destruction successful, exit code 0 [2023-12-25 06:36:20,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-12-25 06:36:21,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 06:36:21,099 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:36:21,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:36:21,100 INFO L85 PathProgramCache]: Analyzing trace with hash -908301236, now seen corresponding path program 6 times [2023-12-25 06:36:21,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:36:21,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891593963] [2023-12-25 06:36:21,100 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 06:36:21,100 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 [2023-12-25 06:36:21,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:36:21,101 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:36:21,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (31)] Waiting until timeout for monitored process [2023-12-25 06:36:21,448 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-12-25 06:36:21,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:36:21,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 53 conjunts are in the unsatisfiable core [2023-12-25 06:36:21,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:36:21,504 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 23 treesize of output 19 [2023-12-25 06:36:21,557 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 23 treesize of output 19 [2023-12-25 06:36:21,603 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 23 treesize of output 19 [2023-12-25 06:36:21,674 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 23 treesize of output 19 [2023-12-25 06:36:21,714 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 23 treesize of output 19 [2023-12-25 06:36:21,753 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 23 treesize of output 19 [2023-12-25 06:36:21,761 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_221 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_221)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) is different from true [2023-12-25 06:36:21,792 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_216 (_ BitVec 32)) (v_arrayElimCell_221 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_221)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_216)))))))) is different from true [2023-12-25 06:36:21,809 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_222 (_ BitVec 32)) (v_arrayElimCell_216 (_ BitVec 32)) (v_arrayElimCell_221 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_221)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_222)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_216)))))))) is different from true [2023-12-25 06:36:21,828 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_223 (_ BitVec 32)) (v_arrayElimCell_222 (_ BitVec 32)) (v_arrayElimCell_216 (_ BitVec 32)) (v_arrayElimCell_221 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_221)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_222)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_216)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_223)))))))) is different from true [2023-12-25 06:36:21,848 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_223 (_ BitVec 32)) (v_arrayElimCell_222 (_ BitVec 32)) (v_arrayElimCell_224 (_ BitVec 32)) (v_arrayElimCell_216 (_ BitVec 32)) (v_arrayElimCell_221 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_221)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_222)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_216)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_223)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_224)))))))) is different from true [2023-12-25 06:36:21,872 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_223 (_ BitVec 32)) (v_arrayElimCell_222 (_ BitVec 32)) (v_arrayElimCell_225 (_ BitVec 32)) (v_arrayElimCell_224 (_ BitVec 32)) (v_arrayElimCell_216 (_ BitVec 32)) (v_arrayElimCell_221 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_221)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_222)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_216)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_223)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_224)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_225)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:36:21,887 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 37 treesize of output 29 [2023-12-25 06:36:21,960 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 33 treesize of output 25 [2023-12-25 06:36:22,049 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 47 not checked. [2023-12-25 06:36:22,050 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:36:23,367 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 51 treesize of output 47 [2023-12-25 06:36:23,370 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 47 treesize of output 43 [2023-12-25 06:36:23,373 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 43 treesize of output 39 [2023-12-25 06:36:23,376 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 35 [2023-12-25 06:36:23,381 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 35 treesize of output 31 [2023-12-25 06:36:23,383 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 27 [2023-12-25 06:36:23,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:36:23,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891593963] [2023-12-25 06:36:23,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891593963] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:36:23,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [129369120] [2023-12-25 06:36:23,556 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 06:36:23,556 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:36:23,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:36:23,562 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:36:23,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2023-12-25 06:36:24,012 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-25 06:36:24,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231987480] [2023-12-25 06:36:24,013 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 06:36:24,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 06:36:24,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:36:24,014 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-25 06:36:24,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-12-25 06:36:24,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 1 [2023-12-25 06:36:24,643 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-12-25 06:36:24,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:36:24,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 53 conjunts are in the unsatisfiable core [2023-12-25 06:36:24,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:36:24,676 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 23 treesize of output 19 [2023-12-25 06:36:24,736 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 23 treesize of output 19 [2023-12-25 06:36:24,798 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 23 treesize of output 19 [2023-12-25 06:36:24,866 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 23 treesize of output 19 [2023-12-25 06:36:24,927 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 23 treesize of output 19 [2023-12-25 06:36:24,982 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 23 treesize of output 19 [2023-12-25 06:36:24,992 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_239 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_239)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:36:25,037 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_216 (_ BitVec 32)) (v_arrayElimCell_239 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_239)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_216)))))))) is different from true [2023-12-25 06:36:25,060 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_216 (_ BitVec 32)) (v_arrayElimCell_239 (_ BitVec 32)) (v_arrayElimCell_240 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_239)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_216)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_240)))))))) is different from true [2023-12-25 06:36:25,083 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_216 (_ BitVec 32)) (v_arrayElimCell_239 (_ BitVec 32)) (v_arrayElimCell_241 (_ BitVec 32)) (v_arrayElimCell_240 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_241)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_239)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_216)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_240)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:36:25,123 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_216 (_ BitVec 32)) (v_arrayElimCell_239 (_ BitVec 32)) (v_arrayElimCell_241 (_ BitVec 32)) (v_arrayElimCell_240 (_ BitVec 32)) (v_arrayElimCell_242 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_241)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_239)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_216)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_242)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_240)))))))) is different from true [2023-12-25 06:36:25,152 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_216 (_ BitVec 32)) (v_arrayElimCell_239 (_ BitVec 32)) (v_arrayElimCell_241 (_ BitVec 32)) (v_arrayElimCell_240 (_ BitVec 32)) (v_arrayElimCell_243 (_ BitVec 32)) (v_arrayElimCell_242 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_241)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_239)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_216)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_242)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_240)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_243)))))))) is different from true [2023-12-25 06:36:25,167 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 37 treesize of output 29 [2023-12-25 06:36:25,247 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 33 treesize of output 25 [2023-12-25 06:36:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 47 not checked. [2023-12-25 06:36:25,257 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:36:26,515 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 51 treesize of output 47 [2023-12-25 06:36:26,528 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 47 treesize of output 43 [2023-12-25 06:36:26,536 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 43 treesize of output 39 [2023-12-25 06:36:26,540 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 35 [2023-12-25 06:36:26,544 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 35 treesize of output 31 [2023-12-25 06:36:26,548 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 27 [2023-12-25 06:36:26,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231987480] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:36:26,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:36:26,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2023-12-25 06:36:26,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095713257] [2023-12-25 06:36:26,662 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:36:26,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 06:36:26,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:36:26,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 06:36:26,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=94, Unknown=12, NotChecked=348, Total=506 [2023-12-25 06:36:26,663 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 20 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 20 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 13 states have return successors, (14), 13 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-25 06:36:27,047 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_216 (_ BitVec 32)) (v_arrayElimCell_221 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_221)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_216))))))) (exists ((v_arrayElimCell_216 (_ BitVec 32)) (v_arrayElimCell_239 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_239)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_216)))))))))) is different from true [2023-12-25 06:36:27,056 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_216 (_ BitVec 32)) (v_arrayElimCell_239 (_ BitVec 32)) (v_arrayElimCell_240 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_239)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_216)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_240))))))) (exists ((v_arrayElimCell_222 (_ BitVec 32)) (v_arrayElimCell_216 (_ BitVec 32)) (v_arrayElimCell_221 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_221)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_222)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_216)))))))))) is different from true [2023-12-25 06:36:27,064 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_223 (_ BitVec 32)) (v_arrayElimCell_222 (_ BitVec 32)) (v_arrayElimCell_216 (_ BitVec 32)) (v_arrayElimCell_221 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_221)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_222)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_216)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_223))))))) (exists ((v_arrayElimCell_216 (_ BitVec 32)) (v_arrayElimCell_239 (_ BitVec 32)) (v_arrayElimCell_241 (_ BitVec 32)) (v_arrayElimCell_240 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_241)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_239)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_216)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_240))))) |c_#memory_int#3|))))) is different from true [2023-12-25 06:36:27,075 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_223 (_ BitVec 32)) (v_arrayElimCell_222 (_ BitVec 32)) (v_arrayElimCell_224 (_ BitVec 32)) (v_arrayElimCell_216 (_ BitVec 32)) (v_arrayElimCell_221 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_221)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_222)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_216)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_223)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_224))))))) (exists ((v_arrayElimCell_216 (_ BitVec 32)) (v_arrayElimCell_239 (_ BitVec 32)) (v_arrayElimCell_241 (_ BitVec 32)) (v_arrayElimCell_240 (_ BitVec 32)) (v_arrayElimCell_242 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_241)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_239)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_216)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_242)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_240)))))))))) is different from true [2023-12-25 06:36:27,087 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_216 (_ BitVec 32)) (v_arrayElimCell_239 (_ BitVec 32)) (v_arrayElimCell_241 (_ BitVec 32)) (v_arrayElimCell_240 (_ BitVec 32)) (v_arrayElimCell_243 (_ BitVec 32)) (v_arrayElimCell_242 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_241)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_239)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_216)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_242)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_240)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_243))))))) (exists ((v_arrayElimCell_223 (_ BitVec 32)) (v_arrayElimCell_222 (_ BitVec 32)) (v_arrayElimCell_225 (_ BitVec 32)) (v_arrayElimCell_224 (_ BitVec 32)) (v_arrayElimCell_216 (_ BitVec 32)) (v_arrayElimCell_221 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_221)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_222)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_216)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_223)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_224)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_225))))) |c_#memory_int#3|))))) is different from true [2023-12-25 06:36:31,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:36:31,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:36:31,221 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2023-12-25 06:36:31,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 06:36:31,222 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 20 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 13 states have return successors, (14), 13 states have call predecessors, (14), 4 states have call successors, (14) Word has length 41 [2023-12-25 06:36:31,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:36:31,222 INFO L225 Difference]: With dead ends: 36 [2023-12-25 06:36:31,222 INFO L226 Difference]: Without dead ends: 31 [2023-12-25 06:36:31,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 58 SyntacticMatches, 12 SemanticMatches, 27 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=69, Invalid=114, Unknown=17, NotChecked=612, Total=812 [2023-12-25 06:36:31,223 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 441 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-12-25 06:36:31,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 52 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 1 Unknown, 441 Unchecked, 4.4s Time] [2023-12-25 06:36:31,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-25 06:36:31,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-12-25 06:36:31,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-25 06:36:31,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2023-12-25 06:36:31,228 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 41 [2023-12-25 06:36:31,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:36:31,228 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2023-12-25 06:36:31,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 20 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 13 states have return successors, (14), 13 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-25 06:36:31,228 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2023-12-25 06:36:31,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-25 06:36:31,229 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:36:31,229 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:36:31,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (31)] Forceful destruction successful, exit code 0 [2023-12-25 06:36:31,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2023-12-25 06:36:31,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 06:36:31,637 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:36:31,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:36:31,637 INFO L85 PathProgramCache]: Analyzing trace with hash -166880537, now seen corresponding path program 7 times [2023-12-25 06:36:31,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:36:31,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865403270] [2023-12-25 06:36:31,637 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-25 06:36:31,638 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 [2023-12-25 06:36:31,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:36:31,639 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:36:31,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (34)] Waiting until timeout for monitored process [2023-12-25 06:36:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:36:31,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 92 conjunts are in the unsatisfiable core [2023-12-25 06:36:31,937 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:36:32,042 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 23 treesize of output 19 [2023-12-25 06:36:32,147 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 23 treesize of output 19 [2023-12-25 06:36:32,214 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 23 treesize of output 19 [2023-12-25 06:36:32,286 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 23 treesize of output 19 [2023-12-25 06:36:32,374 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 23 treesize of output 19 [2023-12-25 06:36:32,450 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 23 treesize of output 19 [2023-12-25 06:36:32,641 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_252 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_252)))))))) is different from true [2023-12-25 06:36:32,660 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_258 (_ BitVec 32)) (v_arrayElimCell_252 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_258)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_252)))))))) is different from true [2023-12-25 06:36:32,681 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_258 (_ BitVec 32)) (v_arrayElimCell_259 (_ BitVec 32)) (v_arrayElimCell_252 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_259)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_258)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_252)))))))) is different from true [2023-12-25 06:36:32,708 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_258 (_ BitVec 32)) (v_arrayElimCell_259 (_ BitVec 32)) (v_arrayElimCell_260 (_ BitVec 32)) (v_arrayElimCell_252 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_260)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_259)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_258)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_252)))))))) is different from true [2023-12-25 06:36:32,733 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_258 (_ BitVec 32)) (v_arrayElimCell_259 (_ BitVec 32)) (v_arrayElimCell_261 (_ BitVec 32)) (v_arrayElimCell_260 (_ BitVec 32)) (v_arrayElimCell_252 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_260)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_259)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_258)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_252)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_261)))))))) is different from true [2023-12-25 06:36:32,776 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_258 (_ BitVec 32)) (v_arrayElimCell_259 (_ BitVec 32)) (v_arrayElimCell_261 (_ BitVec 32)) (v_arrayElimCell_260 (_ BitVec 32)) (v_arrayElimCell_252 (_ BitVec 32)) (v_arrayElimCell_262 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_260)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_259)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_258)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_252)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_261)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_262)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:36:32,796 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 44 treesize of output 36 [2023-12-25 06:36:32,926 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 41 treesize of output 33 [2023-12-25 06:36:32,930 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 36 treesize of output 28 [2023-12-25 06:36:37,066 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 57 trivial. 54 not checked. [2023-12-25 06:36:37,066 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:36:39,699 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 64 treesize of output 56 [2023-12-25 06:36:39,702 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 56 treesize of output 52 [2023-12-25 06:36:39,705 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 52 treesize of output 48 [2023-12-25 06:36:39,708 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 48 treesize of output 44 [2023-12-25 06:36:39,711 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 44 treesize of output 40 [2023-12-25 06:36:39,713 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 40 treesize of output 36 [2023-12-25 06:36:39,716 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 36 treesize of output 32 [2023-12-25 06:36:39,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:36:39,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865403270] [2023-12-25 06:36:39,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865403270] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:36:39,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1623286307] [2023-12-25 06:36:39,855 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-25 06:36:39,855 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:36:39,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:36:39,856 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:36:39,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-12-25 06:36:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:36:40,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 96 conjunts are in the unsatisfiable core [2023-12-25 06:36:40,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:36:40,450 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 23 treesize of output 19 [2023-12-25 06:36:40,516 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 23 treesize of output 19 [2023-12-25 06:36:40,583 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 23 treesize of output 19 [2023-12-25 06:36:40,649 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 23 treesize of output 19 [2023-12-25 06:36:40,715 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 23 treesize of output 19 [2023-12-25 06:36:40,782 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 23 treesize of output 19 [2023-12-25 06:36:40,851 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 [2023-12-25 06:36:40,917 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_279 (_ BitVec 32)) (v_arrayElimCell_252 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_279)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_252)))))))) is different from true [2023-12-25 06:36:40,941 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_279 (_ BitVec 32)) (v_arrayElimCell_280 (_ BitVec 32)) (v_arrayElimCell_252 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_280)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_279)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_252)))))))) is different from true [2023-12-25 06:36:40,969 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_279 (_ BitVec 32)) (v_arrayElimCell_281 (_ BitVec 32)) (v_arrayElimCell_280 (_ BitVec 32)) (v_arrayElimCell_252 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_280)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_279)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_281)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_252)))))))) is different from true [2023-12-25 06:36:41,003 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_279 (_ BitVec 32)) (v_arrayElimCell_281 (_ BitVec 32)) (v_arrayElimCell_280 (_ BitVec 32)) (v_arrayElimCell_282 (_ BitVec 32)) (v_arrayElimCell_252 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_280)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_279)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_281)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_252)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_282)))))))) is different from true [2023-12-25 06:36:41,033 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_279 (_ BitVec 32)) (v_arrayElimCell_281 (_ BitVec 32)) (v_arrayElimCell_280 (_ BitVec 32)) (v_arrayElimCell_283 (_ BitVec 32)) (v_arrayElimCell_282 (_ BitVec 32)) (v_arrayElimCell_252 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_283)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_280)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_279)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_281)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_252)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_282)))))))) is different from true [2023-12-25 06:36:41,053 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 44 treesize of output 36 [2023-12-25 06:36:41,356 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 41 treesize of output 33 [2023-12-25 06:36:41,360 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 36 treesize of output 28 [2023-12-25 06:36:53,594 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 57 trivial. 54 not checked. [2023-12-25 06:36:53,594 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:36:57,313 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 56 treesize of output 52 [2023-12-25 06:36:57,316 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 52 treesize of output 48 [2023-12-25 06:36:57,320 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 48 treesize of output 44 [2023-12-25 06:36:57,324 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 44 treesize of output 40 [2023-12-25 06:36:57,333 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 40 treesize of output 36 [2023-12-25 06:36:57,338 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 36 treesize of output 32 [2023-12-25 06:37:01,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1623286307] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:37:01,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:37:01,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2023-12-25 06:37:01,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888832661] [2023-12-25 06:37:01,514 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:37:01,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-25 06:37:01,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:37:01,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-25 06:37:01,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=230, Unknown=15, NotChecked=440, Total=756 [2023-12-25 06:37:01,515 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 24 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 13 states have return successors, (14), 14 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-25 06:37:02,535 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_258 (_ BitVec 32)) (v_arrayElimCell_252 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_258)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_252))))))) (exists ((v_arrayElimCell_279 (_ BitVec 32)) (v_arrayElimCell_252 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_279)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_252)))))))))) is different from true [2023-12-25 06:37:02,543 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_258 (_ BitVec 32)) (v_arrayElimCell_259 (_ BitVec 32)) (v_arrayElimCell_252 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_259)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_258)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_252))))))) (exists ((v_arrayElimCell_279 (_ BitVec 32)) (v_arrayElimCell_280 (_ BitVec 32)) (v_arrayElimCell_252 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_280)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_279)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_252)))))))))) is different from true [2023-12-25 06:37:02,552 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_279 (_ BitVec 32)) (v_arrayElimCell_281 (_ BitVec 32)) (v_arrayElimCell_280 (_ BitVec 32)) (v_arrayElimCell_252 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_280)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_279)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_281)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_252))))))) (exists ((v_arrayElimCell_258 (_ BitVec 32)) (v_arrayElimCell_259 (_ BitVec 32)) (v_arrayElimCell_260 (_ BitVec 32)) (v_arrayElimCell_252 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_260)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_259)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_258)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_252)))))))))) is different from true [2023-12-25 06:37:02,564 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_258 (_ BitVec 32)) (v_arrayElimCell_259 (_ BitVec 32)) (v_arrayElimCell_261 (_ BitVec 32)) (v_arrayElimCell_260 (_ BitVec 32)) (v_arrayElimCell_252 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_260)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_259)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_258)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_252)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_261))))))) (exists ((v_arrayElimCell_279 (_ BitVec 32)) (v_arrayElimCell_281 (_ BitVec 32)) (v_arrayElimCell_280 (_ BitVec 32)) (v_arrayElimCell_282 (_ BitVec 32)) (v_arrayElimCell_252 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_280)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_279)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_281)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_252)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_282)))))))))) is different from true [2023-12-25 06:37:02,576 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_258 (_ BitVec 32)) (v_arrayElimCell_259 (_ BitVec 32)) (v_arrayElimCell_261 (_ BitVec 32)) (v_arrayElimCell_260 (_ BitVec 32)) (v_arrayElimCell_252 (_ BitVec 32)) (v_arrayElimCell_262 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_260)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_259)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_258)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_252)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_261)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_262))))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_279 (_ BitVec 32)) (v_arrayElimCell_281 (_ BitVec 32)) (v_arrayElimCell_280 (_ BitVec 32)) (v_arrayElimCell_283 (_ BitVec 32)) (v_arrayElimCell_282 (_ BitVec 32)) (v_arrayElimCell_252 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_283)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_280)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_279)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_281)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_252)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_282)))))))))) is different from true [2023-12-25 06:37:06,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:37:10,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:37:10,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:37:10,865 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2023-12-25 06:37:10,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 06:37:10,866 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 13 states have return successors, (14), 14 states have call predecessors, (14), 4 states have call successors, (14) Word has length 45 [2023-12-25 06:37:10,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:37:10,867 INFO L225 Difference]: With dead ends: 40 [2023-12-25 06:37:10,867 INFO L226 Difference]: Without dead ends: 38 [2023-12-25 06:37:10,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 59 SyntacticMatches, 11 SemanticMatches, 37 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=125, Invalid=425, Unknown=20, NotChecked=912, Total=1482 [2023-12-25 06:37:10,868 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 14 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 555 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2023-12-25 06:37:10,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 81 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 2 Unknown, 555 Unchecked, 8.7s Time] [2023-12-25 06:37:10,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-25 06:37:10,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2023-12-25 06:37:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 9 states have return successors, (11), 10 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-25 06:37:10,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2023-12-25 06:37:10,873 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 45 [2023-12-25 06:37:10,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:37:10,873 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2023-12-25 06:37:10,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 13 states have return successors, (14), 14 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-25 06:37:10,874 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2023-12-25 06:37:10,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-25 06:37:10,874 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:37:10,875 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:37:10,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (34)] Forceful destruction successful, exit code 0 [2023-12-25 06:37:11,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2023-12-25 06:37:11,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 06:37:11,275 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:37:11,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:37:11,276 INFO L85 PathProgramCache]: Analyzing trace with hash -878325301, now seen corresponding path program 7 times [2023-12-25 06:37:11,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:37:11,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209647979] [2023-12-25 06:37:11,276 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-25 06:37:11,277 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 [2023-12-25 06:37:11,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:37:11,278 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:37:11,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (36)] Waiting until timeout for monitored process [2023-12-25 06:37:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:37:11,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-25 06:37:11,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:37:11,616 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 23 treesize of output 19 [2023-12-25 06:37:11,676 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 23 treesize of output 19 [2023-12-25 06:37:11,741 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 23 treesize of output 19 [2023-12-25 06:37:11,794 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 23 treesize of output 19 [2023-12-25 06:37:11,852 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 23 treesize of output 19 [2023-12-25 06:37:11,926 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 23 treesize of output 19 [2023-12-25 06:37:12,006 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 23 treesize of output 19 [2023-12-25 06:37:12,021 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_299 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_299)))))))) is different from true [2023-12-25 06:37:12,063 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_299 (_ BitVec 32)) (v_arrayElimCell_293 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_299)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_293)))))))) is different from true [2023-12-25 06:37:12,101 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_300 (_ BitVec 32)) (v_arrayElimCell_299 (_ BitVec 32)) (v_arrayElimCell_293 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_299)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_293)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_300)))))))) is different from true [2023-12-25 06:37:12,125 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_300 (_ BitVec 32)) (v_arrayElimCell_299 (_ BitVec 32)) (v_arrayElimCell_301 (_ BitVec 32)) (v_arrayElimCell_293 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_301)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_299)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_293)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_300)))))))) is different from true [2023-12-25 06:37:12,151 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_300 (_ BitVec 32)) (v_arrayElimCell_299 (_ BitVec 32)) (v_arrayElimCell_302 (_ BitVec 32)) (v_arrayElimCell_301 (_ BitVec 32)) (v_arrayElimCell_293 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_301)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_299)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_302)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_293)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_300)))))))) is different from true [2023-12-25 06:37:12,184 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_300 (_ BitVec 32)) (v_arrayElimCell_299 (_ BitVec 32)) (v_arrayElimCell_302 (_ BitVec 32)) (v_arrayElimCell_301 (_ BitVec 32)) (v_arrayElimCell_303 (_ BitVec 32)) (v_arrayElimCell_293 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_301)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_299)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_303)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_302)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_293)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_300)))))))) is different from true [2023-12-25 06:37:12,221 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_300 (_ BitVec 32)) (v_arrayElimCell_299 (_ BitVec 32)) (v_arrayElimCell_302 (_ BitVec 32)) (v_arrayElimCell_301 (_ BitVec 32)) (v_arrayElimCell_304 (_ BitVec 32)) (v_arrayElimCell_303 (_ BitVec 32)) (v_arrayElimCell_293 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_301)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_299)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_303)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_304)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_302)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_293)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_300)))))))) is different from true [2023-12-25 06:37:12,244 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 40 treesize of output 32 [2023-12-25 06:37:12,352 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 36 treesize of output 28 [2023-12-25 06:37:16,469 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 64 trivial. 62 not checked. [2023-12-25 06:37:16,469 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:37:18,032 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 58 treesize of output 54 [2023-12-25 06:37:18,036 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 54 treesize of output 50 [2023-12-25 06:37:18,039 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 50 treesize of output 46 [2023-12-25 06:37:18,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 46 treesize of output 42 [2023-12-25 06:37:18,046 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 42 treesize of output 38 [2023-12-25 06:37:18,050 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 38 treesize of output 34 [2023-12-25 06:37:18,053 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 34 treesize of output 30 [2023-12-25 06:37:18,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:37:18,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209647979] [2023-12-25 06:37:18,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209647979] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:37:18,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1358396830] [2023-12-25 06:37:18,191 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-25 06:37:18,191 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:37:18,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:37:18,192 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:37:18,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-12-25 06:37:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:37:18,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-25 06:37:18,665 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:37:18,716 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 23 treesize of output 19 [2023-12-25 06:37:18,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 23 treesize of output 19 [2023-12-25 06:37:18,811 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 23 treesize of output 19 [2023-12-25 06:37:18,849 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 23 treesize of output 19 [2023-12-25 06:37:18,885 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 23 treesize of output 19 [2023-12-25 06:37:18,935 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 23 treesize of output 19 [2023-12-25 06:37:18,987 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 23 treesize of output 19 [2023-12-25 06:37:18,999 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_320 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_320)))))))) is different from true [2023-12-25 06:37:19,041 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_293 (_ BitVec 32)) (v_arrayElimCell_320 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_320)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_293)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:37:19,068 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_321 (_ BitVec 32)) (v_arrayElimCell_293 (_ BitVec 32)) (v_arrayElimCell_320 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_320)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_321)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_293)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:37:19,096 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_322 (_ BitVec 32)) (v_arrayElimCell_321 (_ BitVec 32)) (v_arrayElimCell_293 (_ BitVec 32)) (v_arrayElimCell_320 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_322)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_320)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_321)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_293)))))))) is different from true [2023-12-25 06:37:19,132 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_322 (_ BitVec 32)) (v_arrayElimCell_321 (_ BitVec 32)) (v_arrayElimCell_323 (_ BitVec 32)) (v_arrayElimCell_293 (_ BitVec 32)) (v_arrayElimCell_320 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_322)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_323)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_320)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_321)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_293)))))))) is different from true [2023-12-25 06:37:19,206 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_322 (_ BitVec 32)) (v_arrayElimCell_321 (_ BitVec 32)) (v_arrayElimCell_324 (_ BitVec 32)) (v_arrayElimCell_323 (_ BitVec 32)) (v_arrayElimCell_293 (_ BitVec 32)) (v_arrayElimCell_320 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_322)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_323)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_320)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_321)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_324)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_293)))))))) is different from true [2023-12-25 06:37:19,248 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_322 (_ BitVec 32)) (v_arrayElimCell_321 (_ BitVec 32)) (v_arrayElimCell_324 (_ BitVec 32)) (v_arrayElimCell_323 (_ BitVec 32)) (v_arrayElimCell_325 (_ BitVec 32)) (v_arrayElimCell_293 (_ BitVec 32)) (v_arrayElimCell_320 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_325)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_322)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_323)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_320)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_321)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_324)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_293)))))))) is different from true [2023-12-25 06:37:19,275 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 40 treesize of output 32 [2023-12-25 06:37:20,199 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 36 treesize of output 28 [2023-12-25 06:37:24,273 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 64 trivial. 62 not checked. [2023-12-25 06:37:24,273 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:37:25,916 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 58 treesize of output 54 [2023-12-25 06:37:25,919 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 54 treesize of output 50 [2023-12-25 06:37:25,922 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 50 treesize of output 46 [2023-12-25 06:37:25,926 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 46 treesize of output 42 [2023-12-25 06:37:25,929 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 42 treesize of output 38 [2023-12-25 06:37:25,933 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 38 treesize of output 34 [2023-12-25 06:37:25,937 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 34 treesize of output 30 [2023-12-25 06:37:26,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1358396830] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:37:26,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:37:26,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2023-12-25 06:37:26,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903710919] [2023-12-25 06:37:26,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:37:26,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-25 06:37:26,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:37:26,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-25 06:37:26,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=129, Unknown=15, NotChecked=490, Total=702 [2023-12-25 06:37:26,107 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 24 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 1 states have call predecessors, (5), 15 states have return successors, (16), 16 states have call predecessors, (16), 5 states have call successors, (16) [2023-12-25 06:37:26,356 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_299 (_ BitVec 32)) (v_arrayElimCell_293 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_299)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_293))))))) (exists ((v_arrayElimCell_293 (_ BitVec 32)) (v_arrayElimCell_320 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_320)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_293))))) |c_#memory_int#3|))))) is different from true [2023-12-25 06:37:26,363 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_300 (_ BitVec 32)) (v_arrayElimCell_299 (_ BitVec 32)) (v_arrayElimCell_293 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_299)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_293)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_300))))))) (exists ((v_arrayElimCell_321 (_ BitVec 32)) (v_arrayElimCell_293 (_ BitVec 32)) (v_arrayElimCell_320 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_320)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_321)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_293))))) |c_#memory_int#3|))))) is different from true [2023-12-25 06:37:26,371 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_300 (_ BitVec 32)) (v_arrayElimCell_299 (_ BitVec 32)) (v_arrayElimCell_301 (_ BitVec 32)) (v_arrayElimCell_293 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_301)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_299)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_293)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_300))))))) (exists ((v_arrayElimCell_322 (_ BitVec 32)) (v_arrayElimCell_321 (_ BitVec 32)) (v_arrayElimCell_293 (_ BitVec 32)) (v_arrayElimCell_320 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_322)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_320)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_321)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_293)))))))))) is different from true [2023-12-25 06:37:26,382 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_300 (_ BitVec 32)) (v_arrayElimCell_299 (_ BitVec 32)) (v_arrayElimCell_302 (_ BitVec 32)) (v_arrayElimCell_301 (_ BitVec 32)) (v_arrayElimCell_293 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_301)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_299)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_302)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_293)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_300))))))) (exists ((v_arrayElimCell_322 (_ BitVec 32)) (v_arrayElimCell_321 (_ BitVec 32)) (v_arrayElimCell_323 (_ BitVec 32)) (v_arrayElimCell_293 (_ BitVec 32)) (v_arrayElimCell_320 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_322)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_323)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_320)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_321)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_293)))))))))) is different from true [2023-12-25 06:37:26,394 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_322 (_ BitVec 32)) (v_arrayElimCell_321 (_ BitVec 32)) (v_arrayElimCell_324 (_ BitVec 32)) (v_arrayElimCell_323 (_ BitVec 32)) (v_arrayElimCell_293 (_ BitVec 32)) (v_arrayElimCell_320 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_322)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_323)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_320)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_321)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_324)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_293))))))) (exists ((v_arrayElimCell_300 (_ BitVec 32)) (v_arrayElimCell_299 (_ BitVec 32)) (v_arrayElimCell_302 (_ BitVec 32)) (v_arrayElimCell_301 (_ BitVec 32)) (v_arrayElimCell_303 (_ BitVec 32)) (v_arrayElimCell_293 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_301)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_299)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_303)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_302)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_293)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_300)))))))))) is different from true [2023-12-25 06:37:26,406 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_322 (_ BitVec 32)) (v_arrayElimCell_321 (_ BitVec 32)) (v_arrayElimCell_324 (_ BitVec 32)) (v_arrayElimCell_323 (_ BitVec 32)) (v_arrayElimCell_325 (_ BitVec 32)) (v_arrayElimCell_293 (_ BitVec 32)) (v_arrayElimCell_320 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_325)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_322)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_323)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_320)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_321)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_324)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_293))))))) (exists ((v_arrayElimCell_300 (_ BitVec 32)) (v_arrayElimCell_299 (_ BitVec 32)) (v_arrayElimCell_302 (_ BitVec 32)) (v_arrayElimCell_301 (_ BitVec 32)) (v_arrayElimCell_304 (_ BitVec 32)) (v_arrayElimCell_303 (_ BitVec 32)) (v_arrayElimCell_293 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_301)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_299)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_303)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_304)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_302)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_293)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_300)))))))))) is different from true [2023-12-25 06:37:27,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:37:27,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:37:27,952 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2023-12-25 06:37:27,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 06:37:27,952 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 1 states have call predecessors, (5), 15 states have return successors, (16), 16 states have call predecessors, (16), 5 states have call successors, (16) Word has length 46 [2023-12-25 06:37:27,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:37:27,953 INFO L225 Difference]: With dead ends: 38 [2023-12-25 06:37:27,953 INFO L226 Difference]: Without dead ends: 33 [2023-12-25 06:37:27,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 62 SyntacticMatches, 14 SemanticMatches, 32 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=88, Invalid=153, Unknown=21, NotChecked=860, Total=1122 [2023-12-25 06:37:27,954 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 569 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-25 06:37:27,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 66 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 569 Unchecked, 1.7s Time] [2023-12-25 06:37:27,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-25 06:37:27,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-12-25 06:37:27,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 9 states have return successors, (10), 9 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-25 06:37:27,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2023-12-25 06:37:27,958 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 46 [2023-12-25 06:37:27,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:37:27,959 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2023-12-25 06:37:27,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 1 states have call predecessors, (5), 15 states have return successors, (16), 16 states have call predecessors, (16), 5 states have call successors, (16) [2023-12-25 06:37:27,959 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2023-12-25 06:37:27,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-25 06:37:27,960 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:37:27,960 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:37:27,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Forceful destruction successful, exit code 0 [2023-12-25 06:37:28,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (36)] Forceful destruction successful, exit code 0 [2023-12-25 06:37:28,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-25 06:37:28,364 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:37:28,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:37:28,365 INFO L85 PathProgramCache]: Analyzing trace with hash 2135267422, now seen corresponding path program 8 times [2023-12-25 06:37:28,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:37:28,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75171253] [2023-12-25 06:37:28,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:37:28,365 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 [2023-12-25 06:37:28,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:37:28,366 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:37:28,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (38)] Waiting until timeout for monitored process [2023-12-25 06:37:28,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:37:28,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:37:28,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 104 conjunts are in the unsatisfiable core [2023-12-25 06:37:28,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:37:28,790 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 23 treesize of output 19 [2023-12-25 06:37:28,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 23 treesize of output 19 [2023-12-25 06:37:28,957 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 23 treesize of output 19 [2023-12-25 06:37:29,033 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 23 treesize of output 19 [2023-12-25 06:37:29,114 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 23 treesize of output 19 [2023-12-25 06:37:29,180 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 23 treesize of output 19 [2023-12-25 06:37:29,250 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 23 treesize of output 19 [2023-12-25 06:37:29,408 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_335 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_335)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))))) is different from true [2023-12-25 06:37:29,429 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_335 (_ BitVec 32)) (v_arrayElimCell_342 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_335)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_342)))))))) is different from true [2023-12-25 06:37:29,458 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_343 (_ BitVec 32)) (v_arrayElimCell_335 (_ BitVec 32)) (v_arrayElimCell_342 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_343)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_335)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_342)))))))) is different from true [2023-12-25 06:37:29,497 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_344 (_ BitVec 32)) (v_arrayElimCell_343 (_ BitVec 32)) (v_arrayElimCell_335 (_ BitVec 32)) (v_arrayElimCell_342 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_343)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_335)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_344)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_342)))))))) is different from true [2023-12-25 06:37:29,536 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_344 (_ BitVec 32)) (v_arrayElimCell_343 (_ BitVec 32)) (v_arrayElimCell_335 (_ BitVec 32)) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_342 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_343)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_335)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_344)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_345)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_342)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:37:29,570 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_344 (_ BitVec 32)) (v_arrayElimCell_343 (_ BitVec 32)) (v_arrayElimCell_335 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_342 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_343)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_335)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_344)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_345)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_342)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_346)))))))) is different from true [2023-12-25 06:37:29,602 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_344 (_ BitVec 32)) (v_arrayElimCell_343 (_ BitVec 32)) (v_arrayElimCell_335 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32)) (v_arrayElimCell_342 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_343)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_335)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_344)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_345)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_347)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_342)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_346)))))))) is different from true [2023-12-25 06:37:29,620 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 47 treesize of output 39 [2023-12-25 06:37:29,805 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 44 treesize of output 36 [2023-12-25 06:37:29,809 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 31 [2023-12-25 06:37:33,980 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 77 trivial. 70 not checked. [2023-12-25 06:37:33,981 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:37:37,269 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 71 treesize of output 67 [2023-12-25 06:37:37,276 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 67 treesize of output 59 [2023-12-25 06:37:37,280 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 59 treesize of output 55 [2023-12-25 06:37:37,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 55 treesize of output 51 [2023-12-25 06:37:37,295 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 51 treesize of output 47 [2023-12-25 06:37:37,300 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 47 treesize of output 43 [2023-12-25 06:37:37,304 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 43 treesize of output 39 [2023-12-25 06:37:37,309 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 35 [2023-12-25 06:37:37,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:37:37,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75171253] [2023-12-25 06:37:37,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75171253] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:37:37,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [682758085] [2023-12-25 06:37:37,555 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:37:37,555 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:37:37,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:37:37,556 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:37:37,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2023-12-25 06:37:38,099 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-25 06:37:38,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305182119] [2023-12-25 06:37:38,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:37:38,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 06:37:38,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:37:38,102 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-25 06:37:38,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2023-12-25 06:37:38,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Forceful destruction successful, exit code 1 [2023-12-25 06:37:38,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:37:38,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:37:38,468 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 106 conjunts are in the unsatisfiable core [2023-12-25 06:37:38,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:37:38,508 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 23 treesize of output 19 [2023-12-25 06:37:38,570 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 23 treesize of output 19 [2023-12-25 06:37:38,636 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 23 treesize of output 19 [2023-12-25 06:37:38,700 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 23 treesize of output 19 [2023-12-25 06:37:38,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 23 treesize of output 19 [2023-12-25 06:37:38,831 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 23 treesize of output 19 [2023-12-25 06:37:38,895 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 23 treesize of output 19 [2023-12-25 06:37:38,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-25 06:37:39,040 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_366 (_ BitVec 32)) (v_arrayElimCell_335 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_335)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_366)))))))) is different from true [2023-12-25 06:37:39,063 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_366 (_ BitVec 32)) (v_arrayElimCell_335 (_ BitVec 32)) (v_arrayElimCell_367 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_335)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_367)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_366)))))))) is different from true [2023-12-25 06:37:39,087 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_366 (_ BitVec 32)) (v_arrayElimCell_335 (_ BitVec 32)) (v_arrayElimCell_368 (_ BitVec 32)) (v_arrayElimCell_367 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_335)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_368)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_367)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_366)))))))) is different from true [2023-12-25 06:37:39,115 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_366 (_ BitVec 32)) (v_arrayElimCell_335 (_ BitVec 32)) (v_arrayElimCell_368 (_ BitVec 32)) (v_arrayElimCell_367 (_ BitVec 32)) (v_arrayElimCell_369 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_335)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_368)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_367)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_366)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_369)))))))) is different from true [2023-12-25 06:37:39,144 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_366 (_ BitVec 32)) (v_arrayElimCell_335 (_ BitVec 32)) (v_arrayElimCell_368 (_ BitVec 32)) (v_arrayElimCell_367 (_ BitVec 32)) (v_arrayElimCell_369 (_ BitVec 32)) (v_arrayElimCell_370 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_335)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_368)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_367)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_366)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_369)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_370)))))))) is different from true [2023-12-25 06:37:39,176 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_366 (_ BitVec 32)) (v_arrayElimCell_335 (_ BitVec 32)) (v_arrayElimCell_368 (_ BitVec 32)) (v_arrayElimCell_367 (_ BitVec 32)) (v_arrayElimCell_369 (_ BitVec 32)) (v_arrayElimCell_371 (_ BitVec 32)) (v_arrayElimCell_370 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_371)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_335)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_368)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_367)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_366)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_369)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_370)))))))) is different from true [2023-12-25 06:37:39,194 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 47 treesize of output 39 [2023-12-25 06:37:39,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 44 treesize of output 36 [2023-12-25 06:37:39,341 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 31 [2023-12-25 06:37:47,575 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 77 trivial. 70 not checked. [2023-12-25 06:37:47,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:37:52,030 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 63 treesize of output 59 [2023-12-25 06:37:52,033 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 59 treesize of output 55 [2023-12-25 06:37:52,036 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 55 treesize of output 51 [2023-12-25 06:37:52,038 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 51 treesize of output 47 [2023-12-25 06:37:52,041 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 47 treesize of output 43 [2023-12-25 06:37:52,045 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 43 treesize of output 39 [2023-12-25 06:37:52,048 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 35 [2023-12-25 06:37:56,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305182119] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:37:56,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:37:56,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2023-12-25 06:37:56,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900838733] [2023-12-25 06:37:56,211 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:37:56,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-25 06:37:56,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:37:56,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-25 06:37:56,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=180, Unknown=17, NotChecked=494, Total=756 [2023-12-25 06:37:56,213 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 24 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 15 states have return successors, (16), 15 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-25 06:37:57,134 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_366 (_ BitVec 32)) (v_arrayElimCell_335 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_335)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_366))))))) (exists ((v_arrayElimCell_335 (_ BitVec 32)) (v_arrayElimCell_342 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_335)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_342)))))))))) is different from true [2023-12-25 06:37:57,143 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_343 (_ BitVec 32)) (v_arrayElimCell_335 (_ BitVec 32)) (v_arrayElimCell_342 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_343)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_335)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_342))))))) (exists ((v_arrayElimCell_366 (_ BitVec 32)) (v_arrayElimCell_335 (_ BitVec 32)) (v_arrayElimCell_367 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_335)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_367)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_366)))))))))) is different from true [2023-12-25 06:37:57,154 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_344 (_ BitVec 32)) (v_arrayElimCell_343 (_ BitVec 32)) (v_arrayElimCell_335 (_ BitVec 32)) (v_arrayElimCell_342 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_343)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_335)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_344)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_342))))))) (exists ((v_arrayElimCell_366 (_ BitVec 32)) (v_arrayElimCell_335 (_ BitVec 32)) (v_arrayElimCell_368 (_ BitVec 32)) (v_arrayElimCell_367 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_335)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_368)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_367)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_366)))))))))) is different from true [2023-12-25 06:37:57,166 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_366 (_ BitVec 32)) (v_arrayElimCell_335 (_ BitVec 32)) (v_arrayElimCell_368 (_ BitVec 32)) (v_arrayElimCell_367 (_ BitVec 32)) (v_arrayElimCell_369 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_335)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_368)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_367)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_366)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_369))))))) (exists ((v_arrayElimCell_344 (_ BitVec 32)) (v_arrayElimCell_343 (_ BitVec 32)) (v_arrayElimCell_335 (_ BitVec 32)) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_342 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_343)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_335)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_344)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_345)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_342))))) |c_#memory_int#3|))))) is different from true [2023-12-25 06:37:57,181 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_366 (_ BitVec 32)) (v_arrayElimCell_335 (_ BitVec 32)) (v_arrayElimCell_368 (_ BitVec 32)) (v_arrayElimCell_367 (_ BitVec 32)) (v_arrayElimCell_369 (_ BitVec 32)) (v_arrayElimCell_370 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_335)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_368)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_367)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_366)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_369)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_370))))))) (exists ((v_arrayElimCell_344 (_ BitVec 32)) (v_arrayElimCell_343 (_ BitVec 32)) (v_arrayElimCell_335 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_342 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_343)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_335)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_344)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_345)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_342)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_346)))))))))) is different from true [2023-12-25 06:37:57,199 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_366 (_ BitVec 32)) (v_arrayElimCell_335 (_ BitVec 32)) (v_arrayElimCell_368 (_ BitVec 32)) (v_arrayElimCell_367 (_ BitVec 32)) (v_arrayElimCell_369 (_ BitVec 32)) (v_arrayElimCell_371 (_ BitVec 32)) (v_arrayElimCell_370 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_371)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_335)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_368)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_367)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_366)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_369)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_370))))))) (exists ((v_arrayElimCell_344 (_ BitVec 32)) (v_arrayElimCell_343 (_ BitVec 32)) (v_arrayElimCell_335 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32)) (v_arrayElimCell_342 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_343)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_335)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_344)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_345)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_347)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_342)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_346)))))))))) is different from true [2023-12-25 06:38:01,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:38:05,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:38:09,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:38:13,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:38:13,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:38:13,663 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2023-12-25 06:38:13,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 06:38:13,668 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 15 states have return successors, (16), 15 states have call predecessors, (16), 3 states have call successors, (16) Word has length 50 [2023-12-25 06:38:13,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:38:13,668 INFO L225 Difference]: With dead ends: 42 [2023-12-25 06:38:13,668 INFO L226 Difference]: Without dead ends: 40 [2023-12-25 06:38:13,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 66 SyntacticMatches, 14 SemanticMatches, 38 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=118, Invalid=355, Unknown=23, NotChecked=1064, Total=1560 [2023-12-25 06:38:13,669 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 649 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2023-12-25 06:38:13,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 72 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 4 Unknown, 649 Unchecked, 16.8s Time] [2023-12-25 06:38:13,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-12-25 06:38:13,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2023-12-25 06:38:13,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 10 states have return successors, (12), 11 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-25 06:38:13,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2023-12-25 06:38:13,673 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 50 [2023-12-25 06:38:13,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:38:13,674 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2023-12-25 06:38:13,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 15 states have return successors, (16), 15 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-25 06:38:13,674 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2023-12-25 06:38:13,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-25 06:38:13,675 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:38:13,675 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:38:13,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (38)] Forceful destruction successful, exit code 0 [2023-12-25 06:38:13,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2023-12-25 06:38:14,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 06:38:14,078 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:38:14,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:38:14,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1768784692, now seen corresponding path program 8 times [2023-12-25 06:38:14,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:38:14,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [285992714] [2023-12-25 06:38:14,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:38:14,078 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 [2023-12-25 06:38:14,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:38:14,079 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:38:14,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (41)] Waiting until timeout for monitored process [2023-12-25 06:38:14,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:38:14,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:38:14,503 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 69 conjunts are in the unsatisfiable core [2023-12-25 06:38:14,509 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:38:14,584 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 23 treesize of output 19 [2023-12-25 06:38:14,650 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 23 treesize of output 19 [2023-12-25 06:38:14,691 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 23 treesize of output 19 [2023-12-25 06:38:14,736 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 23 treesize of output 19 [2023-12-25 06:38:14,790 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 23 treesize of output 19 [2023-12-25 06:38:14,850 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 23 treesize of output 19 [2023-12-25 06:38:14,900 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 23 treesize of output 19 [2023-12-25 06:38:14,946 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 23 treesize of output 19 [2023-12-25 06:38:14,954 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_389 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_389)))))))) is different from true [2023-12-25 06:38:14,987 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_389 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_389)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_382)))))))) is different from true [2023-12-25 06:38:15,008 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_389 (_ BitVec 32)) (v_arrayElimCell_390 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_389)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_390)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_382)))))))) is different from true [2023-12-25 06:38:15,033 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_389 (_ BitVec 32)) (v_arrayElimCell_391 (_ BitVec 32)) (v_arrayElimCell_390 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_391)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_389)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_390)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_382)))))))) is different from true [2023-12-25 06:38:15,059 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_389 (_ BitVec 32)) (v_arrayElimCell_391 (_ BitVec 32)) (v_arrayElimCell_390 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32)) (v_arrayElimCell_392 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_391)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_389)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_390)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_382)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_392)))))))) is different from true [2023-12-25 06:38:15,089 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_389 (_ BitVec 32)) (v_arrayElimCell_391 (_ BitVec 32)) (v_arrayElimCell_390 (_ BitVec 32)) (v_arrayElimCell_393 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32)) (v_arrayElimCell_392 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_391)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_389)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_393)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_390)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_382)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_392)))))))) is different from true [2023-12-25 06:38:15,121 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_389 (_ BitVec 32)) (v_arrayElimCell_391 (_ BitVec 32)) (v_arrayElimCell_390 (_ BitVec 32)) (v_arrayElimCell_393 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32)) (v_arrayElimCell_392 (_ BitVec 32)) (v_arrayElimCell_394 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_394)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_391)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_389)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_393)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_390)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_382)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_392)))))))) is different from true [2023-12-25 06:38:15,163 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_389 (_ BitVec 32)) (v_arrayElimCell_391 (_ BitVec 32)) (v_arrayElimCell_390 (_ BitVec 32)) (v_arrayElimCell_393 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32)) (v_arrayElimCell_392 (_ BitVec 32)) (v_arrayElimCell_395 (_ BitVec 32)) (v_arrayElimCell_394 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_394)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_391)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_389)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_393)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_390)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_395)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_382)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_392)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:38:15,182 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 43 treesize of output 35 [2023-12-25 06:38:15,322 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 31 [2023-12-25 06:38:19,433 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 85 trivial. 79 not checked. [2023-12-25 06:38:19,434 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:38:21,608 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 65 treesize of output 61 [2023-12-25 06:38:21,613 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 61 treesize of output 57 [2023-12-25 06:38:21,617 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 57 treesize of output 53 [2023-12-25 06:38:21,620 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 53 treesize of output 49 [2023-12-25 06:38:21,623 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 49 treesize of output 45 [2023-12-25 06:38:21,625 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 45 treesize of output 41 [2023-12-25 06:38:21,628 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 41 treesize of output 37 [2023-12-25 06:38:21,630 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 37 treesize of output 33 [2023-12-25 06:38:21,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:38:21,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [285992714] [2023-12-25 06:38:21,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [285992714] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:38:21,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2009340465] [2023-12-25 06:38:21,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:38:21,852 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:38:21,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:38:21,853 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:38:21,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process [2023-12-25 06:38:22,469 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-25 06:38:22,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203998302] [2023-12-25 06:38:22,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:38:22,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 06:38:22,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:38:22,471 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-25 06:38:22,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2023-12-25 06:38:22,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (42)] Forceful destruction successful, exit code 1 [2023-12-25 06:38:22,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:38:22,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:38:22,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 69 conjunts are in the unsatisfiable core [2023-12-25 06:38:22,865 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:38:22,906 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 23 treesize of output 19 [2023-12-25 06:38:22,966 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 23 treesize of output 19 [2023-12-25 06:38:23,047 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 23 treesize of output 19 [2023-12-25 06:38:23,112 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 23 treesize of output 19 [2023-12-25 06:38:23,179 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 23 treesize of output 19 [2023-12-25 06:38:23,247 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 23 treesize of output 19 [2023-12-25 06:38:23,285 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 23 treesize of output 19 [2023-12-25 06:38:23,321 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 23 treesize of output 19 [2023-12-25 06:38:23,329 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_413 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_413)))))))) is different from true [2023-12-25 06:38:23,360 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_413 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_413)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_382)))))))) is different from true [2023-12-25 06:38:23,376 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_414 (_ BitVec 32)) (v_arrayElimCell_413 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_414)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_413)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_382)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:38:23,395 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_414 (_ BitVec 32)) (v_arrayElimCell_413 (_ BitVec 32)) (v_arrayElimCell_415 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_414)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_415)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_413)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_382)))))))) is different from true [2023-12-25 06:38:23,421 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_414 (_ BitVec 32)) (v_arrayElimCell_413 (_ BitVec 32)) (v_arrayElimCell_416 (_ BitVec 32)) (v_arrayElimCell_415 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_416)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_414)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_415)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_413)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_382)))))))) is different from true [2023-12-25 06:38:23,444 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_414 (_ BitVec 32)) (v_arrayElimCell_413 (_ BitVec 32)) (v_arrayElimCell_416 (_ BitVec 32)) (v_arrayElimCell_415 (_ BitVec 32)) (v_arrayElimCell_417 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_416)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_417)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_414)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_415)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_413)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_382)))))))) is different from true [2023-12-25 06:38:23,467 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_414 (_ BitVec 32)) (v_arrayElimCell_413 (_ BitVec 32)) (v_arrayElimCell_416 (_ BitVec 32)) (v_arrayElimCell_415 (_ BitVec 32)) (v_arrayElimCell_418 (_ BitVec 32)) (v_arrayElimCell_417 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_416)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_417)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_414)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_415)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_413)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_382)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_418)))))))) is different from true [2023-12-25 06:38:23,493 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_414 (_ BitVec 32)) (v_arrayElimCell_413 (_ BitVec 32)) (v_arrayElimCell_416 (_ BitVec 32)) (v_arrayElimCell_415 (_ BitVec 32)) (v_arrayElimCell_418 (_ BitVec 32)) (v_arrayElimCell_417 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32)) (v_arrayElimCell_419 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_416)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_417)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_414)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_419)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_415)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_413)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_382)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_418)))))))) is different from true [2023-12-25 06:38:23,514 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 43 treesize of output 35 [2023-12-25 06:38:23,609 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 31 [2023-12-25 06:38:23,621 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 85 trivial. 79 not checked. [2023-12-25 06:38:23,621 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:38:25,374 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 65 treesize of output 61 [2023-12-25 06:38:25,378 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 61 treesize of output 57 [2023-12-25 06:38:25,382 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 57 treesize of output 53 [2023-12-25 06:38:25,385 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 53 treesize of output 49 [2023-12-25 06:38:25,387 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 49 treesize of output 45 [2023-12-25 06:38:25,390 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 45 treesize of output 41 [2023-12-25 06:38:25,393 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 41 treesize of output 37 [2023-12-25 06:38:25,395 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 37 treesize of output 33 [2023-12-25 06:38:25,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203998302] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:38:25,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:38:25,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2023-12-25 06:38:25,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273916743] [2023-12-25 06:38:25,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:38:25,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-25 06:38:25,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:38:25,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-25 06:38:25,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=97, Unknown=17, NotChecked=528, Total=702 [2023-12-25 06:38:25,565 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 24 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 17 states have return successors, (18), 17 states have call predecessors, (18), 4 states have call successors, (18) [2023-12-25 06:38:25,855 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_389 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_389)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_382))))))) (exists ((v_arrayElimCell_413 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_413)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_382)))))))))) is different from true [2023-12-25 06:38:25,865 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_414 (_ BitVec 32)) (v_arrayElimCell_413 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_414)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_413)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_382))))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_389 (_ BitVec 32)) (v_arrayElimCell_390 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_389)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_390)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_382)))))))))) is different from true [2023-12-25 06:38:25,874 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_389 (_ BitVec 32)) (v_arrayElimCell_391 (_ BitVec 32)) (v_arrayElimCell_390 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_391)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_389)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_390)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_382))))))) (exists ((v_arrayElimCell_414 (_ BitVec 32)) (v_arrayElimCell_413 (_ BitVec 32)) (v_arrayElimCell_415 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_414)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_415)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_413)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_382)))))))))) is different from true [2023-12-25 06:38:25,882 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_414 (_ BitVec 32)) (v_arrayElimCell_413 (_ BitVec 32)) (v_arrayElimCell_416 (_ BitVec 32)) (v_arrayElimCell_415 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_416)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_414)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_415)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_413)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_382))))))) (exists ((v_arrayElimCell_389 (_ BitVec 32)) (v_arrayElimCell_391 (_ BitVec 32)) (v_arrayElimCell_390 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32)) (v_arrayElimCell_392 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_391)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_389)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_390)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_382)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_392)))))))))) is different from true [2023-12-25 06:38:25,894 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_414 (_ BitVec 32)) (v_arrayElimCell_413 (_ BitVec 32)) (v_arrayElimCell_416 (_ BitVec 32)) (v_arrayElimCell_415 (_ BitVec 32)) (v_arrayElimCell_417 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_416)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_417)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_414)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_415)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_413)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_382))))))) (exists ((v_arrayElimCell_389 (_ BitVec 32)) (v_arrayElimCell_391 (_ BitVec 32)) (v_arrayElimCell_390 (_ BitVec 32)) (v_arrayElimCell_393 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32)) (v_arrayElimCell_392 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_391)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_389)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_393)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_390)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_382)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_392)))))))))) is different from true [2023-12-25 06:38:25,906 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_414 (_ BitVec 32)) (v_arrayElimCell_413 (_ BitVec 32)) (v_arrayElimCell_416 (_ BitVec 32)) (v_arrayElimCell_415 (_ BitVec 32)) (v_arrayElimCell_418 (_ BitVec 32)) (v_arrayElimCell_417 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_416)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_417)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_414)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_415)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_413)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_382)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_418))))))) (exists ((v_arrayElimCell_389 (_ BitVec 32)) (v_arrayElimCell_391 (_ BitVec 32)) (v_arrayElimCell_390 (_ BitVec 32)) (v_arrayElimCell_393 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32)) (v_arrayElimCell_392 (_ BitVec 32)) (v_arrayElimCell_394 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_394)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_391)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_389)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_393)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_390)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_382)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_392)))))))))) is different from true [2023-12-25 06:38:25,938 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_414 (_ BitVec 32)) (v_arrayElimCell_413 (_ BitVec 32)) (v_arrayElimCell_416 (_ BitVec 32)) (v_arrayElimCell_415 (_ BitVec 32)) (v_arrayElimCell_418 (_ BitVec 32)) (v_arrayElimCell_417 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32)) (v_arrayElimCell_419 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_416)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_417)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_414)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_419)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_415)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_413)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_382)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_418))))))) (exists ((v_arrayElimCell_389 (_ BitVec 32)) (v_arrayElimCell_391 (_ BitVec 32)) (v_arrayElimCell_390 (_ BitVec 32)) (v_arrayElimCell_393 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32)) (v_arrayElimCell_392 (_ BitVec 32)) (v_arrayElimCell_395 (_ BitVec 32)) (v_arrayElimCell_394 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_394)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_391)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_389)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_393)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_390)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_395)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_382)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_392))))) |c_#memory_int#3|))))) is different from true [2023-12-25 06:38:29,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:38:34,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:38:34,219 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2023-12-25 06:38:34,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 06:38:34,220 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 17 states have return successors, (18), 17 states have call predecessors, (18), 4 states have call successors, (18) Word has length 51 [2023-12-25 06:38:34,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:38:34,220 INFO L225 Difference]: With dead ends: 40 [2023-12-25 06:38:34,220 INFO L226 Difference]: Without dead ends: 35 [2023-12-25 06:38:34,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 70 SyntacticMatches, 16 SemanticMatches, 33 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=81, Invalid=118, Unknown=25, NotChecked=966, Total=1190 [2023-12-25 06:38:34,221 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 655 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-12-25 06:38:34,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 60 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 1 Unknown, 655 Unchecked, 4.4s Time] [2023-12-25 06:38:34,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-25 06:38:34,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-12-25 06:38:34,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 10 states have return successors, (11), 10 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-25 06:38:34,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2023-12-25 06:38:34,226 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2023-12-25 06:38:34,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:38:34,226 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2023-12-25 06:38:34,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 17 states have return successors, (18), 17 states have call predecessors, (18), 4 states have call successors, (18) [2023-12-25 06:38:34,227 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2023-12-25 06:38:34,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-25 06:38:34,227 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:38:34,227 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:38:34,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (41)] Forceful destruction successful, exit code 0 [2023-12-25 06:38:34,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2023-12-25 06:38:34,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 06:38:34,635 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:38:34,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:38:34,635 INFO L85 PathProgramCache]: Analyzing trace with hash -433987905, now seen corresponding path program 9 times [2023-12-25 06:38:34,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:38:34,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539971363] [2023-12-25 06:38:34,636 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:38:34,636 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 [2023-12-25 06:38:34,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:38:34,637 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:38:34,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (44)] Waiting until timeout for monitored process [2023-12-25 06:38:35,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2023-12-25 06:38:35,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:38:35,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 116 conjunts are in the unsatisfiable core [2023-12-25 06:38:35,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:38:35,410 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 23 treesize of output 19 [2023-12-25 06:38:35,504 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 23 treesize of output 19 [2023-12-25 06:38:35,582 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 23 treesize of output 19 [2023-12-25 06:38:35,669 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 23 treesize of output 19 [2023-12-25 06:38:35,751 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 23 treesize of output 19 [2023-12-25 06:38:35,839 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 23 treesize of output 19 [2023-12-25 06:38:35,914 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 23 treesize of output 19 [2023-12-25 06:38:35,993 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 23 treesize of output 19 [2023-12-25 06:38:36,196 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_430 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_430)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:38:36,228 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_438 (_ BitVec 32)) (v_arrayElimCell_430 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_430)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_438)))))))) is different from true [2023-12-25 06:38:36,260 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_438 (_ BitVec 32)) (v_arrayElimCell_439 (_ BitVec 32)) (v_arrayElimCell_430 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_439)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_430)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_438)))))))) is different from true [2023-12-25 06:38:36,294 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_438 (_ BitVec 32)) (v_arrayElimCell_439 (_ BitVec 32)) (v_arrayElimCell_430 (_ BitVec 32)) (v_arrayElimCell_440 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_440)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_439)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_430)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_438)))))))) is different from true [2023-12-25 06:38:36,332 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_438 (_ BitVec 32)) (v_arrayElimCell_439 (_ BitVec 32)) (v_arrayElimCell_441 (_ BitVec 32)) (v_arrayElimCell_430 (_ BitVec 32)) (v_arrayElimCell_440 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_440)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_439)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_441)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_430)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_438)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:38:36,375 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_442 (_ BitVec 32)) (v_arrayElimCell_438 (_ BitVec 32)) (v_arrayElimCell_439 (_ BitVec 32)) (v_arrayElimCell_441 (_ BitVec 32)) (v_arrayElimCell_430 (_ BitVec 32)) (v_arrayElimCell_440 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_440)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_439)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_441)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_430)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_442)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_438)))))))) is different from true [2023-12-25 06:38:36,424 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_443 (_ BitVec 32)) (v_arrayElimCell_442 (_ BitVec 32)) (v_arrayElimCell_438 (_ BitVec 32)) (v_arrayElimCell_439 (_ BitVec 32)) (v_arrayElimCell_441 (_ BitVec 32)) (v_arrayElimCell_430 (_ BitVec 32)) (v_arrayElimCell_440 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_440)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_439)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_441)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_430)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_442)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_438)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_443)))))))) is different from true [2023-12-25 06:38:36,472 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_443 (_ BitVec 32)) (v_arrayElimCell_442 (_ BitVec 32)) (v_arrayElimCell_444 (_ BitVec 32)) (v_arrayElimCell_438 (_ BitVec 32)) (v_arrayElimCell_439 (_ BitVec 32)) (v_arrayElimCell_441 (_ BitVec 32)) (v_arrayElimCell_430 (_ BitVec 32)) (v_arrayElimCell_440 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_440)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_439)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_441)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_430)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_442)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_438)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_444)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_443)))))))) is different from true [2023-12-25 06:38:36,492 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 50 treesize of output 42 [2023-12-25 06:38:36,734 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 47 treesize of output 39 [2023-12-25 06:38:36,738 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 42 treesize of output 34 [2023-12-25 06:38:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 100 trivial. 88 not checked. [2023-12-25 06:38:41,855 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:38:45,667 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 78 treesize of output 74 [2023-12-25 06:38:45,670 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 74 treesize of output 70 [2023-12-25 06:38:45,672 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 70 treesize of output 66 [2023-12-25 06:38:45,674 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 66 treesize of output 62 [2023-12-25 06:38:45,676 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 62 treesize of output 58 [2023-12-25 06:38:45,678 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 58 treesize of output 54 [2023-12-25 06:38:45,681 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 54 treesize of output 50 [2023-12-25 06:38:45,686 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 50 treesize of output 46 [2023-12-25 06:38:45,689 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 46 treesize of output 38 [2023-12-25 06:38:45,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:38:45,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [539971363] [2023-12-25 06:38:45,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [539971363] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:38:45,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1544431771] [2023-12-25 06:38:45,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:38:45,899 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:38:45,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:38:45,900 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:38:45,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2023-12-25 06:38:46,779 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-25 06:38:46,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082921153] [2023-12-25 06:38:46,779 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:38:46,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 06:38:46,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:38:46,789 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-25 06:38:46,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (45)] Forceful destruction successful, exit code 1 [2023-12-25 06:38:46,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2023-12-25 06:38:50,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2023-12-25 06:38:50,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:38:50,768 INFO L262 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 118 conjunts are in the unsatisfiable core [2023-12-25 06:38:50,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:38:50,808 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 23 treesize of output 19 [2023-12-25 06:38:50,863 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 23 treesize of output 19 [2023-12-25 06:38:50,926 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 23 treesize of output 19 [2023-12-25 06:38:50,994 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 23 treesize of output 19 [2023-12-25 06:38:51,051 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 23 treesize of output 19 [2023-12-25 06:38:51,116 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 23 treesize of output 19 [2023-12-25 06:38:51,209 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 23 treesize of output 19 [2023-12-25 06:38:51,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 23 treesize of output 19 [2023-12-25 06:38:51,345 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 [2023-12-25 06:38:51,417 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_465 (_ BitVec 32)) (v_arrayElimCell_430 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_465)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_430)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))))) is different from true [2023-12-25 06:38:51,448 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_465 (_ BitVec 32)) (v_arrayElimCell_466 (_ BitVec 32)) (v_arrayElimCell_430 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_466)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_465)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_430)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:38:51,474 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_465 (_ BitVec 32)) (v_arrayElimCell_467 (_ BitVec 32)) (v_arrayElimCell_466 (_ BitVec 32)) (v_arrayElimCell_430 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_467)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_466)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_465)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_430)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))))) is different from true [2023-12-25 06:38:51,502 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_465 (_ BitVec 32)) (v_arrayElimCell_467 (_ BitVec 32)) (v_arrayElimCell_466 (_ BitVec 32)) (v_arrayElimCell_468 (_ BitVec 32)) (v_arrayElimCell_430 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_467)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_468)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_466)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_465)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_430)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:38:51,533 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_465 (_ BitVec 32)) (v_arrayElimCell_467 (_ BitVec 32)) (v_arrayElimCell_466 (_ BitVec 32)) (v_arrayElimCell_469 (_ BitVec 32)) (v_arrayElimCell_468 (_ BitVec 32)) (v_arrayElimCell_430 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_467)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_468)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_466)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_465)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_430)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_469)))))))) is different from true [2023-12-25 06:38:51,565 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_465 (_ BitVec 32)) (v_arrayElimCell_467 (_ BitVec 32)) (v_arrayElimCell_466 (_ BitVec 32)) (v_arrayElimCell_469 (_ BitVec 32)) (v_arrayElimCell_468 (_ BitVec 32)) (v_arrayElimCell_470 (_ BitVec 32)) (v_arrayElimCell_430 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_467)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_468)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_470)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_466)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_465)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_430)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_469)))))))) is different from true [2023-12-25 06:38:51,598 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_465 (_ BitVec 32)) (v_arrayElimCell_467 (_ BitVec 32)) (v_arrayElimCell_466 (_ BitVec 32)) (v_arrayElimCell_469 (_ BitVec 32)) (v_arrayElimCell_468 (_ BitVec 32)) (v_arrayElimCell_470 (_ BitVec 32)) (v_arrayElimCell_471 (_ BitVec 32)) (v_arrayElimCell_430 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_467)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_468)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_470)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_466)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_465)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_430)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_471)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_469)))))))) is different from true [2023-12-25 06:38:51,620 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 50 treesize of output 42 [2023-12-25 06:38:52,586 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 47 treesize of output 39 [2023-12-25 06:38:52,592 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 42 treesize of output 34 [2023-12-25 06:39:00,867 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 100 trivial. 88 not checked. [2023-12-25 06:39:00,868 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:39:05,646 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 70 treesize of output 66 [2023-12-25 06:39:05,650 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 66 treesize of output 62 [2023-12-25 06:39:05,653 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 62 treesize of output 58 [2023-12-25 06:39:05,656 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 58 treesize of output 54 [2023-12-25 06:39:05,659 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 54 treesize of output 50 [2023-12-25 06:39:05,662 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 50 treesize of output 46 [2023-12-25 06:39:05,665 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 46 treesize of output 42 [2023-12-25 06:39:05,667 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 42 treesize of output 38 [2023-12-25 06:39:13,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082921153] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:39:13,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:39:13,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 26 [2023-12-25 06:39:13,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938051926] [2023-12-25 06:39:13,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:39:13,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 06:39:13,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:39:13,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 06:39:13,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=183, Unknown=20, NotChecked=600, Total=870 [2023-12-25 06:39:13,890 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 26 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 17 states have return successors, (18), 17 states have call predecessors, (18), 3 states have call successors, (18) [2023-12-25 06:39:15,322 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_465 (_ BitVec 32)) (v_arrayElimCell_430 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_465)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_430)) .cse2))))) (exists ((v_arrayElimCell_438 (_ BitVec 32)) (v_arrayElimCell_430 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_430)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_438)))))))))) is different from true [2023-12-25 06:39:15,331 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_438 (_ BitVec 32)) (v_arrayElimCell_439 (_ BitVec 32)) (v_arrayElimCell_430 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_439)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_430)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_438))))))) (exists ((v_arrayElimCell_465 (_ BitVec 32)) (v_arrayElimCell_466 (_ BitVec 32)) (v_arrayElimCell_430 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_466)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_465)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_430)) .cse2))) |c_#memory_int#3|))))) is different from true [2023-12-25 06:39:15,342 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_438 (_ BitVec 32)) (v_arrayElimCell_439 (_ BitVec 32)) (v_arrayElimCell_430 (_ BitVec 32)) (v_arrayElimCell_440 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_440)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_439)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_430)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_438))))))) (exists ((v_arrayElimCell_465 (_ BitVec 32)) (v_arrayElimCell_467 (_ BitVec 32)) (v_arrayElimCell_466 (_ BitVec 32)) (v_arrayElimCell_430 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_467)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_466)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_465)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_430)) .cse2)))))))) is different from true [2023-12-25 06:39:15,353 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_465 (_ BitVec 32)) (v_arrayElimCell_467 (_ BitVec 32)) (v_arrayElimCell_466 (_ BitVec 32)) (v_arrayElimCell_468 (_ BitVec 32)) (v_arrayElimCell_430 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_467)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_468)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_466)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_465)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_430)) .cse2))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_438 (_ BitVec 32)) (v_arrayElimCell_439 (_ BitVec 32)) (v_arrayElimCell_441 (_ BitVec 32)) (v_arrayElimCell_430 (_ BitVec 32)) (v_arrayElimCell_440 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_440)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_439)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_441)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_430)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_438))))) |c_#memory_int#3|))))) is different from true [2023-12-25 06:39:15,364 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_442 (_ BitVec 32)) (v_arrayElimCell_438 (_ BitVec 32)) (v_arrayElimCell_439 (_ BitVec 32)) (v_arrayElimCell_441 (_ BitVec 32)) (v_arrayElimCell_430 (_ BitVec 32)) (v_arrayElimCell_440 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_440)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_439)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_441)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_430)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_442)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_438))))))) (exists ((v_arrayElimCell_465 (_ BitVec 32)) (v_arrayElimCell_467 (_ BitVec 32)) (v_arrayElimCell_466 (_ BitVec 32)) (v_arrayElimCell_469 (_ BitVec 32)) (v_arrayElimCell_468 (_ BitVec 32)) (v_arrayElimCell_430 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_467)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_468)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_466)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_465)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_430)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_469)))))))))) is different from true [2023-12-25 06:39:15,378 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_443 (_ BitVec 32)) (v_arrayElimCell_442 (_ BitVec 32)) (v_arrayElimCell_438 (_ BitVec 32)) (v_arrayElimCell_439 (_ BitVec 32)) (v_arrayElimCell_441 (_ BitVec 32)) (v_arrayElimCell_430 (_ BitVec 32)) (v_arrayElimCell_440 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_440)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_439)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_441)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_430)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_442)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_438)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_443))))))) (exists ((v_arrayElimCell_465 (_ BitVec 32)) (v_arrayElimCell_467 (_ BitVec 32)) (v_arrayElimCell_466 (_ BitVec 32)) (v_arrayElimCell_469 (_ BitVec 32)) (v_arrayElimCell_468 (_ BitVec 32)) (v_arrayElimCell_470 (_ BitVec 32)) (v_arrayElimCell_430 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_467)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_468)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_470)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_466)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_465)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_430)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_469)))))))))) is different from true [2023-12-25 06:39:15,394 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_465 (_ BitVec 32)) (v_arrayElimCell_467 (_ BitVec 32)) (v_arrayElimCell_466 (_ BitVec 32)) (v_arrayElimCell_469 (_ BitVec 32)) (v_arrayElimCell_468 (_ BitVec 32)) (v_arrayElimCell_470 (_ BitVec 32)) (v_arrayElimCell_471 (_ BitVec 32)) (v_arrayElimCell_430 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_467)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_468)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_470)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_466)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_465)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_430)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_471)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_469))))))) (exists ((v_arrayElimCell_443 (_ BitVec 32)) (v_arrayElimCell_442 (_ BitVec 32)) (v_arrayElimCell_444 (_ BitVec 32)) (v_arrayElimCell_438 (_ BitVec 32)) (v_arrayElimCell_439 (_ BitVec 32)) (v_arrayElimCell_441 (_ BitVec 32)) (v_arrayElimCell_430 (_ BitVec 32)) (v_arrayElimCell_440 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_440)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_439)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_441)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_430)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_442)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_438)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_444)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_443)))))))))) is different from true [2023-12-25 06:39:23,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:39:27,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:39:28,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:39:28,028 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2023-12-25 06:39:28,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 06:39:28,030 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 17 states have return successors, (18), 17 states have call predecessors, (18), 3 states have call successors, (18) Word has length 55 [2023-12-25 06:39:28,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:39:28,030 INFO L225 Difference]: With dead ends: 44 [2023-12-25 06:39:28,031 INFO L226 Difference]: Without dead ends: 42 [2023-12-25 06:39:28,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 72 SyntacticMatches, 16 SemanticMatches, 41 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 28.6s TimeCoverageRelationStatistics Valid=122, Invalid=358, Unknown=28, NotChecked=1298, Total=1806 [2023-12-25 06:39:28,032 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 776 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:39:28,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 76 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 2 Unknown, 776 Unchecked, 9.2s Time] [2023-12-25 06:39:28,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-25 06:39:28,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2023-12-25 06:39:28,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 11 states have return successors, (13), 12 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-25 06:39:28,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2023-12-25 06:39:28,041 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 55 [2023-12-25 06:39:28,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:39:28,041 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2023-12-25 06:39:28,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 17 states have return successors, (18), 17 states have call predecessors, (18), 3 states have call successors, (18) [2023-12-25 06:39:28,042 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2023-12-25 06:39:28,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-25 06:39:28,042 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:39:28,042 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:39:28,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2023-12-25 06:39:28,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (44)] Forceful destruction successful, exit code 0 [2023-12-25 06:39:28,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-25 06:39:28,443 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:39:28,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:39:28,444 INFO L85 PathProgramCache]: Analyzing trace with hash -568719117, now seen corresponding path program 9 times [2023-12-25 06:39:28,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:39:28,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997468492] [2023-12-25 06:39:28,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:39:28,444 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 [2023-12-25 06:39:28,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:39:28,445 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:39:28,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (47)] Waiting until timeout for monitored process [2023-12-25 06:39:29,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2023-12-25 06:39:29,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:39:29,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 77 conjunts are in the unsatisfiable core [2023-12-25 06:39:29,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:39:29,178 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 23 treesize of output 19 [2023-12-25 06:39:29,242 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 23 treesize of output 19 [2023-12-25 06:39:29,294 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 23 treesize of output 19 [2023-12-25 06:39:29,345 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 23 treesize of output 19 [2023-12-25 06:39:29,396 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 23 treesize of output 19 [2023-12-25 06:39:29,448 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 23 treesize of output 19 [2023-12-25 06:39:29,499 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 23 treesize of output 19 [2023-12-25 06:39:29,550 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 23 treesize of output 19 [2023-12-25 06:39:29,599 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 23 treesize of output 19 [2023-12-25 06:39:29,609 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_491 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_491)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:39:29,644 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_491 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_491)))))))) is different from true [2023-12-25 06:39:29,664 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_492 (_ BitVec 32)) (v_arrayElimCell_491 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_492)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_491)))))))) is different from true [2023-12-25 06:39:29,686 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_492 (_ BitVec 32)) (v_arrayElimCell_491 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32)) (v_arrayElimCell_493 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_492)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_493)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_491)))))))) is different from true [2023-12-25 06:39:29,711 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_492 (_ BitVec 32)) (v_arrayElimCell_491 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32)) (v_arrayElimCell_494 (_ BitVec 32)) (v_arrayElimCell_493 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_492)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_494)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_493)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_491)))))))) is different from true [2023-12-25 06:39:29,744 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_492 (_ BitVec 32)) (v_arrayElimCell_491 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32)) (v_arrayElimCell_494 (_ BitVec 32)) (v_arrayElimCell_493 (_ BitVec 32)) (v_arrayElimCell_495 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_492)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_494)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_495)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_493)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_491)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:39:29,776 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_492 (_ BitVec 32)) (v_arrayElimCell_491 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32)) (v_arrayElimCell_494 (_ BitVec 32)) (v_arrayElimCell_493 (_ BitVec 32)) (v_arrayElimCell_496 (_ BitVec 32)) (v_arrayElimCell_495 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_492)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_494)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_495)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_493)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_491)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_496)))))))) is different from true [2023-12-25 06:39:29,810 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_497 (_ BitVec 32)) (v_arrayElimCell_492 (_ BitVec 32)) (v_arrayElimCell_491 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32)) (v_arrayElimCell_494 (_ BitVec 32)) (v_arrayElimCell_493 (_ BitVec 32)) (v_arrayElimCell_496 (_ BitVec 32)) (v_arrayElimCell_495 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_492)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_497)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_494)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_495)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_493)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_491)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_496)))))))) is different from true [2023-12-25 06:39:29,846 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_498 (_ BitVec 32)) (v_arrayElimCell_497 (_ BitVec 32)) (v_arrayElimCell_492 (_ BitVec 32)) (v_arrayElimCell_491 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32)) (v_arrayElimCell_494 (_ BitVec 32)) (v_arrayElimCell_493 (_ BitVec 32)) (v_arrayElimCell_496 (_ BitVec 32)) (v_arrayElimCell_495 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_492)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_497)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_498)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_494)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_495)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_493)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_491)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_496)))))))) is different from true [2023-12-25 06:39:29,880 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 46 treesize of output 38 [2023-12-25 06:39:30,053 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 42 treesize of output 34 [2023-12-25 06:39:30,193 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 109 trivial. 98 not checked. [2023-12-25 06:39:30,193 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:39:32,910 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 72 treesize of output 68 [2023-12-25 06:39:32,915 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 68 treesize of output 64 [2023-12-25 06:39:32,920 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 64 treesize of output 60 [2023-12-25 06:39:32,924 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 60 treesize of output 56 [2023-12-25 06:39:32,928 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 56 treesize of output 52 [2023-12-25 06:39:32,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 52 treesize of output 48 [2023-12-25 06:39:32,937 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 48 treesize of output 44 [2023-12-25 06:39:32,940 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 44 treesize of output 40 [2023-12-25 06:39:32,944 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 40 treesize of output 36 [2023-12-25 06:39:33,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:39:33,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997468492] [2023-12-25 06:39:33,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997468492] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:39:33,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [889434839] [2023-12-25 06:39:33,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:39:33,169 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:39:33,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:39:33,170 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:39:33,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (48)] Waiting until timeout for monitored process [2023-12-25 06:39:33,997 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-25 06:39:33,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188555773] [2023-12-25 06:39:33,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:39:33,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 06:39:33,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:39:33,999 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-25 06:39:34,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2023-12-25 06:39:34,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (48)] Forceful destruction successful, exit code 1 [2023-12-25 06:39:35,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2023-12-25 06:39:35,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:39:35,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 77 conjunts are in the unsatisfiable core [2023-12-25 06:39:35,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:39:35,126 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 23 treesize of output 19 [2023-12-25 06:39:35,182 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 23 treesize of output 19 [2023-12-25 06:39:35,238 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 23 treesize of output 19 [2023-12-25 06:39:35,296 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 23 treesize of output 19 [2023-12-25 06:39:35,359 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 23 treesize of output 19 [2023-12-25 06:39:35,419 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 23 treesize of output 19 [2023-12-25 06:39:35,474 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 23 treesize of output 19 [2023-12-25 06:39:35,528 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 23 treesize of output 19 [2023-12-25 06:39:35,591 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 23 treesize of output 19 [2023-12-25 06:39:35,602 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_518 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_518)))))))) is different from true [2023-12-25 06:39:35,655 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_518 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_518)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:39:35,679 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_519 (_ BitVec 32)) (v_arrayElimCell_518 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_518)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_519)))))))) is different from true [2023-12-25 06:39:35,702 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_520 (_ BitVec 32)) (v_arrayElimCell_519 (_ BitVec 32)) (v_arrayElimCell_518 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_518)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_520)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_519)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:39:35,728 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_520 (_ BitVec 32)) (v_arrayElimCell_521 (_ BitVec 32)) (v_arrayElimCell_519 (_ BitVec 32)) (v_arrayElimCell_518 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_518)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_521)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_520)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_519)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:39:35,757 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_520 (_ BitVec 32)) (v_arrayElimCell_522 (_ BitVec 32)) (v_arrayElimCell_521 (_ BitVec 32)) (v_arrayElimCell_519 (_ BitVec 32)) (v_arrayElimCell_518 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_522)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_518)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_521)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_520)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_519)))))))) is different from true [2023-12-25 06:39:35,790 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_520 (_ BitVec 32)) (v_arrayElimCell_522 (_ BitVec 32)) (v_arrayElimCell_521 (_ BitVec 32)) (v_arrayElimCell_523 (_ BitVec 32)) (v_arrayElimCell_519 (_ BitVec 32)) (v_arrayElimCell_518 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_522)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_518)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_521)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_520)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_519)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_523)))))))) is different from true [2023-12-25 06:39:35,826 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_520 (_ BitVec 32)) (v_arrayElimCell_522 (_ BitVec 32)) (v_arrayElimCell_521 (_ BitVec 32)) (v_arrayElimCell_524 (_ BitVec 32)) (v_arrayElimCell_523 (_ BitVec 32)) (v_arrayElimCell_519 (_ BitVec 32)) (v_arrayElimCell_518 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_522)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_524)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_518)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_521)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_520)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_519)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_523)))))))) is different from true [2023-12-25 06:39:35,866 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_520 (_ BitVec 32)) (v_arrayElimCell_522 (_ BitVec 32)) (v_arrayElimCell_521 (_ BitVec 32)) (v_arrayElimCell_524 (_ BitVec 32)) (v_arrayElimCell_523 (_ BitVec 32)) (v_arrayElimCell_525 (_ BitVec 32)) (v_arrayElimCell_519 (_ BitVec 32)) (v_arrayElimCell_518 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_522)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_524)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_518)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_521)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_525)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_520)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_519)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_523)))))))) is different from true [2023-12-25 06:39:35,886 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 46 treesize of output 38 [2023-12-25 06:39:36,007 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 42 treesize of output 34 [2023-12-25 06:39:36,022 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 109 trivial. 98 not checked. [2023-12-25 06:39:36,023 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:39:38,505 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 72 treesize of output 68 [2023-12-25 06:39:38,509 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 68 treesize of output 64 [2023-12-25 06:39:38,513 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 64 treesize of output 60 [2023-12-25 06:39:38,517 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 60 treesize of output 56 [2023-12-25 06:39:38,522 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 56 treesize of output 52 [2023-12-25 06:39:38,526 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 52 treesize of output 48 [2023-12-25 06:39:38,530 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 48 treesize of output 44 [2023-12-25 06:39:38,534 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 44 treesize of output 40 [2023-12-25 06:39:38,538 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 40 treesize of output 36 [2023-12-25 06:39:40,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188555773] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:39:40,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:39:40,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 26 [2023-12-25 06:39:40,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642830710] [2023-12-25 06:39:40,945 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:39:40,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 06:39:40,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:39:40,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 06:39:40,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=100, Unknown=18, NotChecked=630, Total=812 [2023-12-25 06:39:40,947 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 26 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 19 states have return successors, (20), 19 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-25 06:39:41,301 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_491 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_491))))))) (exists ((v_arrayElimCell_518 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_518))))) |c_#memory_int#3|))))) is different from true [2023-12-25 06:39:41,310 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_492 (_ BitVec 32)) (v_arrayElimCell_491 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_492)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_491))))))) (exists ((v_arrayElimCell_519 (_ BitVec 32)) (v_arrayElimCell_518 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_518)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_519)))))))))) is different from true [2023-12-25 06:39:41,319 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_492 (_ BitVec 32)) (v_arrayElimCell_491 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32)) (v_arrayElimCell_493 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_492)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_493)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_491))))))) (exists ((v_arrayElimCell_520 (_ BitVec 32)) (v_arrayElimCell_519 (_ BitVec 32)) (v_arrayElimCell_518 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_518)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_520)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_519))))) |c_#memory_int#3|))))) is different from true [2023-12-25 06:39:41,329 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_520 (_ BitVec 32)) (v_arrayElimCell_521 (_ BitVec 32)) (v_arrayElimCell_519 (_ BitVec 32)) (v_arrayElimCell_518 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_518)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_521)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_520)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_519))))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_492 (_ BitVec 32)) (v_arrayElimCell_491 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32)) (v_arrayElimCell_494 (_ BitVec 32)) (v_arrayElimCell_493 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_492)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_494)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_493)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_491)))))))))) is different from true [2023-12-25 06:39:41,340 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_520 (_ BitVec 32)) (v_arrayElimCell_522 (_ BitVec 32)) (v_arrayElimCell_521 (_ BitVec 32)) (v_arrayElimCell_519 (_ BitVec 32)) (v_arrayElimCell_518 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_522)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_518)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_521)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_520)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_519))))))) (exists ((v_arrayElimCell_492 (_ BitVec 32)) (v_arrayElimCell_491 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32)) (v_arrayElimCell_494 (_ BitVec 32)) (v_arrayElimCell_493 (_ BitVec 32)) (v_arrayElimCell_495 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_492)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_494)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_495)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_493)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_491))))) |c_#memory_int#3|))))) is different from true [2023-12-25 06:39:41,354 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_492 (_ BitVec 32)) (v_arrayElimCell_491 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32)) (v_arrayElimCell_494 (_ BitVec 32)) (v_arrayElimCell_493 (_ BitVec 32)) (v_arrayElimCell_496 (_ BitVec 32)) (v_arrayElimCell_495 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_492)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_494)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_495)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_493)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_491)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_496))))))) (exists ((v_arrayElimCell_520 (_ BitVec 32)) (v_arrayElimCell_522 (_ BitVec 32)) (v_arrayElimCell_521 (_ BitVec 32)) (v_arrayElimCell_523 (_ BitVec 32)) (v_arrayElimCell_519 (_ BitVec 32)) (v_arrayElimCell_518 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_522)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_518)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_521)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_520)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_519)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_523)))))))))) is different from true [2023-12-25 06:39:41,368 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_497 (_ BitVec 32)) (v_arrayElimCell_492 (_ BitVec 32)) (v_arrayElimCell_491 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32)) (v_arrayElimCell_494 (_ BitVec 32)) (v_arrayElimCell_493 (_ BitVec 32)) (v_arrayElimCell_496 (_ BitVec 32)) (v_arrayElimCell_495 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_492)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_497)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_494)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_495)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_493)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_491)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_496))))))) (exists ((v_arrayElimCell_520 (_ BitVec 32)) (v_arrayElimCell_522 (_ BitVec 32)) (v_arrayElimCell_521 (_ BitVec 32)) (v_arrayElimCell_524 (_ BitVec 32)) (v_arrayElimCell_523 (_ BitVec 32)) (v_arrayElimCell_519 (_ BitVec 32)) (v_arrayElimCell_518 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_522)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_524)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_518)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_521)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_520)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_519)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_523)))))))))) is different from true [2023-12-25 06:39:41,383 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_498 (_ BitVec 32)) (v_arrayElimCell_497 (_ BitVec 32)) (v_arrayElimCell_492 (_ BitVec 32)) (v_arrayElimCell_491 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32)) (v_arrayElimCell_494 (_ BitVec 32)) (v_arrayElimCell_493 (_ BitVec 32)) (v_arrayElimCell_496 (_ BitVec 32)) (v_arrayElimCell_495 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_492)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_497)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_498)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_494)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_495)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_493)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_491)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_496))))))) (exists ((v_arrayElimCell_520 (_ BitVec 32)) (v_arrayElimCell_522 (_ BitVec 32)) (v_arrayElimCell_521 (_ BitVec 32)) (v_arrayElimCell_524 (_ BitVec 32)) (v_arrayElimCell_523 (_ BitVec 32)) (v_arrayElimCell_525 (_ BitVec 32)) (v_arrayElimCell_519 (_ BitVec 32)) (v_arrayElimCell_518 (_ BitVec 32)) (v_arrayElimCell_483 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_522)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_524)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_483)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_518)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_521)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_525)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_520)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_519)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_523)))))))))) is different from true [2023-12-25 06:39:41,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:39:41,688 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2023-12-25 06:39:41,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 06:39:41,688 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 19 states have return successors, (20), 19 states have call predecessors, (20), 4 states have call successors, (20) Word has length 56 [2023-12-25 06:39:41,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:39:41,689 INFO L225 Difference]: With dead ends: 42 [2023-12-25 06:39:41,689 INFO L226 Difference]: Without dead ends: 37 [2023-12-25 06:39:41,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 76 SyntacticMatches, 18 SemanticMatches, 36 ConstructedPredicates, 26 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=87, Invalid=123, Unknown=26, NotChecked=1170, Total=1406 [2023-12-25 06:39:41,690 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 774 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 06:39:41,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 47 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 774 Unchecked, 0.5s Time] [2023-12-25 06:39:41,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-25 06:39:41,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-12-25 06:39:41,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 11 states have return successors, (12), 11 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-25 06:39:41,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2023-12-25 06:39:41,695 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 56 [2023-12-25 06:39:41,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:39:41,695 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2023-12-25 06:39:41,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 19 states have return successors, (20), 19 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-25 06:39:41,695 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2023-12-25 06:39:41,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-25 06:39:41,696 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:39:41,696 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:39:41,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2023-12-25 06:39:41,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (47)] Forceful destruction successful, exit code 0 [2023-12-25 06:39:42,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-25 06:39:42,101 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:39:42,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:39:42,101 INFO L85 PathProgramCache]: Analyzing trace with hash -729915274, now seen corresponding path program 10 times [2023-12-25 06:39:42,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:39:42,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [232825420] [2023-12-25 06:39:42,101 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 06:39:42,101 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 [2023-12-25 06:39:42,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:39:42,102 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:39:42,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (50)] Waiting until timeout for monitored process [2023-12-25 06:39:42,623 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 06:39:42,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:39:42,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 128 conjunts are in the unsatisfiable core [2023-12-25 06:39:42,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:39:42,735 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 23 treesize of output 19 [2023-12-25 06:39:42,840 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 23 treesize of output 19 [2023-12-25 06:39:42,917 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 23 treesize of output 19 [2023-12-25 06:39:42,996 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 23 treesize of output 19 [2023-12-25 06:39:43,075 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 23 treesize of output 19 [2023-12-25 06:39:43,154 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 23 treesize of output 19 [2023-12-25 06:39:43,231 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 23 treesize of output 19 [2023-12-25 06:39:43,324 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 23 treesize of output 19 [2023-12-25 06:39:43,403 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 23 treesize of output 19 [2023-12-25 06:39:43,583 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_537 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:39:43,606 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_546 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_546)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:39:43,631 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_546 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32)) (v_arrayElimCell_547 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_547)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_546)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)))))))) is different from true [2023-12-25 06:39:43,659 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_546 (_ BitVec 32)) (v_arrayElimCell_548 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32)) (v_arrayElimCell_547 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_547)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_546)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_548)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)))))))) is different from true [2023-12-25 06:39:43,695 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_546 (_ BitVec 32)) (v_arrayElimCell_548 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32)) (v_arrayElimCell_547 (_ BitVec 32)) (v_arrayElimCell_549 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_547)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_546)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_548)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_549)))))))) is different from true [2023-12-25 06:39:43,730 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_546 (_ BitVec 32)) (v_arrayElimCell_548 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32)) (v_arrayElimCell_547 (_ BitVec 32)) (v_arrayElimCell_549 (_ BitVec 32)) (v_arrayElimCell_550 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_547)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_546)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_548)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_550)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_549)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:39:43,766 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_546 (_ BitVec 32)) (v_arrayElimCell_548 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32)) (v_arrayElimCell_547 (_ BitVec 32)) (v_arrayElimCell_549 (_ BitVec 32)) (v_arrayElimCell_551 (_ BitVec 32)) (v_arrayElimCell_550 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_547)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_546)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_551)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_548)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_550)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_549)))))))) is different from true [2023-12-25 06:39:43,807 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_552 (_ BitVec 32)) (v_arrayElimCell_546 (_ BitVec 32)) (v_arrayElimCell_548 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32)) (v_arrayElimCell_547 (_ BitVec 32)) (v_arrayElimCell_549 (_ BitVec 32)) (v_arrayElimCell_551 (_ BitVec 32)) (v_arrayElimCell_550 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_547)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_546)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_551)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_552)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_548)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_550)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_549)))))))) is different from true [2023-12-25 06:39:43,850 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_553 (_ BitVec 32)) (v_arrayElimCell_552 (_ BitVec 32)) (v_arrayElimCell_546 (_ BitVec 32)) (v_arrayElimCell_548 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32)) (v_arrayElimCell_547 (_ BitVec 32)) (v_arrayElimCell_549 (_ BitVec 32)) (v_arrayElimCell_551 (_ BitVec 32)) (v_arrayElimCell_550 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_547)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_553)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_546)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_551)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_552)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_548)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_550)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_549)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:39:43,872 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 53 treesize of output 45 [2023-12-25 06:39:44,125 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 50 treesize of output 42 [2023-12-25 06:39:44,130 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 45 treesize of output 37 [2023-12-25 06:39:44,430 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 126 trivial. 108 not checked. [2023-12-25 06:39:44,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:39:48,751 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 85 treesize of output 81 [2023-12-25 06:39:48,755 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 81 treesize of output 77 [2023-12-25 06:39:48,759 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 77 treesize of output 73 [2023-12-25 06:39:48,763 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 73 treesize of output 69 [2023-12-25 06:39:48,766 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 69 treesize of output 61 [2023-12-25 06:39:48,770 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 61 treesize of output 57 [2023-12-25 06:39:48,773 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 57 treesize of output 53 [2023-12-25 06:39:48,777 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 53 treesize of output 49 [2023-12-25 06:39:48,780 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 49 treesize of output 45 [2023-12-25 06:39:48,783 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 45 treesize of output 41 [2023-12-25 06:39:49,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:39:49,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [232825420] [2023-12-25 06:39:49,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [232825420] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:39:49,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [931312064] [2023-12-25 06:39:49,009 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 06:39:49,009 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:39:49,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:39:49,010 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:39:49,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (51)] Waiting until timeout for monitored process [2023-12-25 06:39:49,921 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 06:39:49,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:39:49,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 132 conjunts are in the unsatisfiable core [2023-12-25 06:39:49,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:39:50,074 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 23 treesize of output 19 [2023-12-25 06:39:50,150 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 23 treesize of output 19 [2023-12-25 06:39:50,240 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 23 treesize of output 19 [2023-12-25 06:39:50,313 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 23 treesize of output 19 [2023-12-25 06:39:50,392 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 23 treesize of output 19 [2023-12-25 06:39:50,470 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 23 treesize of output 19 [2023-12-25 06:39:50,549 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 23 treesize of output 19 [2023-12-25 06:39:50,623 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 23 treesize of output 19 [2023-12-25 06:39:50,696 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 23 treesize of output 19 [2023-12-25 06:39:50,767 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 12 treesize of output 8 [2023-12-25 06:39:50,980 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_876| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_876|) .cse0)) (exists ((v_arrayElimCell_537 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) .cse0)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)))))) |c_#memory_int#3|)))) is different from true [2023-12-25 06:39:51,012 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_876| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_876|) .cse0)) (exists ((v_arrayElimCell_576 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_576)) (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) .cse0)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)))))))))) is different from true [2023-12-25 06:39:51,049 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((v_arrayElimCell_577 (_ BitVec 32)) (v_arrayElimCell_576 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_576)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_577)) ((_ zero_extend 24) ((_ extract 7 0) .cse1)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_876| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_876|) .cse1)))) is different from true [2023-12-25 06:39:51,085 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_876| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_876|) .cse0)) (exists ((v_arrayElimCell_577 (_ BitVec 32)) (v_arrayElimCell_576 (_ BitVec 32)) (v_arrayElimCell_578 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_576)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_578)) (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_577)) ((_ zero_extend 24) ((_ extract 7 0) .cse0)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)))))))))) is different from true [2023-12-25 06:39:51,123 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_876| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_876|) .cse0)) (exists ((v_arrayElimCell_577 (_ BitVec 32)) (v_arrayElimCell_576 (_ BitVec 32)) (v_arrayElimCell_579 (_ BitVec 32)) (v_arrayElimCell_578 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_579)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_576)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_578)) (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_577)) ((_ zero_extend 24) ((_ extract 7 0) .cse0)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)))))))))) is different from true [2023-12-25 06:39:51,168 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_876| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_876|) .cse0)) (exists ((v_arrayElimCell_577 (_ BitVec 32)) (v_arrayElimCell_576 (_ BitVec 32)) (v_arrayElimCell_579 (_ BitVec 32)) (v_arrayElimCell_578 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32)) (v_arrayElimCell_580 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_579)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_576)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_578)) (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_577)) ((_ zero_extend 24) ((_ extract 7 0) .cse0)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_580)))))))))) is different from true [2023-12-25 06:39:51,215 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_876| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_876|) .cse0)) (exists ((v_arrayElimCell_577 (_ BitVec 32)) (v_arrayElimCell_576 (_ BitVec 32)) (v_arrayElimCell_579 (_ BitVec 32)) (v_arrayElimCell_578 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32)) (v_arrayElimCell_580 (_ BitVec 32)) (v_arrayElimCell_581 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_579)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_576)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_578)) (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_577)) ((_ zero_extend 24) ((_ extract 7 0) .cse0)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_580)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_581)))))))))) is different from true [2023-12-25 06:39:51,262 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_876| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_876|) .cse0)) (exists ((v_arrayElimCell_577 (_ BitVec 32)) (v_arrayElimCell_576 (_ BitVec 32)) (v_arrayElimCell_579 (_ BitVec 32)) (v_arrayElimCell_578 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32)) (v_arrayElimCell_580 (_ BitVec 32)) (v_arrayElimCell_582 (_ BitVec 32)) (v_arrayElimCell_581 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_579)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_576)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_578)) (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_582)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_577)) ((_ zero_extend 24) ((_ extract 7 0) .cse0)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_580)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_581)))))) |c_#memory_int#3|)))) is different from true [2023-12-25 06:39:51,315 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_876| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_876|) .cse0)) (exists ((v_arrayElimCell_577 (_ BitVec 32)) (v_arrayElimCell_576 (_ BitVec 32)) (v_arrayElimCell_579 (_ BitVec 32)) (v_arrayElimCell_578 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32)) (v_arrayElimCell_580 (_ BitVec 32)) (v_arrayElimCell_582 (_ BitVec 32)) (v_arrayElimCell_581 (_ BitVec 32)) (v_arrayElimCell_583 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_579)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_576)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_578)) (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_582)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_577)) ((_ zero_extend 24) ((_ extract 7 0) .cse0)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_583)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_580)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_581)))))))))) is different from true [2023-12-25 06:39:51,357 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 53 treesize of output 45 [2023-12-25 06:39:51,522 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 58 treesize of output 46 [2023-12-25 06:39:51,528 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 46 treesize of output 38 [2023-12-25 06:40:00,041 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 126 trivial. 108 not checked. [2023-12-25 06:40:00,041 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:40:05,915 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 79 treesize of output 75 [2023-12-25 06:40:05,918 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 75 treesize of output 71 [2023-12-25 06:40:05,922 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 71 treesize of output 67 [2023-12-25 06:40:05,926 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 67 treesize of output 63 [2023-12-25 06:40:05,929 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 63 treesize of output 59 [2023-12-25 06:40:05,933 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 59 treesize of output 55 [2023-12-25 06:40:05,936 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 55 treesize of output 51 [2023-12-25 06:40:05,940 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 51 treesize of output 47 [2023-12-25 06:40:05,943 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 47 treesize of output 43 [2023-12-25 06:40:14,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [931312064] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:40:14,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:40:14,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 32 [2023-12-25 06:40:14,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395707553] [2023-12-25 06:40:14,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:40:14,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-25 06:40:14,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:40:14,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-25 06:40:14,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=269, Unknown=22, NotChecked=882, Total=1260 [2023-12-25 06:40:14,246 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 32 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 21 states have return successors, (22), 22 states have call predecessors, (22), 5 states have call successors, (22) [2023-12-25 06:40:16,031 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse2 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) .cse0)))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_876| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_876|) .cse0)) (exists ((v_arrayElimCell_546 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_546)) .cse3 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537))))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_576 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_576)) .cse2 .cse3 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)))))))))) is different from true [2023-12-25 06:40:16,046 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse3)))) (and (exists ((v_arrayElimCell_577 (_ BitVec 32)) (v_arrayElimCell_576 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_576)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_577)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_876| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_876|) .cse3)) (exists ((v_arrayElimCell_546 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32)) (v_arrayElimCell_547 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_547)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_546)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)))))))))) is different from true [2023-12-25 06:40:16,058 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse2 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) .cse0)))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_876| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_876|) .cse0)) (exists ((v_arrayElimCell_577 (_ BitVec 32)) (v_arrayElimCell_576 (_ BitVec 32)) (v_arrayElimCell_578 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_576)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_578)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_577)) .cse3 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537))))))) (exists ((v_arrayElimCell_546 (_ BitVec 32)) (v_arrayElimCell_548 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32)) (v_arrayElimCell_547 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_547)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_546)) .cse3 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_548)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)))))))))) is different from true [2023-12-25 06:40:16,070 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse2 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) .cse0)))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_876| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_876|) .cse0)) (exists ((v_arrayElimCell_577 (_ BitVec 32)) (v_arrayElimCell_576 (_ BitVec 32)) (v_arrayElimCell_579 (_ BitVec 32)) (v_arrayElimCell_578 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_579)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_576)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_578)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_577)) .cse3 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537))))))) (exists ((v_arrayElimCell_546 (_ BitVec 32)) (v_arrayElimCell_548 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32)) (v_arrayElimCell_547 (_ BitVec 32)) (v_arrayElimCell_549 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_547)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_546)) .cse3 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_548)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_549)))))))))) is different from true [2023-12-25 06:40:16,086 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse2 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) .cse0)))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_876| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_876|) .cse0)) (exists ((v_arrayElimCell_546 (_ BitVec 32)) (v_arrayElimCell_548 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32)) (v_arrayElimCell_547 (_ BitVec 32)) (v_arrayElimCell_549 (_ BitVec 32)) (v_arrayElimCell_550 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_547)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_546)) .cse3 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_548)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_550)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_549))))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_577 (_ BitVec 32)) (v_arrayElimCell_576 (_ BitVec 32)) (v_arrayElimCell_579 (_ BitVec 32)) (v_arrayElimCell_578 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32)) (v_arrayElimCell_580 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_579)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_576)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_578)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_577)) .cse3 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_580)))))))))) is different from true [2023-12-25 06:40:16,104 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse2 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) .cse0)))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_876| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_876|) .cse0)) (exists ((v_arrayElimCell_577 (_ BitVec 32)) (v_arrayElimCell_576 (_ BitVec 32)) (v_arrayElimCell_579 (_ BitVec 32)) (v_arrayElimCell_578 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32)) (v_arrayElimCell_580 (_ BitVec 32)) (v_arrayElimCell_581 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_579)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_576)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_578)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_577)) .cse3 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_580)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_581))))))) (exists ((v_arrayElimCell_546 (_ BitVec 32)) (v_arrayElimCell_548 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32)) (v_arrayElimCell_547 (_ BitVec 32)) (v_arrayElimCell_549 (_ BitVec 32)) (v_arrayElimCell_551 (_ BitVec 32)) (v_arrayElimCell_550 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_547)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_546)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_551)) .cse3 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_548)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_550)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_549)))))))))) is different from true [2023-12-25 06:40:16,127 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse3)))) (and (exists ((v_arrayElimCell_552 (_ BitVec 32)) (v_arrayElimCell_546 (_ BitVec 32)) (v_arrayElimCell_548 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32)) (v_arrayElimCell_547 (_ BitVec 32)) (v_arrayElimCell_549 (_ BitVec 32)) (v_arrayElimCell_551 (_ BitVec 32)) (v_arrayElimCell_550 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_547)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_546)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_551)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_552)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_548)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_550)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_549))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_876| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_876|) .cse3)) (exists ((v_arrayElimCell_577 (_ BitVec 32)) (v_arrayElimCell_576 (_ BitVec 32)) (v_arrayElimCell_579 (_ BitVec 32)) (v_arrayElimCell_578 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32)) (v_arrayElimCell_580 (_ BitVec 32)) (v_arrayElimCell_582 (_ BitVec 32)) (v_arrayElimCell_581 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_579)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_576)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_578)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_582)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_577)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_580)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_581))))) |c_#memory_int#3|))))) is different from true [2023-12-25 06:40:16,149 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse2 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) .cse0)))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_876| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_876|) .cse0)) (exists ((v_arrayElimCell_553 (_ BitVec 32)) (v_arrayElimCell_552 (_ BitVec 32)) (v_arrayElimCell_546 (_ BitVec 32)) (v_arrayElimCell_548 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32)) (v_arrayElimCell_547 (_ BitVec 32)) (v_arrayElimCell_549 (_ BitVec 32)) (v_arrayElimCell_551 (_ BitVec 32)) (v_arrayElimCell_550 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_547)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_553)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_546)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_551)) .cse3 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_552)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_548)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_550)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_549))))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_577 (_ BitVec 32)) (v_arrayElimCell_576 (_ BitVec 32)) (v_arrayElimCell_579 (_ BitVec 32)) (v_arrayElimCell_578 (_ BitVec 32)) (v_arrayElimCell_537 (_ BitVec 32)) (v_arrayElimCell_580 (_ BitVec 32)) (v_arrayElimCell_582 (_ BitVec 32)) (v_arrayElimCell_581 (_ BitVec 32)) (v_arrayElimCell_583 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_579)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_576)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_578)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_582)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_577)) .cse3 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_583)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_537)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_580)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_581)))))))))) is different from true [2023-12-25 06:40:20,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:40:24,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:40:24,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:40:24,737 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2023-12-25 06:40:24,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-25 06:40:24,738 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 21 states have return successors, (22), 22 states have call predecessors, (22), 5 states have call successors, (22) Word has length 60 [2023-12-25 06:40:24,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:40:24,738 INFO L225 Difference]: With dead ends: 46 [2023-12-25 06:40:24,738 INFO L226 Difference]: Without dead ends: 44 [2023-12-25 06:40:24,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 76 SyntacticMatches, 17 SemanticMatches, 48 ConstructedPredicates, 26 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=150, Invalid=476, Unknown=30, NotChecked=1794, Total=2450 [2023-12-25 06:40:24,740 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 10 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 1010 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:40:24,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 92 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 2 Unknown, 1010 Unchecked, 9.2s Time] [2023-12-25 06:40:24,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-25 06:40:24,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2023-12-25 06:40:24,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 12 states have return successors, (14), 13 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-25 06:40:24,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2023-12-25 06:40:24,749 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 60 [2023-12-25 06:40:24,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:40:24,749 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2023-12-25 06:40:24,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 21 states have return successors, (22), 22 states have call predecessors, (22), 5 states have call successors, (22) [2023-12-25 06:40:24,752 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2023-12-25 06:40:24,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 06:40:24,753 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:40:24,753 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:40:24,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (51)] Forceful destruction successful, exit code 0 [2023-12-25 06:40:24,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (50)] Ended with exit code 0 [2023-12-25 06:40:25,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-25 06:40:25,156 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:40:25,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:40:25,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1152532964, now seen corresponding path program 10 times [2023-12-25 06:40:25,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:40:25,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439615825] [2023-12-25 06:40:25,157 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 06:40:25,157 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 [2023-12-25 06:40:25,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:40:25,158 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:40:25,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (52)] Waiting until timeout for monitored process [2023-12-25 06:40:25,698 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 06:40:25,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:40:25,708 INFO L262 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 85 conjunts are in the unsatisfiable core [2023-12-25 06:40:25,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:40:25,773 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 23 treesize of output 19 [2023-12-25 06:40:25,842 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 23 treesize of output 19 [2023-12-25 06:40:25,898 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 23 treesize of output 19 [2023-12-25 06:40:25,961 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 23 treesize of output 19 [2023-12-25 06:40:26,022 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 23 treesize of output 19 [2023-12-25 06:40:26,077 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 23 treesize of output 19 [2023-12-25 06:40:26,133 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 23 treesize of output 19 [2023-12-25 06:40:26,189 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 23 treesize of output 19 [2023-12-25 06:40:26,243 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 23 treesize of output 19 [2023-12-25 06:40:26,300 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 23 treesize of output 19 [2023-12-25 06:40:26,313 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_605 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_605)))))))) is different from true [2023-12-25 06:40:26,357 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_605 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_605)))))))) is different from true [2023-12-25 06:40:26,379 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_605 (_ BitVec 32)) (v_arrayElimCell_606 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_606)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_605)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:40:26,417 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_605 (_ BitVec 32)) (v_arrayElimCell_607 (_ BitVec 32)) (v_arrayElimCell_606 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_606)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_607)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_605)))))))) is different from true [2023-12-25 06:40:26,444 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_605 (_ BitVec 32)) (v_arrayElimCell_607 (_ BitVec 32)) (v_arrayElimCell_606 (_ BitVec 32)) (v_arrayElimCell_608 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_606)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_607)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_608)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_605)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:40:26,472 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_605 (_ BitVec 32)) (v_arrayElimCell_607 (_ BitVec 32)) (v_arrayElimCell_606 (_ BitVec 32)) (v_arrayElimCell_609 (_ BitVec 32)) (v_arrayElimCell_608 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_606)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_609)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_607)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_608)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_605)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:40:26,502 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_610 (_ BitVec 32)) (v_arrayElimCell_605 (_ BitVec 32)) (v_arrayElimCell_607 (_ BitVec 32)) (v_arrayElimCell_606 (_ BitVec 32)) (v_arrayElimCell_609 (_ BitVec 32)) (v_arrayElimCell_608 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_606)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_609)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_610)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_607)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_608)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_605)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:40:26,536 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_610 (_ BitVec 32)) (v_arrayElimCell_611 (_ BitVec 32)) (v_arrayElimCell_605 (_ BitVec 32)) (v_arrayElimCell_607 (_ BitVec 32)) (v_arrayElimCell_606 (_ BitVec 32)) (v_arrayElimCell_609 (_ BitVec 32)) (v_arrayElimCell_608 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_606)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_611)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_609)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_610)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_607)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_608)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_605)))))))) is different from true [2023-12-25 06:40:26,575 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_610 (_ BitVec 32)) (v_arrayElimCell_612 (_ BitVec 32)) (v_arrayElimCell_611 (_ BitVec 32)) (v_arrayElimCell_605 (_ BitVec 32)) (v_arrayElimCell_607 (_ BitVec 32)) (v_arrayElimCell_606 (_ BitVec 32)) (v_arrayElimCell_609 (_ BitVec 32)) (v_arrayElimCell_608 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_606)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_611)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_609)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_612)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_610)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_607)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_608)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_605)))))))) is different from true [2023-12-25 06:40:26,614 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_610 (_ BitVec 32)) (v_arrayElimCell_612 (_ BitVec 32)) (v_arrayElimCell_611 (_ BitVec 32)) (v_arrayElimCell_613 (_ BitVec 32)) (v_arrayElimCell_605 (_ BitVec 32)) (v_arrayElimCell_607 (_ BitVec 32)) (v_arrayElimCell_606 (_ BitVec 32)) (v_arrayElimCell_609 (_ BitVec 32)) (v_arrayElimCell_608 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_606)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_611)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_609)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_612)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_610)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_607)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_608)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_605)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_613)))))))) is different from true [2023-12-25 06:40:26,637 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 49 treesize of output 41 [2023-12-25 06:40:26,814 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 45 treesize of output 37 [2023-12-25 06:40:27,092 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 136 trivial. 119 not checked. [2023-12-25 06:40:27,093 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:40:30,244 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 79 treesize of output 75 [2023-12-25 06:40:30,248 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 75 treesize of output 71 [2023-12-25 06:40:30,253 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 71 treesize of output 67 [2023-12-25 06:40:30,258 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 67 treesize of output 63 [2023-12-25 06:40:30,274 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 63 treesize of output 59 [2023-12-25 06:40:30,279 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 59 treesize of output 55 [2023-12-25 06:40:30,297 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 55 treesize of output 51 [2023-12-25 06:40:30,303 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 51 treesize of output 47 [2023-12-25 06:40:30,307 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 47 treesize of output 43 [2023-12-25 06:40:30,310 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 43 treesize of output 39 [2023-12-25 06:40:30,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:40:30,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439615825] [2023-12-25 06:40:30,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439615825] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:40:30,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1620189728] [2023-12-25 06:40:30,750 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 06:40:30,750 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:40:30,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:40:30,752 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:40:30,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (53)] Waiting until timeout for monitored process [2023-12-25 06:40:31,712 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 06:40:31,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:40:31,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 86 conjunts are in the unsatisfiable core [2023-12-25 06:40:31,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:40:31,801 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 23 treesize of output 19 [2023-12-25 06:40:31,854 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 23 treesize of output 19 [2023-12-25 06:40:31,906 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 23 treesize of output 19 [2023-12-25 06:40:31,957 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 23 treesize of output 19 [2023-12-25 06:40:32,009 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 23 treesize of output 19 [2023-12-25 06:40:32,061 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 23 treesize of output 19 [2023-12-25 06:40:32,112 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 23 treesize of output 19 [2023-12-25 06:40:32,164 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 23 treesize of output 19 [2023-12-25 06:40:32,214 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 23 treesize of output 19 [2023-12-25 06:40:32,266 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 23 treesize of output 19 [2023-12-25 06:40:32,276 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_635 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_635)))))))) is different from true [2023-12-25 06:40:32,311 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_635 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_635)))))))) is different from true [2023-12-25 06:40:32,332 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_636 (_ BitVec 32)) (v_arrayElimCell_635 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_635)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_636)))))))) is different from true [2023-12-25 06:40:32,354 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_636 (_ BitVec 32)) (v_arrayElimCell_635 (_ BitVec 32)) (v_arrayElimCell_637 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_637)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_635)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_636)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:40:32,380 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_636 (_ BitVec 32)) (v_arrayElimCell_635 (_ BitVec 32)) (v_arrayElimCell_638 (_ BitVec 32)) (v_arrayElimCell_637 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_637)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_635)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_636)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_638)))))))) is different from true [2023-12-25 06:40:32,408 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_636 (_ BitVec 32)) (v_arrayElimCell_635 (_ BitVec 32)) (v_arrayElimCell_638 (_ BitVec 32)) (v_arrayElimCell_637 (_ BitVec 32)) (v_arrayElimCell_639 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_639)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_637)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_635)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_636)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_638)))))))) is different from true [2023-12-25 06:40:32,440 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_640 (_ BitVec 32)) (v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_636 (_ BitVec 32)) (v_arrayElimCell_635 (_ BitVec 32)) (v_arrayElimCell_638 (_ BitVec 32)) (v_arrayElimCell_637 (_ BitVec 32)) (v_arrayElimCell_639 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_640)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_639)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_637)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_635)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_636)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_638)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:40:32,471 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_641 (_ BitVec 32)) (v_arrayElimCell_640 (_ BitVec 32)) (v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_636 (_ BitVec 32)) (v_arrayElimCell_635 (_ BitVec 32)) (v_arrayElimCell_638 (_ BitVec 32)) (v_arrayElimCell_637 (_ BitVec 32)) (v_arrayElimCell_639 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_640)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_639)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_637)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_635)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_636)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_638)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_641)))))))) is different from true [2023-12-25 06:40:32,506 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_641 (_ BitVec 32)) (v_arrayElimCell_640 (_ BitVec 32)) (v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_642 (_ BitVec 32)) (v_arrayElimCell_636 (_ BitVec 32)) (v_arrayElimCell_635 (_ BitVec 32)) (v_arrayElimCell_638 (_ BitVec 32)) (v_arrayElimCell_637 (_ BitVec 32)) (v_arrayElimCell_639 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_642)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_640)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_639)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_637)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_635)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_636)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_638)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_641)))))))) is different from true [2023-12-25 06:40:32,549 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_641 (_ BitVec 32)) (v_arrayElimCell_640 (_ BitVec 32)) (v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_643 (_ BitVec 32)) (v_arrayElimCell_642 (_ BitVec 32)) (v_arrayElimCell_636 (_ BitVec 32)) (v_arrayElimCell_635 (_ BitVec 32)) (v_arrayElimCell_638 (_ BitVec 32)) (v_arrayElimCell_637 (_ BitVec 32)) (v_arrayElimCell_639 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_642)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_640)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_639)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_637)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_635)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_643)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_636)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_638)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_641)))))))) is different from true [2023-12-25 06:40:32,572 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 49 treesize of output 41 [2023-12-25 06:40:32,733 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 45 treesize of output 37 [2023-12-25 06:40:32,904 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 136 trivial. 119 not checked. [2023-12-25 06:40:32,904 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:40:35,732 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 79 treesize of output 75 [2023-12-25 06:40:35,740 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 75 treesize of output 71 [2023-12-25 06:40:35,745 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 71 treesize of output 67 [2023-12-25 06:40:35,750 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 67 treesize of output 63 [2023-12-25 06:40:35,754 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 63 treesize of output 59 [2023-12-25 06:40:35,759 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 59 treesize of output 55 [2023-12-25 06:40:35,763 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 55 treesize of output 51 [2023-12-25 06:40:35,773 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 51 treesize of output 47 [2023-12-25 06:40:35,778 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 47 treesize of output 43 [2023-12-25 06:40:35,783 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 43 treesize of output 39 [2023-12-25 06:40:36,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1620189728] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:40:36,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:40:36,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 30 [2023-12-25 06:40:36,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162413727] [2023-12-25 06:40:36,079 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:40:36,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-25 06:40:36,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:40:36,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-25 06:40:36,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=136, Unknown=20, NotChecked=820, Total=1056 [2023-12-25 06:40:36,081 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 30 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 30 states have internal predecessors, (36), 5 states have call successors, (5), 1 states have call predecessors, (5), 21 states have return successors, (22), 22 states have call predecessors, (22), 5 states have call successors, (22) [2023-12-25 06:40:37,092 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_605 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_605))))))) (exists ((v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_635 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_635)))))))))) is different from true [2023-12-25 06:40:37,100 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_605 (_ BitVec 32)) (v_arrayElimCell_606 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_606)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_605))))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_636 (_ BitVec 32)) (v_arrayElimCell_635 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_635)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_636)))))))))) is different from true [2023-12-25 06:40:37,108 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_636 (_ BitVec 32)) (v_arrayElimCell_635 (_ BitVec 32)) (v_arrayElimCell_637 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_637)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_635)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_636))))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_605 (_ BitVec 32)) (v_arrayElimCell_607 (_ BitVec 32)) (v_arrayElimCell_606 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_606)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_607)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_605)))))))))) is different from true [2023-12-25 06:40:37,118 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_605 (_ BitVec 32)) (v_arrayElimCell_607 (_ BitVec 32)) (v_arrayElimCell_606 (_ BitVec 32)) (v_arrayElimCell_608 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_606)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_607)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_608)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_605))))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_636 (_ BitVec 32)) (v_arrayElimCell_635 (_ BitVec 32)) (v_arrayElimCell_638 (_ BitVec 32)) (v_arrayElimCell_637 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_637)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_635)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_636)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_638)))))))))) is different from true [2023-12-25 06:40:37,129 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_605 (_ BitVec 32)) (v_arrayElimCell_607 (_ BitVec 32)) (v_arrayElimCell_606 (_ BitVec 32)) (v_arrayElimCell_609 (_ BitVec 32)) (v_arrayElimCell_608 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_606)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_609)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_607)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_608)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_605))))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_636 (_ BitVec 32)) (v_arrayElimCell_635 (_ BitVec 32)) (v_arrayElimCell_638 (_ BitVec 32)) (v_arrayElimCell_637 (_ BitVec 32)) (v_arrayElimCell_639 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_639)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_637)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_635)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_636)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_638)))))))))) is different from true [2023-12-25 06:40:37,142 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_610 (_ BitVec 32)) (v_arrayElimCell_605 (_ BitVec 32)) (v_arrayElimCell_607 (_ BitVec 32)) (v_arrayElimCell_606 (_ BitVec 32)) (v_arrayElimCell_609 (_ BitVec 32)) (v_arrayElimCell_608 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_606)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_609)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_610)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_607)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_608)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_605))))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_640 (_ BitVec 32)) (v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_636 (_ BitVec 32)) (v_arrayElimCell_635 (_ BitVec 32)) (v_arrayElimCell_638 (_ BitVec 32)) (v_arrayElimCell_637 (_ BitVec 32)) (v_arrayElimCell_639 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_640)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_639)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_637)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_635)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_636)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_638))))) |c_#memory_int#3|))))) is different from true [2023-12-25 06:40:37,157 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_641 (_ BitVec 32)) (v_arrayElimCell_640 (_ BitVec 32)) (v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_636 (_ BitVec 32)) (v_arrayElimCell_635 (_ BitVec 32)) (v_arrayElimCell_638 (_ BitVec 32)) (v_arrayElimCell_637 (_ BitVec 32)) (v_arrayElimCell_639 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_640)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_639)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_637)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_635)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_636)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_638)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_641))))))) (exists ((v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_610 (_ BitVec 32)) (v_arrayElimCell_611 (_ BitVec 32)) (v_arrayElimCell_605 (_ BitVec 32)) (v_arrayElimCell_607 (_ BitVec 32)) (v_arrayElimCell_606 (_ BitVec 32)) (v_arrayElimCell_609 (_ BitVec 32)) (v_arrayElimCell_608 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_606)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_611)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_609)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_610)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_607)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_608)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_605)))))))))) is different from true [2023-12-25 06:40:37,173 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_641 (_ BitVec 32)) (v_arrayElimCell_640 (_ BitVec 32)) (v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_642 (_ BitVec 32)) (v_arrayElimCell_636 (_ BitVec 32)) (v_arrayElimCell_635 (_ BitVec 32)) (v_arrayElimCell_638 (_ BitVec 32)) (v_arrayElimCell_637 (_ BitVec 32)) (v_arrayElimCell_639 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_642)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_640)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_639)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_637)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_635)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_636)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_638)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_641))))))) (exists ((v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_610 (_ BitVec 32)) (v_arrayElimCell_612 (_ BitVec 32)) (v_arrayElimCell_611 (_ BitVec 32)) (v_arrayElimCell_605 (_ BitVec 32)) (v_arrayElimCell_607 (_ BitVec 32)) (v_arrayElimCell_606 (_ BitVec 32)) (v_arrayElimCell_609 (_ BitVec 32)) (v_arrayElimCell_608 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_606)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_611)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_609)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_612)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_610)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_607)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_608)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_605)))))))))) is different from true [2023-12-25 06:40:37,204 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_610 (_ BitVec 32)) (v_arrayElimCell_612 (_ BitVec 32)) (v_arrayElimCell_611 (_ BitVec 32)) (v_arrayElimCell_613 (_ BitVec 32)) (v_arrayElimCell_605 (_ BitVec 32)) (v_arrayElimCell_607 (_ BitVec 32)) (v_arrayElimCell_606 (_ BitVec 32)) (v_arrayElimCell_609 (_ BitVec 32)) (v_arrayElimCell_608 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_606)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_611)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_609)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_612)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_610)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_607)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_608)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_605)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_613))))))) (exists ((v_arrayElimCell_641 (_ BitVec 32)) (v_arrayElimCell_640 (_ BitVec 32)) (v_arrayElimCell_596 (_ BitVec 32)) (v_arrayElimCell_643 (_ BitVec 32)) (v_arrayElimCell_642 (_ BitVec 32)) (v_arrayElimCell_636 (_ BitVec 32)) (v_arrayElimCell_635 (_ BitVec 32)) (v_arrayElimCell_638 (_ BitVec 32)) (v_arrayElimCell_637 (_ BitVec 32)) (v_arrayElimCell_639 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_642)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_640)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_639)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_596)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_637)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_635)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_643)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_636)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_638)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_641)))))))))) is different from true [2023-12-25 06:40:41,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:40:42,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:40:42,035 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2023-12-25 06:40:42,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 06:40:42,037 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 30 states have internal predecessors, (36), 5 states have call successors, (5), 1 states have call predecessors, (5), 21 states have return successors, (22), 22 states have call predecessors, (22), 5 states have call successors, (22) Word has length 61 [2023-12-25 06:40:42,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:40:42,037 INFO L225 Difference]: With dead ends: 44 [2023-12-25 06:40:42,037 INFO L226 Difference]: Without dead ends: 39 [2023-12-25 06:40:42,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 80 SyntacticMatches, 20 SemanticMatches, 41 ConstructedPredicates, 29 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=106, Invalid=163, Unknown=29, NotChecked=1508, Total=1806 [2023-12-25 06:40:42,038 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 938 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2023-12-25 06:40:42,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 62 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 1 Unknown, 938 Unchecked, 5.7s Time] [2023-12-25 06:40:42,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-25 06:40:42,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-12-25 06:40:42,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 12 states have return successors, (13), 12 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-25 06:40:42,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2023-12-25 06:40:42,043 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 61 [2023-12-25 06:40:42,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:40:42,043 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2023-12-25 06:40:42,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 30 states have internal predecessors, (36), 5 states have call successors, (5), 1 states have call predecessors, (5), 21 states have return successors, (22), 22 states have call predecessors, (22), 5 states have call successors, (22) [2023-12-25 06:40:42,043 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2023-12-25 06:40:42,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-25 06:40:42,044 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:40:42,044 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:40:42,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (53)] Forceful destruction successful, exit code 0 [2023-12-25 06:40:42,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (52)] Ended with exit code 0 [2023-12-25 06:40:42,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-25 06:40:42,445 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:40:42,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:40:42,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1243172503, now seen corresponding path program 11 times [2023-12-25 06:40:42,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:40:42,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550469330] [2023-12-25 06:40:42,446 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 06:40:42,446 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 [2023-12-25 06:40:42,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:40:42,447 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:40:42,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (54)] Waiting until timeout for monitored process [2023-12-25 06:40:43,377 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2023-12-25 06:40:43,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:40:43,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 140 conjunts are in the unsatisfiable core [2023-12-25 06:40:43,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:40:43,490 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 23 treesize of output 19 [2023-12-25 06:40:43,594 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 23 treesize of output 19 [2023-12-25 06:40:43,677 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 23 treesize of output 19 [2023-12-25 06:40:43,758 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 23 treesize of output 19 [2023-12-25 06:40:43,839 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 23 treesize of output 19 [2023-12-25 06:40:43,928 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 23 treesize of output 19 [2023-12-25 06:40:44,020 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 23 treesize of output 19 [2023-12-25 06:40:44,112 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 23 treesize of output 19 [2023-12-25 06:40:44,233 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 23 treesize of output 19 [2023-12-25 06:40:44,321 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 23 treesize of output 19 [2023-12-25 06:40:44,514 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_656 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))))) is different from true [2023-12-25 06:40:44,540 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_666 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_666)))))))) is different from true [2023-12-25 06:40:44,567 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_667 (_ BitVec 32)) (v_arrayElimCell_666 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_666)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_667)))))))) is different from true [2023-12-25 06:40:44,597 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_667 (_ BitVec 32)) (v_arrayElimCell_666 (_ BitVec 32)) (v_arrayElimCell_668 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_668)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_666)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_667)))))))) is different from true [2023-12-25 06:40:44,628 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_667 (_ BitVec 32)) (v_arrayElimCell_666 (_ BitVec 32)) (v_arrayElimCell_669 (_ BitVec 32)) (v_arrayElimCell_668 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_668)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_666)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_669)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_667)))))))) is different from true [2023-12-25 06:40:44,662 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_667 (_ BitVec 32)) (v_arrayElimCell_666 (_ BitVec 32)) (v_arrayElimCell_669 (_ BitVec 32)) (v_arrayElimCell_668 (_ BitVec 32)) (v_arrayElimCell_670 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_670)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_668)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_666)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_669)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_667)))))))) is different from true [2023-12-25 06:40:44,698 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_667 (_ BitVec 32)) (v_arrayElimCell_666 (_ BitVec 32)) (v_arrayElimCell_669 (_ BitVec 32)) (v_arrayElimCell_668 (_ BitVec 32)) (v_arrayElimCell_670 (_ BitVec 32)) (v_arrayElimCell_671 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_670)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_668)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_666)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_671)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_669)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_667)))))))) is different from true [2023-12-25 06:40:44,737 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_667 (_ BitVec 32)) (v_arrayElimCell_666 (_ BitVec 32)) (v_arrayElimCell_669 (_ BitVec 32)) (v_arrayElimCell_668 (_ BitVec 32)) (v_arrayElimCell_670 (_ BitVec 32)) (v_arrayElimCell_672 (_ BitVec 32)) (v_arrayElimCell_671 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_670)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_668)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_666)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_672)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_671)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_669)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_667)))))))) is different from true [2023-12-25 06:40:44,792 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_673 (_ BitVec 32)) (v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_667 (_ BitVec 32)) (v_arrayElimCell_666 (_ BitVec 32)) (v_arrayElimCell_669 (_ BitVec 32)) (v_arrayElimCell_668 (_ BitVec 32)) (v_arrayElimCell_670 (_ BitVec 32)) (v_arrayElimCell_672 (_ BitVec 32)) (v_arrayElimCell_671 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_670)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_668)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_673)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_666)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_672)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_671)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_669)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_667)))))))) is different from true [2023-12-25 06:40:44,859 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_674 (_ BitVec 32)) (v_arrayElimCell_673 (_ BitVec 32)) (v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_667 (_ BitVec 32)) (v_arrayElimCell_666 (_ BitVec 32)) (v_arrayElimCell_669 (_ BitVec 32)) (v_arrayElimCell_668 (_ BitVec 32)) (v_arrayElimCell_670 (_ BitVec 32)) (v_arrayElimCell_672 (_ BitVec 32)) (v_arrayElimCell_671 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_670)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_668)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_673)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_666)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_672)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_671)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_669)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_674)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_667)))))))) is different from true [2023-12-25 06:40:44,892 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 56 treesize of output 48 [2023-12-25 06:40:45,224 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 53 treesize of output 45 [2023-12-25 06:40:45,230 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 48 treesize of output 40 [2023-12-25 06:40:53,562 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 11 proven. 23 refuted. 0 times theorem prover too weak. 155 trivial. 130 not checked. [2023-12-25 06:40:53,562 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:40:58,503 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 92 treesize of output 88 [2023-12-25 06:40:58,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 88 treesize of output 84 [2023-12-25 06:40:58,512 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 84 treesize of output 80 [2023-12-25 06:40:58,516 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 80 treesize of output 76 [2023-12-25 06:40:58,520 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 72 [2023-12-25 06:40:58,524 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 72 treesize of output 68 [2023-12-25 06:40:58,529 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 68 treesize of output 60 [2023-12-25 06:40:58,533 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 60 treesize of output 56 [2023-12-25 06:40:58,537 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 56 treesize of output 52 [2023-12-25 06:40:58,542 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 52 treesize of output 48 [2023-12-25 06:40:58,547 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 48 treesize of output 44 [2023-12-25 06:40:58,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:40:58,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550469330] [2023-12-25 06:40:58,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550469330] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:40:58,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1546387934] [2023-12-25 06:40:58,845 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 06:40:58,845 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:40:58,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:40:58,846 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:40:58,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (55)] Waiting until timeout for monitored process [2023-12-25 06:40:59,915 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2023-12-25 06:40:59,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:40:59,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 144 conjunts are in the unsatisfiable core [2023-12-25 06:40:59,926 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:41:00,083 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 23 treesize of output 19 [2023-12-25 06:41:00,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 23 treesize of output 19 [2023-12-25 06:41:00,245 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 23 treesize of output 19 [2023-12-25 06:41:00,334 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 23 treesize of output 19 [2023-12-25 06:41:00,426 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 23 treesize of output 19 [2023-12-25 06:41:00,519 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 23 treesize of output 19 [2023-12-25 06:41:00,611 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 23 treesize of output 19 [2023-12-25 06:41:00,696 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 23 treesize of output 19 [2023-12-25 06:41:00,774 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 23 treesize of output 19 [2023-12-25 06:41:00,871 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 23 treesize of output 19 [2023-12-25 06:41:00,941 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 [2023-12-25 06:41:01,044 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_699 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_699)))))))) is different from true [2023-12-25 06:41:01,072 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_700 (_ BitVec 32)) (v_arrayElimCell_699 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_700)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_699)))))))) is different from true [2023-12-25 06:41:01,098 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_700 (_ BitVec 32)) (v_arrayElimCell_699 (_ BitVec 32)) (v_arrayElimCell_701 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_700)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_701)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_699)))))))) is different from true [2023-12-25 06:41:01,128 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_700 (_ BitVec 32)) (v_arrayElimCell_699 (_ BitVec 32)) (v_arrayElimCell_702 (_ BitVec 32)) (v_arrayElimCell_701 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_700)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_702)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_701)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_699)))))))) is different from true [2023-12-25 06:41:01,161 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_700 (_ BitVec 32)) (v_arrayElimCell_699 (_ BitVec 32)) (v_arrayElimCell_702 (_ BitVec 32)) (v_arrayElimCell_701 (_ BitVec 32)) (v_arrayElimCell_703 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_703)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_700)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_702)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_701)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_699)))))))) is different from true [2023-12-25 06:41:01,198 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_700 (_ BitVec 32)) (v_arrayElimCell_699 (_ BitVec 32)) (v_arrayElimCell_702 (_ BitVec 32)) (v_arrayElimCell_701 (_ BitVec 32)) (v_arrayElimCell_704 (_ BitVec 32)) (v_arrayElimCell_703 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_703)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_700)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_702)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_701)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_699)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_704)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:41:01,242 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_700 (_ BitVec 32)) (v_arrayElimCell_699 (_ BitVec 32)) (v_arrayElimCell_702 (_ BitVec 32)) (v_arrayElimCell_701 (_ BitVec 32)) (v_arrayElimCell_704 (_ BitVec 32)) (v_arrayElimCell_703 (_ BitVec 32)) (v_arrayElimCell_705 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_703)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_700)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_702)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_701)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_699)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_704)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_705)))))))) is different from true [2023-12-25 06:41:01,286 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_700 (_ BitVec 32)) (v_arrayElimCell_699 (_ BitVec 32)) (v_arrayElimCell_702 (_ BitVec 32)) (v_arrayElimCell_701 (_ BitVec 32)) (v_arrayElimCell_704 (_ BitVec 32)) (v_arrayElimCell_703 (_ BitVec 32)) (v_arrayElimCell_706 (_ BitVec 32)) (v_arrayElimCell_705 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_703)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_700)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_702)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_701)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_706)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_699)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_704)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_705)))))))) is different from true [2023-12-25 06:41:01,334 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_700 (_ BitVec 32)) (v_arrayElimCell_699 (_ BitVec 32)) (v_arrayElimCell_702 (_ BitVec 32)) (v_arrayElimCell_701 (_ BitVec 32)) (v_arrayElimCell_704 (_ BitVec 32)) (v_arrayElimCell_703 (_ BitVec 32)) (v_arrayElimCell_706 (_ BitVec 32)) (v_arrayElimCell_705 (_ BitVec 32)) (v_arrayElimCell_707 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_703)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_700)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_702)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_701)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_707)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_706)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_699)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_704)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_705)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:41:01,369 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 56 treesize of output 48 [2023-12-25 06:41:05,531 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 53 treesize of output 45 [2023-12-25 06:41:05,546 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 48 treesize of output 40 [2023-12-25 06:41:18,097 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 11 proven. 23 refuted. 0 times theorem prover too weak. 155 trivial. 130 not checked. [2023-12-25 06:41:18,097 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:41:25,553 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 84 treesize of output 80 [2023-12-25 06:41:25,558 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 80 treesize of output 76 [2023-12-25 06:41:25,562 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 72 [2023-12-25 06:41:25,567 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 72 treesize of output 68 [2023-12-25 06:41:25,572 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 68 treesize of output 64 [2023-12-25 06:41:25,577 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 64 treesize of output 60 [2023-12-25 06:41:25,581 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 60 treesize of output 56 [2023-12-25 06:41:25,586 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 56 treesize of output 52 [2023-12-25 06:41:25,606 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 52 treesize of output 48 [2023-12-25 06:41:25,610 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 48 treesize of output 44 [2023-12-25 06:41:33,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1546387934] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:41:33,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:41:33,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 32 [2023-12-25 06:41:33,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739750605] [2023-12-25 06:41:33,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:41:33,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-25 06:41:33,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:41:33,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-25 06:41:33,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=236, Unknown=26, NotChecked=912, Total=1260 [2023-12-25 06:41:33,941 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 32 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 21 states have return successors, (22), 22 states have call predecessors, (22), 4 states have call successors, (22) [2023-12-25 06:41:35,705 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_699 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_699))))))) (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_666 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_666)))))))))) is different from true [2023-12-25 06:41:35,716 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_667 (_ BitVec 32)) (v_arrayElimCell_666 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_666)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_667))))))) (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_700 (_ BitVec 32)) (v_arrayElimCell_699 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_700)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_699)))))))))) is different from true [2023-12-25 06:41:35,733 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_667 (_ BitVec 32)) (v_arrayElimCell_666 (_ BitVec 32)) (v_arrayElimCell_668 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_668)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_666)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_667))))))) (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_700 (_ BitVec 32)) (v_arrayElimCell_699 (_ BitVec 32)) (v_arrayElimCell_701 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_700)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_701)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_699)))))))))) is different from true [2023-12-25 06:41:35,749 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_667 (_ BitVec 32)) (v_arrayElimCell_666 (_ BitVec 32)) (v_arrayElimCell_669 (_ BitVec 32)) (v_arrayElimCell_668 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_668)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_666)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_669)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_667))))))) (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_700 (_ BitVec 32)) (v_arrayElimCell_699 (_ BitVec 32)) (v_arrayElimCell_702 (_ BitVec 32)) (v_arrayElimCell_701 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_700)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_702)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_701)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_699)))))))))) is different from true [2023-12-25 06:41:35,763 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_700 (_ BitVec 32)) (v_arrayElimCell_699 (_ BitVec 32)) (v_arrayElimCell_702 (_ BitVec 32)) (v_arrayElimCell_701 (_ BitVec 32)) (v_arrayElimCell_703 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_703)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_700)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_702)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_701)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_699))))))) (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_667 (_ BitVec 32)) (v_arrayElimCell_666 (_ BitVec 32)) (v_arrayElimCell_669 (_ BitVec 32)) (v_arrayElimCell_668 (_ BitVec 32)) (v_arrayElimCell_670 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_670)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_668)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_666)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_669)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_667)))))))))) is different from true [2023-12-25 06:41:35,779 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_700 (_ BitVec 32)) (v_arrayElimCell_699 (_ BitVec 32)) (v_arrayElimCell_702 (_ BitVec 32)) (v_arrayElimCell_701 (_ BitVec 32)) (v_arrayElimCell_704 (_ BitVec 32)) (v_arrayElimCell_703 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_703)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_700)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_702)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_701)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_699)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_704))))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_667 (_ BitVec 32)) (v_arrayElimCell_666 (_ BitVec 32)) (v_arrayElimCell_669 (_ BitVec 32)) (v_arrayElimCell_668 (_ BitVec 32)) (v_arrayElimCell_670 (_ BitVec 32)) (v_arrayElimCell_671 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_670)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_668)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_666)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_671)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_669)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_667)))))))))) is different from true [2023-12-25 06:41:35,804 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_667 (_ BitVec 32)) (v_arrayElimCell_666 (_ BitVec 32)) (v_arrayElimCell_669 (_ BitVec 32)) (v_arrayElimCell_668 (_ BitVec 32)) (v_arrayElimCell_670 (_ BitVec 32)) (v_arrayElimCell_672 (_ BitVec 32)) (v_arrayElimCell_671 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_670)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_668)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_666)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_672)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_671)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_669)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_667))))))) (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_700 (_ BitVec 32)) (v_arrayElimCell_699 (_ BitVec 32)) (v_arrayElimCell_702 (_ BitVec 32)) (v_arrayElimCell_701 (_ BitVec 32)) (v_arrayElimCell_704 (_ BitVec 32)) (v_arrayElimCell_703 (_ BitVec 32)) (v_arrayElimCell_705 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_703)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_700)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_702)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_701)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_699)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_704)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_705)))))))))) is different from true [2023-12-25 06:41:35,827 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_673 (_ BitVec 32)) (v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_667 (_ BitVec 32)) (v_arrayElimCell_666 (_ BitVec 32)) (v_arrayElimCell_669 (_ BitVec 32)) (v_arrayElimCell_668 (_ BitVec 32)) (v_arrayElimCell_670 (_ BitVec 32)) (v_arrayElimCell_672 (_ BitVec 32)) (v_arrayElimCell_671 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_670)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_668)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_673)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_666)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_672)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_671)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_669)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_667))))))) (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_700 (_ BitVec 32)) (v_arrayElimCell_699 (_ BitVec 32)) (v_arrayElimCell_702 (_ BitVec 32)) (v_arrayElimCell_701 (_ BitVec 32)) (v_arrayElimCell_704 (_ BitVec 32)) (v_arrayElimCell_703 (_ BitVec 32)) (v_arrayElimCell_706 (_ BitVec 32)) (v_arrayElimCell_705 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_703)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_700)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_702)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_701)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_706)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_699)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_704)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_705)))))))))) is different from true [2023-12-25 06:41:35,847 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_700 (_ BitVec 32)) (v_arrayElimCell_699 (_ BitVec 32)) (v_arrayElimCell_702 (_ BitVec 32)) (v_arrayElimCell_701 (_ BitVec 32)) (v_arrayElimCell_704 (_ BitVec 32)) (v_arrayElimCell_703 (_ BitVec 32)) (v_arrayElimCell_706 (_ BitVec 32)) (v_arrayElimCell_705 (_ BitVec 32)) (v_arrayElimCell_707 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_703)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_700)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_702)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_701)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_707)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_706)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_699)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_704)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_705))))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_674 (_ BitVec 32)) (v_arrayElimCell_673 (_ BitVec 32)) (v_arrayElimCell_656 (_ BitVec 32)) (v_arrayElimCell_667 (_ BitVec 32)) (v_arrayElimCell_666 (_ BitVec 32)) (v_arrayElimCell_669 (_ BitVec 32)) (v_arrayElimCell_668 (_ BitVec 32)) (v_arrayElimCell_670 (_ BitVec 32)) (v_arrayElimCell_672 (_ BitVec 32)) (v_arrayElimCell_671 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_656)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_670)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_668)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_673)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_666)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_672)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_671)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_669)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_674)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_667)))))))))) is different from true [2023-12-25 06:41:40,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:41:44,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:41:48,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:41:48,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:41:48,664 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2023-12-25 06:41:48,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-25 06:41:48,665 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 21 states have return successors, (22), 22 states have call predecessors, (22), 4 states have call successors, (22) Word has length 65 [2023-12-25 06:41:48,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:41:48,665 INFO L225 Difference]: With dead ends: 48 [2023-12-25 06:41:48,665 INFO L226 Difference]: Without dead ends: 46 [2023-12-25 06:41:48,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 83 SyntacticMatches, 19 SemanticMatches, 49 ConstructedPredicates, 28 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 36.3s TimeCoverageRelationStatistics Valid=148, Invalid=435, Unknown=35, NotChecked=1932, Total=2550 [2023-12-25 06:41:48,666 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 1095 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2023-12-25 06:41:48,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 78 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 3 Unknown, 1095 Unchecked, 13.4s Time] [2023-12-25 06:41:48,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-25 06:41:48,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2023-12-25 06:41:48,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 13 states have return successors, (15), 14 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-25 06:41:48,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2023-12-25 06:41:48,673 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 65 [2023-12-25 06:41:48,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:41:48,673 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2023-12-25 06:41:48,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 21 states have return successors, (22), 22 states have call predecessors, (22), 4 states have call successors, (22) [2023-12-25 06:41:48,674 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2023-12-25 06:41:48,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-25 06:41:48,674 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:41:48,674 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:41:48,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (54)] Forceful destruction successful, exit code 0 [2023-12-25 06:41:48,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (55)] Ended with exit code 0 [2023-12-25 06:41:49,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 06:41:49,084 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:41:49,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:41:49,084 INFO L85 PathProgramCache]: Analyzing trace with hash -116354021, now seen corresponding path program 11 times [2023-12-25 06:41:49,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:41:49,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1650803482] [2023-12-25 06:41:49,085 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 06:41:49,085 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 [2023-12-25 06:41:49,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:41:49,086 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:41:49,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (56)] Waiting until timeout for monitored process [2023-12-25 06:41:50,058 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2023-12-25 06:41:50,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:41:50,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 93 conjunts are in the unsatisfiable core [2023-12-25 06:41:50,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:41:50,186 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 23 treesize of output 19 [2023-12-25 06:41:50,298 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 23 treesize of output 19 [2023-12-25 06:41:50,387 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 23 treesize of output 19 [2023-12-25 06:41:50,480 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 23 treesize of output 19 [2023-12-25 06:41:50,570 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 23 treesize of output 19 [2023-12-25 06:41:50,659 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 23 treesize of output 19 [2023-12-25 06:41:50,783 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 23 treesize of output 19 [2023-12-25 06:41:50,889 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 23 treesize of output 19 [2023-12-25 06:41:50,984 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 23 treesize of output 19 [2023-12-25 06:41:51,077 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 23 treesize of output 19 [2023-12-25 06:41:51,189 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 23 treesize of output 19 [2023-12-25 06:41:51,213 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_731 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_731)))))))) is different from true [2023-12-25 06:41:51,302 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_731 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_731)))))))) is different from true [2023-12-25 06:41:51,344 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_731 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_732 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_731)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_732)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:41:51,387 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_731 (_ BitVec 32)) (v_arrayElimCell_733 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_732 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_733)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_731)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_732)))))))) is different from true [2023-12-25 06:41:51,436 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_731 (_ BitVec 32)) (v_arrayElimCell_733 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_732 (_ BitVec 32)) (v_arrayElimCell_734 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_733)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_734)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_731)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_732)))))))) is different from true [2023-12-25 06:41:51,490 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_731 (_ BitVec 32)) (v_arrayElimCell_733 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_732 (_ BitVec 32)) (v_arrayElimCell_735 (_ BitVec 32)) (v_arrayElimCell_734 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_733)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_734)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_731)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_735)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_732)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:41:51,552 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_731 (_ BitVec 32)) (v_arrayElimCell_733 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_732 (_ BitVec 32)) (v_arrayElimCell_735 (_ BitVec 32)) (v_arrayElimCell_734 (_ BitVec 32)) (v_arrayElimCell_736 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_733)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_734)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_731)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_735)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_732)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_736)))))))) is different from true [2023-12-25 06:41:51,598 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_731 (_ BitVec 32)) (v_arrayElimCell_733 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_732 (_ BitVec 32)) (v_arrayElimCell_735 (_ BitVec 32)) (v_arrayElimCell_734 (_ BitVec 32)) (v_arrayElimCell_737 (_ BitVec 32)) (v_arrayElimCell_736 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_733)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_734)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_731)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_735)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_732)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_736)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_737)))))))) is different from true [2023-12-25 06:41:51,644 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_731 (_ BitVec 32)) (v_arrayElimCell_733 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_732 (_ BitVec 32)) (v_arrayElimCell_735 (_ BitVec 32)) (v_arrayElimCell_734 (_ BitVec 32)) (v_arrayElimCell_737 (_ BitVec 32)) (v_arrayElimCell_736 (_ BitVec 32)) (v_arrayElimCell_738 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_733)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_738)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_734)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_731)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_735)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_732)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_736)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_737)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:41:51,696 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_731 (_ BitVec 32)) (v_arrayElimCell_733 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_732 (_ BitVec 32)) (v_arrayElimCell_735 (_ BitVec 32)) (v_arrayElimCell_734 (_ BitVec 32)) (v_arrayElimCell_737 (_ BitVec 32)) (v_arrayElimCell_736 (_ BitVec 32)) (v_arrayElimCell_739 (_ BitVec 32)) (v_arrayElimCell_738 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_733)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_739)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_738)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_734)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_731)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_735)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_732)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_736)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_737)))))))) is different from true [2023-12-25 06:41:51,757 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_740 (_ BitVec 32)) (v_arrayElimCell_731 (_ BitVec 32)) (v_arrayElimCell_733 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_732 (_ BitVec 32)) (v_arrayElimCell_735 (_ BitVec 32)) (v_arrayElimCell_734 (_ BitVec 32)) (v_arrayElimCell_737 (_ BitVec 32)) (v_arrayElimCell_736 (_ BitVec 32)) (v_arrayElimCell_739 (_ BitVec 32)) (v_arrayElimCell_738 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_733)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_739)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_738)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_734)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_740)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_731)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_735)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_732)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_736)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_737)))))))) is different from true [2023-12-25 06:41:51,788 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 52 treesize of output 44 [2023-12-25 06:41:52,033 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 48 treesize of output 40 [2023-12-25 06:41:56,286 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 166 trivial. 142 not checked. [2023-12-25 06:41:56,286 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:42:01,982 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 86 treesize of output 82 [2023-12-25 06:42:01,991 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 82 treesize of output 78 [2023-12-25 06:42:01,999 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 78 treesize of output 74 [2023-12-25 06:42:02,008 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 74 treesize of output 70 [2023-12-25 06:42:02,015 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 70 treesize of output 66 [2023-12-25 06:42:02,023 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 66 treesize of output 62 [2023-12-25 06:42:02,031 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 62 treesize of output 58 [2023-12-25 06:42:02,038 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 58 treesize of output 54 [2023-12-25 06:42:02,045 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 54 treesize of output 50 [2023-12-25 06:42:02,053 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 50 treesize of output 46 [2023-12-25 06:42:02,060 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 46 treesize of output 42 [2023-12-25 06:42:02,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:42:02,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1650803482] [2023-12-25 06:42:02,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1650803482] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:42:02,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1972071718] [2023-12-25 06:42:02,630 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 06:42:02,630 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:42:02,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:42:02,631 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:42:02,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (57)] Waiting until timeout for monitored process [2023-12-25 06:42:03,806 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2023-12-25 06:42:03,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:42:03,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 94 conjunts are in the unsatisfiable core [2023-12-25 06:42:03,817 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:42:03,963 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 23 treesize of output 19 [2023-12-25 06:42:04,058 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 23 treesize of output 19 [2023-12-25 06:42:04,152 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 23 treesize of output 19 [2023-12-25 06:42:04,247 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 23 treesize of output 19 [2023-12-25 06:42:04,344 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 23 treesize of output 19 [2023-12-25 06:42:04,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 23 treesize of output 19 [2023-12-25 06:42:04,532 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 23 treesize of output 19 [2023-12-25 06:42:04,623 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 23 treesize of output 19 [2023-12-25 06:42:04,717 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 23 treesize of output 19 [2023-12-25 06:42:04,808 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 23 treesize of output 19 [2023-12-25 06:42:04,898 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 23 treesize of output 19 [2023-12-25 06:42:04,914 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_764 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_764)))))))) is different from true [2023-12-25 06:42:04,977 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_764 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_764)))))))) is different from true [2023-12-25 06:42:05,008 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_764 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_765 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_764)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_765)))))))) is different from true [2023-12-25 06:42:05,042 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_764 (_ BitVec 32)) (v_arrayElimCell_766 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_765 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_766)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_764)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_765)))))))) is different from true [2023-12-25 06:42:05,077 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_764 (_ BitVec 32)) (v_arrayElimCell_766 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_765 (_ BitVec 32)) (v_arrayElimCell_767 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_766)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_767)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_764)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_765)))))))) is different from true [2023-12-25 06:42:05,114 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_764 (_ BitVec 32)) (v_arrayElimCell_766 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_765 (_ BitVec 32)) (v_arrayElimCell_768 (_ BitVec 32)) (v_arrayElimCell_767 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_766)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_767)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_764)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_765)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_768)))))))) is different from true [2023-12-25 06:42:05,154 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_764 (_ BitVec 32)) (v_arrayElimCell_766 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_765 (_ BitVec 32)) (v_arrayElimCell_768 (_ BitVec 32)) (v_arrayElimCell_767 (_ BitVec 32)) (v_arrayElimCell_769 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_766)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_767)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_769)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_764)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_765)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_768)))))))) is different from true [2023-12-25 06:42:05,201 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_764 (_ BitVec 32)) (v_arrayElimCell_766 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_765 (_ BitVec 32)) (v_arrayElimCell_768 (_ BitVec 32)) (v_arrayElimCell_767 (_ BitVec 32)) (v_arrayElimCell_769 (_ BitVec 32)) (v_arrayElimCell_770 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_770)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_766)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_767)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_769)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_764)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_765)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_768)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:42:05,268 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_764 (_ BitVec 32)) (v_arrayElimCell_766 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_765 (_ BitVec 32)) (v_arrayElimCell_768 (_ BitVec 32)) (v_arrayElimCell_767 (_ BitVec 32)) (v_arrayElimCell_769 (_ BitVec 32)) (v_arrayElimCell_771 (_ BitVec 32)) (v_arrayElimCell_770 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_770)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_766)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_767)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_771)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_769)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_764)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_765)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_768)))))))) is different from true [2023-12-25 06:42:05,322 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_772 (_ BitVec 32)) (v_arrayElimCell_764 (_ BitVec 32)) (v_arrayElimCell_766 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_765 (_ BitVec 32)) (v_arrayElimCell_768 (_ BitVec 32)) (v_arrayElimCell_767 (_ BitVec 32)) (v_arrayElimCell_769 (_ BitVec 32)) (v_arrayElimCell_771 (_ BitVec 32)) (v_arrayElimCell_770 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_770)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_766)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_767)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_771)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_769)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_764)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_765)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_772)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_768)))))))) is different from true [2023-12-25 06:42:05,397 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_773 (_ BitVec 32)) (v_arrayElimCell_772 (_ BitVec 32)) (v_arrayElimCell_764 (_ BitVec 32)) (v_arrayElimCell_766 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_765 (_ BitVec 32)) (v_arrayElimCell_768 (_ BitVec 32)) (v_arrayElimCell_767 (_ BitVec 32)) (v_arrayElimCell_769 (_ BitVec 32)) (v_arrayElimCell_771 (_ BitVec 32)) (v_arrayElimCell_770 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_770)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_766)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_773)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_767)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_771)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_769)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_764)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_765)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_772)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_768)))))))) is different from true [2023-12-25 06:42:05,435 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 52 treesize of output 44 [2023-12-25 06:42:05,614 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 48 treesize of output 40 [2023-12-25 06:42:05,887 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 166 trivial. 142 not checked. [2023-12-25 06:42:05,887 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:42:10,060 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 86 treesize of output 82 [2023-12-25 06:42:10,068 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 82 treesize of output 78 [2023-12-25 06:42:10,076 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 78 treesize of output 74 [2023-12-25 06:42:10,083 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 74 treesize of output 70 [2023-12-25 06:42:10,091 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 70 treesize of output 66 [2023-12-25 06:42:10,098 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 66 treesize of output 62 [2023-12-25 06:42:10,120 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 62 treesize of output 58 [2023-12-25 06:42:10,126 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 58 treesize of output 54 [2023-12-25 06:42:10,134 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 54 treesize of output 50 [2023-12-25 06:42:10,141 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 50 treesize of output 46 [2023-12-25 06:42:10,148 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 46 treesize of output 42 [2023-12-25 06:42:10,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1972071718] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:42:10,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:42:10,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 32 [2023-12-25 06:42:10,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854617706] [2023-12-25 06:42:10,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:42:10,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-25 06:42:10,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:42:10,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-25 06:42:10,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=137, Unknown=23, NotChecked=946, Total=1190 [2023-12-25 06:42:10,579 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 32 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 32 states have internal predecessors, (38), 5 states have call successors, (5), 1 states have call predecessors, (5), 23 states have return successors, (24), 24 states have call predecessors, (24), 5 states have call successors, (24) [2023-12-25 06:42:11,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:42:12,226 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_764 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_764))))))) (exists ((v_arrayElimCell_731 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_731)))))))))) is different from true [2023-12-25 06:42:12,238 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_731 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_732 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_731)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_732))))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_764 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_765 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_764)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_765)))))))))) is different from true [2023-12-25 06:42:12,249 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_764 (_ BitVec 32)) (v_arrayElimCell_766 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_765 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_766)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_764)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_765))))))) (exists ((v_arrayElimCell_731 (_ BitVec 32)) (v_arrayElimCell_733 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_732 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_733)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_731)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_732)))))))))) is different from true [2023-12-25 06:42:12,263 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_764 (_ BitVec 32)) (v_arrayElimCell_766 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_765 (_ BitVec 32)) (v_arrayElimCell_767 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_766)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_767)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_764)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_765))))))) (exists ((v_arrayElimCell_731 (_ BitVec 32)) (v_arrayElimCell_733 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_732 (_ BitVec 32)) (v_arrayElimCell_734 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_733)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_734)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_731)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_732)))))))))) is different from true [2023-12-25 06:42:12,279 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_764 (_ BitVec 32)) (v_arrayElimCell_766 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_765 (_ BitVec 32)) (v_arrayElimCell_768 (_ BitVec 32)) (v_arrayElimCell_767 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_766)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_767)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_764)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_765)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_768))))))) (exists ((v_arrayElimCell_731 (_ BitVec 32)) (v_arrayElimCell_733 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_732 (_ BitVec 32)) (v_arrayElimCell_735 (_ BitVec 32)) (v_arrayElimCell_734 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_733)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_734)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_731)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_735)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_732))))) |c_#memory_int#3|))))) is different from true [2023-12-25 06:42:12,306 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_764 (_ BitVec 32)) (v_arrayElimCell_766 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_765 (_ BitVec 32)) (v_arrayElimCell_768 (_ BitVec 32)) (v_arrayElimCell_767 (_ BitVec 32)) (v_arrayElimCell_769 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_766)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_767)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_769)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_764)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_765)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_768))))))) (exists ((v_arrayElimCell_731 (_ BitVec 32)) (v_arrayElimCell_733 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_732 (_ BitVec 32)) (v_arrayElimCell_735 (_ BitVec 32)) (v_arrayElimCell_734 (_ BitVec 32)) (v_arrayElimCell_736 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_733)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_734)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_731)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_735)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_732)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_736)))))))))) is different from true [2023-12-25 06:42:12,325 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_764 (_ BitVec 32)) (v_arrayElimCell_766 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_765 (_ BitVec 32)) (v_arrayElimCell_768 (_ BitVec 32)) (v_arrayElimCell_767 (_ BitVec 32)) (v_arrayElimCell_769 (_ BitVec 32)) (v_arrayElimCell_770 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_770)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_766)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_767)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_769)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_764)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_765)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_768))))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_731 (_ BitVec 32)) (v_arrayElimCell_733 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_732 (_ BitVec 32)) (v_arrayElimCell_735 (_ BitVec 32)) (v_arrayElimCell_734 (_ BitVec 32)) (v_arrayElimCell_737 (_ BitVec 32)) (v_arrayElimCell_736 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_733)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_734)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_731)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_735)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_732)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_736)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_737)))))))))) is different from true [2023-12-25 06:42:12,347 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_764 (_ BitVec 32)) (v_arrayElimCell_766 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_765 (_ BitVec 32)) (v_arrayElimCell_768 (_ BitVec 32)) (v_arrayElimCell_767 (_ BitVec 32)) (v_arrayElimCell_769 (_ BitVec 32)) (v_arrayElimCell_771 (_ BitVec 32)) (v_arrayElimCell_770 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_770)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_766)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_767)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_771)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_769)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_764)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_765)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_768))))))) (exists ((v_arrayElimCell_731 (_ BitVec 32)) (v_arrayElimCell_733 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_732 (_ BitVec 32)) (v_arrayElimCell_735 (_ BitVec 32)) (v_arrayElimCell_734 (_ BitVec 32)) (v_arrayElimCell_737 (_ BitVec 32)) (v_arrayElimCell_736 (_ BitVec 32)) (v_arrayElimCell_738 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_733)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_738)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_734)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_731)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_735)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_732)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_736)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_737))))) |c_#memory_int#3|))))) is different from true [2023-12-25 06:42:12,368 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_731 (_ BitVec 32)) (v_arrayElimCell_733 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_732 (_ BitVec 32)) (v_arrayElimCell_735 (_ BitVec 32)) (v_arrayElimCell_734 (_ BitVec 32)) (v_arrayElimCell_737 (_ BitVec 32)) (v_arrayElimCell_736 (_ BitVec 32)) (v_arrayElimCell_739 (_ BitVec 32)) (v_arrayElimCell_738 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_733)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_739)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_738)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_734)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_731)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_735)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_732)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_736)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_737))))))) (exists ((v_arrayElimCell_772 (_ BitVec 32)) (v_arrayElimCell_764 (_ BitVec 32)) (v_arrayElimCell_766 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_765 (_ BitVec 32)) (v_arrayElimCell_768 (_ BitVec 32)) (v_arrayElimCell_767 (_ BitVec 32)) (v_arrayElimCell_769 (_ BitVec 32)) (v_arrayElimCell_771 (_ BitVec 32)) (v_arrayElimCell_770 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_770)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_766)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_767)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_771)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_769)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_764)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_765)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_772)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_768)))))))))) is different from true [2023-12-25 06:42:12,398 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_740 (_ BitVec 32)) (v_arrayElimCell_731 (_ BitVec 32)) (v_arrayElimCell_733 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_732 (_ BitVec 32)) (v_arrayElimCell_735 (_ BitVec 32)) (v_arrayElimCell_734 (_ BitVec 32)) (v_arrayElimCell_737 (_ BitVec 32)) (v_arrayElimCell_736 (_ BitVec 32)) (v_arrayElimCell_739 (_ BitVec 32)) (v_arrayElimCell_738 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_733)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_739)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_738)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_734)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_740)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_731)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_735)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_732)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_736)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_737))))))) (exists ((v_arrayElimCell_773 (_ BitVec 32)) (v_arrayElimCell_772 (_ BitVec 32)) (v_arrayElimCell_764 (_ BitVec 32)) (v_arrayElimCell_766 (_ BitVec 32)) (v_arrayElimCell_721 (_ BitVec 32)) (v_arrayElimCell_765 (_ BitVec 32)) (v_arrayElimCell_768 (_ BitVec 32)) (v_arrayElimCell_767 (_ BitVec 32)) (v_arrayElimCell_769 (_ BitVec 32)) (v_arrayElimCell_771 (_ BitVec 32)) (v_arrayElimCell_770 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_770)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_766)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_773)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_767)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_771)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_721)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_769)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_764)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_765)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_772)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_768)))))))))) is different from true [2023-12-25 06:42:12,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:42:12,791 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2023-12-25 06:42:12,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 06:42:12,792 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 32 states have internal predecessors, (38), 5 states have call successors, (5), 1 states have call predecessors, (5), 23 states have return successors, (24), 24 states have call predecessors, (24), 5 states have call successors, (24) Word has length 66 [2023-12-25 06:42:12,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:42:12,794 INFO L225 Difference]: With dead ends: 46 [2023-12-25 06:42:12,794 INFO L226 Difference]: Without dead ends: 41 [2023-12-25 06:42:12,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 86 SyntacticMatches, 22 SemanticMatches, 44 ConstructedPredicates, 32 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=112, Invalid=165, Unknown=33, NotChecked=1760, Total=2070 [2023-12-25 06:42:12,796 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1077 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-25 06:42:12,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 49 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 1077 Unchecked, 1.8s Time] [2023-12-25 06:42:12,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-25 06:42:12,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-12-25 06:42:12,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 13 states have return successors, (14), 13 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-25 06:42:12,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2023-12-25 06:42:12,801 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 66 [2023-12-25 06:42:12,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:42:12,801 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2023-12-25 06:42:12,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 32 states have internal predecessors, (38), 5 states have call successors, (5), 1 states have call predecessors, (5), 23 states have return successors, (24), 24 states have call predecessors, (24), 5 states have call successors, (24) [2023-12-25 06:42:12,801 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2023-12-25 06:42:12,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-25 06:42:12,802 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:42:12,802 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:42:12,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (56)] Forceful destruction successful, exit code 0 [2023-12-25 06:42:13,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (57)] Forceful destruction successful, exit code 0 [2023-12-25 06:42:13,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 06:42:13,211 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:42:13,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:42:13,212 INFO L85 PathProgramCache]: Analyzing trace with hash -313293682, now seen corresponding path program 12 times [2023-12-25 06:42:13,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:42:13,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466340139] [2023-12-25 06:42:13,212 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 06:42:13,212 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 [2023-12-25 06:42:13,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:42:13,213 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:42:13,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (58)] Waiting until timeout for monitored process [2023-12-25 06:42:14,351 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2023-12-25 06:42:14,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:42:14,365 INFO L262 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 152 conjunts are in the unsatisfiable core [2023-12-25 06:42:14,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:42:14,541 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 23 treesize of output 19 [2023-12-25 06:42:14,701 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 23 treesize of output 19 [2023-12-25 06:42:14,820 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 23 treesize of output 19 [2023-12-25 06:42:14,949 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 23 treesize of output 19 [2023-12-25 06:42:15,093 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 23 treesize of output 19 [2023-12-25 06:42:15,265 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 23 treesize of output 19 [2023-12-25 06:42:15,405 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 23 treesize of output 19 [2023-12-25 06:42:15,537 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 23 treesize of output 19 [2023-12-25 06:42:15,664 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 23 treesize of output 19 [2023-12-25 06:42:15,784 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 23 treesize of output 19 [2023-12-25 06:42:15,920 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 23 treesize of output 19 [2023-12-25 06:42:16,255 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_787 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))))) is different from true [2023-12-25 06:42:16,287 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_798 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_798)))))))) is different from true [2023-12-25 06:42:16,319 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_799 (_ BitVec 32)) (v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_798 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_799)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_798)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:42:16,353 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_799 (_ BitVec 32)) (v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_798 (_ BitVec 32)) (v_arrayElimCell_800 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_799)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_798)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_800)))))))) is different from true [2023-12-25 06:42:16,390 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_799 (_ BitVec 32)) (v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_798 (_ BitVec 32)) (v_arrayElimCell_801 (_ BitVec 32)) (v_arrayElimCell_800 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_801)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_799)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_798)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_800)))))))) is different from true [2023-12-25 06:42:16,430 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_799 (_ BitVec 32)) (v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_798 (_ BitVec 32)) (v_arrayElimCell_801 (_ BitVec 32)) (v_arrayElimCell_800 (_ BitVec 32)) (v_arrayElimCell_802 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_802)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_801)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_799)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_798)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_800)))))))) is different from true [2023-12-25 06:42:16,473 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_799 (_ BitVec 32)) (v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_798 (_ BitVec 32)) (v_arrayElimCell_801 (_ BitVec 32)) (v_arrayElimCell_800 (_ BitVec 32)) (v_arrayElimCell_803 (_ BitVec 32)) (v_arrayElimCell_802 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_802)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_803)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_801)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_799)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_798)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_800)))))))) is different from true [2023-12-25 06:42:16,521 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_799 (_ BitVec 32)) (v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_798 (_ BitVec 32)) (v_arrayElimCell_801 (_ BitVec 32)) (v_arrayElimCell_800 (_ BitVec 32)) (v_arrayElimCell_803 (_ BitVec 32)) (v_arrayElimCell_802 (_ BitVec 32)) (v_arrayElimCell_804 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_802)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_804)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_803)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_801)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_799)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_798)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_800)))))))) is different from true [2023-12-25 06:42:16,574 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_799 (_ BitVec 32)) (v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_798 (_ BitVec 32)) (v_arrayElimCell_801 (_ BitVec 32)) (v_arrayElimCell_800 (_ BitVec 32)) (v_arrayElimCell_803 (_ BitVec 32)) (v_arrayElimCell_802 (_ BitVec 32)) (v_arrayElimCell_805 (_ BitVec 32)) (v_arrayElimCell_804 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_802)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_805)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_804)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_803)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_801)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_799)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_798)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_800)))))))) is different from true [2023-12-25 06:42:16,631 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_799 (_ BitVec 32)) (v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_798 (_ BitVec 32)) (v_arrayElimCell_801 (_ BitVec 32)) (v_arrayElimCell_800 (_ BitVec 32)) (v_arrayElimCell_803 (_ BitVec 32)) (v_arrayElimCell_802 (_ BitVec 32)) (v_arrayElimCell_805 (_ BitVec 32)) (v_arrayElimCell_804 (_ BitVec 32)) (v_arrayElimCell_806 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_802)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_805)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_804)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_803)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_801)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_806)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_799)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_798)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_800)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:42:16,699 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_799 (_ BitVec 32)) (v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_798 (_ BitVec 32)) (v_arrayElimCell_801 (_ BitVec 32)) (v_arrayElimCell_800 (_ BitVec 32)) (v_arrayElimCell_803 (_ BitVec 32)) (v_arrayElimCell_802 (_ BitVec 32)) (v_arrayElimCell_805 (_ BitVec 32)) (v_arrayElimCell_804 (_ BitVec 32)) (v_arrayElimCell_807 (_ BitVec 32)) (v_arrayElimCell_806 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_807)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_802)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_805)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_804)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_803)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_801)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_806)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_799)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_798)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_800)))))))) is different from true [2023-12-25 06:42:16,734 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 59 treesize of output 51 [2023-12-25 06:42:17,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 56 treesize of output 48 [2023-12-25 06:42:17,344 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 51 treesize of output 43 [2023-12-25 06:42:22,523 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 187 trivial. 154 not checked. [2023-12-25 06:42:22,523 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:42:30,044 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 99 treesize of output 95 [2023-12-25 06:42:30,051 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 95 treesize of output 91 [2023-12-25 06:42:30,058 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 91 treesize of output 87 [2023-12-25 06:42:30,079 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 87 treesize of output 83 [2023-12-25 06:42:30,088 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 83 treesize of output 75 [2023-12-25 06:42:30,122 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 75 treesize of output 71 [2023-12-25 06:42:30,129 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 71 treesize of output 67 [2023-12-25 06:42:30,135 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 67 treesize of output 63 [2023-12-25 06:42:30,143 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 63 treesize of output 59 [2023-12-25 06:42:30,152 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 59 treesize of output 55 [2023-12-25 06:42:30,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 55 treesize of output 51 [2023-12-25 06:42:30,166 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 51 treesize of output 47 [2023-12-25 06:42:30,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:42:30,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466340139] [2023-12-25 06:42:30,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [466340139] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:42:30,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [808198209] [2023-12-25 06:42:30,496 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 06:42:30,496 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:42:30,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:42:30,497 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:42:30,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (59)] Waiting until timeout for monitored process [2023-12-25 06:42:31,817 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-25 06:42:31,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711670081] [2023-12-25 06:42:31,818 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 06:42:31,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 06:42:31,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:42:31,821 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-25 06:42:31,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2023-12-25 06:42:31,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (59)] Forceful destruction successful, exit code 1 [2023-12-25 06:42:44,652 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2023-12-25 06:42:44,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:42:44,667 INFO L262 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 154 conjunts are in the unsatisfiable core [2023-12-25 06:42:44,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:42:44,742 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 23 treesize of output 19 [2023-12-25 06:42:44,850 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 23 treesize of output 19 [2023-12-25 06:42:44,958 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 23 treesize of output 19 [2023-12-25 06:42:45,090 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 23 treesize of output 19 [2023-12-25 06:42:45,214 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 23 treesize of output 19 [2023-12-25 06:42:45,330 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 23 treesize of output 19 [2023-12-25 06:42:45,459 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 23 treesize of output 19 [2023-12-25 06:42:45,604 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 23 treesize of output 19 [2023-12-25 06:42:45,729 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 23 treesize of output 19 [2023-12-25 06:42:45,845 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 23 treesize of output 19 [2023-12-25 06:42:45,957 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 23 treesize of output 19 [2023-12-25 06:42:46,072 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 [2023-12-25 06:42:46,196 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_834 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_834)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))))) is different from true [2023-12-25 06:42:46,232 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_834 (_ BitVec 32)) (v_arrayElimCell_835 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_834)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_835)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))))) is different from true [2023-12-25 06:42:46,270 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_834 (_ BitVec 32)) (v_arrayElimCell_836 (_ BitVec 32)) (v_arrayElimCell_835 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_834)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_835)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_836)))))))) is different from true [2023-12-25 06:42:46,312 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_834 (_ BitVec 32)) (v_arrayElimCell_836 (_ BitVec 32)) (v_arrayElimCell_835 (_ BitVec 32)) (v_arrayElimCell_837 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_834)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_835)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_837)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_836)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:42:46,351 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_834 (_ BitVec 32)) (v_arrayElimCell_836 (_ BitVec 32)) (v_arrayElimCell_835 (_ BitVec 32)) (v_arrayElimCell_838 (_ BitVec 32)) (v_arrayElimCell_837 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_834)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_835)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_837)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_838)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_836)))))))) is different from true [2023-12-25 06:42:46,396 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_834 (_ BitVec 32)) (v_arrayElimCell_836 (_ BitVec 32)) (v_arrayElimCell_835 (_ BitVec 32)) (v_arrayElimCell_838 (_ BitVec 32)) (v_arrayElimCell_837 (_ BitVec 32)) (v_arrayElimCell_839 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_834)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_835)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_837)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_839)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_838)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_836)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:42:46,443 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_840 (_ BitVec 32)) (v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_834 (_ BitVec 32)) (v_arrayElimCell_836 (_ BitVec 32)) (v_arrayElimCell_835 (_ BitVec 32)) (v_arrayElimCell_838 (_ BitVec 32)) (v_arrayElimCell_837 (_ BitVec 32)) (v_arrayElimCell_839 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_834)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_835)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_837)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_840)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_839)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_838)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_836)))))))) is different from true [2023-12-25 06:42:46,497 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_841 (_ BitVec 32)) (v_arrayElimCell_840 (_ BitVec 32)) (v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_834 (_ BitVec 32)) (v_arrayElimCell_836 (_ BitVec 32)) (v_arrayElimCell_835 (_ BitVec 32)) (v_arrayElimCell_838 (_ BitVec 32)) (v_arrayElimCell_837 (_ BitVec 32)) (v_arrayElimCell_839 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_834)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_835)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_841)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_837)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_840)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_839)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_838)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_836)))))))) is different from true [2023-12-25 06:42:46,554 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_841 (_ BitVec 32)) (v_arrayElimCell_840 (_ BitVec 32)) (v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_842 (_ BitVec 32)) (v_arrayElimCell_834 (_ BitVec 32)) (v_arrayElimCell_836 (_ BitVec 32)) (v_arrayElimCell_835 (_ BitVec 32)) (v_arrayElimCell_838 (_ BitVec 32)) (v_arrayElimCell_837 (_ BitVec 32)) (v_arrayElimCell_839 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_834)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_835)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_841)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_837)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_842)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_840)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_839)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_838)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_836)))))))) is different from true [2023-12-25 06:42:46,618 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_841 (_ BitVec 32)) (v_arrayElimCell_840 (_ BitVec 32)) (v_arrayElimCell_843 (_ BitVec 32)) (v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_842 (_ BitVec 32)) (v_arrayElimCell_834 (_ BitVec 32)) (v_arrayElimCell_836 (_ BitVec 32)) (v_arrayElimCell_835 (_ BitVec 32)) (v_arrayElimCell_838 (_ BitVec 32)) (v_arrayElimCell_837 (_ BitVec 32)) (v_arrayElimCell_839 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_834)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_835)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_841)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_837)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_842)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_843)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_840)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_839)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_838)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_836)))))))) is different from true [2023-12-25 06:42:46,650 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 59 treesize of output 51 [2023-12-25 06:42:47,078 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 56 treesize of output 48 [2023-12-25 06:42:47,086 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 51 treesize of output 43 [2023-12-25 06:42:55,843 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 187 trivial. 154 not checked. [2023-12-25 06:42:55,844 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:43:05,334 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 91 treesize of output 87 [2023-12-25 06:43:05,341 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 87 treesize of output 83 [2023-12-25 06:43:05,347 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 83 treesize of output 79 [2023-12-25 06:43:05,354 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 79 treesize of output 75 [2023-12-25 06:43:05,361 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 75 treesize of output 71 [2023-12-25 06:43:05,369 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 71 treesize of output 67 [2023-12-25 06:43:05,376 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 67 treesize of output 63 [2023-12-25 06:43:05,384 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 63 treesize of output 59 [2023-12-25 06:43:05,392 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 59 treesize of output 55 [2023-12-25 06:43:05,399 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 55 treesize of output 51 [2023-12-25 06:43:05,406 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 51 treesize of output 47 [2023-12-25 06:43:09,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711670081] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:43:09,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:43:09,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 32 [2023-12-25 06:43:09,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320929652] [2023-12-25 06:43:09,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:43:09,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-25 06:43:09,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:43:09,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-25 06:43:09,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=189, Unknown=25, NotChecked=966, Total=1260 [2023-12-25 06:43:09,802 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 32 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 23 states have return successors, (24), 23 states have call predecessors, (24), 3 states have call successors, (24) [2023-12-25 06:43:12,105 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_798 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_798))))))) (exists ((v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_834 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_834)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) .cse1 .cse2)))))))) is different from true [2023-12-25 06:43:12,117 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_834 (_ BitVec 32)) (v_arrayElimCell_835 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_834)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_835)) .cse2))))) (exists ((v_arrayElimCell_799 (_ BitVec 32)) (v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_798 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_799)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_798))))) |c_#memory_int#3|))))) is different from true [2023-12-25 06:43:12,130 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_799 (_ BitVec 32)) (v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_798 (_ BitVec 32)) (v_arrayElimCell_800 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_799)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_798)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_800))))))) (exists ((v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_834 (_ BitVec 32)) (v_arrayElimCell_836 (_ BitVec 32)) (v_arrayElimCell_835 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_834)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_835)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_836)))))))))) is different from true [2023-12-25 06:43:12,145 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_834 (_ BitVec 32)) (v_arrayElimCell_836 (_ BitVec 32)) (v_arrayElimCell_835 (_ BitVec 32)) (v_arrayElimCell_837 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_834)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_835)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_837)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_836))))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_799 (_ BitVec 32)) (v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_798 (_ BitVec 32)) (v_arrayElimCell_801 (_ BitVec 32)) (v_arrayElimCell_800 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_801)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_799)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_798)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_800)))))))))) is different from true [2023-12-25 06:43:12,159 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_799 (_ BitVec 32)) (v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_798 (_ BitVec 32)) (v_arrayElimCell_801 (_ BitVec 32)) (v_arrayElimCell_800 (_ BitVec 32)) (v_arrayElimCell_802 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_802)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_801)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_799)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_798)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_800))))))) (exists ((v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_834 (_ BitVec 32)) (v_arrayElimCell_836 (_ BitVec 32)) (v_arrayElimCell_835 (_ BitVec 32)) (v_arrayElimCell_838 (_ BitVec 32)) (v_arrayElimCell_837 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_834)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_835)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_837)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_838)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_836)))))))))) is different from true [2023-12-25 06:43:12,180 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_834 (_ BitVec 32)) (v_arrayElimCell_836 (_ BitVec 32)) (v_arrayElimCell_835 (_ BitVec 32)) (v_arrayElimCell_838 (_ BitVec 32)) (v_arrayElimCell_837 (_ BitVec 32)) (v_arrayElimCell_839 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_834)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_835)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_837)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_839)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_838)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_836))))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_799 (_ BitVec 32)) (v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_798 (_ BitVec 32)) (v_arrayElimCell_801 (_ BitVec 32)) (v_arrayElimCell_800 (_ BitVec 32)) (v_arrayElimCell_803 (_ BitVec 32)) (v_arrayElimCell_802 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_802)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_803)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_801)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_799)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_798)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_800)))))))))) is different from true [2023-12-25 06:43:12,197 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_799 (_ BitVec 32)) (v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_798 (_ BitVec 32)) (v_arrayElimCell_801 (_ BitVec 32)) (v_arrayElimCell_800 (_ BitVec 32)) (v_arrayElimCell_803 (_ BitVec 32)) (v_arrayElimCell_802 (_ BitVec 32)) (v_arrayElimCell_804 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_802)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_804)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_803)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_801)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_799)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_798)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_800))))))) (exists ((v_arrayElimCell_840 (_ BitVec 32)) (v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_834 (_ BitVec 32)) (v_arrayElimCell_836 (_ BitVec 32)) (v_arrayElimCell_835 (_ BitVec 32)) (v_arrayElimCell_838 (_ BitVec 32)) (v_arrayElimCell_837 (_ BitVec 32)) (v_arrayElimCell_839 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_834)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_835)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_837)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_840)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_839)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_838)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_836)))))))))) is different from true [2023-12-25 06:43:12,222 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_799 (_ BitVec 32)) (v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_798 (_ BitVec 32)) (v_arrayElimCell_801 (_ BitVec 32)) (v_arrayElimCell_800 (_ BitVec 32)) (v_arrayElimCell_803 (_ BitVec 32)) (v_arrayElimCell_802 (_ BitVec 32)) (v_arrayElimCell_805 (_ BitVec 32)) (v_arrayElimCell_804 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_802)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_805)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_804)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_803)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_801)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_799)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_798)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_800))))))) (exists ((v_arrayElimCell_841 (_ BitVec 32)) (v_arrayElimCell_840 (_ BitVec 32)) (v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_834 (_ BitVec 32)) (v_arrayElimCell_836 (_ BitVec 32)) (v_arrayElimCell_835 (_ BitVec 32)) (v_arrayElimCell_838 (_ BitVec 32)) (v_arrayElimCell_837 (_ BitVec 32)) (v_arrayElimCell_839 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_834)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_835)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_841)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_837)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_840)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_839)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_838)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_836)))))))))) is different from true [2023-12-25 06:43:12,248 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_799 (_ BitVec 32)) (v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_798 (_ BitVec 32)) (v_arrayElimCell_801 (_ BitVec 32)) (v_arrayElimCell_800 (_ BitVec 32)) (v_arrayElimCell_803 (_ BitVec 32)) (v_arrayElimCell_802 (_ BitVec 32)) (v_arrayElimCell_805 (_ BitVec 32)) (v_arrayElimCell_804 (_ BitVec 32)) (v_arrayElimCell_806 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_802)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_805)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_804)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_803)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_801)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_806)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_799)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_798)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_800))))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_841 (_ BitVec 32)) (v_arrayElimCell_840 (_ BitVec 32)) (v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_842 (_ BitVec 32)) (v_arrayElimCell_834 (_ BitVec 32)) (v_arrayElimCell_836 (_ BitVec 32)) (v_arrayElimCell_835 (_ BitVec 32)) (v_arrayElimCell_838 (_ BitVec 32)) (v_arrayElimCell_837 (_ BitVec 32)) (v_arrayElimCell_839 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_834)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_835)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_841)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_837)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_842)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_840)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_839)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_838)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_836)))))))))) is different from true [2023-12-25 06:43:12,285 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_841 (_ BitVec 32)) (v_arrayElimCell_840 (_ BitVec 32)) (v_arrayElimCell_843 (_ BitVec 32)) (v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_842 (_ BitVec 32)) (v_arrayElimCell_834 (_ BitVec 32)) (v_arrayElimCell_836 (_ BitVec 32)) (v_arrayElimCell_835 (_ BitVec 32)) (v_arrayElimCell_838 (_ BitVec 32)) (v_arrayElimCell_837 (_ BitVec 32)) (v_arrayElimCell_839 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_834)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_835)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_841)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_837)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_842)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_843)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_840)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_839)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_838)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_836))))))) (exists ((v_arrayElimCell_799 (_ BitVec 32)) (v_arrayElimCell_787 (_ BitVec 32)) (v_arrayElimCell_798 (_ BitVec 32)) (v_arrayElimCell_801 (_ BitVec 32)) (v_arrayElimCell_800 (_ BitVec 32)) (v_arrayElimCell_803 (_ BitVec 32)) (v_arrayElimCell_802 (_ BitVec 32)) (v_arrayElimCell_805 (_ BitVec 32)) (v_arrayElimCell_804 (_ BitVec 32)) (v_arrayElimCell_807 (_ BitVec 32)) (v_arrayElimCell_806 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_807)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_802)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_805)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_804)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_787)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_803)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_801)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_806)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_799)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_798)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_800)))))))))) is different from true [2023-12-25 06:43:20,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:43:25,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:43:25,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:43:25,355 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2023-12-25 06:43:25,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-25 06:43:25,355 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 23 states have return successors, (24), 23 states have call predecessors, (24), 3 states have call successors, (24) Word has length 70 [2023-12-25 06:43:25,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:43:25,356 INFO L225 Difference]: With dead ends: 50 [2023-12-25 06:43:25,356 INFO L226 Difference]: Without dead ends: 48 [2023-12-25 06:43:25,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 90 SyntacticMatches, 22 SemanticMatches, 50 ConstructedPredicates, 31 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=141, Invalid=367, Unknown=36, NotChecked=2108, Total=2652 [2023-12-25 06:43:25,357 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 1205 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:43:25,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 2 Unknown, 1205 Unchecked, 10.0s Time] [2023-12-25 06:43:25,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-25 06:43:25,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2023-12-25 06:43:25,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 14 states have return successors, (16), 15 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-25 06:43:25,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2023-12-25 06:43:25,361 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 70 [2023-12-25 06:43:25,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:43:25,362 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2023-12-25 06:43:25,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 23 states have return successors, (24), 23 states have call predecessors, (24), 3 states have call successors, (24) [2023-12-25 06:43:25,362 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2023-12-25 06:43:25,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-25 06:43:25,362 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:43:25,362 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:43:25,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2023-12-25 06:43:25,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (58)] Ended with exit code 0 [2023-12-25 06:43:25,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-25 06:43:25,763 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:43:25,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:43:25,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1122165500, now seen corresponding path program 12 times [2023-12-25 06:43:25,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:43:25,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767956063] [2023-12-25 06:43:25,764 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 06:43:25,764 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 [2023-12-25 06:43:25,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:43:25,765 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:43:25,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (61)] Waiting until timeout for monitored process [2023-12-25 06:43:27,024 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2023-12-25 06:43:27,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:43:27,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 101 conjunts are in the unsatisfiable core [2023-12-25 06:43:27,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:43:27,210 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 23 treesize of output 19 [2023-12-25 06:43:27,384 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 23 treesize of output 19 [2023-12-25 06:43:27,522 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 23 treesize of output 19 [2023-12-25 06:43:27,659 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 23 treesize of output 19 [2023-12-25 06:43:27,796 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 23 treesize of output 19 [2023-12-25 06:43:27,940 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 23 treesize of output 19 [2023-12-25 06:43:28,080 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 23 treesize of output 19 [2023-12-25 06:43:28,218 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 23 treesize of output 19 [2023-12-25 06:43:28,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 23 treesize of output 19 [2023-12-25 06:43:28,494 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 23 treesize of output 19 [2023-12-25 06:43:28,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 23 treesize of output 19 [2023-12-25 06:43:28,771 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 23 treesize of output 19 [2023-12-25 06:43:28,795 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_869 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_869)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) is different from true [2023-12-25 06:43:28,889 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_869 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_869)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)))))))) is different from true [2023-12-25 06:43:28,933 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_869 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_870 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_869)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_870)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)))))))) is different from true [2023-12-25 06:43:28,980 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_871 (_ BitVec 32)) (v_arrayElimCell_869 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_870 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_869)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_871)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_870)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)))))))) is different from true [2023-12-25 06:43:29,027 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_872 (_ BitVec 32)) (v_arrayElimCell_871 (_ BitVec 32)) (v_arrayElimCell_869 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_870 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_869)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_871)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_870)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_872)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)))))))) is different from true [2023-12-25 06:43:29,078 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_872 (_ BitVec 32)) (v_arrayElimCell_871 (_ BitVec 32)) (v_arrayElimCell_873 (_ BitVec 32)) (v_arrayElimCell_869 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_870 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_869)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_871)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_870)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_872)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_873)))))))) is different from true [2023-12-25 06:43:29,132 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_872 (_ BitVec 32)) (v_arrayElimCell_871 (_ BitVec 32)) (v_arrayElimCell_874 (_ BitVec 32)) (v_arrayElimCell_873 (_ BitVec 32)) (v_arrayElimCell_869 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_870 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_869)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_871)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_870)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_872)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_874)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_873)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:43:29,192 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_872 (_ BitVec 32)) (v_arrayElimCell_871 (_ BitVec 32)) (v_arrayElimCell_874 (_ BitVec 32)) (v_arrayElimCell_873 (_ BitVec 32)) (v_arrayElimCell_875 (_ BitVec 32)) (v_arrayElimCell_869 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_870 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_869)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_875)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_871)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_870)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_872)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_874)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_873)))))))) is different from true [2023-12-25 06:43:29,254 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_872 (_ BitVec 32)) (v_arrayElimCell_871 (_ BitVec 32)) (v_arrayElimCell_874 (_ BitVec 32)) (v_arrayElimCell_873 (_ BitVec 32)) (v_arrayElimCell_876 (_ BitVec 32)) (v_arrayElimCell_875 (_ BitVec 32)) (v_arrayElimCell_869 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_870 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_869)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_875)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_871)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_870)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_872)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_876)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_874)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_873)))))))) is different from true [2023-12-25 06:43:29,315 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_872 (_ BitVec 32)) (v_arrayElimCell_871 (_ BitVec 32)) (v_arrayElimCell_874 (_ BitVec 32)) (v_arrayElimCell_873 (_ BitVec 32)) (v_arrayElimCell_876 (_ BitVec 32)) (v_arrayElimCell_875 (_ BitVec 32)) (v_arrayElimCell_877 (_ BitVec 32)) (v_arrayElimCell_869 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_870 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_869)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_875)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_871)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_870)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_877)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_872)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_876)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_874)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_873)))))))) is different from true [2023-12-25 06:43:29,380 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_872 (_ BitVec 32)) (v_arrayElimCell_871 (_ BitVec 32)) (v_arrayElimCell_874 (_ BitVec 32)) (v_arrayElimCell_873 (_ BitVec 32)) (v_arrayElimCell_876 (_ BitVec 32)) (v_arrayElimCell_875 (_ BitVec 32)) (v_arrayElimCell_878 (_ BitVec 32)) (v_arrayElimCell_877 (_ BitVec 32)) (v_arrayElimCell_869 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_870 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_869)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_875)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_871)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_870)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_877)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_872)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_878)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_876)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_874)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_873)))))))) is different from true [2023-12-25 06:43:29,450 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_870 (_ BitVec 32)) (v_arrayElimCell_872 (_ BitVec 32)) (v_arrayElimCell_871 (_ BitVec 32)) (v_arrayElimCell_874 (_ BitVec 32)) (v_arrayElimCell_873 (_ BitVec 32)) (v_arrayElimCell_876 (_ BitVec 32)) (v_arrayElimCell_875 (_ BitVec 32)) (v_arrayElimCell_878 (_ BitVec 32)) (v_arrayElimCell_877 (_ BitVec 32)) (v_arrayElimCell_869 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_879 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_869)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_875)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_871)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_870)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_879)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_877)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_872)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_878)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_876)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_874)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_873)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:43:29,488 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 55 treesize of output 47 [2023-12-25 06:43:29,812 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 51 treesize of output 43 [2023-12-25 06:43:34,131 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 199 trivial. 167 not checked. [2023-12-25 06:43:34,131 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:43:41,111 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 93 treesize of output 89 [2023-12-25 06:43:41,123 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 89 treesize of output 85 [2023-12-25 06:43:41,135 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 85 treesize of output 81 [2023-12-25 06:43:41,146 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 81 treesize of output 77 [2023-12-25 06:43:41,160 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 77 treesize of output 73 [2023-12-25 06:43:41,174 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 73 treesize of output 69 [2023-12-25 06:43:41,189 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 69 treesize of output 65 [2023-12-25 06:43:41,203 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 65 treesize of output 61 [2023-12-25 06:43:41,217 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 61 treesize of output 57 [2023-12-25 06:43:41,231 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 57 treesize of output 53 [2023-12-25 06:43:41,245 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 53 treesize of output 49 [2023-12-25 06:43:41,259 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 49 treesize of output 45 [2023-12-25 06:43:41,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:43:41,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767956063] [2023-12-25 06:43:41,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [767956063] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:43:41,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [568366428] [2023-12-25 06:43:41,732 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 06:43:41,732 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:43:41,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:43:41,733 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:43:41,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (62)] Waiting until timeout for monitored process [2023-12-25 06:43:43,158 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-25 06:43:43,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767836289] [2023-12-25 06:43:43,158 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 06:43:43,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 06:43:43,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:43:43,161 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-25 06:43:43,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2023-12-25 06:43:43,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (62)] Forceful destruction successful, exit code 1 [2023-12-25 06:44:21,505 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2023-12-25 06:44:21,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:44:21,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 101 conjunts are in the unsatisfiable core [2023-12-25 06:44:21,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:44:21,633 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 23 treesize of output 19 [2023-12-25 06:44:21,824 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 23 treesize of output 19 [2023-12-25 06:44:22,022 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 23 treesize of output 19 [2023-12-25 06:44:22,221 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 23 treesize of output 19 [2023-12-25 06:44:22,374 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 23 treesize of output 19 [2023-12-25 06:44:22,522 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 23 treesize of output 19 [2023-12-25 06:44:22,663 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 23 treesize of output 19 [2023-12-25 06:44:22,802 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 23 treesize of output 19 [2023-12-25 06:44:22,940 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 23 treesize of output 19 [2023-12-25 06:44:23,080 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 23 treesize of output 19 [2023-12-25 06:44:23,223 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 23 treesize of output 19 [2023-12-25 06:44:23,360 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 23 treesize of output 19 [2023-12-25 06:44:23,384 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_905 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_905)))))))) is different from true [2023-12-25 06:44:23,476 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_905 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_905)))))))) is different from true [2023-12-25 06:44:23,517 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_906 (_ BitVec 32)) (v_arrayElimCell_905 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_905)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_906)))))))) is different from true [2023-12-25 06:44:23,559 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_906 (_ BitVec 32)) (v_arrayElimCell_905 (_ BitVec 32)) (v_arrayElimCell_907 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_907)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_905)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_906)))))))) is different from true [2023-12-25 06:44:23,613 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_906 (_ BitVec 32)) (v_arrayElimCell_905 (_ BitVec 32)) (v_arrayElimCell_908 (_ BitVec 32)) (v_arrayElimCell_907 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_907)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_905)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_906)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_908)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:44:23,660 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_909 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_906 (_ BitVec 32)) (v_arrayElimCell_905 (_ BitVec 32)) (v_arrayElimCell_908 (_ BitVec 32)) (v_arrayElimCell_907 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_907)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_905)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_909)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_906)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_908)))))))) is different from true [2023-12-25 06:44:23,712 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_909 (_ BitVec 32)) (v_arrayElimCell_910 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_906 (_ BitVec 32)) (v_arrayElimCell_905 (_ BitVec 32)) (v_arrayElimCell_908 (_ BitVec 32)) (v_arrayElimCell_907 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_907)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_905)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_909)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_906)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_908)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_910)))))))) is different from true [2023-12-25 06:44:23,766 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_909 (_ BitVec 32)) (v_arrayElimCell_911 (_ BitVec 32)) (v_arrayElimCell_910 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_906 (_ BitVec 32)) (v_arrayElimCell_905 (_ BitVec 32)) (v_arrayElimCell_908 (_ BitVec 32)) (v_arrayElimCell_907 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_907)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_911)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_905)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_909)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_906)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_908)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_910)))))))) is different from true [2023-12-25 06:44:23,825 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_909 (_ BitVec 32)) (v_arrayElimCell_911 (_ BitVec 32)) (v_arrayElimCell_910 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_912 (_ BitVec 32)) (v_arrayElimCell_906 (_ BitVec 32)) (v_arrayElimCell_905 (_ BitVec 32)) (v_arrayElimCell_908 (_ BitVec 32)) (v_arrayElimCell_907 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_912)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_907)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_911)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_905)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_909)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_906)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_908)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_910)))))))) is different from true [2023-12-25 06:44:23,911 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_909 (_ BitVec 32)) (v_arrayElimCell_911 (_ BitVec 32)) (v_arrayElimCell_910 (_ BitVec 32)) (v_arrayElimCell_913 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_912 (_ BitVec 32)) (v_arrayElimCell_906 (_ BitVec 32)) (v_arrayElimCell_905 (_ BitVec 32)) (v_arrayElimCell_908 (_ BitVec 32)) (v_arrayElimCell_907 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_912)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_913)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_907)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_911)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_905)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_909)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_906)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_908)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_910)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:44:23,983 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_909 (_ BitVec 32)) (v_arrayElimCell_911 (_ BitVec 32)) (v_arrayElimCell_910 (_ BitVec 32)) (v_arrayElimCell_913 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_912 (_ BitVec 32)) (v_arrayElimCell_914 (_ BitVec 32)) (v_arrayElimCell_906 (_ BitVec 32)) (v_arrayElimCell_905 (_ BitVec 32)) (v_arrayElimCell_908 (_ BitVec 32)) (v_arrayElimCell_907 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_912)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_913)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_907)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_911)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_914)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_905)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_909)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_906)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_908)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_910)))))))) is different from true [2023-12-25 06:44:24,066 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_909 (_ BitVec 32)) (v_arrayElimCell_911 (_ BitVec 32)) (v_arrayElimCell_910 (_ BitVec 32)) (v_arrayElimCell_913 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_912 (_ BitVec 32)) (v_arrayElimCell_915 (_ BitVec 32)) (v_arrayElimCell_914 (_ BitVec 32)) (v_arrayElimCell_906 (_ BitVec 32)) (v_arrayElimCell_905 (_ BitVec 32)) (v_arrayElimCell_908 (_ BitVec 32)) (v_arrayElimCell_907 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_912)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_913)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_907)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_911)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_914)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_915)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_905)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_909)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_906)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_908)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_910)))))))) is different from true [2023-12-25 06:44:24,107 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 55 treesize of output 47 [2023-12-25 06:44:24,405 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 51 treesize of output 43 [2023-12-25 06:44:24,444 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 199 trivial. 167 not checked. [2023-12-25 06:44:24,444 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:44:30,571 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 93 treesize of output 89 [2023-12-25 06:44:30,587 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 89 treesize of output 85 [2023-12-25 06:44:30,601 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 85 treesize of output 81 [2023-12-25 06:44:30,616 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 81 treesize of output 77 [2023-12-25 06:44:30,631 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 77 treesize of output 73 [2023-12-25 06:44:30,645 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 73 treesize of output 69 [2023-12-25 06:44:30,659 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 69 treesize of output 65 [2023-12-25 06:44:30,673 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 65 treesize of output 61 [2023-12-25 06:44:30,688 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 61 treesize of output 57 [2023-12-25 06:44:30,702 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 57 treesize of output 53 [2023-12-25 06:44:30,716 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 53 treesize of output 49 [2023-12-25 06:44:30,729 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 49 treesize of output 45 [2023-12-25 06:44:31,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767836289] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:44:31,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:44:31,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 32 [2023-12-25 06:44:31,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983783579] [2023-12-25 06:44:31,364 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:44:31,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-25 06:44:31,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:44:31,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-25 06:44:31,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=105, Unknown=25, NotChecked=984, Total=1190 [2023-12-25 06:44:31,365 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 32 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 25 states have return successors, (26), 25 states have call predecessors, (26), 4 states have call successors, (26) [2023-12-25 06:44:32,315 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_905 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_905))))))) (exists ((v_arrayElimCell_869 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_869)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)))))))))) is different from true [2023-12-25 06:44:32,329 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_869 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_870 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_869)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_870)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858))))))) (exists ((v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_906 (_ BitVec 32)) (v_arrayElimCell_905 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_905)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_906)))))))))) is different from true [2023-12-25 06:44:32,345 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_906 (_ BitVec 32)) (v_arrayElimCell_905 (_ BitVec 32)) (v_arrayElimCell_907 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_907)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_905)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_906))))))) (exists ((v_arrayElimCell_871 (_ BitVec 32)) (v_arrayElimCell_869 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_870 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_869)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_871)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_870)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)))))))))) is different from true [2023-12-25 06:44:32,370 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_906 (_ BitVec 32)) (v_arrayElimCell_905 (_ BitVec 32)) (v_arrayElimCell_908 (_ BitVec 32)) (v_arrayElimCell_907 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_907)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_905)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_906)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_908))))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_872 (_ BitVec 32)) (v_arrayElimCell_871 (_ BitVec 32)) (v_arrayElimCell_869 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_870 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_869)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_871)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_870)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_872)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)))))))))) is different from true [2023-12-25 06:44:32,389 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_909 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_906 (_ BitVec 32)) (v_arrayElimCell_905 (_ BitVec 32)) (v_arrayElimCell_908 (_ BitVec 32)) (v_arrayElimCell_907 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_907)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_905)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_909)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_906)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_908))))))) (exists ((v_arrayElimCell_872 (_ BitVec 32)) (v_arrayElimCell_871 (_ BitVec 32)) (v_arrayElimCell_873 (_ BitVec 32)) (v_arrayElimCell_869 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_870 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_869)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_871)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_870)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_872)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_873)))))))))) is different from true [2023-12-25 06:44:32,409 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_909 (_ BitVec 32)) (v_arrayElimCell_910 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_906 (_ BitVec 32)) (v_arrayElimCell_905 (_ BitVec 32)) (v_arrayElimCell_908 (_ BitVec 32)) (v_arrayElimCell_907 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_907)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_905)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_909)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_906)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_908)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_910))))))) (exists ((v_arrayElimCell_872 (_ BitVec 32)) (v_arrayElimCell_871 (_ BitVec 32)) (v_arrayElimCell_874 (_ BitVec 32)) (v_arrayElimCell_873 (_ BitVec 32)) (v_arrayElimCell_869 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_870 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_869)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_871)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_870)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_872)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_874)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_873))))) |c_#memory_int#3|))))) is different from true [2023-12-25 06:44:32,450 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_872 (_ BitVec 32)) (v_arrayElimCell_871 (_ BitVec 32)) (v_arrayElimCell_874 (_ BitVec 32)) (v_arrayElimCell_873 (_ BitVec 32)) (v_arrayElimCell_875 (_ BitVec 32)) (v_arrayElimCell_869 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_870 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_869)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_875)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_871)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_870)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_872)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_874)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_873))))))) (exists ((v_arrayElimCell_909 (_ BitVec 32)) (v_arrayElimCell_911 (_ BitVec 32)) (v_arrayElimCell_910 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_906 (_ BitVec 32)) (v_arrayElimCell_905 (_ BitVec 32)) (v_arrayElimCell_908 (_ BitVec 32)) (v_arrayElimCell_907 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_907)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_911)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_905)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_909)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_906)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_908)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_910)))))))))) is different from true [2023-12-25 06:44:32,472 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_872 (_ BitVec 32)) (v_arrayElimCell_871 (_ BitVec 32)) (v_arrayElimCell_874 (_ BitVec 32)) (v_arrayElimCell_873 (_ BitVec 32)) (v_arrayElimCell_876 (_ BitVec 32)) (v_arrayElimCell_875 (_ BitVec 32)) (v_arrayElimCell_869 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_870 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_869)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_875)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_871)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_870)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_872)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_876)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_874)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_873))))))) (exists ((v_arrayElimCell_909 (_ BitVec 32)) (v_arrayElimCell_911 (_ BitVec 32)) (v_arrayElimCell_910 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_912 (_ BitVec 32)) (v_arrayElimCell_906 (_ BitVec 32)) (v_arrayElimCell_905 (_ BitVec 32)) (v_arrayElimCell_908 (_ BitVec 32)) (v_arrayElimCell_907 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_912)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_907)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_911)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_905)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_909)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_906)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_908)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_910)))))))))) is different from true [2023-12-25 06:44:32,504 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_872 (_ BitVec 32)) (v_arrayElimCell_871 (_ BitVec 32)) (v_arrayElimCell_874 (_ BitVec 32)) (v_arrayElimCell_873 (_ BitVec 32)) (v_arrayElimCell_876 (_ BitVec 32)) (v_arrayElimCell_875 (_ BitVec 32)) (v_arrayElimCell_877 (_ BitVec 32)) (v_arrayElimCell_869 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_870 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_869)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_875)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_871)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_870)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_877)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_872)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_876)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_874)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_873))))))) (exists ((v_arrayElimCell_909 (_ BitVec 32)) (v_arrayElimCell_911 (_ BitVec 32)) (v_arrayElimCell_910 (_ BitVec 32)) (v_arrayElimCell_913 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_912 (_ BitVec 32)) (v_arrayElimCell_906 (_ BitVec 32)) (v_arrayElimCell_905 (_ BitVec 32)) (v_arrayElimCell_908 (_ BitVec 32)) (v_arrayElimCell_907 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_912)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_913)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_907)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_911)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_905)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_909)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_906)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_908)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_910))))) |c_#memory_int#3|))))) is different from true [2023-12-25 06:44:32,529 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_872 (_ BitVec 32)) (v_arrayElimCell_871 (_ BitVec 32)) (v_arrayElimCell_874 (_ BitVec 32)) (v_arrayElimCell_873 (_ BitVec 32)) (v_arrayElimCell_876 (_ BitVec 32)) (v_arrayElimCell_875 (_ BitVec 32)) (v_arrayElimCell_878 (_ BitVec 32)) (v_arrayElimCell_877 (_ BitVec 32)) (v_arrayElimCell_869 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_870 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_869)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_875)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_871)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_870)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_877)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_872)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_878)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_876)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_874)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_873))))))) (exists ((v_arrayElimCell_909 (_ BitVec 32)) (v_arrayElimCell_911 (_ BitVec 32)) (v_arrayElimCell_910 (_ BitVec 32)) (v_arrayElimCell_913 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_912 (_ BitVec 32)) (v_arrayElimCell_914 (_ BitVec 32)) (v_arrayElimCell_906 (_ BitVec 32)) (v_arrayElimCell_905 (_ BitVec 32)) (v_arrayElimCell_908 (_ BitVec 32)) (v_arrayElimCell_907 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_912)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_913)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_907)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_911)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_914)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_905)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_909)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_906)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_908)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_910)))))))))) is different from true [2023-12-25 06:44:32,583 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_870 (_ BitVec 32)) (v_arrayElimCell_872 (_ BitVec 32)) (v_arrayElimCell_871 (_ BitVec 32)) (v_arrayElimCell_874 (_ BitVec 32)) (v_arrayElimCell_873 (_ BitVec 32)) (v_arrayElimCell_876 (_ BitVec 32)) (v_arrayElimCell_875 (_ BitVec 32)) (v_arrayElimCell_878 (_ BitVec 32)) (v_arrayElimCell_877 (_ BitVec 32)) (v_arrayElimCell_869 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_879 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_869)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_875)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_871)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_870)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_879)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_877)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_872)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_878)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_876)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_874)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_873))))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_909 (_ BitVec 32)) (v_arrayElimCell_911 (_ BitVec 32)) (v_arrayElimCell_910 (_ BitVec 32)) (v_arrayElimCell_913 (_ BitVec 32)) (v_arrayElimCell_858 (_ BitVec 32)) (v_arrayElimCell_912 (_ BitVec 32)) (v_arrayElimCell_915 (_ BitVec 32)) (v_arrayElimCell_914 (_ BitVec 32)) (v_arrayElimCell_906 (_ BitVec 32)) (v_arrayElimCell_905 (_ BitVec 32)) (v_arrayElimCell_908 (_ BitVec 32)) (v_arrayElimCell_907 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_912)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_913)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_907)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_911)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_914)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_858)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_915)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_905)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_909)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_906)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_908)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_910)))))))))) is different from true [2023-12-25 06:44:36,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:44:41,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:44:41,462 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2023-12-25 06:44:41,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-25 06:44:41,463 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 25 states have return successors, (26), 25 states have call predecessors, (26), 4 states have call successors, (26) Word has length 71 [2023-12-25 06:44:41,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:44:41,463 INFO L225 Difference]: With dead ends: 48 [2023-12-25 06:44:41,463 INFO L226 Difference]: Without dead ends: 43 [2023-12-25 06:44:41,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 94 SyntacticMatches, 24 SemanticMatches, 45 ConstructedPredicates, 35 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=105, Invalid=130, Unknown=37, NotChecked=1890, Total=2162 [2023-12-25 06:44:41,465 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1179 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-12-25 06:44:41,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 52 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 1 Unknown, 1179 Unchecked, 5.3s Time] [2023-12-25 06:44:41,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-25 06:44:41,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-12-25 06:44:41,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 14 states have return successors, (15), 14 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-25 06:44:41,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2023-12-25 06:44:41,471 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 71 [2023-12-25 06:44:41,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:44:41,471 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2023-12-25 06:44:41,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 25 states have return successors, (26), 25 states have call predecessors, (26), 4 states have call successors, (26) [2023-12-25 06:44:41,471 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2023-12-25 06:44:41,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-25 06:44:41,472 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:44:41,472 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:44:41,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2023-12-25 06:44:41,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (61)] Forceful destruction successful, exit code 0 [2023-12-25 06:44:41,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-25 06:44:41,873 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:44:41,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:44:41,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1833953903, now seen corresponding path program 13 times [2023-12-25 06:44:41,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:44:41,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10607014] [2023-12-25 06:44:41,874 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-25 06:44:41,874 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 [2023-12-25 06:44:41,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:44:41,875 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:44:41,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (64)] Waiting until timeout for monitored process [2023-12-25 06:44:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:44:42,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 164 conjunts are in the unsatisfiable core [2023-12-25 06:44:42,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:44:43,072 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 23 treesize of output 19 [2023-12-25 06:44:43,327 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 23 treesize of output 19 [2023-12-25 06:44:43,516 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 23 treesize of output 19 [2023-12-25 06:44:43,719 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 23 treesize of output 19 [2023-12-25 06:44:43,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 23 treesize of output 19 [2023-12-25 06:44:44,100 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 23 treesize of output 19 [2023-12-25 06:44:44,299 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 23 treesize of output 19 [2023-12-25 06:44:44,487 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 23 treesize of output 19 [2023-12-25 06:44:44,674 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 23 treesize of output 19 [2023-12-25 06:44:44,862 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 23 treesize of output 19 [2023-12-25 06:44:45,050 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 23 treesize of output 19 [2023-12-25 06:44:45,238 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 23 treesize of output 19 [2023-12-25 06:44:45,673 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_930 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:44:45,717 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_942 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_942)))))))) is different from true [2023-12-25 06:44:45,767 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_942 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_943 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_943)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_942)))))))) is different from true [2023-12-25 06:44:45,818 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_942 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_944 (_ BitVec 32)) (v_arrayElimCell_943 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_943)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_944)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_942)))))))) is different from true [2023-12-25 06:44:45,871 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_942 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_944 (_ BitVec 32)) (v_arrayElimCell_943 (_ BitVec 32)) (v_arrayElimCell_945 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_943)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_944)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_945)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_942)))))))) is different from true [2023-12-25 06:44:45,925 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_942 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_944 (_ BitVec 32)) (v_arrayElimCell_943 (_ BitVec 32)) (v_arrayElimCell_946 (_ BitVec 32)) (v_arrayElimCell_945 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_943)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_944)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_946)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_945)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_942)))))))) is different from true [2023-12-25 06:44:45,982 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_942 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_944 (_ BitVec 32)) (v_arrayElimCell_943 (_ BitVec 32)) (v_arrayElimCell_946 (_ BitVec 32)) (v_arrayElimCell_945 (_ BitVec 32)) (v_arrayElimCell_947 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_943)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_944)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_946)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_947)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_945)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_942)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:44:46,046 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_942 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_944 (_ BitVec 32)) (v_arrayElimCell_943 (_ BitVec 32)) (v_arrayElimCell_946 (_ BitVec 32)) (v_arrayElimCell_945 (_ BitVec 32)) (v_arrayElimCell_948 (_ BitVec 32)) (v_arrayElimCell_947 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_943)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_948)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_944)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_946)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_947)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_945)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_942)))))))) is different from true [2023-12-25 06:44:46,116 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_942 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_944 (_ BitVec 32)) (v_arrayElimCell_943 (_ BitVec 32)) (v_arrayElimCell_946 (_ BitVec 32)) (v_arrayElimCell_945 (_ BitVec 32)) (v_arrayElimCell_948 (_ BitVec 32)) (v_arrayElimCell_947 (_ BitVec 32)) (v_arrayElimCell_949 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_949)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_943)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_948)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_944)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_946)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_947)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_945)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_942)))))))) is different from true [2023-12-25 06:44:46,182 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_950 (_ BitVec 32)) (v_arrayElimCell_942 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_944 (_ BitVec 32)) (v_arrayElimCell_943 (_ BitVec 32)) (v_arrayElimCell_946 (_ BitVec 32)) (v_arrayElimCell_945 (_ BitVec 32)) (v_arrayElimCell_948 (_ BitVec 32)) (v_arrayElimCell_947 (_ BitVec 32)) (v_arrayElimCell_949 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_949)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_943)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_948)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_944)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_946)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_947)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_945)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_942)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_950)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:44:46,251 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_951 (_ BitVec 32)) (v_arrayElimCell_950 (_ BitVec 32)) (v_arrayElimCell_942 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_944 (_ BitVec 32)) (v_arrayElimCell_943 (_ BitVec 32)) (v_arrayElimCell_946 (_ BitVec 32)) (v_arrayElimCell_945 (_ BitVec 32)) (v_arrayElimCell_948 (_ BitVec 32)) (v_arrayElimCell_947 (_ BitVec 32)) (v_arrayElimCell_949 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_949)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_943)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_948)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_944)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_946)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_947)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_951)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_945)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_942)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_950)))))))) is different from true [2023-12-25 06:44:46,327 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_951 (_ BitVec 32)) (v_arrayElimCell_950 (_ BitVec 32)) (v_arrayElimCell_942 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_952 (_ BitVec 32)) (v_arrayElimCell_944 (_ BitVec 32)) (v_arrayElimCell_943 (_ BitVec 32)) (v_arrayElimCell_946 (_ BitVec 32)) (v_arrayElimCell_945 (_ BitVec 32)) (v_arrayElimCell_948 (_ BitVec 32)) (v_arrayElimCell_947 (_ BitVec 32)) (v_arrayElimCell_949 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_949)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_943)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_948)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_944)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_946)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_947)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_951)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_945)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_942)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_950)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_952)))))))) is different from true [2023-12-25 06:44:46,371 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 62 treesize of output 54 [2023-12-25 06:44:46,929 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 59 treesize of output 51 [2023-12-25 06:44:46,941 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 54 treesize of output 46 [2023-12-25 06:44:51,533 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 13 proven. 27 refuted. 0 times theorem prover too weak. 222 trivial. 180 not checked. [2023-12-25 06:44:51,533 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:45:02,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 106 treesize of output 102 [2023-12-25 06:45:02,711 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 102 treesize of output 98 [2023-12-25 06:45:02,726 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 98 treesize of output 94 [2023-12-25 06:45:02,740 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 94 treesize of output 90 [2023-12-25 06:45:02,753 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 90 treesize of output 86 [2023-12-25 06:45:02,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 86 treesize of output 82 [2023-12-25 06:45:02,782 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 82 treesize of output 74 [2023-12-25 06:45:02,796 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 74 treesize of output 70 [2023-12-25 06:45:02,808 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 70 treesize of output 66 [2023-12-25 06:45:02,819 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 66 treesize of output 62 [2023-12-25 06:45:02,830 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 62 treesize of output 58 [2023-12-25 06:45:02,841 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 58 treesize of output 54 [2023-12-25 06:45:02,851 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 54 treesize of output 50 [2023-12-25 06:45:03,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:45:03,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10607014] [2023-12-25 06:45:03,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10607014] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:45:03,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [31524617] [2023-12-25 06:45:03,287 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-25 06:45:03,287 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:45:03,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:45:03,289 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:45:03,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (65)] Waiting until timeout for monitored process [2023-12-25 06:45:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:45:04,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 168 conjunts are in the unsatisfiable core [2023-12-25 06:45:04,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:45:05,191 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 23 treesize of output 19 [2023-12-25 06:45:05,375 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 23 treesize of output 19 [2023-12-25 06:45:05,563 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 23 treesize of output 19 [2023-12-25 06:45:05,750 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 23 treesize of output 19 [2023-12-25 06:45:05,945 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 23 treesize of output 19 [2023-12-25 06:45:06,176 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 23 treesize of output 19 [2023-12-25 06:45:06,379 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 23 treesize of output 19 [2023-12-25 06:45:06,578 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 23 treesize of output 19 [2023-12-25 06:45:06,780 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 23 treesize of output 19 [2023-12-25 06:45:06,980 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 23 treesize of output 19 [2023-12-25 06:45:07,181 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 23 treesize of output 19 [2023-12-25 06:45:07,375 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 23 treesize of output 19 [2023-12-25 06:45:07,564 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 12 treesize of output 8 [2023-12-25 06:45:08,069 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474|) .cse0)) (exists ((v_arrayElimCell_930 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) .cse0)))))) |c_#memory_int#3|)))) is different from true [2023-12-25 06:45:08,144 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((v_arrayElimCell_981 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_981)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) .cse1)))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474|) .cse1)))) is different from true [2023-12-25 06:45:08,223 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((v_arrayElimCell_982 (_ BitVec 32)) (v_arrayElimCell_981 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_981)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) .cse1)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_982)))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474|) .cse1)))) is different from true [2023-12-25 06:45:08,293 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474|) .cse0)) (exists ((v_arrayElimCell_982 (_ BitVec 32)) (v_arrayElimCell_981 (_ BitVec 32)) (v_arrayElimCell_983 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_981)) (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) .cse0)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_982)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_983)))))))))) is different from true [2023-12-25 06:45:08,366 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((v_arrayElimCell_982 (_ BitVec 32)) (v_arrayElimCell_981 (_ BitVec 32)) (v_arrayElimCell_984 (_ BitVec 32)) (v_arrayElimCell_983 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_981)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) .cse1)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_984)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_982)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_983)))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474|) .cse1)))) is different from true [2023-12-25 06:45:08,449 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((v_arrayElimCell_982 (_ BitVec 32)) (v_arrayElimCell_981 (_ BitVec 32)) (v_arrayElimCell_984 (_ BitVec 32)) (v_arrayElimCell_983 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_985 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_981)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_985)) ((_ zero_extend 24) ((_ extract 7 0) .cse1)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_984)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_982)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_983)))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474|) .cse1)))) is different from true [2023-12-25 06:45:08,531 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474|) .cse0)) (exists ((v_arrayElimCell_982 (_ BitVec 32)) (v_arrayElimCell_981 (_ BitVec 32)) (v_arrayElimCell_984 (_ BitVec 32)) (v_arrayElimCell_983 (_ BitVec 32)) (v_arrayElimCell_986 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_985 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_981)) (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_985)) ((_ zero_extend 24) ((_ extract 7 0) .cse0)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_984)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_986)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_982)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_983)))))) |c_#memory_int#3|)))) is different from true [2023-12-25 06:45:08,646 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((v_arrayElimCell_982 (_ BitVec 32)) (v_arrayElimCell_981 (_ BitVec 32)) (v_arrayElimCell_984 (_ BitVec 32)) (v_arrayElimCell_983 (_ BitVec 32)) (v_arrayElimCell_986 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_985 (_ BitVec 32)) (v_arrayElimCell_987 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_981)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_985)) ((_ zero_extend 24) ((_ extract 7 0) .cse1)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_984)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_986)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_987)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_982)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_983)))))) |c_#memory_int#3|)) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474|) .cse1)))) is different from true [2023-12-25 06:45:08,733 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((v_arrayElimCell_982 (_ BitVec 32)) (v_arrayElimCell_981 (_ BitVec 32)) (v_arrayElimCell_984 (_ BitVec 32)) (v_arrayElimCell_983 (_ BitVec 32)) (v_arrayElimCell_986 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_985 (_ BitVec 32)) (v_arrayElimCell_988 (_ BitVec 32)) (v_arrayElimCell_987 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_981)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_985)) ((_ zero_extend 24) ((_ extract 7 0) .cse1)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_984)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_988)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_986)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_987)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_982)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_983)))))) |c_#memory_int#3|)) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474|) .cse1)))) is different from true [2023-12-25 06:45:08,851 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474|) .cse0)) (exists ((v_arrayElimCell_982 (_ BitVec 32)) (v_arrayElimCell_981 (_ BitVec 32)) (v_arrayElimCell_984 (_ BitVec 32)) (v_arrayElimCell_983 (_ BitVec 32)) (v_arrayElimCell_986 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_985 (_ BitVec 32)) (v_arrayElimCell_988 (_ BitVec 32)) (v_arrayElimCell_987 (_ BitVec 32)) (v_arrayElimCell_989 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_981)) (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_985)) ((_ zero_extend 24) ((_ extract 7 0) .cse0)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_984)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_988)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_989)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_986)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_987)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_982)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_983)))))) |c_#memory_int#3|)))) is different from true [2023-12-25 06:45:08,949 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474|) .cse0)) (exists ((v_arrayElimCell_982 (_ BitVec 32)) (v_arrayElimCell_981 (_ BitVec 32)) (v_arrayElimCell_984 (_ BitVec 32)) (v_arrayElimCell_983 (_ BitVec 32)) (v_arrayElimCell_986 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_985 (_ BitVec 32)) (v_arrayElimCell_988 (_ BitVec 32)) (v_arrayElimCell_987 (_ BitVec 32)) (v_arrayElimCell_989 (_ BitVec 32)) (v_arrayElimCell_990 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_981)) (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_985)) ((_ zero_extend 24) ((_ extract 7 0) .cse0)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_984)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_988)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_989)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_986)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_987)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_982)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_990)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_983)))))))))) is different from true [2023-12-25 06:45:09,061 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474|) .cse0)) (exists ((v_arrayElimCell_991 (_ BitVec 32)) (v_arrayElimCell_990 (_ BitVec 32)) (v_arrayElimCell_982 (_ BitVec 32)) (v_arrayElimCell_981 (_ BitVec 32)) (v_arrayElimCell_984 (_ BitVec 32)) (v_arrayElimCell_983 (_ BitVec 32)) (v_arrayElimCell_986 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_985 (_ BitVec 32)) (v_arrayElimCell_988 (_ BitVec 32)) (v_arrayElimCell_987 (_ BitVec 32)) (v_arrayElimCell_989 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_981)) (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_985)) ((_ zero_extend 24) ((_ extract 7 0) .cse0)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_984)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_988)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_989)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_986)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_987)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_982)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_990)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_983)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_991)))))))))) is different from true [2023-12-25 06:45:09,158 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 62 treesize of output 54 [2023-12-25 06:45:09,512 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 67 treesize of output 55 [2023-12-25 06:45:09,526 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 55 treesize of output 47 [2023-12-25 06:45:22,620 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 13 proven. 27 refuted. 0 times theorem prover too weak. 222 trivial. 180 not checked. [2023-12-25 06:45:22,621 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:45:35,815 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 100 treesize of output 96 [2023-12-25 06:45:35,825 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 96 treesize of output 92 [2023-12-25 06:45:35,836 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 92 treesize of output 88 [2023-12-25 06:45:35,847 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 88 treesize of output 84 [2023-12-25 06:45:35,857 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 84 treesize of output 80 [2023-12-25 06:45:35,868 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 80 treesize of output 76 [2023-12-25 06:45:35,878 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 72 [2023-12-25 06:45:35,889 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 72 treesize of output 68 [2023-12-25 06:45:35,899 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 68 treesize of output 64 [2023-12-25 06:45:35,909 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 64 treesize of output 60 [2023-12-25 06:45:35,920 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 60 treesize of output 56 [2023-12-25 06:45:35,934 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 56 treesize of output 52 [2023-12-25 06:45:40,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [31524617] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:45:40,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:45:40,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 38 [2023-12-25 06:45:40,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869069736] [2023-12-25 06:45:40,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:45:40,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-25 06:45:40,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:45:40,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-25 06:45:40,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=274, Unknown=28, NotChecked=1320, Total=1722 [2023-12-25 06:45:40,557 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 38 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 27 states have return successors, (28), 28 states have call predecessors, (28), 5 states have call successors, (28) [2023-12-25 06:45:43,824 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse3)))) (and (exists ((v_arrayElimCell_981 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_981)) .cse1 .cse2))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474|) .cse3)) (exists ((v_arrayElimCell_942 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_942)))))))))) is different from true [2023-12-25 06:45:43,840 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse3)))) (and (exists ((v_arrayElimCell_942 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_943 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_943)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_942))))))) (exists ((v_arrayElimCell_982 (_ BitVec 32)) (v_arrayElimCell_981 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_981)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_982))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474|) .cse3))))) is different from true [2023-12-25 06:45:43,857 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse3)))) (and (exists ((v_arrayElimCell_942 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_944 (_ BitVec 32)) (v_arrayElimCell_943 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_943)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_944)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_942))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474|) .cse3)) (exists ((v_arrayElimCell_982 (_ BitVec 32)) (v_arrayElimCell_981 (_ BitVec 32)) (v_arrayElimCell_983 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_981)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_982)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_983)))))))))) is different from true [2023-12-25 06:45:43,876 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse3)))) (and (exists ((v_arrayElimCell_982 (_ BitVec 32)) (v_arrayElimCell_981 (_ BitVec 32)) (v_arrayElimCell_984 (_ BitVec 32)) (v_arrayElimCell_983 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_981)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_984)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_982)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_983))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474|) .cse3)) (exists ((v_arrayElimCell_942 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_944 (_ BitVec 32)) (v_arrayElimCell_943 (_ BitVec 32)) (v_arrayElimCell_945 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_943)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_944)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_945)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_942)))))))))) is different from true [2023-12-25 06:45:43,910 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse3)))) (and (exists ((v_arrayElimCell_982 (_ BitVec 32)) (v_arrayElimCell_981 (_ BitVec 32)) (v_arrayElimCell_984 (_ BitVec 32)) (v_arrayElimCell_983 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_985 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_981)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_985)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_984)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_982)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_983))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474|) .cse3)) (exists ((v_arrayElimCell_942 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_944 (_ BitVec 32)) (v_arrayElimCell_943 (_ BitVec 32)) (v_arrayElimCell_946 (_ BitVec 32)) (v_arrayElimCell_945 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_943)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_944)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_946)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_945)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_942)))))))))) is different from true [2023-12-25 06:45:43,937 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse2 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) .cse0)))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474|) .cse0)) (exists ((v_arrayElimCell_942 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_944 (_ BitVec 32)) (v_arrayElimCell_943 (_ BitVec 32)) (v_arrayElimCell_946 (_ BitVec 32)) (v_arrayElimCell_945 (_ BitVec 32)) (v_arrayElimCell_947 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_943)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_944)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_946)) .cse3 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_947)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_945)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_942))))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_982 (_ BitVec 32)) (v_arrayElimCell_981 (_ BitVec 32)) (v_arrayElimCell_984 (_ BitVec 32)) (v_arrayElimCell_983 (_ BitVec 32)) (v_arrayElimCell_986 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_985 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_981)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_985)) .cse3 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_984)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_986)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_982)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_983))))) |c_#memory_int#3|))))) is different from true [2023-12-25 06:45:43,971 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse3)))) (and (exists ((v_arrayElimCell_942 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_944 (_ BitVec 32)) (v_arrayElimCell_943 (_ BitVec 32)) (v_arrayElimCell_946 (_ BitVec 32)) (v_arrayElimCell_945 (_ BitVec 32)) (v_arrayElimCell_948 (_ BitVec 32)) (v_arrayElimCell_947 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_943)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_948)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_944)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_946)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_947)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_945)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_942))))))) (exists ((v_arrayElimCell_982 (_ BitVec 32)) (v_arrayElimCell_981 (_ BitVec 32)) (v_arrayElimCell_984 (_ BitVec 32)) (v_arrayElimCell_983 (_ BitVec 32)) (v_arrayElimCell_986 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_985 (_ BitVec 32)) (v_arrayElimCell_987 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_981)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_985)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_984)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_986)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_987)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_982)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_983))))) |c_#memory_int#3|)) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474|) .cse3))))) is different from true [2023-12-25 06:45:44,003 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse3)))) (and (exists ((v_arrayElimCell_982 (_ BitVec 32)) (v_arrayElimCell_981 (_ BitVec 32)) (v_arrayElimCell_984 (_ BitVec 32)) (v_arrayElimCell_983 (_ BitVec 32)) (v_arrayElimCell_986 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_985 (_ BitVec 32)) (v_arrayElimCell_988 (_ BitVec 32)) (v_arrayElimCell_987 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_981)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_985)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_984)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_988)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_986)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_987)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_982)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_983))))) |c_#memory_int#3|)) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474|) .cse3)) (exists ((v_arrayElimCell_942 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_944 (_ BitVec 32)) (v_arrayElimCell_943 (_ BitVec 32)) (v_arrayElimCell_946 (_ BitVec 32)) (v_arrayElimCell_945 (_ BitVec 32)) (v_arrayElimCell_948 (_ BitVec 32)) (v_arrayElimCell_947 (_ BitVec 32)) (v_arrayElimCell_949 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_949)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_943)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_948)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_944)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_946)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_947)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_945)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_942)))))))))) is different from true [2023-12-25 06:45:44,036 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse2 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) .cse0)))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474|) .cse0)) (exists ((v_arrayElimCell_950 (_ BitVec 32)) (v_arrayElimCell_942 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_944 (_ BitVec 32)) (v_arrayElimCell_943 (_ BitVec 32)) (v_arrayElimCell_946 (_ BitVec 32)) (v_arrayElimCell_945 (_ BitVec 32)) (v_arrayElimCell_948 (_ BitVec 32)) (v_arrayElimCell_947 (_ BitVec 32)) (v_arrayElimCell_949 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_949)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_943)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_948)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_944)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_946)) .cse3 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_947)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_945)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_942)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_950))))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_982 (_ BitVec 32)) (v_arrayElimCell_981 (_ BitVec 32)) (v_arrayElimCell_984 (_ BitVec 32)) (v_arrayElimCell_983 (_ BitVec 32)) (v_arrayElimCell_986 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_985 (_ BitVec 32)) (v_arrayElimCell_988 (_ BitVec 32)) (v_arrayElimCell_987 (_ BitVec 32)) (v_arrayElimCell_989 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_981)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_985)) .cse3 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_984)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_988)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_989)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_986)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_987)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_982)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_983))))) |c_#memory_int#3|))))) is different from true [2023-12-25 06:45:44,083 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse3)))) (and (exists ((v_arrayElimCell_951 (_ BitVec 32)) (v_arrayElimCell_950 (_ BitVec 32)) (v_arrayElimCell_942 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_944 (_ BitVec 32)) (v_arrayElimCell_943 (_ BitVec 32)) (v_arrayElimCell_946 (_ BitVec 32)) (v_arrayElimCell_945 (_ BitVec 32)) (v_arrayElimCell_948 (_ BitVec 32)) (v_arrayElimCell_947 (_ BitVec 32)) (v_arrayElimCell_949 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_949)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_943)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_948)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_944)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_946)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_947)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_951)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_945)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_942)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_950))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474|) .cse3)) (exists ((v_arrayElimCell_982 (_ BitVec 32)) (v_arrayElimCell_981 (_ BitVec 32)) (v_arrayElimCell_984 (_ BitVec 32)) (v_arrayElimCell_983 (_ BitVec 32)) (v_arrayElimCell_986 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_985 (_ BitVec 32)) (v_arrayElimCell_988 (_ BitVec 32)) (v_arrayElimCell_987 (_ BitVec 32)) (v_arrayElimCell_989 (_ BitVec 32)) (v_arrayElimCell_990 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_981)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_985)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_984)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_988)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_989)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_986)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_987)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_982)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_990)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_983)))))))))) is different from true [2023-12-25 06:45:44,145 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse3)))) (and (exists ((v_arrayElimCell_951 (_ BitVec 32)) (v_arrayElimCell_950 (_ BitVec 32)) (v_arrayElimCell_942 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_952 (_ BitVec 32)) (v_arrayElimCell_944 (_ BitVec 32)) (v_arrayElimCell_943 (_ BitVec 32)) (v_arrayElimCell_946 (_ BitVec 32)) (v_arrayElimCell_945 (_ BitVec 32)) (v_arrayElimCell_948 (_ BitVec 32)) (v_arrayElimCell_947 (_ BitVec 32)) (v_arrayElimCell_949 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_949)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_943)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_948)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_944)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_946)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_947)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_951)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_945)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_942)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_950)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_952))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1474|) .cse3)) (exists ((v_arrayElimCell_991 (_ BitVec 32)) (v_arrayElimCell_990 (_ BitVec 32)) (v_arrayElimCell_982 (_ BitVec 32)) (v_arrayElimCell_981 (_ BitVec 32)) (v_arrayElimCell_984 (_ BitVec 32)) (v_arrayElimCell_983 (_ BitVec 32)) (v_arrayElimCell_986 (_ BitVec 32)) (v_arrayElimCell_930 (_ BitVec 32)) (v_arrayElimCell_985 (_ BitVec 32)) (v_arrayElimCell_988 (_ BitVec 32)) (v_arrayElimCell_987 (_ BitVec 32)) (v_arrayElimCell_989 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_930)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_981)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_985)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_984)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_988)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_989)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_986)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_987)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_982)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_990)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_983)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_991)))))))))) is different from true [2023-12-25 06:45:48,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:45:53,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:45:53,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:45:53,418 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2023-12-25 06:45:53,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-25 06:45:53,419 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 27 states have return successors, (28), 28 states have call predecessors, (28), 5 states have call successors, (28) Word has length 75 [2023-12-25 06:45:53,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:45:53,419 INFO L225 Difference]: With dead ends: 52 [2023-12-25 06:45:53,419 INFO L226 Difference]: Without dead ends: 50 [2023-12-25 06:45:53,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 94 SyntacticMatches, 23 SemanticMatches, 57 ConstructedPredicates, 35 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 29.1s TimeCoverageRelationStatistics Valid=169, Invalid=484, Unknown=39, NotChecked=2730, Total=3422 [2023-12-25 06:45:53,421 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 1487 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2023-12-25 06:45:53,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 93 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 2 Unknown, 1487 Unchecked, 10.3s Time] [2023-12-25 06:45:53,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-25 06:45:53,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2023-12-25 06:45:53,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 15 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-25 06:45:53,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2023-12-25 06:45:53,426 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 75 [2023-12-25 06:45:53,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:45:53,426 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2023-12-25 06:45:53,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 27 states have return successors, (28), 28 states have call predecessors, (28), 5 states have call successors, (28) [2023-12-25 06:45:53,426 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2023-12-25 06:45:53,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-25 06:45:53,427 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:45:53,427 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:45:53,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (65)] Forceful destruction successful, exit code 0 [2023-12-25 06:45:53,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (64)] Forceful destruction successful, exit code 0 [2023-12-25 06:45:53,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-25 06:45:53,828 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:45:53,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:45:53,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1018000195, now seen corresponding path program 13 times [2023-12-25 06:45:53,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:45:53,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007305277] [2023-12-25 06:45:53,829 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-25 06:45:53,829 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 [2023-12-25 06:45:53,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:45:53,830 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:45:53,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (66)] Waiting until timeout for monitored process [2023-12-25 06:45:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:45:54,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 109 conjunts are in the unsatisfiable core [2023-12-25 06:45:54,809 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:45:54,987 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 23 treesize of output 19 [2023-12-25 06:45:55,161 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 23 treesize of output 19 [2023-12-25 06:45:55,298 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 23 treesize of output 19 [2023-12-25 06:45:55,434 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 23 treesize of output 19 [2023-12-25 06:45:55,571 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 23 treesize of output 19 [2023-12-25 06:45:55,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 23 treesize of output 19 [2023-12-25 06:45:55,839 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 23 treesize of output 19 [2023-12-25 06:45:55,982 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 23 treesize of output 19 [2023-12-25 06:45:56,130 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 23 treesize of output 19 [2023-12-25 06:45:56,260 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 23 treesize of output 19 [2023-12-25 06:45:56,391 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 23 treesize of output 19 [2023-12-25 06:45:56,523 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 23 treesize of output 19 [2023-12-25 06:45:56,651 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 23 treesize of output 19 [2023-12-25 06:45:56,675 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1019 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1019)))))))) is different from true [2023-12-25 06:45:56,765 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1019 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1019)))))))) is different from true [2023-12-25 06:45:56,805 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1019 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1020 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1020)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1019)))))))) is different from true [2023-12-25 06:45:56,847 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1019 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1020 (_ BitVec 32)) (v_arrayElimCell_1021 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1020)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1021)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1019)))))))) is different from true [2023-12-25 06:45:56,893 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1019 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1020 (_ BitVec 32)) (v_arrayElimCell_1022 (_ BitVec 32)) (v_arrayElimCell_1021 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1022)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1020)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1021)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1019)))))))) is different from true [2023-12-25 06:45:56,939 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1019 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1020 (_ BitVec 32)) (v_arrayElimCell_1023 (_ BitVec 32)) (v_arrayElimCell_1022 (_ BitVec 32)) (v_arrayElimCell_1021 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1023)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1022)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1020)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1021)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1019)))))))) is different from true [2023-12-25 06:45:56,988 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1019 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1020 (_ BitVec 32)) (v_arrayElimCell_1024 (_ BitVec 32)) (v_arrayElimCell_1023 (_ BitVec 32)) (v_arrayElimCell_1022 (_ BitVec 32)) (v_arrayElimCell_1021 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1023)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1022)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1024)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1020)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1021)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1019)))))))) is different from true [2023-12-25 06:45:57,042 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1019 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1020 (_ BitVec 32)) (v_arrayElimCell_1024 (_ BitVec 32)) (v_arrayElimCell_1023 (_ BitVec 32)) (v_arrayElimCell_1022 (_ BitVec 32)) (v_arrayElimCell_1021 (_ BitVec 32)) (v_arrayElimCell_1025 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1023)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1022)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1024)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1020)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1021)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1019)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1025)))))))) is different from true [2023-12-25 06:45:57,101 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1019 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1020 (_ BitVec 32)) (v_arrayElimCell_1024 (_ BitVec 32)) (v_arrayElimCell_1023 (_ BitVec 32)) (v_arrayElimCell_1022 (_ BitVec 32)) (v_arrayElimCell_1021 (_ BitVec 32)) (v_arrayElimCell_1026 (_ BitVec 32)) (v_arrayElimCell_1025 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1023)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1022)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1026)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1024)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1020)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1021)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1019)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1025)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:45:57,164 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1019 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1020 (_ BitVec 32)) (v_arrayElimCell_1024 (_ BitVec 32)) (v_arrayElimCell_1023 (_ BitVec 32)) (v_arrayElimCell_1022 (_ BitVec 32)) (v_arrayElimCell_1021 (_ BitVec 32)) (v_arrayElimCell_1027 (_ BitVec 32)) (v_arrayElimCell_1026 (_ BitVec 32)) (v_arrayElimCell_1025 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1023)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1022)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1026)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1024)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1020)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1021)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1019)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1027)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1025)))))))) is different from true [2023-12-25 06:45:57,231 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1019 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1020 (_ BitVec 32)) (v_arrayElimCell_1024 (_ BitVec 32)) (v_arrayElimCell_1023 (_ BitVec 32)) (v_arrayElimCell_1022 (_ BitVec 32)) (v_arrayElimCell_1021 (_ BitVec 32)) (v_arrayElimCell_1028 (_ BitVec 32)) (v_arrayElimCell_1027 (_ BitVec 32)) (v_arrayElimCell_1026 (_ BitVec 32)) (v_arrayElimCell_1025 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1023)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1022)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1026)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1024)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1020)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1021)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1019)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1028)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1027)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1025)))))))) is different from true [2023-12-25 06:45:57,298 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1019 (_ BitVec 32)) (v_arrayElimCell_1029 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1024 (_ BitVec 32)) (v_arrayElimCell_1023 (_ BitVec 32)) (v_arrayElimCell_1022 (_ BitVec 32)) (v_arrayElimCell_1021 (_ BitVec 32)) (v_arrayElimCell_1028 (_ BitVec 32)) (v_arrayElimCell_1027 (_ BitVec 32)) (v_arrayElimCell_1026 (_ BitVec 32)) (v_arrayElimCell_1025 (_ BitVec 32)) (v_arrayElimCell_1020 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1023)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1029)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1022)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1026)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1024)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1020)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1021)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1019)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1028)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1027)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1025)))))))) is different from true [2023-12-25 06:45:57,369 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1019 (_ BitVec 32)) (v_arrayElimCell_1029 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1024 (_ BitVec 32)) (v_arrayElimCell_1023 (_ BitVec 32)) (v_arrayElimCell_1022 (_ BitVec 32)) (v_arrayElimCell_1021 (_ BitVec 32)) (v_arrayElimCell_1028 (_ BitVec 32)) (v_arrayElimCell_1027 (_ BitVec 32)) (v_arrayElimCell_1026 (_ BitVec 32)) (v_arrayElimCell_1025 (_ BitVec 32)) (v_arrayElimCell_1020 (_ BitVec 32)) (v_arrayElimCell_1030 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1023)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1029)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1030)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1022)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1026)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1024)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1020)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1021)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1019)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1028)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1027)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1025)))))))) is different from true [2023-12-25 06:45:57,410 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 58 treesize of output 50 [2023-12-25 06:45:57,895 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 54 treesize of output 46 [2023-12-25 06:46:02,290 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 235 trivial. 194 not checked. [2023-12-25 06:46:02,290 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:46:10,930 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 100 treesize of output 96 [2023-12-25 06:46:10,943 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 96 treesize of output 92 [2023-12-25 06:46:10,956 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 92 treesize of output 88 [2023-12-25 06:46:10,968 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 88 treesize of output 84 [2023-12-25 06:46:10,981 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 84 treesize of output 80 [2023-12-25 06:46:10,994 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 80 treesize of output 76 [2023-12-25 06:46:11,006 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 72 [2023-12-25 06:46:11,017 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 72 treesize of output 68 [2023-12-25 06:46:11,028 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 68 treesize of output 64 [2023-12-25 06:46:11,052 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 64 treesize of output 60 [2023-12-25 06:46:11,063 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 60 treesize of output 56 [2023-12-25 06:46:11,074 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 56 treesize of output 52 [2023-12-25 06:46:11,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 52 treesize of output 48 [2023-12-25 06:46:11,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:46:11,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007305277] [2023-12-25 06:46:11,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007305277] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:46:11,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1543745589] [2023-12-25 06:46:11,723 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-25 06:46:11,723 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:46:11,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:46:11,724 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:46:11,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (67)] Waiting until timeout for monitored process [2023-12-25 06:46:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:46:13,334 INFO L262 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 110 conjunts are in the unsatisfiable core [2023-12-25 06:46:13,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:46:13,543 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 23 treesize of output 19 [2023-12-25 06:46:13,684 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 23 treesize of output 19 [2023-12-25 06:46:13,820 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 23 treesize of output 19 [2023-12-25 06:46:13,954 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 23 treesize of output 19 [2023-12-25 06:46:14,086 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 23 treesize of output 19 [2023-12-25 06:46:14,219 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 23 treesize of output 19 [2023-12-25 06:46:14,349 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 23 treesize of output 19 [2023-12-25 06:46:14,481 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 23 treesize of output 19 [2023-12-25 06:46:14,612 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 23 treesize of output 19 [2023-12-25 06:46:14,738 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 23 treesize of output 19 [2023-12-25 06:46:14,865 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 23 treesize of output 19 [2023-12-25 06:46:14,996 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 23 treesize of output 19 [2023-12-25 06:46:15,141 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 23 treesize of output 19 [2023-12-25 06:46:15,167 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1058 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1058)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) is different from true [2023-12-25 06:46:15,259 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1058 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1058)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) is different from true [2023-12-25 06:46:15,302 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1059 (_ BitVec 32)) (v_arrayElimCell_1058 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1058)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1059)))))))) is different from true [2023-12-25 06:46:15,347 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1060 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1059 (_ BitVec 32)) (v_arrayElimCell_1058 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1058)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1060)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1059)))))))) is different from true [2023-12-25 06:46:15,396 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1060 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1061 (_ BitVec 32)) (v_arrayElimCell_1059 (_ BitVec 32)) (v_arrayElimCell_1058 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1058)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1060)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1059)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1061)))))))) is different from true [2023-12-25 06:46:15,445 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1060 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1062 (_ BitVec 32)) (v_arrayElimCell_1061 (_ BitVec 32)) (v_arrayElimCell_1059 (_ BitVec 32)) (v_arrayElimCell_1058 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1062)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1058)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1060)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1059)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1061)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:46:15,499 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1060 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1063 (_ BitVec 32)) (v_arrayElimCell_1062 (_ BitVec 32)) (v_arrayElimCell_1061 (_ BitVec 32)) (v_arrayElimCell_1059 (_ BitVec 32)) (v_arrayElimCell_1058 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1062)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1058)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1060)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1063)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1059)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1061)))))))) is different from true [2023-12-25 06:46:15,555 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1060 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1064 (_ BitVec 32)) (v_arrayElimCell_1063 (_ BitVec 32)) (v_arrayElimCell_1062 (_ BitVec 32)) (v_arrayElimCell_1061 (_ BitVec 32)) (v_arrayElimCell_1059 (_ BitVec 32)) (v_arrayElimCell_1058 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1062)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1058)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1060)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1063)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1064)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1059)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1061)))))))) is different from true [2023-12-25 06:46:15,616 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1060 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1064 (_ BitVec 32)) (v_arrayElimCell_1063 (_ BitVec 32)) (v_arrayElimCell_1062 (_ BitVec 32)) (v_arrayElimCell_1061 (_ BitVec 32)) (v_arrayElimCell_1065 (_ BitVec 32)) (v_arrayElimCell_1059 (_ BitVec 32)) (v_arrayElimCell_1058 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1062)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1058)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1060)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1065)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1063)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1064)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1059)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1061)))))))) is different from true [2023-12-25 06:46:15,699 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1060 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1064 (_ BitVec 32)) (v_arrayElimCell_1063 (_ BitVec 32)) (v_arrayElimCell_1062 (_ BitVec 32)) (v_arrayElimCell_1061 (_ BitVec 32)) (v_arrayElimCell_1066 (_ BitVec 32)) (v_arrayElimCell_1065 (_ BitVec 32)) (v_arrayElimCell_1059 (_ BitVec 32)) (v_arrayElimCell_1058 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1062)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1058)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1060)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1065)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1063)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1066)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1064)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1059)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1061)))))))) is different from true [2023-12-25 06:46:15,765 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1060 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1064 (_ BitVec 32)) (v_arrayElimCell_1063 (_ BitVec 32)) (v_arrayElimCell_1062 (_ BitVec 32)) (v_arrayElimCell_1061 (_ BitVec 32)) (v_arrayElimCell_1067 (_ BitVec 32)) (v_arrayElimCell_1066 (_ BitVec 32)) (v_arrayElimCell_1065 (_ BitVec 32)) (v_arrayElimCell_1059 (_ BitVec 32)) (v_arrayElimCell_1058 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1062)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1058)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1060)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1065)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1067)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1063)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1066)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1064)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1059)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1061)))))))) is different from true [2023-12-25 06:46:15,836 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1068 (_ BitVec 32)) (v_arrayElimCell_1067 (_ BitVec 32)) (v_arrayElimCell_1066 (_ BitVec 32)) (v_arrayElimCell_1065 (_ BitVec 32)) (v_arrayElimCell_1059 (_ BitVec 32)) (v_arrayElimCell_1058 (_ BitVec 32)) (v_arrayElimCell_1060 (_ BitVec 32)) (v_arrayElimCell_1064 (_ BitVec 32)) (v_arrayElimCell_1063 (_ BitVec 32)) (v_arrayElimCell_1062 (_ BitVec 32)) (v_arrayElimCell_1061 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1062)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1058)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1060)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1065)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1067)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1063)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1068)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1066)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1064)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1059)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1061)))))))) is different from true [2023-12-25 06:46:15,914 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1068 (_ BitVec 32)) (v_arrayElimCell_1067 (_ BitVec 32)) (v_arrayElimCell_1066 (_ BitVec 32)) (v_arrayElimCell_1065 (_ BitVec 32)) (v_arrayElimCell_1059 (_ BitVec 32)) (v_arrayElimCell_1069 (_ BitVec 32)) (v_arrayElimCell_1058 (_ BitVec 32)) (v_arrayElimCell_1060 (_ BitVec 32)) (v_arrayElimCell_1064 (_ BitVec 32)) (v_arrayElimCell_1063 (_ BitVec 32)) (v_arrayElimCell_1062 (_ BitVec 32)) (v_arrayElimCell_1061 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1062)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1069)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1058)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1060)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1065)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1067)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1063)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1068)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1066)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1064)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1059)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1061)))))))) is different from true [2023-12-25 06:46:15,967 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 58 treesize of output 50 [2023-12-25 06:46:18,330 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 54 treesize of output 46 [2023-12-25 06:46:22,839 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 235 trivial. 194 not checked. [2023-12-25 06:46:22,839 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:46:29,525 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 100 treesize of output 96 [2023-12-25 06:46:29,536 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 96 treesize of output 92 [2023-12-25 06:46:29,548 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 92 treesize of output 88 [2023-12-25 06:46:29,559 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 88 treesize of output 84 [2023-12-25 06:46:29,570 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 84 treesize of output 80 [2023-12-25 06:46:29,582 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 80 treesize of output 76 [2023-12-25 06:46:29,594 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 72 [2023-12-25 06:46:29,604 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 72 treesize of output 68 [2023-12-25 06:46:29,615 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 68 treesize of output 64 [2023-12-25 06:46:29,626 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 64 treesize of output 60 [2023-12-25 06:46:29,636 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 60 treesize of output 56 [2023-12-25 06:46:29,647 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 56 treesize of output 52 [2023-12-25 06:46:29,657 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 52 treesize of output 48 [2023-12-25 06:46:30,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1543745589] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:46:30,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:46:30,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 36 [2023-12-25 06:46:30,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469625383] [2023-12-25 06:46:30,158 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:46:30,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-25 06:46:30,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:46:30,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-25 06:46:30,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=141, Unknown=27, NotChecked=1222, Total=1482 [2023-12-25 06:46:30,159 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 36 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 36 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 27 states have return successors, (28), 28 states have call predecessors, (28), 5 states have call successors, (28) [2023-12-25 06:46:31,501 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_1019 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1019))))))) (exists ((v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1058 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1058)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) .cse1)))))))) is different from true [2023-12-25 06:46:31,515 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_1019 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1020 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1020)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1019))))))) (exists ((v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1059 (_ BitVec 32)) (v_arrayElimCell_1058 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1058)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1059)))))))))) is different from true [2023-12-25 06:46:31,531 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_1019 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1020 (_ BitVec 32)) (v_arrayElimCell_1021 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1020)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1021)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1019))))))) (exists ((v_arrayElimCell_1060 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1059 (_ BitVec 32)) (v_arrayElimCell_1058 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1058)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1060)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1059)))))))))) is different from true [2023-12-25 06:46:31,548 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_1060 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1061 (_ BitVec 32)) (v_arrayElimCell_1059 (_ BitVec 32)) (v_arrayElimCell_1058 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1058)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1060)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1059)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1061))))))) (exists ((v_arrayElimCell_1019 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1020 (_ BitVec 32)) (v_arrayElimCell_1022 (_ BitVec 32)) (v_arrayElimCell_1021 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1022)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1020)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1021)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1019)))))))))) is different from true [2023-12-25 06:46:31,565 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_1060 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1062 (_ BitVec 32)) (v_arrayElimCell_1061 (_ BitVec 32)) (v_arrayElimCell_1059 (_ BitVec 32)) (v_arrayElimCell_1058 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1062)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1058)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1060)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1059)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1061))))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_1019 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1020 (_ BitVec 32)) (v_arrayElimCell_1023 (_ BitVec 32)) (v_arrayElimCell_1022 (_ BitVec 32)) (v_arrayElimCell_1021 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1023)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1022)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1020)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1021)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1019)))))))))) is different from true [2023-12-25 06:46:31,585 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_1060 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1063 (_ BitVec 32)) (v_arrayElimCell_1062 (_ BitVec 32)) (v_arrayElimCell_1061 (_ BitVec 32)) (v_arrayElimCell_1059 (_ BitVec 32)) (v_arrayElimCell_1058 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1062)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1058)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1060)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1063)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1059)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1061))))))) (exists ((v_arrayElimCell_1019 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1020 (_ BitVec 32)) (v_arrayElimCell_1024 (_ BitVec 32)) (v_arrayElimCell_1023 (_ BitVec 32)) (v_arrayElimCell_1022 (_ BitVec 32)) (v_arrayElimCell_1021 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1023)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1022)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1024)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1020)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1021)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1019)))))))))) is different from true [2023-12-25 06:46:31,606 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_1019 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1020 (_ BitVec 32)) (v_arrayElimCell_1024 (_ BitVec 32)) (v_arrayElimCell_1023 (_ BitVec 32)) (v_arrayElimCell_1022 (_ BitVec 32)) (v_arrayElimCell_1021 (_ BitVec 32)) (v_arrayElimCell_1025 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1023)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1022)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1024)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1020)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1021)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1019)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1025))))))) (exists ((v_arrayElimCell_1060 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1064 (_ BitVec 32)) (v_arrayElimCell_1063 (_ BitVec 32)) (v_arrayElimCell_1062 (_ BitVec 32)) (v_arrayElimCell_1061 (_ BitVec 32)) (v_arrayElimCell_1059 (_ BitVec 32)) (v_arrayElimCell_1058 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1062)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1058)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1060)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1063)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1064)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1059)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1061)))))))))) is different from true [2023-12-25 06:46:31,638 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_1019 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1020 (_ BitVec 32)) (v_arrayElimCell_1024 (_ BitVec 32)) (v_arrayElimCell_1023 (_ BitVec 32)) (v_arrayElimCell_1022 (_ BitVec 32)) (v_arrayElimCell_1021 (_ BitVec 32)) (v_arrayElimCell_1026 (_ BitVec 32)) (v_arrayElimCell_1025 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1023)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1022)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1026)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1024)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1020)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1021)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1019)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1025))))) |c_#memory_int#3|)) (exists ((v_arrayElimCell_1060 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1064 (_ BitVec 32)) (v_arrayElimCell_1063 (_ BitVec 32)) (v_arrayElimCell_1062 (_ BitVec 32)) (v_arrayElimCell_1061 (_ BitVec 32)) (v_arrayElimCell_1065 (_ BitVec 32)) (v_arrayElimCell_1059 (_ BitVec 32)) (v_arrayElimCell_1058 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1062)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1058)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1060)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1065)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1063)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1064)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1059)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1061)))))))))) is different from true [2023-12-25 06:46:31,664 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_1019 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1020 (_ BitVec 32)) (v_arrayElimCell_1024 (_ BitVec 32)) (v_arrayElimCell_1023 (_ BitVec 32)) (v_arrayElimCell_1022 (_ BitVec 32)) (v_arrayElimCell_1021 (_ BitVec 32)) (v_arrayElimCell_1027 (_ BitVec 32)) (v_arrayElimCell_1026 (_ BitVec 32)) (v_arrayElimCell_1025 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1023)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1022)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1026)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1024)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1020)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1021)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1019)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1027)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1025))))))) (exists ((v_arrayElimCell_1060 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1064 (_ BitVec 32)) (v_arrayElimCell_1063 (_ BitVec 32)) (v_arrayElimCell_1062 (_ BitVec 32)) (v_arrayElimCell_1061 (_ BitVec 32)) (v_arrayElimCell_1066 (_ BitVec 32)) (v_arrayElimCell_1065 (_ BitVec 32)) (v_arrayElimCell_1059 (_ BitVec 32)) (v_arrayElimCell_1058 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1062)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1058)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1060)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1065)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1063)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1066)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1064)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1059)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1061)))))))))) is different from true [2023-12-25 06:46:31,699 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_1019 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1020 (_ BitVec 32)) (v_arrayElimCell_1024 (_ BitVec 32)) (v_arrayElimCell_1023 (_ BitVec 32)) (v_arrayElimCell_1022 (_ BitVec 32)) (v_arrayElimCell_1021 (_ BitVec 32)) (v_arrayElimCell_1028 (_ BitVec 32)) (v_arrayElimCell_1027 (_ BitVec 32)) (v_arrayElimCell_1026 (_ BitVec 32)) (v_arrayElimCell_1025 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1023)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1022)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1026)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1024)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1020)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1021)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1019)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1028)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1027)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1025))))))) (exists ((v_arrayElimCell_1060 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1064 (_ BitVec 32)) (v_arrayElimCell_1063 (_ BitVec 32)) (v_arrayElimCell_1062 (_ BitVec 32)) (v_arrayElimCell_1061 (_ BitVec 32)) (v_arrayElimCell_1067 (_ BitVec 32)) (v_arrayElimCell_1066 (_ BitVec 32)) (v_arrayElimCell_1065 (_ BitVec 32)) (v_arrayElimCell_1059 (_ BitVec 32)) (v_arrayElimCell_1058 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1062)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1058)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1060)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1065)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1067)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1063)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1066)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1064)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1059)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1061)))))))))) is different from true [2023-12-25 06:46:31,740 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_1019 (_ BitVec 32)) (v_arrayElimCell_1029 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1024 (_ BitVec 32)) (v_arrayElimCell_1023 (_ BitVec 32)) (v_arrayElimCell_1022 (_ BitVec 32)) (v_arrayElimCell_1021 (_ BitVec 32)) (v_arrayElimCell_1028 (_ BitVec 32)) (v_arrayElimCell_1027 (_ BitVec 32)) (v_arrayElimCell_1026 (_ BitVec 32)) (v_arrayElimCell_1025 (_ BitVec 32)) (v_arrayElimCell_1020 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1023)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1029)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1022)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1026)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1024)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1020)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1021)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1019)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1028)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1027)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1025))))))) (exists ((v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1068 (_ BitVec 32)) (v_arrayElimCell_1067 (_ BitVec 32)) (v_arrayElimCell_1066 (_ BitVec 32)) (v_arrayElimCell_1065 (_ BitVec 32)) (v_arrayElimCell_1059 (_ BitVec 32)) (v_arrayElimCell_1058 (_ BitVec 32)) (v_arrayElimCell_1060 (_ BitVec 32)) (v_arrayElimCell_1064 (_ BitVec 32)) (v_arrayElimCell_1063 (_ BitVec 32)) (v_arrayElimCell_1062 (_ BitVec 32)) (v_arrayElimCell_1061 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1062)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1058)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1060)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1065)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1067)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1063)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1068)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1066)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1064)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1059)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1061)))))))))) is different from true [2023-12-25 06:46:31,785 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_1019 (_ BitVec 32)) (v_arrayElimCell_1029 (_ BitVec 32)) (v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1024 (_ BitVec 32)) (v_arrayElimCell_1023 (_ BitVec 32)) (v_arrayElimCell_1022 (_ BitVec 32)) (v_arrayElimCell_1021 (_ BitVec 32)) (v_arrayElimCell_1028 (_ BitVec 32)) (v_arrayElimCell_1027 (_ BitVec 32)) (v_arrayElimCell_1026 (_ BitVec 32)) (v_arrayElimCell_1025 (_ BitVec 32)) (v_arrayElimCell_1020 (_ BitVec 32)) (v_arrayElimCell_1030 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1023)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1029)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1030)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1022)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1026)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1024)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1020)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1021)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1019)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1028)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1027)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1025))))))) (exists ((v_arrayElimCell_1007 (_ BitVec 32)) (v_arrayElimCell_1068 (_ BitVec 32)) (v_arrayElimCell_1067 (_ BitVec 32)) (v_arrayElimCell_1066 (_ BitVec 32)) (v_arrayElimCell_1065 (_ BitVec 32)) (v_arrayElimCell_1059 (_ BitVec 32)) (v_arrayElimCell_1069 (_ BitVec 32)) (v_arrayElimCell_1058 (_ BitVec 32)) (v_arrayElimCell_1060 (_ BitVec 32)) (v_arrayElimCell_1064 (_ BitVec 32)) (v_arrayElimCell_1063 (_ BitVec 32)) (v_arrayElimCell_1062 (_ BitVec 32)) (v_arrayElimCell_1061 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1062)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1069)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1058)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1007)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1060)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1065)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1067)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1063)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1068)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1066)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1064)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1059)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1061)))))))))) is different from true [2023-12-25 06:46:32,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:46:32,821 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2023-12-25 06:46:32,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-25 06:46:32,822 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 36 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 27 states have return successors, (28), 28 states have call predecessors, (28), 5 states have call successors, (28) Word has length 76 [2023-12-25 06:46:32,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:46:32,823 INFO L225 Difference]: With dead ends: 50 [2023-12-25 06:46:32,823 INFO L226 Difference]: Without dead ends: 45 [2023-12-25 06:46:32,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 98 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 38 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=124, Invalid=171, Unknown=39, NotChecked=2318, Total=2652 [2023-12-25 06:46:32,824 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1379 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:46:32,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 71 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 1379 Unchecked, 2.1s Time] [2023-12-25 06:46:32,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-25 06:46:32,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-12-25 06:46:32,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 15 states have return successors, (16), 15 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-25 06:46:32,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2023-12-25 06:46:32,829 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 76 [2023-12-25 06:46:32,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:46:32,829 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2023-12-25 06:46:32,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 36 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 27 states have return successors, (28), 28 states have call predecessors, (28), 5 states have call successors, (28) [2023-12-25 06:46:32,829 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2023-12-25 06:46:32,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-25 06:46:32,829 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:46:32,830 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:46:32,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (66)] Forceful destruction successful, exit code 0 [2023-12-25 06:46:33,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (67)] Forceful destruction successful, exit code 0 [2023-12-25 06:46:33,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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,67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 06:46:33,230 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:46:33,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:46:33,231 INFO L85 PathProgramCache]: Analyzing trace with hash -693828442, now seen corresponding path program 14 times [2023-12-25 06:46:33,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:46:33,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812773206] [2023-12-25 06:46:33,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:46:33,231 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 [2023-12-25 06:46:33,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:46:33,232 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:46:33,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (68)] Waiting until timeout for monitored process [2023-12-25 06:46:34,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:46:34,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:46:34,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 176 conjunts are in the unsatisfiable core [2023-12-25 06:46:34,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:46:34,627 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 23 treesize of output 19 [2023-12-25 06:46:34,871 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 23 treesize of output 19 [2023-12-25 06:46:35,074 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 23 treesize of output 19 [2023-12-25 06:46:35,259 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 23 treesize of output 19 [2023-12-25 06:46:35,443 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 23 treesize of output 19 [2023-12-25 06:46:35,627 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 23 treesize of output 19 [2023-12-25 06:46:35,812 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 23 treesize of output 19 [2023-12-25 06:46:36,015 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 23 treesize of output 19 [2023-12-25 06:46:36,204 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 23 treesize of output 19 [2023-12-25 06:46:36,392 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 23 treesize of output 19 [2023-12-25 06:46:36,579 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 23 treesize of output 19 [2023-12-25 06:46:36,772 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 23 treesize of output 19 [2023-12-25 06:46:36,972 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 23 treesize of output 19 [2023-12-25 06:46:37,427 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1085 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))))) is different from true [2023-12-25 06:46:37,477 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1098 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1098)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))))) is different from true [2023-12-25 06:46:37,526 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1099 (_ BitVec 32)) (v_arrayElimCell_1098 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1098)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1099)))))))) is different from true [2023-12-25 06:46:37,577 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1100 (_ BitVec 32)) (v_arrayElimCell_1099 (_ BitVec 32)) (v_arrayElimCell_1098 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1098)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1100)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1099)))))))) is different from true [2023-12-25 06:46:37,627 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1101 (_ BitVec 32)) (v_arrayElimCell_1100 (_ BitVec 32)) (v_arrayElimCell_1099 (_ BitVec 32)) (v_arrayElimCell_1098 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1101)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1098)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1100)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1099)))))))) is different from true [2023-12-25 06:46:37,679 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1101 (_ BitVec 32)) (v_arrayElimCell_1100 (_ BitVec 32)) (v_arrayElimCell_1099 (_ BitVec 32)) (v_arrayElimCell_1098 (_ BitVec 32)) (v_arrayElimCell_1102 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1101)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1102)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1098)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1100)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1099)))))))) is different from true [2023-12-25 06:46:37,734 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1101 (_ BitVec 32)) (v_arrayElimCell_1100 (_ BitVec 32)) (v_arrayElimCell_1099 (_ BitVec 32)) (v_arrayElimCell_1098 (_ BitVec 32)) (v_arrayElimCell_1103 (_ BitVec 32)) (v_arrayElimCell_1102 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1101)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1102)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1098)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1100)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1099)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1103)))))))) is different from true [2023-12-25 06:46:37,808 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1101 (_ BitVec 32)) (v_arrayElimCell_1100 (_ BitVec 32)) (v_arrayElimCell_1099 (_ BitVec 32)) (v_arrayElimCell_1098 (_ BitVec 32)) (v_arrayElimCell_1104 (_ BitVec 32)) (v_arrayElimCell_1103 (_ BitVec 32)) (v_arrayElimCell_1102 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1101)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1102)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1098)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1100)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1104)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1099)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1103)))))))) is different from true [2023-12-25 06:46:37,877 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1101 (_ BitVec 32)) (v_arrayElimCell_1100 (_ BitVec 32)) (v_arrayElimCell_1099 (_ BitVec 32)) (v_arrayElimCell_1098 (_ BitVec 32)) (v_arrayElimCell_1105 (_ BitVec 32)) (v_arrayElimCell_1104 (_ BitVec 32)) (v_arrayElimCell_1103 (_ BitVec 32)) (v_arrayElimCell_1102 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1101)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1102)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1105)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1098)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1100)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1104)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1099)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1103)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:46:37,946 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1106 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1101 (_ BitVec 32)) (v_arrayElimCell_1100 (_ BitVec 32)) (v_arrayElimCell_1099 (_ BitVec 32)) (v_arrayElimCell_1098 (_ BitVec 32)) (v_arrayElimCell_1105 (_ BitVec 32)) (v_arrayElimCell_1104 (_ BitVec 32)) (v_arrayElimCell_1103 (_ BitVec 32)) (v_arrayElimCell_1102 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1101)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1102)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1105)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1098)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1100)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1104)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1099)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1106)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1103)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:46:38,019 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1107 (_ BitVec 32)) (v_arrayElimCell_1106 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1101 (_ BitVec 32)) (v_arrayElimCell_1100 (_ BitVec 32)) (v_arrayElimCell_1099 (_ BitVec 32)) (v_arrayElimCell_1098 (_ BitVec 32)) (v_arrayElimCell_1105 (_ BitVec 32)) (v_arrayElimCell_1104 (_ BitVec 32)) (v_arrayElimCell_1103 (_ BitVec 32)) (v_arrayElimCell_1102 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1101)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1102)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1105)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1098)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1100)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1104)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1099)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1106)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1103)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1107)))))))) is different from true [2023-12-25 06:46:38,095 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1108 (_ BitVec 32)) (v_arrayElimCell_1107 (_ BitVec 32)) (v_arrayElimCell_1106 (_ BitVec 32)) (v_arrayElimCell_1101 (_ BitVec 32)) (v_arrayElimCell_1100 (_ BitVec 32)) (v_arrayElimCell_1099 (_ BitVec 32)) (v_arrayElimCell_1098 (_ BitVec 32)) (v_arrayElimCell_1105 (_ BitVec 32)) (v_arrayElimCell_1104 (_ BitVec 32)) (v_arrayElimCell_1103 (_ BitVec 32)) (v_arrayElimCell_1102 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1101)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1102)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1105)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1098)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1100)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1104)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1108)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1099)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1106)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1103)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1107)))))))) is different from true [2023-12-25 06:46:38,174 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1109 (_ BitVec 32)) (v_arrayElimCell_1108 (_ BitVec 32)) (v_arrayElimCell_1107 (_ BitVec 32)) (v_arrayElimCell_1106 (_ BitVec 32)) (v_arrayElimCell_1101 (_ BitVec 32)) (v_arrayElimCell_1100 (_ BitVec 32)) (v_arrayElimCell_1099 (_ BitVec 32)) (v_arrayElimCell_1098 (_ BitVec 32)) (v_arrayElimCell_1105 (_ BitVec 32)) (v_arrayElimCell_1104 (_ BitVec 32)) (v_arrayElimCell_1103 (_ BitVec 32)) (v_arrayElimCell_1102 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1101)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1102)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1105)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1098)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1100)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1104)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1108)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1099)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1106)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1103)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1107)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1109)))))))) is different from true [2023-12-25 06:46:38,221 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 65 treesize of output 57 [2023-12-25 06:46:39,028 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 62 treesize of output 54 [2023-12-25 06:46:39,040 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 57 treesize of output 49 [2023-12-25 06:46:43,651 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 14 proven. 29 refuted. 0 times theorem prover too weak. 260 trivial. 208 not checked. [2023-12-25 06:46:43,651 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:46:55,742 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 113 treesize of output 109 [2023-12-25 06:46:55,752 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 109 treesize of output 105 [2023-12-25 06:46:55,763 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 105 treesize of output 101 [2023-12-25 06:46:55,774 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 101 treesize of output 97 [2023-12-25 06:46:55,784 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 97 treesize of output 93 [2023-12-25 06:46:55,795 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 93 treesize of output 89 [2023-12-25 06:46:55,806 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 89 treesize of output 81 [2023-12-25 06:46:55,817 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 81 treesize of output 77 [2023-12-25 06:46:55,829 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 77 treesize of output 73 [2023-12-25 06:46:55,840 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 73 treesize of output 69 [2023-12-25 06:46:55,851 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 69 treesize of output 65 [2023-12-25 06:46:55,862 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 65 treesize of output 61 [2023-12-25 06:46:55,873 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 61 treesize of output 57 [2023-12-25 06:46:55,885 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 57 treesize of output 53 [2023-12-25 06:46:56,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:46:56,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812773206] [2023-12-25 06:46:56,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812773206] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:46:56,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [23096474] [2023-12-25 06:46:56,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:46:56,328 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:46:56,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:46:56,329 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:46:56,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (69)] Waiting until timeout for monitored process [2023-12-25 06:46:57,958 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-25 06:46:57,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145744436] [2023-12-25 06:46:57,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:46:57,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 06:46:57,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:46:57,961 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-25 06:46:57,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2023-12-25 06:46:57,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (69)] Forceful destruction successful, exit code 1 [2023-12-25 06:46:58,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:46:58,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:46:58,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 179 conjunts are in the unsatisfiable core [2023-12-25 06:46:58,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:46:59,104 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 23 treesize of output 19 [2023-12-25 06:46:59,297 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 23 treesize of output 19 [2023-12-25 06:46:59,492 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 23 treesize of output 19 [2023-12-25 06:46:59,683 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 23 treesize of output 19 [2023-12-25 06:46:59,871 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 23 treesize of output 19 [2023-12-25 06:47:00,061 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 23 treesize of output 19 [2023-12-25 06:47:00,247 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 23 treesize of output 19 [2023-12-25 06:47:00,438 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 23 treesize of output 19 [2023-12-25 06:47:00,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 23 treesize of output 19 [2023-12-25 06:47:00,822 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 23 treesize of output 19 [2023-12-25 06:47:01,010 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 23 treesize of output 19 [2023-12-25 06:47:01,195 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 23 treesize of output 19 [2023-12-25 06:47:01,382 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 23 treesize of output 19 [2023-12-25 06:47:01,554 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 12 treesize of output 8 [2023-12-25 06:47:02,016 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((v_arrayElimCell_1085 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) .cse1)))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741|) .cse1)))) is different from true [2023-12-25 06:47:02,085 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741|) .cse0)) (exists ((v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1140 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1140)) ((_ zero_extend 24) ((_ extract 7 0) .cse0)))))))))) is different from true [2023-12-25 06:47:02,197 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((v_arrayElimCell_1141 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1140 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1140)) ((_ zero_extend 24) ((_ extract 7 0) .cse1)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1141)))))) |c_#memory_int#3|)) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741|) .cse1)))) is different from true [2023-12-25 06:47:02,274 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((v_arrayElimCell_1141 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1140 (_ BitVec 32)) (v_arrayElimCell_1142 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1140)) ((_ zero_extend 24) ((_ extract 7 0) .cse1)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1142)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1141)))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741|) .cse1)))) is different from true [2023-12-25 06:47:02,350 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741|) .cse0)) (exists ((v_arrayElimCell_1141 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1140 (_ BitVec 32)) (v_arrayElimCell_1143 (_ BitVec 32)) (v_arrayElimCell_1142 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1140)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1143)) ((_ zero_extend 24) ((_ extract 7 0) .cse0)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1142)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1141)))))))))) is different from true [2023-12-25 06:47:02,454 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((v_arrayElimCell_1141 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1140 (_ BitVec 32)) (v_arrayElimCell_1144 (_ BitVec 32)) (v_arrayElimCell_1143 (_ BitVec 32)) (v_arrayElimCell_1142 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1140)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1143)) ((_ zero_extend 24) ((_ extract 7 0) .cse1)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1144)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1142)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1141)))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741|) .cse1)))) is different from true [2023-12-25 06:47:02,539 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741|) .cse0)) (exists ((v_arrayElimCell_1141 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1140 (_ BitVec 32)) (v_arrayElimCell_1145 (_ BitVec 32)) (v_arrayElimCell_1144 (_ BitVec 32)) (v_arrayElimCell_1143 (_ BitVec 32)) (v_arrayElimCell_1142 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1140)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1143)) ((_ zero_extend 24) ((_ extract 7 0) .cse0)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1144)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1142)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1145)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1141)))))))))) is different from true [2023-12-25 06:47:02,640 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741|) .cse0)) (exists ((v_arrayElimCell_1141 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1140 (_ BitVec 32)) (v_arrayElimCell_1145 (_ BitVec 32)) (v_arrayElimCell_1144 (_ BitVec 32)) (v_arrayElimCell_1143 (_ BitVec 32)) (v_arrayElimCell_1142 (_ BitVec 32)) (v_arrayElimCell_1146 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1140)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1143)) ((_ zero_extend 24) ((_ extract 7 0) .cse0)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1144)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1142)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1145)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1146)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1141)))))))))) is different from true [2023-12-25 06:47:02,730 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((v_arrayElimCell_1141 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1140 (_ BitVec 32)) (v_arrayElimCell_1145 (_ BitVec 32)) (v_arrayElimCell_1144 (_ BitVec 32)) (v_arrayElimCell_1143 (_ BitVec 32)) (v_arrayElimCell_1142 (_ BitVec 32)) (v_arrayElimCell_1147 (_ BitVec 32)) (v_arrayElimCell_1146 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1140)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1143)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1147)) ((_ zero_extend 24) ((_ extract 7 0) .cse1)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1144)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1142)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1145)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1146)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1141)))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741|) .cse1)))) is different from true [2023-12-25 06:47:02,819 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741|) .cse0)) (exists ((v_arrayElimCell_1141 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1140 (_ BitVec 32)) (v_arrayElimCell_1145 (_ BitVec 32)) (v_arrayElimCell_1144 (_ BitVec 32)) (v_arrayElimCell_1143 (_ BitVec 32)) (v_arrayElimCell_1142 (_ BitVec 32)) (v_arrayElimCell_1148 (_ BitVec 32)) (v_arrayElimCell_1147 (_ BitVec 32)) (v_arrayElimCell_1146 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1148)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1140)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1143)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1147)) ((_ zero_extend 24) ((_ extract 7 0) .cse0)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1144)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1142)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1145)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1146)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1141)))))))))) is different from true [2023-12-25 06:47:02,917 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((v_arrayElimCell_1141 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1140 (_ BitVec 32)) (v_arrayElimCell_1145 (_ BitVec 32)) (v_arrayElimCell_1144 (_ BitVec 32)) (v_arrayElimCell_1143 (_ BitVec 32)) (v_arrayElimCell_1142 (_ BitVec 32)) (v_arrayElimCell_1149 (_ BitVec 32)) (v_arrayElimCell_1148 (_ BitVec 32)) (v_arrayElimCell_1147 (_ BitVec 32)) (v_arrayElimCell_1146 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1148)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1140)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1143)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1147)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1149)) ((_ zero_extend 24) ((_ extract 7 0) .cse1)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1144)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1142)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1145)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1146)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1141)))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741|) .cse1)))) is different from true [2023-12-25 06:47:03,020 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((v_arrayElimCell_1145 (_ BitVec 32)) (v_arrayElimCell_1144 (_ BitVec 32)) (v_arrayElimCell_1143 (_ BitVec 32)) (v_arrayElimCell_1142 (_ BitVec 32)) (v_arrayElimCell_1149 (_ BitVec 32)) (v_arrayElimCell_1148 (_ BitVec 32)) (v_arrayElimCell_1147 (_ BitVec 32)) (v_arrayElimCell_1146 (_ BitVec 32)) (v_arrayElimCell_1141 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1140 (_ BitVec 32)) (v_arrayElimCell_1150 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1148)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1140)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1143)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1147)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1149)) ((_ zero_extend 24) ((_ extract 7 0) .cse1)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1144)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1142)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1145)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1146)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1141)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1150)))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741|) .cse1)))) is different from true [2023-12-25 06:47:03,125 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((v_arrayElimCell_1145 (_ BitVec 32)) (v_arrayElimCell_1144 (_ BitVec 32)) (v_arrayElimCell_1143 (_ BitVec 32)) (v_arrayElimCell_1142 (_ BitVec 32)) (v_arrayElimCell_1149 (_ BitVec 32)) (v_arrayElimCell_1148 (_ BitVec 32)) (v_arrayElimCell_1147 (_ BitVec 32)) (v_arrayElimCell_1146 (_ BitVec 32)) (v_arrayElimCell_1141 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1140 (_ BitVec 32)) (v_arrayElimCell_1151 (_ BitVec 32)) (v_arrayElimCell_1150 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1148)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1140)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1143)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1147)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1149)) ((_ zero_extend 24) ((_ extract 7 0) .cse1)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1144)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1142)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1145)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1146)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1151)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1141)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1150)))))) |c_#memory_int#3|)) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741|) .cse1)))) is different from true [2023-12-25 06:47:03,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2023-12-25 06:47:07,782 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 70 treesize of output 58 [2023-12-25 06:47:07,795 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 58 treesize of output 50 [2023-12-25 06:47:20,937 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 14 proven. 29 refuted. 0 times theorem prover too weak. 260 trivial. 208 not checked. [2023-12-25 06:47:20,937 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:47:36,267 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 107 treesize of output 103 [2023-12-25 06:47:36,279 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 103 treesize of output 99 [2023-12-25 06:47:36,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 99 treesize of output 95 [2023-12-25 06:47:36,302 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 95 treesize of output 91 [2023-12-25 06:47:36,312 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 91 treesize of output 87 [2023-12-25 06:47:36,324 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 87 treesize of output 83 [2023-12-25 06:47:36,335 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 83 treesize of output 79 [2023-12-25 06:47:36,349 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 79 treesize of output 75 [2023-12-25 06:47:36,360 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 75 treesize of output 71 [2023-12-25 06:47:36,374 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 71 treesize of output 67 [2023-12-25 06:47:36,387 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 67 treesize of output 63 [2023-12-25 06:47:36,399 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 63 treesize of output 59 [2023-12-25 06:47:36,410 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 59 treesize of output 55 [2023-12-25 06:47:44,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145744436] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:47:44,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:47:44,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 39 [2023-12-25 06:47:44,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912840065] [2023-12-25 06:47:44,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:47:44,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-25 06:47:44,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:47:44,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-25 06:47:44,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=246, Unknown=32, NotChecked=1430, Total=1806 [2023-12-25 06:47:44,987 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 39 states, 37 states have (on average 1.135135135135135) internal successors, (42), 36 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 29 states have return successors, (30), 30 states have call predecessors, (30), 4 states have call successors, (30) [2023-12-25 06:47:48,989 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse3)))) (and (exists ((v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1098 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1098)) .cse2))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741|) .cse3)) (exists ((v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1140 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1140)) .cse2)))))))) is different from true [2023-12-25 06:47:49,010 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse3)))) (and (exists ((v_arrayElimCell_1141 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1140 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1140)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1141))))) |c_#memory_int#3|)) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741|) .cse3)) (exists ((v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1099 (_ BitVec 32)) (v_arrayElimCell_1098 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1098)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1099)))))))))) is different from true [2023-12-25 06:47:49,041 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse3)))) (and (exists ((v_arrayElimCell_1141 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1140 (_ BitVec 32)) (v_arrayElimCell_1142 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1140)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1142)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1141))))))) (exists ((v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1100 (_ BitVec 32)) (v_arrayElimCell_1099 (_ BitVec 32)) (v_arrayElimCell_1098 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1098)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1100)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1099))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741|) .cse3))))) is different from true [2023-12-25 06:47:49,082 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse2 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) .cse0)))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741|) .cse0)) (exists ((v_arrayElimCell_1141 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1140 (_ BitVec 32)) (v_arrayElimCell_1143 (_ BitVec 32)) (v_arrayElimCell_1142 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1140)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1143)) .cse3 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1142)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1141))))))) (exists ((v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1101 (_ BitVec 32)) (v_arrayElimCell_1100 (_ BitVec 32)) (v_arrayElimCell_1099 (_ BitVec 32)) (v_arrayElimCell_1098 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1101)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1098)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1100)) .cse3 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1099)))))))))) is different from true [2023-12-25 06:47:49,105 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse3)))) (and (exists ((v_arrayElimCell_1141 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1140 (_ BitVec 32)) (v_arrayElimCell_1144 (_ BitVec 32)) (v_arrayElimCell_1143 (_ BitVec 32)) (v_arrayElimCell_1142 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1140)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1143)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1144)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1142)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1141))))))) (exists ((v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1101 (_ BitVec 32)) (v_arrayElimCell_1100 (_ BitVec 32)) (v_arrayElimCell_1099 (_ BitVec 32)) (v_arrayElimCell_1098 (_ BitVec 32)) (v_arrayElimCell_1102 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1101)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1102)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1098)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1100)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1099))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741|) .cse3))))) is different from true [2023-12-25 06:47:49,137 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse3)))) (and (exists ((v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1101 (_ BitVec 32)) (v_arrayElimCell_1100 (_ BitVec 32)) (v_arrayElimCell_1099 (_ BitVec 32)) (v_arrayElimCell_1098 (_ BitVec 32)) (v_arrayElimCell_1103 (_ BitVec 32)) (v_arrayElimCell_1102 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1101)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1102)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1098)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1100)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1099)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1103))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741|) .cse3)) (exists ((v_arrayElimCell_1141 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1140 (_ BitVec 32)) (v_arrayElimCell_1145 (_ BitVec 32)) (v_arrayElimCell_1144 (_ BitVec 32)) (v_arrayElimCell_1143 (_ BitVec 32)) (v_arrayElimCell_1142 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1140)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1143)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1144)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1142)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1145)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1141)))))))))) is different from true [2023-12-25 06:47:49,170 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse1 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse2 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) .cse0)))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741|) .cse0)) (exists ((v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1101 (_ BitVec 32)) (v_arrayElimCell_1100 (_ BitVec 32)) (v_arrayElimCell_1099 (_ BitVec 32)) (v_arrayElimCell_1098 (_ BitVec 32)) (v_arrayElimCell_1104 (_ BitVec 32)) (v_arrayElimCell_1103 (_ BitVec 32)) (v_arrayElimCell_1102 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1101)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1102)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1098)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1100)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1104)) .cse3 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1099)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1103))))))) (exists ((v_arrayElimCell_1141 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1140 (_ BitVec 32)) (v_arrayElimCell_1145 (_ BitVec 32)) (v_arrayElimCell_1144 (_ BitVec 32)) (v_arrayElimCell_1143 (_ BitVec 32)) (v_arrayElimCell_1142 (_ BitVec 32)) (v_arrayElimCell_1146 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1140)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1143)) .cse3 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1144)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1142)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1145)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1146)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1141)))))))))) is different from true [2023-12-25 06:47:49,194 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse3)))) (and (exists ((v_arrayElimCell_1141 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1140 (_ BitVec 32)) (v_arrayElimCell_1145 (_ BitVec 32)) (v_arrayElimCell_1144 (_ BitVec 32)) (v_arrayElimCell_1143 (_ BitVec 32)) (v_arrayElimCell_1142 (_ BitVec 32)) (v_arrayElimCell_1147 (_ BitVec 32)) (v_arrayElimCell_1146 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1140)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1143)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1147)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1144)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1142)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1145)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1146)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1141))))))) (exists ((v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1101 (_ BitVec 32)) (v_arrayElimCell_1100 (_ BitVec 32)) (v_arrayElimCell_1099 (_ BitVec 32)) (v_arrayElimCell_1098 (_ BitVec 32)) (v_arrayElimCell_1105 (_ BitVec 32)) (v_arrayElimCell_1104 (_ BitVec 32)) (v_arrayElimCell_1103 (_ BitVec 32)) (v_arrayElimCell_1102 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1101)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1102)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1105)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1098)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1100)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1104)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1099)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1103))))) |c_#memory_int#3|)) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741|) .cse3))))) is different from true [2023-12-25 06:47:49,253 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse3)))) (and (exists ((v_arrayElimCell_1106 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1101 (_ BitVec 32)) (v_arrayElimCell_1100 (_ BitVec 32)) (v_arrayElimCell_1099 (_ BitVec 32)) (v_arrayElimCell_1098 (_ BitVec 32)) (v_arrayElimCell_1105 (_ BitVec 32)) (v_arrayElimCell_1104 (_ BitVec 32)) (v_arrayElimCell_1103 (_ BitVec 32)) (v_arrayElimCell_1102 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1101)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1102)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1105)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1098)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1100)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1104)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1099)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1106)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1103))))) |c_#memory_int#3|)) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741|) .cse3)) (exists ((v_arrayElimCell_1141 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1140 (_ BitVec 32)) (v_arrayElimCell_1145 (_ BitVec 32)) (v_arrayElimCell_1144 (_ BitVec 32)) (v_arrayElimCell_1143 (_ BitVec 32)) (v_arrayElimCell_1142 (_ BitVec 32)) (v_arrayElimCell_1148 (_ BitVec 32)) (v_arrayElimCell_1147 (_ BitVec 32)) (v_arrayElimCell_1146 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1148)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1140)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1143)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1147)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1144)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1142)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1145)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1146)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1141)))))))))) is different from true [2023-12-25 06:47:49,283 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse3)))) (and (exists ((v_arrayElimCell_1107 (_ BitVec 32)) (v_arrayElimCell_1106 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1101 (_ BitVec 32)) (v_arrayElimCell_1100 (_ BitVec 32)) (v_arrayElimCell_1099 (_ BitVec 32)) (v_arrayElimCell_1098 (_ BitVec 32)) (v_arrayElimCell_1105 (_ BitVec 32)) (v_arrayElimCell_1104 (_ BitVec 32)) (v_arrayElimCell_1103 (_ BitVec 32)) (v_arrayElimCell_1102 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1101)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1102)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1105)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1098)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1100)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1104)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1099)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1106)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1103)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1107))))))) (exists ((v_arrayElimCell_1141 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1140 (_ BitVec 32)) (v_arrayElimCell_1145 (_ BitVec 32)) (v_arrayElimCell_1144 (_ BitVec 32)) (v_arrayElimCell_1143 (_ BitVec 32)) (v_arrayElimCell_1142 (_ BitVec 32)) (v_arrayElimCell_1149 (_ BitVec 32)) (v_arrayElimCell_1148 (_ BitVec 32)) (v_arrayElimCell_1147 (_ BitVec 32)) (v_arrayElimCell_1146 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1148)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1140)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1143)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1147)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1149)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1144)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1142)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1145)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1146)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1141))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741|) .cse3))))) is different from true [2023-12-25 06:47:49,343 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse3)))) (and (exists ((v_arrayElimCell_1108 (_ BitVec 32)) (v_arrayElimCell_1107 (_ BitVec 32)) (v_arrayElimCell_1106 (_ BitVec 32)) (v_arrayElimCell_1101 (_ BitVec 32)) (v_arrayElimCell_1100 (_ BitVec 32)) (v_arrayElimCell_1099 (_ BitVec 32)) (v_arrayElimCell_1098 (_ BitVec 32)) (v_arrayElimCell_1105 (_ BitVec 32)) (v_arrayElimCell_1104 (_ BitVec 32)) (v_arrayElimCell_1103 (_ BitVec 32)) (v_arrayElimCell_1102 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1101)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1102)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1105)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1098)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1100)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1104)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1108)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1099)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1106)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1103)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1107))))))) (exists ((v_arrayElimCell_1145 (_ BitVec 32)) (v_arrayElimCell_1144 (_ BitVec 32)) (v_arrayElimCell_1143 (_ BitVec 32)) (v_arrayElimCell_1142 (_ BitVec 32)) (v_arrayElimCell_1149 (_ BitVec 32)) (v_arrayElimCell_1148 (_ BitVec 32)) (v_arrayElimCell_1147 (_ BitVec 32)) (v_arrayElimCell_1146 (_ BitVec 32)) (v_arrayElimCell_1141 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1140 (_ BitVec 32)) (v_arrayElimCell_1150 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1148)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1140)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1143)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1147)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1149)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1144)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1142)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1145)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1146)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1141)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1150))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741|) .cse3))))) is different from true [2023-12-25 06:47:49,398 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse3)))) (and (exists ((v_arrayElimCell_1145 (_ BitVec 32)) (v_arrayElimCell_1144 (_ BitVec 32)) (v_arrayElimCell_1143 (_ BitVec 32)) (v_arrayElimCell_1142 (_ BitVec 32)) (v_arrayElimCell_1149 (_ BitVec 32)) (v_arrayElimCell_1148 (_ BitVec 32)) (v_arrayElimCell_1147 (_ BitVec 32)) (v_arrayElimCell_1146 (_ BitVec 32)) (v_arrayElimCell_1141 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32)) (v_arrayElimCell_1140 (_ BitVec 32)) (v_arrayElimCell_1151 (_ BitVec 32)) (v_arrayElimCell_1150 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1148)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1140)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1143)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1147)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1149)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1144)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1142)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1145)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1146)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1151)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1141)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1150))))) |c_#memory_int#3|)) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741| (_ BitVec 8))) (= ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_1741|) .cse3)) (exists ((v_arrayElimCell_1109 (_ BitVec 32)) (v_arrayElimCell_1108 (_ BitVec 32)) (v_arrayElimCell_1107 (_ BitVec 32)) (v_arrayElimCell_1106 (_ BitVec 32)) (v_arrayElimCell_1101 (_ BitVec 32)) (v_arrayElimCell_1100 (_ BitVec 32)) (v_arrayElimCell_1099 (_ BitVec 32)) (v_arrayElimCell_1098 (_ BitVec 32)) (v_arrayElimCell_1105 (_ BitVec 32)) (v_arrayElimCell_1104 (_ BitVec 32)) (v_arrayElimCell_1103 (_ BitVec 32)) (v_arrayElimCell_1102 (_ BitVec 32)) (v_arrayElimCell_1085 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1085)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1101)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1102)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1105)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1098)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1100)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1104)) .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1108)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1099)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1106)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1103)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1107)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1109)))))))))) is different from true [2023-12-25 06:47:54,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:47:58,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:48:02,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:48:02,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:48:02,953 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2023-12-25 06:48:02,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-25 06:48:02,965 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 1.135135135135135) internal successors, (42), 36 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 29 states have return successors, (30), 30 states have call predecessors, (30), 4 states have call successors, (30) Word has length 80 [2023-12-25 06:48:02,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:48:02,965 INFO L225 Difference]: With dead ends: 54 [2023-12-25 06:48:02,965 INFO L226 Difference]: Without dead ends: 52 [2023-12-25 06:48:02,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 101 SyntacticMatches, 25 SemanticMatches, 59 ConstructedPredicates, 38 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 37.6s TimeCoverageRelationStatistics Valid=168, Invalid=446, Unknown=44, NotChecked=3002, Total=3660 [2023-12-25 06:48:02,967 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 13 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 1635 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:48:02,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 85 Invalid, 1727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 84 Invalid, 2 Unknown, 1635 Unchecked, 15.1s Time] [2023-12-25 06:48:02,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-25 06:48:02,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2023-12-25 06:48:02,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 16 states have return successors, (18), 17 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-25 06:48:02,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2023-12-25 06:48:02,981 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 80 [2023-12-25 06:48:02,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:48:02,981 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2023-12-25 06:48:02,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 1.135135135135135) internal successors, (42), 36 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 29 states have return successors, (30), 30 states have call predecessors, (30), 4 states have call successors, (30) [2023-12-25 06:48:02,981 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2023-12-25 06:48:02,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-25 06:48:02,982 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:48:02,982 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:48:02,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2023-12-25 06:48:03,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (68)] Forceful destruction successful, exit code 0 [2023-12-25 06:48:03,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-25 06:48:03,387 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:48:03,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:48:03,388 INFO L85 PathProgramCache]: Analyzing trace with hash -33841172, now seen corresponding path program 14 times [2023-12-25 06:48:03,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:48:03,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112659122] [2023-12-25 06:48:03,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:48:03,388 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 [2023-12-25 06:48:03,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:48:03,389 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:48:03,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (71)] Waiting until timeout for monitored process [2023-12-25 06:48:04,482 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:48:04,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:48:04,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 117 conjunts are in the unsatisfiable core [2023-12-25 06:48:04,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:48:04,687 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 23 treesize of output 19 [2023-12-25 06:48:04,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 23 treesize of output 19 [2023-12-25 06:48:05,015 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 23 treesize of output 19 [2023-12-25 06:48:05,161 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 23 treesize of output 19 [2023-12-25 06:48:05,305 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 23 treesize of output 19 [2023-12-25 06:48:05,449 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 23 treesize of output 19 [2023-12-25 06:48:05,595 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 23 treesize of output 19 [2023-12-25 06:48:05,741 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 23 treesize of output 19 [2023-12-25 06:48:05,895 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 23 treesize of output 19 [2023-12-25 06:48:06,061 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 23 treesize of output 19 [2023-12-25 06:48:06,246 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 23 treesize of output 19 [2023-12-25 06:48:06,434 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 23 treesize of output 19 [2023-12-25 06:48:06,627 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 23 treesize of output 19 [2023-12-25 06:48:06,819 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 23 treesize of output 19 [2023-12-25 06:48:06,855 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1181 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1181)))))))) is different from true [2023-12-25 06:48:06,986 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1181 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1181)))))))) is different from true [2023-12-25 06:48:07,048 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1181 (_ BitVec 32)) (v_arrayElimCell_1182 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1182)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1181)))))))) is different from true [2023-12-25 06:48:07,115 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1181 (_ BitVec 32)) (v_arrayElimCell_1183 (_ BitVec 32)) (v_arrayElimCell_1182 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1182)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1183)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1181)))))))) is different from true [2023-12-25 06:48:07,226 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1181 (_ BitVec 32)) (v_arrayElimCell_1184 (_ BitVec 32)) (v_arrayElimCell_1183 (_ BitVec 32)) (v_arrayElimCell_1182 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1182)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1183)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1184)))))))) is different from true [2023-12-25 06:48:07,299 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1181 (_ BitVec 32)) (v_arrayElimCell_1185 (_ BitVec 32)) (v_arrayElimCell_1184 (_ BitVec 32)) (v_arrayElimCell_1183 (_ BitVec 32)) (v_arrayElimCell_1182 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1182)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1183)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1184)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1185)))))))) is different from true [2023-12-25 06:48:07,373 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1181 (_ BitVec 32)) (v_arrayElimCell_1185 (_ BitVec 32)) (v_arrayElimCell_1184 (_ BitVec 32)) (v_arrayElimCell_1183 (_ BitVec 32)) (v_arrayElimCell_1182 (_ BitVec 32)) (v_arrayElimCell_1186 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1186)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1182)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1183)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1184)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1185)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:48:07,450 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1181 (_ BitVec 32)) (v_arrayElimCell_1185 (_ BitVec 32)) (v_arrayElimCell_1184 (_ BitVec 32)) (v_arrayElimCell_1183 (_ BitVec 32)) (v_arrayElimCell_1182 (_ BitVec 32)) (v_arrayElimCell_1187 (_ BitVec 32)) (v_arrayElimCell_1186 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1186)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1182)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1183)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1187)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1184)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1185)))))))) is different from true [2023-12-25 06:48:07,532 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1181 (_ BitVec 32)) (v_arrayElimCell_1185 (_ BitVec 32)) (v_arrayElimCell_1184 (_ BitVec 32)) (v_arrayElimCell_1183 (_ BitVec 32)) (v_arrayElimCell_1182 (_ BitVec 32)) (v_arrayElimCell_1188 (_ BitVec 32)) (v_arrayElimCell_1187 (_ BitVec 32)) (v_arrayElimCell_1186 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1186)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1182)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1183)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1188)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1187)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1184)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1185)))))))) is different from true [2023-12-25 06:48:07,624 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1181 (_ BitVec 32)) (v_arrayElimCell_1185 (_ BitVec 32)) (v_arrayElimCell_1184 (_ BitVec 32)) (v_arrayElimCell_1183 (_ BitVec 32)) (v_arrayElimCell_1182 (_ BitVec 32)) (v_arrayElimCell_1189 (_ BitVec 32)) (v_arrayElimCell_1188 (_ BitVec 32)) (v_arrayElimCell_1187 (_ BitVec 32)) (v_arrayElimCell_1186 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1186)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1182)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1183)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1188)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1187)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1184)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1189)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1185)))))))) is different from true [2023-12-25 06:48:07,701 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1181 (_ BitVec 32)) (v_arrayElimCell_1190 (_ BitVec 32)) (v_arrayElimCell_1185 (_ BitVec 32)) (v_arrayElimCell_1184 (_ BitVec 32)) (v_arrayElimCell_1183 (_ BitVec 32)) (v_arrayElimCell_1182 (_ BitVec 32)) (v_arrayElimCell_1189 (_ BitVec 32)) (v_arrayElimCell_1188 (_ BitVec 32)) (v_arrayElimCell_1187 (_ BitVec 32)) (v_arrayElimCell_1186 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1186)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1182)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1183)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1190)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1188)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1187)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1184)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1189)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1185)))))))) is different from true [2023-12-25 06:48:07,782 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1189 (_ BitVec 32)) (v_arrayElimCell_1188 (_ BitVec 32)) (v_arrayElimCell_1187 (_ BitVec 32)) (v_arrayElimCell_1186 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32)) (v_arrayElimCell_1181 (_ BitVec 32)) (v_arrayElimCell_1191 (_ BitVec 32)) (v_arrayElimCell_1190 (_ BitVec 32)) (v_arrayElimCell_1185 (_ BitVec 32)) (v_arrayElimCell_1184 (_ BitVec 32)) (v_arrayElimCell_1183 (_ BitVec 32)) (v_arrayElimCell_1182 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1191)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1186)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1182)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1183)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1190)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1188)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1187)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1184)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1189)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1185)))))))) is different from true [2023-12-25 06:48:07,862 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1189 (_ BitVec 32)) (v_arrayElimCell_1188 (_ BitVec 32)) (v_arrayElimCell_1187 (_ BitVec 32)) (v_arrayElimCell_1186 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32)) (v_arrayElimCell_1192 (_ BitVec 32)) (v_arrayElimCell_1181 (_ BitVec 32)) (v_arrayElimCell_1191 (_ BitVec 32)) (v_arrayElimCell_1190 (_ BitVec 32)) (v_arrayElimCell_1185 (_ BitVec 32)) (v_arrayElimCell_1184 (_ BitVec 32)) (v_arrayElimCell_1183 (_ BitVec 32)) (v_arrayElimCell_1182 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1192)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1191)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1186)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1182)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1183)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1190)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1188)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1187)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1184)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1189)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1185)))))))) is different from true [2023-12-25 06:48:07,946 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1189 (_ BitVec 32)) (v_arrayElimCell_1188 (_ BitVec 32)) (v_arrayElimCell_1187 (_ BitVec 32)) (v_arrayElimCell_1186 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32)) (v_arrayElimCell_1192 (_ BitVec 32)) (v_arrayElimCell_1181 (_ BitVec 32)) (v_arrayElimCell_1191 (_ BitVec 32)) (v_arrayElimCell_1190 (_ BitVec 32)) (v_arrayElimCell_1185 (_ BitVec 32)) (v_arrayElimCell_1184 (_ BitVec 32)) (v_arrayElimCell_1183 (_ BitVec 32)) (v_arrayElimCell_1182 (_ BitVec 32)) (v_arrayElimCell_1193 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1192)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1191)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1186)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1182)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1183)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1190)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1188)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1187)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1193)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1184)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1189)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1185)))))))) is different from true [2023-12-25 06:48:07,995 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 61 treesize of output 53 [2023-12-25 06:48:08,521 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 57 treesize of output 49 [2023-12-25 06:48:09,802 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 274 trivial. 223 not checked. [2023-12-25 06:48:09,802 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:48:18,671 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 107 treesize of output 103 [2023-12-25 06:48:18,684 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 103 treesize of output 99 [2023-12-25 06:48:18,697 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 99 treesize of output 95 [2023-12-25 06:48:18,710 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 95 treesize of output 91 [2023-12-25 06:48:18,722 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 91 treesize of output 87 [2023-12-25 06:48:18,733 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 87 treesize of output 83 [2023-12-25 06:48:18,745 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 83 treesize of output 79 [2023-12-25 06:48:18,757 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 79 treesize of output 75 [2023-12-25 06:48:18,769 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 75 treesize of output 71 [2023-12-25 06:48:18,781 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 71 treesize of output 67 [2023-12-25 06:48:18,792 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 67 treesize of output 63 [2023-12-25 06:48:18,804 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 63 treesize of output 59 [2023-12-25 06:48:18,815 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 59 treesize of output 55 [2023-12-25 06:48:18,826 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 55 treesize of output 51 [2023-12-25 06:48:19,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:48:19,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112659122] [2023-12-25 06:48:19,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1112659122] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:48:19,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [559835920] [2023-12-25 06:48:19,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:48:19,489 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:48:19,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:48:19,490 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:48:19,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (72)] Waiting until timeout for monitored process [2023-12-25 06:48:21,335 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-25 06:48:21,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428979525] [2023-12-25 06:48:21,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:48:21,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-25 06:48:21,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:48:21,338 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-25 06:48:21,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2023-12-25 06:48:21,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (72)] Forceful destruction successful, exit code 1 [2023-12-25 06:48:22,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:48:22,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:48:22,445 INFO L262 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 117 conjunts are in the unsatisfiable core [2023-12-25 06:48:22,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:48:22,527 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 23 treesize of output 19 [2023-12-25 06:48:22,672 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 23 treesize of output 19 [2023-12-25 06:48:22,814 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 23 treesize of output 19 [2023-12-25 06:48:22,955 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 23 treesize of output 19 [2023-12-25 06:48:23,096 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 23 treesize of output 19 [2023-12-25 06:48:23,263 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 23 treesize of output 19 [2023-12-25 06:48:23,407 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 23 treesize of output 19 [2023-12-25 06:48:23,556 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 23 treesize of output 19 [2023-12-25 06:48:23,695 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 23 treesize of output 19 [2023-12-25 06:48:23,834 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 23 treesize of output 19 [2023-12-25 06:48:23,968 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 23 treesize of output 19 [2023-12-25 06:48:24,105 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 23 treesize of output 19 [2023-12-25 06:48:24,246 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 23 treesize of output 19 [2023-12-25 06:48:24,387 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 23 treesize of output 19 [2023-12-25 06:48:24,413 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1223 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1223)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) is different from true [2023-12-25 06:48:24,508 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1223 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1223)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:48:24,550 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1224 (_ BitVec 32)) (v_arrayElimCell_1223 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1223)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1224)))))))) is different from true [2023-12-25 06:48:24,596 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1225 (_ BitVec 32)) (v_arrayElimCell_1224 (_ BitVec 32)) (v_arrayElimCell_1223 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1223)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1225)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1224)))))))) is different from true [2023-12-25 06:48:24,642 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1226 (_ BitVec 32)) (v_arrayElimCell_1225 (_ BitVec 32)) (v_arrayElimCell_1224 (_ BitVec 32)) (v_arrayElimCell_1223 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1223)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1225)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1224)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1226)))))))) is different from true [2023-12-25 06:48:24,693 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1227 (_ BitVec 32)) (v_arrayElimCell_1226 (_ BitVec 32)) (v_arrayElimCell_1225 (_ BitVec 32)) (v_arrayElimCell_1224 (_ BitVec 32)) (v_arrayElimCell_1223 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1223)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1225)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1227)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1224)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1226)))))))) is different from true [2023-12-25 06:48:24,749 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1228 (_ BitVec 32)) (v_arrayElimCell_1227 (_ BitVec 32)) (v_arrayElimCell_1226 (_ BitVec 32)) (v_arrayElimCell_1225 (_ BitVec 32)) (v_arrayElimCell_1224 (_ BitVec 32)) (v_arrayElimCell_1223 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1223)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1225)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1227)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1228)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1224)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1226)))))))) is different from true [2023-12-25 06:48:24,807 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1229 (_ BitVec 32)) (v_arrayElimCell_1228 (_ BitVec 32)) (v_arrayElimCell_1227 (_ BitVec 32)) (v_arrayElimCell_1226 (_ BitVec 32)) (v_arrayElimCell_1225 (_ BitVec 32)) (v_arrayElimCell_1224 (_ BitVec 32)) (v_arrayElimCell_1223 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1223)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1225)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1227)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1229)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1228)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1224)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1226)))))))) is different from true [2023-12-25 06:48:24,867 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1229 (_ BitVec 32)) (v_arrayElimCell_1228 (_ BitVec 32)) (v_arrayElimCell_1227 (_ BitVec 32)) (v_arrayElimCell_1230 (_ BitVec 32)) (v_arrayElimCell_1226 (_ BitVec 32)) (v_arrayElimCell_1225 (_ BitVec 32)) (v_arrayElimCell_1224 (_ BitVec 32)) (v_arrayElimCell_1223 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1223)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1225)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1227)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1229)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1228)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1230)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1224)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1226)))))))) is different from true [2023-12-25 06:48:24,929 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1229 (_ BitVec 32)) (v_arrayElimCell_1228 (_ BitVec 32)) (v_arrayElimCell_1227 (_ BitVec 32)) (v_arrayElimCell_1231 (_ BitVec 32)) (v_arrayElimCell_1230 (_ BitVec 32)) (v_arrayElimCell_1226 (_ BitVec 32)) (v_arrayElimCell_1225 (_ BitVec 32)) (v_arrayElimCell_1224 (_ BitVec 32)) (v_arrayElimCell_1223 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1231)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1223)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1225)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1227)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1229)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1228)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1230)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1224)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1226)))))))) is different from true [2023-12-25 06:48:25,003 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1229 (_ BitVec 32)) (v_arrayElimCell_1228 (_ BitVec 32)) (v_arrayElimCell_1227 (_ BitVec 32)) (v_arrayElimCell_1232 (_ BitVec 32)) (v_arrayElimCell_1231 (_ BitVec 32)) (v_arrayElimCell_1230 (_ BitVec 32)) (v_arrayElimCell_1226 (_ BitVec 32)) (v_arrayElimCell_1225 (_ BitVec 32)) (v_arrayElimCell_1224 (_ BitVec 32)) (v_arrayElimCell_1223 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1231)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1223)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1225)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1227)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1229)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1228)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1232)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1230)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1224)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1226)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:48:25,089 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1229 (_ BitVec 32)) (v_arrayElimCell_1228 (_ BitVec 32)) (v_arrayElimCell_1227 (_ BitVec 32)) (v_arrayElimCell_1233 (_ BitVec 32)) (v_arrayElimCell_1232 (_ BitVec 32)) (v_arrayElimCell_1231 (_ BitVec 32)) (v_arrayElimCell_1230 (_ BitVec 32)) (v_arrayElimCell_1226 (_ BitVec 32)) (v_arrayElimCell_1225 (_ BitVec 32)) (v_arrayElimCell_1224 (_ BitVec 32)) (v_arrayElimCell_1223 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1231)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1223)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1225)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1227)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1229)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1233)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1228)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1232)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1230)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1224)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1226)))))))) is different from true [2023-12-25 06:48:25,171 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1229 (_ BitVec 32)) (v_arrayElimCell_1228 (_ BitVec 32)) (v_arrayElimCell_1227 (_ BitVec 32)) (v_arrayElimCell_1233 (_ BitVec 32)) (v_arrayElimCell_1232 (_ BitVec 32)) (v_arrayElimCell_1231 (_ BitVec 32)) (v_arrayElimCell_1230 (_ BitVec 32)) (v_arrayElimCell_1226 (_ BitVec 32)) (v_arrayElimCell_1225 (_ BitVec 32)) (v_arrayElimCell_1224 (_ BitVec 32)) (v_arrayElimCell_1223 (_ BitVec 32)) (v_arrayElimCell_1234 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1231)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1223)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1225)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1234)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1227)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1229)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1233)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1228)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1232)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1230)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1224)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1226)))))))) is different from true [2023-12-25 06:48:25,256 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1229 (_ BitVec 32)) (v_arrayElimCell_1228 (_ BitVec 32)) (v_arrayElimCell_1227 (_ BitVec 32)) (v_arrayElimCell_1233 (_ BitVec 32)) (v_arrayElimCell_1232 (_ BitVec 32)) (v_arrayElimCell_1231 (_ BitVec 32)) (v_arrayElimCell_1230 (_ BitVec 32)) (v_arrayElimCell_1226 (_ BitVec 32)) (v_arrayElimCell_1225 (_ BitVec 32)) (v_arrayElimCell_1235 (_ BitVec 32)) (v_arrayElimCell_1224 (_ BitVec 32)) (v_arrayElimCell_1223 (_ BitVec 32)) (v_arrayElimCell_1234 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1231)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1223)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1225)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1234)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1235)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1227)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1229)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1233)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1228)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1232)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1230)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1224)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1226)))))))) is different from true [2023-12-25 06:48:25,302 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 61 treesize of output 53 [2023-12-25 06:48:25,770 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 57 treesize of output 49 [2023-12-25 06:48:25,835 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 274 trivial. 223 not checked. [2023-12-25 06:48:25,836 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:48:33,623 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 107 treesize of output 103 [2023-12-25 06:48:33,636 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 103 treesize of output 99 [2023-12-25 06:48:33,666 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 99 treesize of output 95 [2023-12-25 06:48:33,679 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 95 treesize of output 91 [2023-12-25 06:48:33,692 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 91 treesize of output 87 [2023-12-25 06:48:33,704 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 87 treesize of output 83 [2023-12-25 06:48:33,716 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 83 treesize of output 79 [2023-12-25 06:48:33,729 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 79 treesize of output 75 [2023-12-25 06:48:33,740 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 75 treesize of output 71 [2023-12-25 06:48:33,752 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 71 treesize of output 67 [2023-12-25 06:48:33,764 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 67 treesize of output 63 [2023-12-25 06:48:33,775 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 63 treesize of output 59 [2023-12-25 06:48:33,786 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 59 treesize of output 55 [2023-12-25 06:48:33,798 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 55 treesize of output 51 [2023-12-25 06:48:34,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428979525] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:48:34,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:48:34,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 36 [2023-12-25 06:48:34,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089081877] [2023-12-25 06:48:34,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:48:34,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-25 06:48:34,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:48:34,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-25 06:48:34,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=110, Unknown=28, NotChecked=1260, Total=1482 [2023-12-25 06:48:34,417 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand has 36 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 36 states have internal predecessors, (41), 4 states have call successors, (4), 1 states have call predecessors, (4), 29 states have return successors, (30), 29 states have call predecessors, (30), 4 states have call successors, (30) [2023-12-25 06:48:35,607 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_1181 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1181))))))) (exists ((v_arrayElimCell_1223 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1223)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168))))) |c_#memory_int#3|))))) is different from true [2023-12-25 06:48:35,624 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_1224 (_ BitVec 32)) (v_arrayElimCell_1223 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1223)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1224))))))) (exists ((v_arrayElimCell_1181 (_ BitVec 32)) (v_arrayElimCell_1182 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1182)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1181)))))))))) is different from true [2023-12-25 06:48:35,640 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_1225 (_ BitVec 32)) (v_arrayElimCell_1224 (_ BitVec 32)) (v_arrayElimCell_1223 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1223)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1225)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1224))))))) (exists ((v_arrayElimCell_1181 (_ BitVec 32)) (v_arrayElimCell_1183 (_ BitVec 32)) (v_arrayElimCell_1182 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1182)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1183)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1181)))))))))) is different from true [2023-12-25 06:48:35,658 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_1181 (_ BitVec 32)) (v_arrayElimCell_1184 (_ BitVec 32)) (v_arrayElimCell_1183 (_ BitVec 32)) (v_arrayElimCell_1182 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1182)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1183)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1184))))))) (exists ((v_arrayElimCell_1226 (_ BitVec 32)) (v_arrayElimCell_1225 (_ BitVec 32)) (v_arrayElimCell_1224 (_ BitVec 32)) (v_arrayElimCell_1223 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1223)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1225)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1224)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1226)))))))))) is different from true [2023-12-25 06:48:35,677 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_1227 (_ BitVec 32)) (v_arrayElimCell_1226 (_ BitVec 32)) (v_arrayElimCell_1225 (_ BitVec 32)) (v_arrayElimCell_1224 (_ BitVec 32)) (v_arrayElimCell_1223 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1223)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1225)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1227)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1224)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1226))))))) (exists ((v_arrayElimCell_1181 (_ BitVec 32)) (v_arrayElimCell_1185 (_ BitVec 32)) (v_arrayElimCell_1184 (_ BitVec 32)) (v_arrayElimCell_1183 (_ BitVec 32)) (v_arrayElimCell_1182 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1182)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1183)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1184)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1185)))))))))) is different from true [2023-12-25 06:48:35,698 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_1228 (_ BitVec 32)) (v_arrayElimCell_1227 (_ BitVec 32)) (v_arrayElimCell_1226 (_ BitVec 32)) (v_arrayElimCell_1225 (_ BitVec 32)) (v_arrayElimCell_1224 (_ BitVec 32)) (v_arrayElimCell_1223 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1223)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1225)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1227)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1228)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1224)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1226))))))) (exists ((v_arrayElimCell_1181 (_ BitVec 32)) (v_arrayElimCell_1185 (_ BitVec 32)) (v_arrayElimCell_1184 (_ BitVec 32)) (v_arrayElimCell_1183 (_ BitVec 32)) (v_arrayElimCell_1182 (_ BitVec 32)) (v_arrayElimCell_1186 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1186)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1182)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1183)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1184)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1185))))) |c_#memory_int#3|))))) is different from true [2023-12-25 06:48:35,719 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_1229 (_ BitVec 32)) (v_arrayElimCell_1228 (_ BitVec 32)) (v_arrayElimCell_1227 (_ BitVec 32)) (v_arrayElimCell_1226 (_ BitVec 32)) (v_arrayElimCell_1225 (_ BitVec 32)) (v_arrayElimCell_1224 (_ BitVec 32)) (v_arrayElimCell_1223 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1223)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1225)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1227)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1229)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1228)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1224)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1226))))))) (exists ((v_arrayElimCell_1181 (_ BitVec 32)) (v_arrayElimCell_1185 (_ BitVec 32)) (v_arrayElimCell_1184 (_ BitVec 32)) (v_arrayElimCell_1183 (_ BitVec 32)) (v_arrayElimCell_1182 (_ BitVec 32)) (v_arrayElimCell_1187 (_ BitVec 32)) (v_arrayElimCell_1186 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1186)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1182)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1183)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1187)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1184)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1185)))))))))) is different from true [2023-12-25 06:48:35,749 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_1181 (_ BitVec 32)) (v_arrayElimCell_1185 (_ BitVec 32)) (v_arrayElimCell_1184 (_ BitVec 32)) (v_arrayElimCell_1183 (_ BitVec 32)) (v_arrayElimCell_1182 (_ BitVec 32)) (v_arrayElimCell_1188 (_ BitVec 32)) (v_arrayElimCell_1187 (_ BitVec 32)) (v_arrayElimCell_1186 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1186)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1182)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1183)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1188)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1187)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1184)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1185))))))) (exists ((v_arrayElimCell_1229 (_ BitVec 32)) (v_arrayElimCell_1228 (_ BitVec 32)) (v_arrayElimCell_1227 (_ BitVec 32)) (v_arrayElimCell_1230 (_ BitVec 32)) (v_arrayElimCell_1226 (_ BitVec 32)) (v_arrayElimCell_1225 (_ BitVec 32)) (v_arrayElimCell_1224 (_ BitVec 32)) (v_arrayElimCell_1223 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1223)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1225)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1227)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1229)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1228)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1230)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1224)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1226)))))))))) is different from true [2023-12-25 06:48:35,773 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_1229 (_ BitVec 32)) (v_arrayElimCell_1228 (_ BitVec 32)) (v_arrayElimCell_1227 (_ BitVec 32)) (v_arrayElimCell_1231 (_ BitVec 32)) (v_arrayElimCell_1230 (_ BitVec 32)) (v_arrayElimCell_1226 (_ BitVec 32)) (v_arrayElimCell_1225 (_ BitVec 32)) (v_arrayElimCell_1224 (_ BitVec 32)) (v_arrayElimCell_1223 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1231)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1223)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1225)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1227)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1229)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1228)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1230)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1224)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1226))))))) (exists ((v_arrayElimCell_1181 (_ BitVec 32)) (v_arrayElimCell_1185 (_ BitVec 32)) (v_arrayElimCell_1184 (_ BitVec 32)) (v_arrayElimCell_1183 (_ BitVec 32)) (v_arrayElimCell_1182 (_ BitVec 32)) (v_arrayElimCell_1189 (_ BitVec 32)) (v_arrayElimCell_1188 (_ BitVec 32)) (v_arrayElimCell_1187 (_ BitVec 32)) (v_arrayElimCell_1186 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1186)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1182)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1183)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1188)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1187)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1184)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1189)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1185)))))))))) is different from true [2023-12-25 06:48:35,813 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_1181 (_ BitVec 32)) (v_arrayElimCell_1190 (_ BitVec 32)) (v_arrayElimCell_1185 (_ BitVec 32)) (v_arrayElimCell_1184 (_ BitVec 32)) (v_arrayElimCell_1183 (_ BitVec 32)) (v_arrayElimCell_1182 (_ BitVec 32)) (v_arrayElimCell_1189 (_ BitVec 32)) (v_arrayElimCell_1188 (_ BitVec 32)) (v_arrayElimCell_1187 (_ BitVec 32)) (v_arrayElimCell_1186 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1186)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1182)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1183)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1190)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1188)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1187)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1184)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1189)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1185))))))) (exists ((v_arrayElimCell_1229 (_ BitVec 32)) (v_arrayElimCell_1228 (_ BitVec 32)) (v_arrayElimCell_1227 (_ BitVec 32)) (v_arrayElimCell_1232 (_ BitVec 32)) (v_arrayElimCell_1231 (_ BitVec 32)) (v_arrayElimCell_1230 (_ BitVec 32)) (v_arrayElimCell_1226 (_ BitVec 32)) (v_arrayElimCell_1225 (_ BitVec 32)) (v_arrayElimCell_1224 (_ BitVec 32)) (v_arrayElimCell_1223 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1231)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1223)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1225)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1227)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1229)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1228)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1232)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1230)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1224)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1226))))) |c_#memory_int#3|))))) is different from true [2023-12-25 06:48:35,856 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_1229 (_ BitVec 32)) (v_arrayElimCell_1228 (_ BitVec 32)) (v_arrayElimCell_1227 (_ BitVec 32)) (v_arrayElimCell_1233 (_ BitVec 32)) (v_arrayElimCell_1232 (_ BitVec 32)) (v_arrayElimCell_1231 (_ BitVec 32)) (v_arrayElimCell_1230 (_ BitVec 32)) (v_arrayElimCell_1226 (_ BitVec 32)) (v_arrayElimCell_1225 (_ BitVec 32)) (v_arrayElimCell_1224 (_ BitVec 32)) (v_arrayElimCell_1223 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1231)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1223)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1225)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1227)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1229)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1233)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1228)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1232)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1230)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1224)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1226))))))) (exists ((v_arrayElimCell_1189 (_ BitVec 32)) (v_arrayElimCell_1188 (_ BitVec 32)) (v_arrayElimCell_1187 (_ BitVec 32)) (v_arrayElimCell_1186 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32)) (v_arrayElimCell_1181 (_ BitVec 32)) (v_arrayElimCell_1191 (_ BitVec 32)) (v_arrayElimCell_1190 (_ BitVec 32)) (v_arrayElimCell_1185 (_ BitVec 32)) (v_arrayElimCell_1184 (_ BitVec 32)) (v_arrayElimCell_1183 (_ BitVec 32)) (v_arrayElimCell_1182 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1191)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1186)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1182)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1183)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1190)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1188)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1187)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1184)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1189)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1185)))))))))) is different from true [2023-12-25 06:48:35,893 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_1189 (_ BitVec 32)) (v_arrayElimCell_1188 (_ BitVec 32)) (v_arrayElimCell_1187 (_ BitVec 32)) (v_arrayElimCell_1186 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32)) (v_arrayElimCell_1192 (_ BitVec 32)) (v_arrayElimCell_1181 (_ BitVec 32)) (v_arrayElimCell_1191 (_ BitVec 32)) (v_arrayElimCell_1190 (_ BitVec 32)) (v_arrayElimCell_1185 (_ BitVec 32)) (v_arrayElimCell_1184 (_ BitVec 32)) (v_arrayElimCell_1183 (_ BitVec 32)) (v_arrayElimCell_1182 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1192)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1191)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1186)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1182)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1183)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1190)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1188)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1187)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1184)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1189)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1185))))))) (exists ((v_arrayElimCell_1229 (_ BitVec 32)) (v_arrayElimCell_1228 (_ BitVec 32)) (v_arrayElimCell_1227 (_ BitVec 32)) (v_arrayElimCell_1233 (_ BitVec 32)) (v_arrayElimCell_1232 (_ BitVec 32)) (v_arrayElimCell_1231 (_ BitVec 32)) (v_arrayElimCell_1230 (_ BitVec 32)) (v_arrayElimCell_1226 (_ BitVec 32)) (v_arrayElimCell_1225 (_ BitVec 32)) (v_arrayElimCell_1224 (_ BitVec 32)) (v_arrayElimCell_1223 (_ BitVec 32)) (v_arrayElimCell_1234 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1231)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1223)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1225)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1234)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1227)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1229)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1233)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1228)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1232)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1230)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1224)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1226)))))))))) is different from true [2023-12-25 06:48:35,946 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_1229 (_ BitVec 32)) (v_arrayElimCell_1228 (_ BitVec 32)) (v_arrayElimCell_1227 (_ BitVec 32)) (v_arrayElimCell_1233 (_ BitVec 32)) (v_arrayElimCell_1232 (_ BitVec 32)) (v_arrayElimCell_1231 (_ BitVec 32)) (v_arrayElimCell_1230 (_ BitVec 32)) (v_arrayElimCell_1226 (_ BitVec 32)) (v_arrayElimCell_1225 (_ BitVec 32)) (v_arrayElimCell_1235 (_ BitVec 32)) (v_arrayElimCell_1224 (_ BitVec 32)) (v_arrayElimCell_1223 (_ BitVec 32)) (v_arrayElimCell_1234 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1231)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1223)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1225)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1234)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1235)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1227)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1229)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1233)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1228)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1232)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1230)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1224)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1226))))))) (exists ((v_arrayElimCell_1189 (_ BitVec 32)) (v_arrayElimCell_1188 (_ BitVec 32)) (v_arrayElimCell_1187 (_ BitVec 32)) (v_arrayElimCell_1186 (_ BitVec 32)) (v_arrayElimCell_1168 (_ BitVec 32)) (v_arrayElimCell_1192 (_ BitVec 32)) (v_arrayElimCell_1181 (_ BitVec 32)) (v_arrayElimCell_1191 (_ BitVec 32)) (v_arrayElimCell_1190 (_ BitVec 32)) (v_arrayElimCell_1185 (_ BitVec 32)) (v_arrayElimCell_1184 (_ BitVec 32)) (v_arrayElimCell_1183 (_ BitVec 32)) (v_arrayElimCell_1182 (_ BitVec 32)) (v_arrayElimCell_1193 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1192)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1191)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1186)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1182)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1183)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1190)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1168)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1188)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1181)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1187)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1193)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1184)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1189)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1185)))))))))) is different from true [2023-12-25 06:48:39,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:48:40,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:48:40,779 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2023-12-25 06:48:40,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-25 06:48:40,779 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 36 states have internal predecessors, (41), 4 states have call successors, (4), 1 states have call predecessors, (4), 29 states have return successors, (30), 29 states have call predecessors, (30), 4 states have call successors, (30) Word has length 81 [2023-12-25 06:48:40,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:48:40,780 INFO L225 Difference]: With dead ends: 52 [2023-12-25 06:48:40,780 INFO L226 Difference]: Without dead ends: 47 [2023-12-25 06:48:40,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 106 SyntacticMatches, 28 SemanticMatches, 51 ConstructedPredicates, 41 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=117, Invalid=138, Unknown=41, NotChecked=2460, Total=2756 [2023-12-25 06:48:40,781 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1489 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2023-12-25 06:48:40,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 66 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 1 Unknown, 1489 Unchecked, 5.6s Time] [2023-12-25 06:48:40,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-25 06:48:40,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-12-25 06:48:40,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 16 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-25 06:48:40,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2023-12-25 06:48:40,788 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 81 [2023-12-25 06:48:40,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:48:40,788 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2023-12-25 06:48:40,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 36 states have internal predecessors, (41), 4 states have call successors, (4), 1 states have call predecessors, (4), 29 states have return successors, (30), 29 states have call predecessors, (30), 4 states have call successors, (30) [2023-12-25 06:48:40,789 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2023-12-25 06:48:40,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-25 06:48:40,790 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:48:40,790 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:48:40,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Forceful destruction successful, exit code 0 [2023-12-25 06:48:41,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (71)] Forceful destruction successful, exit code 0 [2023-12-25 06:48:41,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-25 06:48:41,204 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:48:41,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:48:41,204 INFO L85 PathProgramCache]: Analyzing trace with hash 782348871, now seen corresponding path program 15 times [2023-12-25 06:48:41,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:48:41,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658346823] [2023-12-25 06:48:41,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:48:41,205 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 [2023-12-25 06:48:41,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:48:41,206 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-25 06:48:41,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (74)] Waiting until timeout for monitored process [2023-12-25 06:48:43,075 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2023-12-25 06:48:43,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:48:43,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 188 conjunts are in the unsatisfiable core [2023-12-25 06:48:43,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:48:43,375 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 23 treesize of output 19 [2023-12-25 06:48:43,631 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 23 treesize of output 19 [2023-12-25 06:48:43,827 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 23 treesize of output 19 [2023-12-25 06:48:44,029 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 23 treesize of output 19 [2023-12-25 06:48:44,228 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 23 treesize of output 19 [2023-12-25 06:48:44,431 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 23 treesize of output 19 [2023-12-25 06:48:44,633 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 23 treesize of output 19 [2023-12-25 06:48:44,828 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 23 treesize of output 19 [2023-12-25 06:48:45,024 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 23 treesize of output 19 [2023-12-25 06:48:45,226 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 23 treesize of output 19 [2023-12-25 06:48:45,421 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 23 treesize of output 19 [2023-12-25 06:48:45,615 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 23 treesize of output 19 [2023-12-25 06:48:45,811 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 23 treesize of output 19 [2023-12-25 06:48:46,001 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 23 treesize of output 19 [2023-12-25 06:48:46,454 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1252 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1252)))))))) is different from true [2023-12-25 06:48:46,499 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1266 (_ BitVec 32)) (v_arrayElimCell_1252 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1266)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1252)))))))) is different from true [2023-12-25 06:48:46,545 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1266 (_ BitVec 32)) (v_arrayElimCell_1252 (_ BitVec 32)) (v_arrayElimCell_1267 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1266)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1267)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1252)))))))) is different from true [2023-12-25 06:48:46,595 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1266 (_ BitVec 32)) (v_arrayElimCell_1252 (_ BitVec 32)) (v_arrayElimCell_1268 (_ BitVec 32)) (v_arrayElimCell_1267 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1268)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1266)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1267)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1252)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:48:46,648 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1266 (_ BitVec 32)) (v_arrayElimCell_1252 (_ BitVec 32)) (v_arrayElimCell_1269 (_ BitVec 32)) (v_arrayElimCell_1268 (_ BitVec 32)) (v_arrayElimCell_1267 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1268)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1266)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1269)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1267)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1252)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:48:46,705 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1270 (_ BitVec 32)) (v_arrayElimCell_1266 (_ BitVec 32)) (v_arrayElimCell_1252 (_ BitVec 32)) (v_arrayElimCell_1269 (_ BitVec 32)) (v_arrayElimCell_1268 (_ BitVec 32)) (v_arrayElimCell_1267 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1268)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1266)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1270)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1269)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1267)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1252)))))))) is different from true [2023-12-25 06:48:46,764 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1271 (_ BitVec 32)) (v_arrayElimCell_1270 (_ BitVec 32)) (v_arrayElimCell_1266 (_ BitVec 32)) (v_arrayElimCell_1252 (_ BitVec 32)) (v_arrayElimCell_1269 (_ BitVec 32)) (v_arrayElimCell_1268 (_ BitVec 32)) (v_arrayElimCell_1267 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1268)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1266)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1270)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1269)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1271)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1267)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1252)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:48:46,825 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1272 (_ BitVec 32)) (v_arrayElimCell_1271 (_ BitVec 32)) (v_arrayElimCell_1270 (_ BitVec 32)) (v_arrayElimCell_1266 (_ BitVec 32)) (v_arrayElimCell_1252 (_ BitVec 32)) (v_arrayElimCell_1269 (_ BitVec 32)) (v_arrayElimCell_1268 (_ BitVec 32)) (v_arrayElimCell_1267 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1268)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1266)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1270)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1269)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1271)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1272)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1267)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1252)))))))) is different from true [2023-12-25 06:48:46,891 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1273 (_ BitVec 32)) (v_arrayElimCell_1272 (_ BitVec 32)) (v_arrayElimCell_1271 (_ BitVec 32)) (v_arrayElimCell_1270 (_ BitVec 32)) (v_arrayElimCell_1266 (_ BitVec 32)) (v_arrayElimCell_1252 (_ BitVec 32)) (v_arrayElimCell_1269 (_ BitVec 32)) (v_arrayElimCell_1268 (_ BitVec 32)) (v_arrayElimCell_1267 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1268)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1266)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1270)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1269)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1273)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1271)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1272)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1267)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1252)))))))) is different from true [2023-12-25 06:48:46,964 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1273 (_ BitVec 32)) (v_arrayElimCell_1272 (_ BitVec 32)) (v_arrayElimCell_1271 (_ BitVec 32)) (v_arrayElimCell_1270 (_ BitVec 32)) (v_arrayElimCell_1266 (_ BitVec 32)) (v_arrayElimCell_1274 (_ BitVec 32)) (v_arrayElimCell_1252 (_ BitVec 32)) (v_arrayElimCell_1269 (_ BitVec 32)) (v_arrayElimCell_1268 (_ BitVec 32)) (v_arrayElimCell_1267 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1268)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1266)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1270)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1274)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1269)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1273)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1271)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1272)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1267)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1252)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:48:47,058 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1273 (_ BitVec 32)) (v_arrayElimCell_1272 (_ BitVec 32)) (v_arrayElimCell_1271 (_ BitVec 32)) (v_arrayElimCell_1270 (_ BitVec 32)) (v_arrayElimCell_1266 (_ BitVec 32)) (v_arrayElimCell_1275 (_ BitVec 32)) (v_arrayElimCell_1274 (_ BitVec 32)) (v_arrayElimCell_1252 (_ BitVec 32)) (v_arrayElimCell_1269 (_ BitVec 32)) (v_arrayElimCell_1268 (_ BitVec 32)) (v_arrayElimCell_1267 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1268)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1266)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1270)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1274)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1269)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1273)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1271)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1272)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1275)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1267)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1252)))))))) is different from true [2023-12-25 06:48:47,138 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1266 (_ BitVec 32)) (v_arrayElimCell_1276 (_ BitVec 32)) (v_arrayElimCell_1275 (_ BitVec 32)) (v_arrayElimCell_1274 (_ BitVec 32)) (v_arrayElimCell_1252 (_ BitVec 32)) (v_arrayElimCell_1269 (_ BitVec 32)) (v_arrayElimCell_1268 (_ BitVec 32)) (v_arrayElimCell_1267 (_ BitVec 32)) (v_arrayElimCell_1273 (_ BitVec 32)) (v_arrayElimCell_1272 (_ BitVec 32)) (v_arrayElimCell_1271 (_ BitVec 32)) (v_arrayElimCell_1270 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1268)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1276)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1266)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1270)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1274)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1269)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1273)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1271)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1272)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1275)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1267)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1252)))))))) is different from true [2023-12-25 06:48:47,216 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1277 (_ BitVec 32)) (v_arrayElimCell_1266 (_ BitVec 32)) (v_arrayElimCell_1276 (_ BitVec 32)) (v_arrayElimCell_1275 (_ BitVec 32)) (v_arrayElimCell_1274 (_ BitVec 32)) (v_arrayElimCell_1252 (_ BitVec 32)) (v_arrayElimCell_1269 (_ BitVec 32)) (v_arrayElimCell_1268 (_ BitVec 32)) (v_arrayElimCell_1267 (_ BitVec 32)) (v_arrayElimCell_1273 (_ BitVec 32)) (v_arrayElimCell_1272 (_ BitVec 32)) (v_arrayElimCell_1271 (_ BitVec 32)) (v_arrayElimCell_1270 (_ BitVec 32))) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1277)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1268)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1276)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1266)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1270)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1274)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1269)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1273)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1271)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1272)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1275)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1267)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1252)))))))) is different from true [2023-12-25 06:48:47,295 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1277 (_ BitVec 32)) (v_arrayElimCell_1266 (_ BitVec 32)) (v_arrayElimCell_1276 (_ BitVec 32)) (v_arrayElimCell_1275 (_ BitVec 32)) (v_arrayElimCell_1274 (_ BitVec 32)) (v_arrayElimCell_1252 (_ BitVec 32)) (v_arrayElimCell_1269 (_ BitVec 32)) (v_arrayElimCell_1268 (_ BitVec 32)) (v_arrayElimCell_1278 (_ BitVec 32)) (v_arrayElimCell_1267 (_ BitVec 32)) (v_arrayElimCell_1273 (_ BitVec 32)) (v_arrayElimCell_1272 (_ BitVec 32)) (v_arrayElimCell_1271 (_ BitVec 32)) (v_arrayElimCell_1270 (_ BitVec 32))) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1277)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1268)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1276)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1266)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1270)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1274)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1269)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#2| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1278)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1273)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1271)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1272)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1275)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1267)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_1252)))))) |c_#memory_int#3|)) is different from true [2023-12-25 06:48:47,339 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 68 treesize of output 60 [2023-12-25 06:48:48,058 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 65 treesize of output 57 [2023-12-25 06:48:48,071 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 60 treesize of output 52 [2023-12-25 06:48:52,869 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 15 proven. 31 refuted. 0 times theorem prover too weak. 301 trivial. 238 not checked. [2023-12-25 06:48:52,869 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-12-25 06:48:59,275 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (74)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 06:48:59,276 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 06:48:59,322 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-25 06:48:59,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (74)] Ended with exit code 0 [2023-12-25 06:48:59,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-25 06:48:59,524 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 86 with TraceHistMax 16,while TraceCheckSpWp was constructing backward predicates,while TransFormulaUtils was doing sequential composition of 5 TransFormulas,while SimplifyDDA2 was simplifying a ∧-11-1 term,while SimplifyDDA2 was simplifying 11 xjuncts wrt. a ATOM-1 context. [2023-12-25 06:48:59,526 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-25 06:48:59,529 INFO L445 BasicCegarLoop]: Path program histogram: [15, 14, 1, 1] [2023-12-25 06:48:59,531 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 06:48:59,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 06:48:59 BoogieIcfgContainer [2023-12-25 06:48:59,532 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 06:48:59,533 INFO L158 Benchmark]: Toolchain (without parser) took 871039.08ms. Allocated memory was 263.2MB in the beginning and 316.7MB in the end (delta: 53.5MB). Free memory was 211.6MB in the beginning and 148.1MB in the end (delta: 63.5MB). Peak memory consumption was 220.1MB. Max. memory is 8.0GB. [2023-12-25 06:48:59,533 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 177.2MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 06:48:59,533 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.10ms. Allocated memory is still 263.2MB. Free memory was 211.6MB in the beginning and 200.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 06:48:59,533 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.59ms. Allocated memory is still 263.2MB. Free memory was 200.0MB in the beginning and 198.3MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 06:48:59,533 INFO L158 Benchmark]: Boogie Preprocessor took 54.12ms. Allocated memory is still 263.2MB. Free memory was 198.3MB in the beginning and 196.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 06:48:59,533 INFO L158 Benchmark]: RCFGBuilder took 388.18ms. Allocated memory is still 263.2MB. Free memory was 196.1MB in the beginning and 180.1MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-25 06:48:59,534 INFO L158 Benchmark]: TraceAbstraction took 870342.29ms. Allocated memory was 263.2MB in the beginning and 316.7MB in the end (delta: 53.5MB). Free memory was 179.4MB in the beginning and 148.1MB in the end (delta: 31.3MB). Peak memory consumption was 188.6MB. Max. memory is 8.0GB. [2023-12-25 06:48:59,534 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.17ms. Allocated memory is still 177.2MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.10ms. Allocated memory is still 263.2MB. Free memory was 211.6MB in the beginning and 200.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.59ms. Allocated memory is still 263.2MB. Free memory was 200.0MB in the beginning and 198.3MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.12ms. Allocated memory is still 263.2MB. Free memory was 198.3MB in the beginning and 196.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 388.18ms. Allocated memory is still 263.2MB. Free memory was 196.1MB in the beginning and 180.1MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 870342.29ms. Allocated memory was 263.2MB in the beginning and 316.7MB in the end (delta: 53.5MB). Free memory was 179.4MB in the beginning and 148.1MB in the end (delta: 31.3MB). Peak memory consumption was 188.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 52). Cancelled while NwaCegarLoop was analyzing trace of length 86 with TraceHistMax 16,while TraceCheckSpWp was constructing backward predicates,while TransFormulaUtils was doing sequential composition of 5 TransFormulas,while SimplifyDDA2 was simplifying a ∧-11-1 term,while SimplifyDDA2 was simplifying 11 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 60). Cancelled while NwaCegarLoop was analyzing trace of length 86 with TraceHistMax 16,while TraceCheckSpWp was constructing backward predicates,while TransFormulaUtils was doing sequential composition of 5 TransFormulas,while SimplifyDDA2 was simplifying a ∧-11-1 term,while SimplifyDDA2 was simplifying 11 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 870.3s, OverallIterations: 31, TraceHistogramMax: 16, PathProgramHistogramMax: 15, EmptinessCheckTime: 0.0s, AutomataDifference: 170.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 26 mSolverCounterUnknown, 227 SdHoareTripleChecker+Valid, 136.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 227 mSDsluCounter, 1945 SdHoareTripleChecker+Invalid, 135.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 19218 IncrementalHoareTripleChecker+Unchecked, 1432 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1812 IncrementalHoareTripleChecker+Invalid, 21137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 513 mSDtfsCounter, 1812 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3191 GetRequests, 1805 SyntacticMatches, 390 SemanticMatches, 996 ConstructedPredicates, 555 IntricatePredicates, 0 DeprecatedPredicates, 2533 ImplicationChecksByTransitivity, 354.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=29, InterpolantAutomatonStates: 444, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 30 MinimizatonAttempts, 45 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.7s SsaConstructionTime, 64.1s SatisfiabilityAnalysisTime, 573.9s InterpolantComputationTime, 2709 NumberOfCodeBlocks, 2709 NumberOfCodeBlocksAsserted, 254 NumberOfCheckSat, 2651 ConstructedInterpolants, 1336 QuantifiedInterpolants, 55521 SizeOfPredicates, 2330 NumberOfNonLiveVariables, 19644 ConjunctsInSsa, 4624 ConjunctsInUnsatCore, 58 InterpolantComputations, 2 PerfectInterpolantSequences, 5516/10780 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown