/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/verifythis/lcp.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 23:32:38,049 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 23:32:38,050 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 23:32:38,083 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 23:32:38,084 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 23:32:38,084 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 23:32:38,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 23:32:38,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 23:32:38,087 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 23:32:38,088 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 23:32:38,088 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 23:32:38,089 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 23:32:38,089 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 23:32:38,090 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 23:32:38,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 23:32:38,091 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 23:32:38,091 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 23:32:38,092 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 23:32:38,093 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 23:32:38,094 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 23:32:38,094 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 23:32:38,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 23:32:38,096 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 23:32:38,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 23:32:38,097 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 23:32:38,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 23:32:38,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 23:32:38,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 23:32:38,099 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 23:32:38,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 23:32:38,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 23:32:38,100 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 23:32:38,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 23:32:38,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 23:32:38,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 23:32:38,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 23:32:38,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 23:32:38,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 23:32:38,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 23:32:38,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 23:32:38,103 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 23:32:38,104 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 23:32:38,104 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 23:32:38,118 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 23:32:38,118 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 23:32:38,119 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 23:32:38,119 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 23:32:38,119 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 23:32:38,119 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 23:32:38,119 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 23:32:38,120 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 23:32:38,120 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 23:32:38,120 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 23:32:38,120 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 23:32:38,120 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 23:32:38,120 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 23:32:38,120 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 23:32:38,120 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 23:32:38,120 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 23:32:38,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 23:32:38,121 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 23:32:38,121 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 23:32:38,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 23:32:38,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 23:32:38,121 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 23:32:38,121 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 23:32:38,121 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 23:32:38,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 23:32:38,121 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 23:32:38,121 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 23:32:38,122 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 23:32:38,122 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 23:32:38,122 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 23:32:38,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 23:32:38,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 23:32:38,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 23:32:38,306 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 23:32:38,306 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 23:32:38,307 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/lcp.c [2022-04-07 23:32:38,358 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa672eb7c/e4ecab136f7d439d8cf44e78f12eeea9/FLAG1177afedd [2022-04-07 23:32:38,740 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 23:32:38,740 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/lcp.c [2022-04-07 23:32:38,744 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa672eb7c/e4ecab136f7d439d8cf44e78f12eeea9/FLAG1177afedd [2022-04-07 23:32:38,755 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa672eb7c/e4ecab136f7d439d8cf44e78f12eeea9 [2022-04-07 23:32:38,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 23:32:38,759 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 23:32:38,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 23:32:38,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 23:32:38,763 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 23:32:38,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:32:38" (1/1) ... [2022-04-07 23:32:38,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b0a8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:38, skipping insertion in model container [2022-04-07 23:32:38,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:32:38" (1/1) ... [2022-04-07 23:32:38,769 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 23:32:38,780 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 23:32:38,921 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/lcp.c[515,528] [2022-04-07 23:32:38,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 23:32:38,958 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 23:32:38,971 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/lcp.c[515,528] [2022-04-07 23:32:38,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 23:32:39,000 INFO L208 MainTranslator]: Completed translation [2022-04-07 23:32:39,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:39 WrapperNode [2022-04-07 23:32:39,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 23:32:39,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 23:32:39,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 23:32:39,002 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 23:32:39,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:39" (1/1) ... [2022-04-07 23:32:39,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:39" (1/1) ... [2022-04-07 23:32:39,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:39" (1/1) ... [2022-04-07 23:32:39,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:39" (1/1) ... [2022-04-07 23:32:39,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:39" (1/1) ... [2022-04-07 23:32:39,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:39" (1/1) ... [2022-04-07 23:32:39,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:39" (1/1) ... [2022-04-07 23:32:39,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 23:32:39,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 23:32:39,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 23:32:39,043 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 23:32:39,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:39" (1/1) ... [2022-04-07 23:32:39,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 23:32:39,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:32:39,073 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 23:32:39,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 23:32:39,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 23:32:39,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 23:32:39,096 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 23:32:39,096 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 23:32:39,096 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 23:32:39,096 INFO L138 BoogieDeclarations]: Found implementation of procedure lcp [2022-04-07 23:32:39,097 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2022-04-07 23:32:39,097 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 23:32:39,097 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-07 23:32:39,097 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-07 23:32:39,097 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-04-07 23:32:39,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 23:32:39,097 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 23:32:39,097 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 23:32:39,097 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 23:32:39,097 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 23:32:39,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 23:32:39,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 23:32:39,097 INFO L130 BoogieDeclarations]: Found specification of procedure lcp [2022-04-07 23:32:39,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 23:32:39,098 INFO L130 BoogieDeclarations]: Found specification of procedure check [2022-04-07 23:32:39,098 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 23:32:39,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-07 23:32:39,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-07 23:32:39,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 23:32:39,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 23:32:39,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 23:32:39,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 23:32:39,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 23:32:39,151 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 23:32:39,152 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 23:32:39,424 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 23:32:39,429 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 23:32:39,429 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 23:32:39,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:32:39 BoogieIcfgContainer [2022-04-07 23:32:39,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 23:32:39,438 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 23:32:39,438 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 23:32:39,439 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 23:32:39,442 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:32:39" (1/1) ... [2022-04-07 23:32:39,444 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 23:32:39,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 11:32:39 BasicIcfg [2022-04-07 23:32:39,488 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 23:32:39,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 23:32:39,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 23:32:39,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 23:32:39,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 11:32:38" (1/4) ... [2022-04-07 23:32:39,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c9286ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:32:39, skipping insertion in model container [2022-04-07 23:32:39,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:39" (2/4) ... [2022-04-07 23:32:39,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c9286ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:32:39, skipping insertion in model container [2022-04-07 23:32:39,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:32:39" (3/4) ... [2022-04-07 23:32:39,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c9286ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 11:32:39, skipping insertion in model container [2022-04-07 23:32:39,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 11:32:39" (4/4) ... [2022-04-07 23:32:39,493 INFO L111 eAbstractionObserver]: Analyzing ICFG lcp.cqvasr [2022-04-07 23:32:39,497 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 23:32:39,497 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 23:32:39,537 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 23:32:39,543 INFO L340 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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 [2022-04-07 23:32:39,544 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 23:32:39,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 23:32:39,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-07 23:32:39,564 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:32:39,564 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:32:39,564 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:32:39,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:32:39,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1603802952, now seen corresponding path program 1 times [2022-04-07 23:32:39,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:32:39,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966964694] [2022-04-07 23:32:39,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:32:39,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:32:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:39,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:32:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:39,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {77#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [96] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1)) (.cse1 (select |v_#memory_int_5| 2))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= (select .cse1 3) 46) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= 112 (select .cse1 2)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select .cse1 4) 99) (= (select .cse1 5) 0) (= 6 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {52#true} is VALID [2022-04-07 23:32:39,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {52#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52#true} is VALID [2022-04-07 23:32:39,752 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52#true} {52#true} [141] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52#true} is VALID [2022-04-07 23:32:39,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 23:32:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:39,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {52#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {52#true} is VALID [2022-04-07 23:32:39,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {52#true} [104] L6-->L6-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {53#false} is VALID [2022-04-07 23:32:39,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {53#false} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53#false} is VALID [2022-04-07 23:32:39,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53#false} {52#true} [142] assume_abort_if_notEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (< v_main_~n~0_7 1073741824) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {53#false} is VALID [2022-04-07 23:32:39,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 23:32:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:39,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {78#(= |#memory_int| |old(#memory_int)|)} [107] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {52#true} is VALID [2022-04-07 23:32:39,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {52#true} [110] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52#true} is VALID [2022-04-07 23:32:39,796 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52#true} {53#false} [145] #Ultimate.meminitEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc15.base_4|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_main_~n~0_8 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_8 4)) (= |v_#Ultimate.meminit_#ptr.offsetInParam_1| |v_main_#t~malloc15.offset_4|)) InVars {main_#t~malloc15.offset=|v_main_#t~malloc15.offset_4|, main_~n~0=v_main_~n~0_8, main_#t~malloc15.base=|v_main_#t~malloc15.base_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[main_#t~malloc15.offset, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_~n~0, #Ultimate.meminit_#ptr.base, main_#t~malloc15.base, #Ultimate.meminit_#ptr.offset] {53#false} is VALID [2022-04-07 23:32:39,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 23:32:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:39,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {52#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {52#true} is VALID [2022-04-07 23:32:39,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {52#true} [104] L6-->L6-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {53#false} is VALID [2022-04-07 23:32:39,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {53#false} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53#false} is VALID [2022-04-07 23:32:39,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53#false} {53#false} [143] assume_abort_if_notEXIT-->L43-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_5) (<= 0 v_main_~x~0_5)) 1 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, assume_abort_if_not_#in~cond] {53#false} is VALID [2022-04-07 23:32:39,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-07 23:32:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:39,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {52#true} [114] lcpENTRY-->L18-5: Formula: (and (= v_lcp_~a.base_1 |v_lcp_#in~a.base_1|) (= v_lcp_~n_1 |v_lcp_#in~n_1|) (= v_lcp_~l~0_1 0) (= v_lcp_~x_1 |v_lcp_#in~x_1|) (= v_lcp_~y_1 |v_lcp_#in~y_1|) (= |v_lcp_#in~a.offset_1| v_lcp_~a.offset_1)) InVars {lcp_#in~a.base=|v_lcp_#in~a.base_1|, lcp_#in~a.offset=|v_lcp_#in~a.offset_1|, lcp_#in~n=|v_lcp_#in~n_1|, lcp_#in~y=|v_lcp_#in~y_1|, lcp_#in~x=|v_lcp_#in~x_1|} OutVars{lcp_~x=v_lcp_~x_1, lcp_#in~a.offset=|v_lcp_#in~a.offset_1|, lcp_~l~0=v_lcp_~l~0_1, lcp_~a.offset=v_lcp_~a.offset_1, lcp_~y=v_lcp_~y_1, lcp_#in~y=|v_lcp_#in~y_1|, lcp_~a.base=v_lcp_~a.base_1, lcp_#in~x=|v_lcp_#in~x_1|, lcp_#in~a.base=|v_lcp_#in~a.base_1|, lcp_#in~n=|v_lcp_#in~n_1|, lcp_~n=v_lcp_~n_1} AuxVars[] AssignedVars[lcp_~x, lcp_~l~0, lcp_~a.offset, lcp_~y, lcp_~a.base, lcp_~n] {52#true} is VALID [2022-04-07 23:32:39,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {52#true} [117] L18-5-->L18-6: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {53#false} is VALID [2022-04-07 23:32:39,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {53#false} [123] L18-6-->lcpFINAL: Formula: (= |v_lcp_#res_1| v_lcp_~l~0_4) InVars {lcp_~l~0=v_lcp_~l~0_4} OutVars{lcp_#res=|v_lcp_#res_1|, lcp_~l~0=v_lcp_~l~0_4} AuxVars[] AssignedVars[lcp_#res] {53#false} is VALID [2022-04-07 23:32:39,819 INFO L290 TraceCheckUtils]: 3: Hoare triple {53#false} [132] lcpFINAL-->lcpEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53#false} is VALID [2022-04-07 23:32:39,820 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {53#false} {53#false} [147] lcpEXIT-->L44: AOR: Formula: (= |v_lcp_#resOutParam_1| |v_main_#t~ret18_4|) InVars {lcp_#res=|v_lcp_#resOutParam_1|} OutVars{main_#t~ret18=|v_main_#t~ret18_4|} AuxVars[] AssignedVars[main_#t~ret18, lcp_#res] LVA: Formula: (and (= v_main_~y~0_6 |v_lcp_#in~yInParam_1|) (= |v_lcp_#in~nInParam_1| v_main_~n~0_9) (= v_main_~x~0_6 |v_lcp_#in~xInParam_1|) (= |v_lcp_#in~a.offsetInParam_1| v_main_~a~0.offset_5) (= |v_lcp_#in~a.baseInParam_1| v_main_~a~0.base_5)) InVars {main_~a~0.base=v_main_~a~0.base_5, main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_6, main_~a~0.offset=v_main_~a~0.offset_5} OutVars{lcp_#in~a.base=|v_lcp_#in~a.baseInParam_1|, lcp_#in~a.offset=|v_lcp_#in~a.offsetInParam_1|, lcp_#in~n=|v_lcp_#in~nInParam_1|, lcp_#in~y=|v_lcp_#in~yInParam_1|, lcp_#in~x=|v_lcp_#in~xInParam_1|} AuxVars[] AssignedVars[lcp_#in~a.offset, lcp_#in~y, main_~x~0, lcp_#in~x, lcp_#in~a.base, main_~a~0.base, lcp_#in~n, main_~y~0, main_~n~0, main_~a~0.offset] {53#false} is VALID [2022-04-07 23:32:39,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-04-07 23:32:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:39,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {52#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {52#true} is VALID [2022-04-07 23:32:39,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {52#true} [104] L6-->L6-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {53#false} is VALID [2022-04-07 23:32:39,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {53#false} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53#false} is VALID [2022-04-07 23:32:39,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53#false} {53#false} [144] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= 0 v_check_~i~0_4) (< v_check_~i~0_4 v_check_~l_5)) 1 0)) InVars {check_~i~0=v_check_~i~0_4, check_~l=v_check_~l_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[check_~i~0, assume_abort_if_not_#in~cond, check_~l] {53#false} is VALID [2022-04-07 23:32:39,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {52#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {77#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:32:39,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {77#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [96] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1)) (.cse1 (select |v_#memory_int_5| 2))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= (select .cse1 3) 46) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= 112 (select .cse1 2)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select .cse1 4) 99) (= (select .cse1 5) 0) (= 6 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {52#true} is VALID [2022-04-07 23:32:39,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {52#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52#true} is VALID [2022-04-07 23:32:39,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52#true} {52#true} [141] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52#true} is VALID [2022-04-07 23:32:39,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {52#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52#true} is VALID [2022-04-07 23:32:39,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {52#true} [98] mainENTRY-->L38: Formula: (and (<= |v_main_#t~nondet14_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet14_2|) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[main_#t~nondet14, main_~n~0] {52#true} is VALID [2022-04-07 23:32:39,834 INFO L272 TraceCheckUtils]: 6: Hoare triple {52#true} [100] L38-->assume_abort_if_notENTRY: Formula: (= (ite (and (< v_main_~n~0_7 1073741824) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {52#true} is VALID [2022-04-07 23:32:39,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {52#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {52#true} is VALID [2022-04-07 23:32:39,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {52#true} [104] L6-->L6-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {53#false} is VALID [2022-04-07 23:32:39,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {53#false} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53#false} is VALID [2022-04-07 23:32:39,835 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {53#false} {52#true} [142] assume_abort_if_notEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (< v_main_~n~0_7 1073741824) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {53#false} is VALID [2022-04-07 23:32:39,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {53#false} [101] L38-1-->L39: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_main_#t~malloc15.base_1| 1)) (not (= |v_main_#t~malloc15.base_1| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_#t~malloc15.base_1| (* v_main_~n~0_5 4))) (< |v_main_#t~malloc15.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_4| |v_main_#t~malloc15.base_1|) 0) (= |v_main_#t~malloc15.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, main_~n~0=v_main_~n~0_5, #valid=|v_#valid_4|} OutVars{main_#t~malloc15.offset=|v_main_#t~malloc15.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_3|, #length=|v_#length_1|, main_~n~0=v_main_~n~0_5, main_#t~malloc15.base=|v_main_#t~malloc15.base_1|} AuxVars[] AssignedVars[main_#t~malloc15.offset, #valid, #length, main_#t~malloc15.base] {53#false} is VALID [2022-04-07 23:32:39,836 INFO L272 TraceCheckUtils]: 12: Hoare triple {53#false} [103] L39-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc15.base_4|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_main_~n~0_8 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_8 4)) (= |v_#Ultimate.meminit_#ptr.offsetInParam_1| |v_main_#t~malloc15.offset_4|)) InVars {main_#t~malloc15.offset=|v_main_#t~malloc15.offset_4|, main_~n~0=v_main_~n~0_8, main_#t~malloc15.base=|v_main_#t~malloc15.base_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[main_#t~malloc15.offset, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_~n~0, #Ultimate.meminit_#ptr.base, main_#t~malloc15.base, #Ultimate.meminit_#ptr.offset] {78#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-07 23:32:39,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {78#(= |#memory_int| |old(#memory_int)|)} [107] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {52#true} is VALID [2022-04-07 23:32:39,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {52#true} [110] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52#true} is VALID [2022-04-07 23:32:39,836 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {52#true} {53#false} [145] #Ultimate.meminitEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc15.base_4|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_main_~n~0_8 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_8 4)) (= |v_#Ultimate.meminit_#ptr.offsetInParam_1| |v_main_#t~malloc15.offset_4|)) InVars {main_#t~malloc15.offset=|v_main_#t~malloc15.offset_4|, main_~n~0=v_main_~n~0_8, main_#t~malloc15.base=|v_main_#t~malloc15.base_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[main_#t~malloc15.offset, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_~n~0, #Ultimate.meminit_#ptr.base, main_#t~malloc15.base, #Ultimate.meminit_#ptr.offset] {53#false} is VALID [2022-04-07 23:32:39,837 INFO L290 TraceCheckUtils]: 16: Hoare triple {53#false} [106] L39-1-->L43: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~a~0.offset_4 |v_main_#t~malloc15.offset_3|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet17_2|) (= v_main_~x~0_3 |v_main_#t~nondet16_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (= v_main_~a~0.base_4 |v_main_#t~malloc15.base_3|)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~malloc15.offset=|v_main_#t~malloc15.offset_3|, main_#t~malloc15.base=|v_main_#t~malloc15.base_3|, main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_#t~malloc15.offset=|v_main_#t~malloc15.offset_3|, main_~x~0=v_main_~x~0_3, main_~a~0.base=v_main_~a~0.base_4, main_~y~0=v_main_~y~0_3, main_#t~malloc15.base=|v_main_#t~malloc15.base_3|, main_~a~0.offset=v_main_~a~0.offset_4} AuxVars[] AssignedVars[main_#t~nondet16, main_~x~0, main_#t~nondet17, main_~a~0.base, main_~y~0, main_~a~0.offset] {53#false} is VALID [2022-04-07 23:32:39,837 INFO L272 TraceCheckUtils]: 17: Hoare triple {53#false} [109] L43-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_5) (<= 0 v_main_~x~0_5)) 1 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, assume_abort_if_not_#in~cond] {52#true} is VALID [2022-04-07 23:32:39,838 INFO L290 TraceCheckUtils]: 18: Hoare triple {52#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {52#true} is VALID [2022-04-07 23:32:39,838 INFO L290 TraceCheckUtils]: 19: Hoare triple {52#true} [104] L6-->L6-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {53#false} is VALID [2022-04-07 23:32:39,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {53#false} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53#false} is VALID [2022-04-07 23:32:39,839 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {53#false} {53#false} [143] assume_abort_if_notEXIT-->L43-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_5) (<= 0 v_main_~x~0_5)) 1 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, assume_abort_if_not_#in~cond] {53#false} is VALID [2022-04-07 23:32:39,839 INFO L272 TraceCheckUtils]: 22: Hoare triple {53#false} [111] L43-1-->lcpENTRY: Formula: (and (= v_main_~y~0_6 |v_lcp_#in~yInParam_1|) (= |v_lcp_#in~nInParam_1| v_main_~n~0_9) (= v_main_~x~0_6 |v_lcp_#in~xInParam_1|) (= |v_lcp_#in~a.offsetInParam_1| v_main_~a~0.offset_5) (= |v_lcp_#in~a.baseInParam_1| v_main_~a~0.base_5)) InVars {main_~a~0.base=v_main_~a~0.base_5, main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_6, main_~a~0.offset=v_main_~a~0.offset_5} OutVars{lcp_#in~a.base=|v_lcp_#in~a.baseInParam_1|, lcp_#in~a.offset=|v_lcp_#in~a.offsetInParam_1|, lcp_#in~n=|v_lcp_#in~nInParam_1|, lcp_#in~y=|v_lcp_#in~yInParam_1|, lcp_#in~x=|v_lcp_#in~xInParam_1|} AuxVars[] AssignedVars[lcp_#in~a.offset, lcp_#in~y, main_~x~0, lcp_#in~x, lcp_#in~a.base, main_~a~0.base, lcp_#in~n, main_~y~0, main_~n~0, main_~a~0.offset] {52#true} is VALID [2022-04-07 23:32:39,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {52#true} [114] lcpENTRY-->L18-5: Formula: (and (= v_lcp_~a.base_1 |v_lcp_#in~a.base_1|) (= v_lcp_~n_1 |v_lcp_#in~n_1|) (= v_lcp_~l~0_1 0) (= v_lcp_~x_1 |v_lcp_#in~x_1|) (= v_lcp_~y_1 |v_lcp_#in~y_1|) (= |v_lcp_#in~a.offset_1| v_lcp_~a.offset_1)) InVars {lcp_#in~a.base=|v_lcp_#in~a.base_1|, lcp_#in~a.offset=|v_lcp_#in~a.offset_1|, lcp_#in~n=|v_lcp_#in~n_1|, lcp_#in~y=|v_lcp_#in~y_1|, lcp_#in~x=|v_lcp_#in~x_1|} OutVars{lcp_~x=v_lcp_~x_1, lcp_#in~a.offset=|v_lcp_#in~a.offset_1|, lcp_~l~0=v_lcp_~l~0_1, lcp_~a.offset=v_lcp_~a.offset_1, lcp_~y=v_lcp_~y_1, lcp_#in~y=|v_lcp_#in~y_1|, lcp_~a.base=v_lcp_~a.base_1, lcp_#in~x=|v_lcp_#in~x_1|, lcp_#in~a.base=|v_lcp_#in~a.base_1|, lcp_#in~n=|v_lcp_#in~n_1|, lcp_~n=v_lcp_~n_1} AuxVars[] AssignedVars[lcp_~x, lcp_~l~0, lcp_~a.offset, lcp_~y, lcp_~a.base, lcp_~n] {52#true} is VALID [2022-04-07 23:32:39,840 INFO L290 TraceCheckUtils]: 24: Hoare triple {52#true} [117] L18-5-->L18-6: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {53#false} is VALID [2022-04-07 23:32:39,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {53#false} [123] L18-6-->lcpFINAL: Formula: (= |v_lcp_#res_1| v_lcp_~l~0_4) InVars {lcp_~l~0=v_lcp_~l~0_4} OutVars{lcp_#res=|v_lcp_#res_1|, lcp_~l~0=v_lcp_~l~0_4} AuxVars[] AssignedVars[lcp_#res] {53#false} is VALID [2022-04-07 23:32:39,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {53#false} [132] lcpFINAL-->lcpEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53#false} is VALID [2022-04-07 23:32:39,844 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {53#false} {53#false} [147] lcpEXIT-->L44: AOR: Formula: (= |v_lcp_#resOutParam_1| |v_main_#t~ret18_4|) InVars {lcp_#res=|v_lcp_#resOutParam_1|} OutVars{main_#t~ret18=|v_main_#t~ret18_4|} AuxVars[] AssignedVars[main_#t~ret18, lcp_#res] LVA: Formula: (and (= v_main_~y~0_6 |v_lcp_#in~yInParam_1|) (= |v_lcp_#in~nInParam_1| v_main_~n~0_9) (= v_main_~x~0_6 |v_lcp_#in~xInParam_1|) (= |v_lcp_#in~a.offsetInParam_1| v_main_~a~0.offset_5) (= |v_lcp_#in~a.baseInParam_1| v_main_~a~0.base_5)) InVars {main_~a~0.base=v_main_~a~0.base_5, main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_6, main_~a~0.offset=v_main_~a~0.offset_5} OutVars{lcp_#in~a.base=|v_lcp_#in~a.baseInParam_1|, lcp_#in~a.offset=|v_lcp_#in~a.offsetInParam_1|, lcp_#in~n=|v_lcp_#in~nInParam_1|, lcp_#in~y=|v_lcp_#in~yInParam_1|, lcp_#in~x=|v_lcp_#in~xInParam_1|} AuxVars[] AssignedVars[lcp_#in~a.offset, lcp_#in~y, main_~x~0, lcp_#in~x, lcp_#in~a.base, main_~a~0.base, lcp_#in~n, main_~y~0, main_~n~0, main_~a~0.offset] {53#false} is VALID [2022-04-07 23:32:39,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {53#false} [113] L44-->L45: Formula: (and (<= |v_main_#t~ret18_3| 2147483647) (= v_main_~l~1_1 |v_main_#t~ret18_3|) (<= 0 (+ |v_main_#t~ret18_3| 2147483648))) InVars {main_#t~ret18=|v_main_#t~ret18_3|} OutVars{main_~l~1=v_main_~l~1_1} AuxVars[] AssignedVars[main_#t~ret18, main_~l~1] {53#false} is VALID [2022-04-07 23:32:39,847 INFO L272 TraceCheckUtils]: 29: Hoare triple {53#false} [116] L45-->checkENTRY: Formula: (and (= v_main_~n~0_10 |v_check_#in~nInParam_1|) (= |v_check_#in~a.baseInParam_1| v_main_~a~0.base_6) (= v_main_~y~0_7 |v_check_#in~yInParam_1|) (= v_main_~x~0_7 |v_check_#in~xInParam_1|) (= |v_check_#in~a.offsetInParam_1| v_main_~a~0.offset_6) (= |v_check_#in~lInParam_1| v_main_~l~1_3)) InVars {main_~x~0=v_main_~x~0_7, main_~l~1=v_main_~l~1_3, main_~a~0.base=v_main_~a~0.base_6, main_~y~0=v_main_~y~0_7, main_~n~0=v_main_~n~0_10, main_~a~0.offset=v_main_~a~0.offset_6} OutVars{check_#in~y=|v_check_#in~yInParam_1|, check_#in~x=|v_check_#in~xInParam_1|, check_#in~a.offset=|v_check_#in~a.offsetInParam_1|, check_#in~a.base=|v_check_#in~a.baseInParam_1|, check_#in~l=|v_check_#in~lInParam_1|, check_#in~n=|v_check_#in~nInParam_1|} AuxVars[] AssignedVars[check_#in~y, check_#in~x, check_#in~a.offset, main_~x~0, main_~l~1, check_#in~a.base, main_~a~0.base, main_~y~0, main_~n~0, check_#in~l, main_~a~0.offset, check_#in~n] {53#false} is VALID [2022-04-07 23:32:39,851 INFO L290 TraceCheckUtils]: 30: Hoare triple {53#false} [122] checkENTRY-->L27: Formula: (and (= v_check_~x_2 |v_check_#in~x_1|) (= |v_check_#in~a.offset_1| v_check_~a.offset_1) (= v_check_~i~0_1 |v_check_#t~nondet9_2|) (= v_check_~l_2 |v_check_#in~l_1|) (= v_check_~n_2 |v_check_#in~n_1|) (= v_check_~a.base_1 |v_check_#in~a.base_1|) (<= 0 (+ 2147483648 |v_check_#t~nondet9_2|)) (= v_check_~y_2 |v_check_#in~y_1|) (<= |v_check_#t~nondet9_2| 2147483647)) InVars {check_#in~y=|v_check_#in~y_1|, check_#in~x=|v_check_#in~x_1|, check_#in~a.offset=|v_check_#in~a.offset_1|, check_#in~a.base=|v_check_#in~a.base_1|, check_#in~l=|v_check_#in~l_1|, check_#t~nondet9=|v_check_#t~nondet9_2|, check_#in~n=|v_check_#in~n_1|} OutVars{check_#in~y=|v_check_#in~y_1|, check_#in~x=|v_check_#in~x_1|, check_#in~a.offset=|v_check_#in~a.offset_1|, check_~a.base=v_check_~a.base_1, check_~i~0=v_check_~i~0_1, check_~y=v_check_~y_2, check_~x=v_check_~x_2, check_~a.offset=v_check_~a.offset_1, check_#in~a.base=|v_check_#in~a.base_1|, check_#in~l=|v_check_#in~l_1|, check_~n=v_check_~n_2, check_#in~n=|v_check_#in~n_1|, check_~l=v_check_~l_2} AuxVars[] AssignedVars[check_~y, check_~x, check_~a.base, check_~a.offset, check_~i~0, check_~n, check_#t~nondet9, check_~l] {53#false} is VALID [2022-04-07 23:32:39,851 INFO L272 TraceCheckUtils]: 31: Hoare triple {53#false} [131] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= 0 v_check_~i~0_4) (< v_check_~i~0_4 v_check_~l_5)) 1 0)) InVars {check_~i~0=v_check_~i~0_4, check_~l=v_check_~l_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[check_~i~0, assume_abort_if_not_#in~cond, check_~l] {52#true} is VALID [2022-04-07 23:32:39,852 INFO L290 TraceCheckUtils]: 32: Hoare triple {52#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {52#true} is VALID [2022-04-07 23:32:39,853 INFO L290 TraceCheckUtils]: 33: Hoare triple {52#true} [104] L6-->L6-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {53#false} is VALID [2022-04-07 23:32:39,853 INFO L290 TraceCheckUtils]: 34: Hoare triple {53#false} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53#false} is VALID [2022-04-07 23:32:39,854 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {53#false} {53#false} [144] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= 0 v_check_~i~0_4) (< v_check_~i~0_4 v_check_~l_5)) 1 0)) InVars {check_~i~0=v_check_~i~0_4, check_~l=v_check_~l_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[check_~i~0, assume_abort_if_not_#in~cond, check_~l] {53#false} is VALID [2022-04-07 23:32:39,854 INFO L290 TraceCheckUtils]: 36: Hoare triple {53#false} [112] L27-1-->L28: Formula: (let ((.cse0 (select |v_#memory_int_3| v_check_~a.base_2)) (.cse1 (* v_check_~i~0_3 4))) (and (= (select .cse0 (+ (* v_check_~y_3 4) v_check_~a.offset_2 .cse1)) |v_check_#t~mem11_1|) (= (select .cse0 (+ (* v_check_~x_3 4) v_check_~a.offset_2 .cse1)) |v_check_#t~mem10_1|))) InVars {check_~y=v_check_~y_3, check_~x=v_check_~x_3, check_~a.base=v_check_~a.base_2, check_~a.offset=v_check_~a.offset_2, check_~i~0=v_check_~i~0_3, #memory_int=|v_#memory_int_3|} OutVars{check_~y=v_check_~y_3, check_~x=v_check_~x_3, check_#t~mem10=|v_check_#t~mem10_1|, check_~a.base=v_check_~a.base_2, check_~a.offset=v_check_~a.offset_2, check_~i~0=v_check_~i~0_3, check_#t~mem11=|v_check_#t~mem11_1|, #memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[check_#t~mem10, check_#t~mem11] {53#false} is VALID [2022-04-07 23:32:39,854 INFO L272 TraceCheckUtils]: 37: Hoare triple {53#false} [115] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= |v_check_#t~mem11_4| |v_check_#t~mem10_4|) 1 0)) InVars {check_#t~mem10=|v_check_#t~mem10_4|, check_#t~mem11=|v_check_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, check_#t~mem10, check_#t~mem11] {53#false} is VALID [2022-04-07 23:32:39,854 INFO L290 TraceCheckUtils]: 38: Hoare triple {53#false} [120] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {53#false} is VALID [2022-04-07 23:32:39,854 INFO L290 TraceCheckUtils]: 39: Hoare triple {53#false} [128] L13-->L13-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {53#false} is VALID [2022-04-07 23:32:39,855 INFO L290 TraceCheckUtils]: 40: Hoare triple {53#false} [137] L13-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53#false} is VALID [2022-04-07 23:32:39,855 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 23:32:39,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:32:39,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966964694] [2022-04-07 23:32:39,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966964694] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:32:39,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:32:39,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 23:32:39,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528695618] [2022-04-07 23:32:39,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:32:39,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-04-07 23:32:39,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:32:39,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 23:32:39,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:32:39,920 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 23:32:39,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:32:39,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 23:32:39,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 23:32:39,956 INFO L87 Difference]: Start difference. First operand has 49 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 23:32:40,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:40,197 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2022-04-07 23:32:40,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 23:32:40,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-04-07 23:32:40,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:32:40,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 23:32:40,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2022-04-07 23:32:40,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 23:32:40,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2022-04-07 23:32:40,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 113 transitions. [2022-04-07 23:32:40,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:32:40,317 INFO L225 Difference]: With dead ends: 91 [2022-04-07 23:32:40,318 INFO L226 Difference]: Without dead ends: 41 [2022-04-07 23:32:40,320 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 23:32:40,324 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 56 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 23:32:40,325 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 43 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 23:32:40,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-07 23:32:40,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-07 23:32:40,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:32:40,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 23:32:40,349 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 23:32:40,351 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 23:32:40,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:40,357 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-04-07 23:32:40,357 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-07 23:32:40,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:32:40,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:32:40,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-07 23:32:40,358 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-07 23:32:40,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:40,371 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-04-07 23:32:40,371 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-07 23:32:40,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:32:40,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:32:40,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:32:40,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:32:40,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 23:32:40,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-04-07 23:32:40,377 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 41 [2022-04-07 23:32:40,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:32:40,378 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-04-07 23:32:40,378 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 23:32:40,378 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-07 23:32:40,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-07 23:32:40,379 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:32:40,379 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:32:40,379 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 23:32:40,379 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:32:40,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:32:40,380 INFO L85 PathProgramCache]: Analyzing trace with hash -345645567, now seen corresponding path program 1 times [2022-04-07 23:32:40,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:32:40,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420126359] [2022-04-07 23:32:40,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:32:40,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:32:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:40,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:32:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:40,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [96] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1)) (.cse1 (select |v_#memory_int_5| 2))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= (select .cse1 3) 46) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= 112 (select .cse1 2)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select .cse1 4) 99) (= (select .cse1 5) 0) (= 6 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {347#true} is VALID [2022-04-07 23:32:40,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:32:40,541 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {347#true} {347#true} [141] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:32:40,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 23:32:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:40,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {347#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {347#true} is VALID [2022-04-07 23:32:40,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:32:40,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {347#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:32:40,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {347#true} {347#true} [142] assume_abort_if_notEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (< v_main_~n~0_7 1073741824) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {347#true} is VALID [2022-04-07 23:32:40,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 23:32:40,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:40,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {377#(= |#memory_int| |old(#memory_int)|)} [107] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {378#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-07 23:32:40,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {378#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} [110] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-07 23:32:40,569 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {378#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {347#true} [145] #Ultimate.meminitEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc15.base_4|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_main_~n~0_8 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_8 4)) (= |v_#Ultimate.meminit_#ptr.offsetInParam_1| |v_main_#t~malloc15.offset_4|)) InVars {main_#t~malloc15.offset=|v_main_#t~malloc15.offset_4|, main_~n~0=v_main_~n~0_8, main_#t~malloc15.base=|v_main_#t~malloc15.base_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[main_#t~malloc15.offset, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_~n~0, #Ultimate.meminit_#ptr.base, main_#t~malloc15.base, #Ultimate.meminit_#ptr.offset] {359#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|))} is VALID [2022-04-07 23:32:40,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 23:32:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:40,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {347#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {347#true} is VALID [2022-04-07 23:32:40,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:32:40,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {347#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:32:40,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {347#true} {360#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [143] assume_abort_if_notEXIT-->L43-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_5) (<= 0 v_main_~x~0_5)) 1 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, assume_abort_if_not_#in~cond] {360#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-07 23:32:40,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-07 23:32:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:40,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {347#true} [114] lcpENTRY-->L18-5: Formula: (and (= v_lcp_~a.base_1 |v_lcp_#in~a.base_1|) (= v_lcp_~n_1 |v_lcp_#in~n_1|) (= v_lcp_~l~0_1 0) (= v_lcp_~x_1 |v_lcp_#in~x_1|) (= v_lcp_~y_1 |v_lcp_#in~y_1|) (= |v_lcp_#in~a.offset_1| v_lcp_~a.offset_1)) InVars {lcp_#in~a.base=|v_lcp_#in~a.base_1|, lcp_#in~a.offset=|v_lcp_#in~a.offset_1|, lcp_#in~n=|v_lcp_#in~n_1|, lcp_#in~y=|v_lcp_#in~y_1|, lcp_#in~x=|v_lcp_#in~x_1|} OutVars{lcp_~x=v_lcp_~x_1, lcp_#in~a.offset=|v_lcp_#in~a.offset_1|, lcp_~l~0=v_lcp_~l~0_1, lcp_~a.offset=v_lcp_~a.offset_1, lcp_~y=v_lcp_~y_1, lcp_#in~y=|v_lcp_#in~y_1|, lcp_~a.base=v_lcp_~a.base_1, lcp_#in~x=|v_lcp_#in~x_1|, lcp_#in~a.base=|v_lcp_#in~a.base_1|, lcp_#in~n=|v_lcp_#in~n_1|, lcp_~n=v_lcp_~n_1} AuxVars[] AssignedVars[lcp_~x, lcp_~l~0, lcp_~a.offset, lcp_~y, lcp_~a.base, lcp_~n] {379#(= |lcp_#in~a.base| lcp_~a.base)} is VALID [2022-04-07 23:32:40,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {379#(= |lcp_#in~a.base| lcp_~a.base)} [118] L18-5-->L18-1: Formula: (let ((.cse1 (< (+ v_lcp_~y_2 v_lcp_~l~0_5) v_lcp_~n_2)) (.cse0 (< (+ v_lcp_~x_2 v_lcp_~l~0_5) v_lcp_~n_2))) (or (and (or (not .cse0) (not .cse1)) (not |v_lcp_#t~short7_5|)) (and .cse1 .cse0 |v_lcp_#t~short7_5|))) InVars {lcp_~x=v_lcp_~x_2, lcp_~l~0=v_lcp_~l~0_5, lcp_~y=v_lcp_~y_2, lcp_~n=v_lcp_~n_2} OutVars{lcp_~x=v_lcp_~x_2, lcp_#t~short7=|v_lcp_#t~short7_5|, lcp_~l~0=v_lcp_~l~0_5, lcp_~y=v_lcp_~y_2, lcp_~n=v_lcp_~n_2} AuxVars[] AssignedVars[lcp_#t~short7] {379#(= |lcp_#in~a.base| lcp_~a.base)} is VALID [2022-04-07 23:32:40,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {379#(= |lcp_#in~a.base| lcp_~a.base)} [124] L18-1-->L18-3: Formula: (let ((.cse0 (select |v_#memory_int_6| v_lcp_~a.base_2)) (.cse1 (* v_lcp_~l~0_6 4))) (and (= (select .cse0 (+ v_lcp_~a.offset_2 .cse1 (* v_lcp_~y_3 4))) |v_lcp_#t~mem6_3|) (let ((.cse2 (= |v_lcp_#t~mem6_3| |v_lcp_#t~mem5_3|))) (or (and (not |v_lcp_#t~short7_6|) (not .cse2)) (and .cse2 |v_lcp_#t~short7_6|))) (= |v_lcp_#t~mem5_3| (select .cse0 (+ v_lcp_~a.offset_2 .cse1 (* v_lcp_~x_3 4)))) |v_lcp_#t~short7_7|)) InVars {lcp_~x=v_lcp_~x_3, lcp_~a.offset=v_lcp_~a.offset_2, lcp_~l~0=v_lcp_~l~0_6, lcp_~y=v_lcp_~y_3, lcp_~a.base=v_lcp_~a.base_2, #memory_int=|v_#memory_int_6|, lcp_#t~short7=|v_lcp_#t~short7_7|} OutVars{lcp_~x=v_lcp_~x_3, lcp_~a.offset=v_lcp_~a.offset_2, lcp_~l~0=v_lcp_~l~0_6, lcp_~y=v_lcp_~y_3, lcp_~a.base=v_lcp_~a.base_2, lcp_#t~mem6=|v_lcp_#t~mem6_3|, #memory_int=|v_#memory_int_6|, lcp_#t~short7=|v_lcp_#t~short7_6|, lcp_#t~mem5=|v_lcp_#t~mem5_3|} AuxVars[] AssignedVars[lcp_#t~mem6, lcp_#t~short7, lcp_#t~mem5] {380#(or |lcp_#t~short7| (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |lcp_#in~a.base|))))} is VALID [2022-04-07 23:32:40,638 INFO L290 TraceCheckUtils]: 3: Hoare triple {380#(or |lcp_#t~short7| (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |lcp_#in~a.base|))))} [133] L18-3-->L18-6: Formula: (not |v_lcp_#t~short7_2|) InVars {lcp_#t~short7=|v_lcp_#t~short7_2|} OutVars{lcp_#t~mem6=|v_lcp_#t~mem6_1|, lcp_#t~mem5=|v_lcp_#t~mem5_1|} AuxVars[] AssignedVars[lcp_#t~mem6, lcp_#t~mem5, lcp_#t~short7] {381#(not (= ((as const (Array Int Int)) 0) (select |#memory_int| |lcp_#in~a.base|)))} is VALID [2022-04-07 23:32:40,638 INFO L290 TraceCheckUtils]: 4: Hoare triple {381#(not (= ((as const (Array Int Int)) 0) (select |#memory_int| |lcp_#in~a.base|)))} [123] L18-6-->lcpFINAL: Formula: (= |v_lcp_#res_1| v_lcp_~l~0_4) InVars {lcp_~l~0=v_lcp_~l~0_4} OutVars{lcp_#res=|v_lcp_#res_1|, lcp_~l~0=v_lcp_~l~0_4} AuxVars[] AssignedVars[lcp_#res] {381#(not (= ((as const (Array Int Int)) 0) (select |#memory_int| |lcp_#in~a.base|)))} is VALID [2022-04-07 23:32:40,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {381#(not (= ((as const (Array Int Int)) 0) (select |#memory_int| |lcp_#in~a.base|)))} [132] lcpFINAL-->lcpEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {381#(not (= ((as const (Array Int Int)) 0) (select |#memory_int| |lcp_#in~a.base|)))} is VALID [2022-04-07 23:32:40,640 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {381#(not (= ((as const (Array Int Int)) 0) (select |#memory_int| |lcp_#in~a.base|)))} {360#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [147] lcpEXIT-->L44: AOR: Formula: (= |v_lcp_#resOutParam_1| |v_main_#t~ret18_4|) InVars {lcp_#res=|v_lcp_#resOutParam_1|} OutVars{main_#t~ret18=|v_main_#t~ret18_4|} AuxVars[] AssignedVars[main_#t~ret18, lcp_#res] LVA: Formula: (and (= v_main_~y~0_6 |v_lcp_#in~yInParam_1|) (= |v_lcp_#in~nInParam_1| v_main_~n~0_9) (= v_main_~x~0_6 |v_lcp_#in~xInParam_1|) (= |v_lcp_#in~a.offsetInParam_1| v_main_~a~0.offset_5) (= |v_lcp_#in~a.baseInParam_1| v_main_~a~0.base_5)) InVars {main_~a~0.base=v_main_~a~0.base_5, main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_6, main_~a~0.offset=v_main_~a~0.offset_5} OutVars{lcp_#in~a.base=|v_lcp_#in~a.baseInParam_1|, lcp_#in~a.offset=|v_lcp_#in~a.offsetInParam_1|, lcp_#in~n=|v_lcp_#in~nInParam_1|, lcp_#in~y=|v_lcp_#in~yInParam_1|, lcp_#in~x=|v_lcp_#in~xInParam_1|} AuxVars[] AssignedVars[lcp_#in~a.offset, lcp_#in~y, main_~x~0, lcp_#in~x, lcp_#in~a.base, main_~a~0.base, lcp_#in~n, main_~y~0, main_~n~0, main_~a~0.offset] {348#false} is VALID [2022-04-07 23:32:40,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-07 23:32:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:40,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {347#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {347#true} is VALID [2022-04-07 23:32:40,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:32:40,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {347#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:32:40,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {347#true} {348#false} [144] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= 0 v_check_~i~0_4) (< v_check_~i~0_4 v_check_~l_5)) 1 0)) InVars {check_~i~0=v_check_~i~0_4, check_~l=v_check_~l_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[check_~i~0, assume_abort_if_not_#in~cond, check_~l] {348#false} is VALID [2022-04-07 23:32:40,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {347#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:32:40,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [96] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1)) (.cse1 (select |v_#memory_int_5| 2))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= (select .cse1 3) 46) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= 112 (select .cse1 2)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select .cse1 4) 99) (= (select .cse1 5) 0) (= 6 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {347#true} is VALID [2022-04-07 23:32:40,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {347#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:32:40,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {347#true} {347#true} [141] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:32:40,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {347#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:32:40,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {347#true} [98] mainENTRY-->L38: Formula: (and (<= |v_main_#t~nondet14_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet14_2|) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[main_#t~nondet14, main_~n~0] {347#true} is VALID [2022-04-07 23:32:40,648 INFO L272 TraceCheckUtils]: 6: Hoare triple {347#true} [100] L38-->assume_abort_if_notENTRY: Formula: (= (ite (and (< v_main_~n~0_7 1073741824) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {347#true} is VALID [2022-04-07 23:32:40,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {347#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {347#true} is VALID [2022-04-07 23:32:40,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {347#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:32:40,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {347#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:32:40,649 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {347#true} {347#true} [142] assume_abort_if_notEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (< v_main_~n~0_7 1073741824) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {347#true} is VALID [2022-04-07 23:32:40,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {347#true} [101] L38-1-->L39: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_main_#t~malloc15.base_1| 1)) (not (= |v_main_#t~malloc15.base_1| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_#t~malloc15.base_1| (* v_main_~n~0_5 4))) (< |v_main_#t~malloc15.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_4| |v_main_#t~malloc15.base_1|) 0) (= |v_main_#t~malloc15.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, main_~n~0=v_main_~n~0_5, #valid=|v_#valid_4|} OutVars{main_#t~malloc15.offset=|v_main_#t~malloc15.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_3|, #length=|v_#length_1|, main_~n~0=v_main_~n~0_5, main_#t~malloc15.base=|v_main_#t~malloc15.base_1|} AuxVars[] AssignedVars[main_#t~malloc15.offset, #valid, #length, main_#t~malloc15.base] {347#true} is VALID [2022-04-07 23:32:40,652 INFO L272 TraceCheckUtils]: 12: Hoare triple {347#true} [103] L39-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc15.base_4|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_main_~n~0_8 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_8 4)) (= |v_#Ultimate.meminit_#ptr.offsetInParam_1| |v_main_#t~malloc15.offset_4|)) InVars {main_#t~malloc15.offset=|v_main_#t~malloc15.offset_4|, main_~n~0=v_main_~n~0_8, main_#t~malloc15.base=|v_main_#t~malloc15.base_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[main_#t~malloc15.offset, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_~n~0, #Ultimate.meminit_#ptr.base, main_#t~malloc15.base, #Ultimate.meminit_#ptr.offset] {377#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-07 23:32:40,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {377#(= |#memory_int| |old(#memory_int)|)} [107] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {378#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-07 23:32:40,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {378#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} [110] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-07 23:32:40,654 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {378#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {347#true} [145] #Ultimate.meminitEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc15.base_4|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_main_~n~0_8 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_8 4)) (= |v_#Ultimate.meminit_#ptr.offsetInParam_1| |v_main_#t~malloc15.offset_4|)) InVars {main_#t~malloc15.offset=|v_main_#t~malloc15.offset_4|, main_~n~0=v_main_~n~0_8, main_#t~malloc15.base=|v_main_#t~malloc15.base_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[main_#t~malloc15.offset, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_~n~0, #Ultimate.meminit_#ptr.base, main_#t~malloc15.base, #Ultimate.meminit_#ptr.offset] {359#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|))} is VALID [2022-04-07 23:32:40,655 INFO L290 TraceCheckUtils]: 16: Hoare triple {359#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|))} [106] L39-1-->L43: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~a~0.offset_4 |v_main_#t~malloc15.offset_3|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet17_2|) (= v_main_~x~0_3 |v_main_#t~nondet16_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (= v_main_~a~0.base_4 |v_main_#t~malloc15.base_3|)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~malloc15.offset=|v_main_#t~malloc15.offset_3|, main_#t~malloc15.base=|v_main_#t~malloc15.base_3|, main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_#t~malloc15.offset=|v_main_#t~malloc15.offset_3|, main_~x~0=v_main_~x~0_3, main_~a~0.base=v_main_~a~0.base_4, main_~y~0=v_main_~y~0_3, main_#t~malloc15.base=|v_main_#t~malloc15.base_3|, main_~a~0.offset=v_main_~a~0.offset_4} AuxVars[] AssignedVars[main_#t~nondet16, main_~x~0, main_#t~nondet17, main_~a~0.base, main_~y~0, main_~a~0.offset] {360#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-07 23:32:40,655 INFO L272 TraceCheckUtils]: 17: Hoare triple {360#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [109] L43-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_5) (<= 0 v_main_~x~0_5)) 1 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, assume_abort_if_not_#in~cond] {347#true} is VALID [2022-04-07 23:32:40,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {347#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {347#true} is VALID [2022-04-07 23:32:40,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {347#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:32:40,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {347#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:32:40,656 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {347#true} {360#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [143] assume_abort_if_notEXIT-->L43-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_5) (<= 0 v_main_~x~0_5)) 1 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, assume_abort_if_not_#in~cond] {360#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-07 23:32:40,657 INFO L272 TraceCheckUtils]: 22: Hoare triple {360#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [111] L43-1-->lcpENTRY: Formula: (and (= v_main_~y~0_6 |v_lcp_#in~yInParam_1|) (= |v_lcp_#in~nInParam_1| v_main_~n~0_9) (= v_main_~x~0_6 |v_lcp_#in~xInParam_1|) (= |v_lcp_#in~a.offsetInParam_1| v_main_~a~0.offset_5) (= |v_lcp_#in~a.baseInParam_1| v_main_~a~0.base_5)) InVars {main_~a~0.base=v_main_~a~0.base_5, main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_6, main_~a~0.offset=v_main_~a~0.offset_5} OutVars{lcp_#in~a.base=|v_lcp_#in~a.baseInParam_1|, lcp_#in~a.offset=|v_lcp_#in~a.offsetInParam_1|, lcp_#in~n=|v_lcp_#in~nInParam_1|, lcp_#in~y=|v_lcp_#in~yInParam_1|, lcp_#in~x=|v_lcp_#in~xInParam_1|} AuxVars[] AssignedVars[lcp_#in~a.offset, lcp_#in~y, main_~x~0, lcp_#in~x, lcp_#in~a.base, main_~a~0.base, lcp_#in~n, main_~y~0, main_~n~0, main_~a~0.offset] {347#true} is VALID [2022-04-07 23:32:40,657 INFO L290 TraceCheckUtils]: 23: Hoare triple {347#true} [114] lcpENTRY-->L18-5: Formula: (and (= v_lcp_~a.base_1 |v_lcp_#in~a.base_1|) (= v_lcp_~n_1 |v_lcp_#in~n_1|) (= v_lcp_~l~0_1 0) (= v_lcp_~x_1 |v_lcp_#in~x_1|) (= v_lcp_~y_1 |v_lcp_#in~y_1|) (= |v_lcp_#in~a.offset_1| v_lcp_~a.offset_1)) InVars {lcp_#in~a.base=|v_lcp_#in~a.base_1|, lcp_#in~a.offset=|v_lcp_#in~a.offset_1|, lcp_#in~n=|v_lcp_#in~n_1|, lcp_#in~y=|v_lcp_#in~y_1|, lcp_#in~x=|v_lcp_#in~x_1|} OutVars{lcp_~x=v_lcp_~x_1, lcp_#in~a.offset=|v_lcp_#in~a.offset_1|, lcp_~l~0=v_lcp_~l~0_1, lcp_~a.offset=v_lcp_~a.offset_1, lcp_~y=v_lcp_~y_1, lcp_#in~y=|v_lcp_#in~y_1|, lcp_~a.base=v_lcp_~a.base_1, lcp_#in~x=|v_lcp_#in~x_1|, lcp_#in~a.base=|v_lcp_#in~a.base_1|, lcp_#in~n=|v_lcp_#in~n_1|, lcp_~n=v_lcp_~n_1} AuxVars[] AssignedVars[lcp_~x, lcp_~l~0, lcp_~a.offset, lcp_~y, lcp_~a.base, lcp_~n] {379#(= |lcp_#in~a.base| lcp_~a.base)} is VALID [2022-04-07 23:32:40,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {379#(= |lcp_#in~a.base| lcp_~a.base)} [118] L18-5-->L18-1: Formula: (let ((.cse1 (< (+ v_lcp_~y_2 v_lcp_~l~0_5) v_lcp_~n_2)) (.cse0 (< (+ v_lcp_~x_2 v_lcp_~l~0_5) v_lcp_~n_2))) (or (and (or (not .cse0) (not .cse1)) (not |v_lcp_#t~short7_5|)) (and .cse1 .cse0 |v_lcp_#t~short7_5|))) InVars {lcp_~x=v_lcp_~x_2, lcp_~l~0=v_lcp_~l~0_5, lcp_~y=v_lcp_~y_2, lcp_~n=v_lcp_~n_2} OutVars{lcp_~x=v_lcp_~x_2, lcp_#t~short7=|v_lcp_#t~short7_5|, lcp_~l~0=v_lcp_~l~0_5, lcp_~y=v_lcp_~y_2, lcp_~n=v_lcp_~n_2} AuxVars[] AssignedVars[lcp_#t~short7] {379#(= |lcp_#in~a.base| lcp_~a.base)} is VALID [2022-04-07 23:32:40,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {379#(= |lcp_#in~a.base| lcp_~a.base)} [124] L18-1-->L18-3: Formula: (let ((.cse0 (select |v_#memory_int_6| v_lcp_~a.base_2)) (.cse1 (* v_lcp_~l~0_6 4))) (and (= (select .cse0 (+ v_lcp_~a.offset_2 .cse1 (* v_lcp_~y_3 4))) |v_lcp_#t~mem6_3|) (let ((.cse2 (= |v_lcp_#t~mem6_3| |v_lcp_#t~mem5_3|))) (or (and (not |v_lcp_#t~short7_6|) (not .cse2)) (and .cse2 |v_lcp_#t~short7_6|))) (= |v_lcp_#t~mem5_3| (select .cse0 (+ v_lcp_~a.offset_2 .cse1 (* v_lcp_~x_3 4)))) |v_lcp_#t~short7_7|)) InVars {lcp_~x=v_lcp_~x_3, lcp_~a.offset=v_lcp_~a.offset_2, lcp_~l~0=v_lcp_~l~0_6, lcp_~y=v_lcp_~y_3, lcp_~a.base=v_lcp_~a.base_2, #memory_int=|v_#memory_int_6|, lcp_#t~short7=|v_lcp_#t~short7_7|} OutVars{lcp_~x=v_lcp_~x_3, lcp_~a.offset=v_lcp_~a.offset_2, lcp_~l~0=v_lcp_~l~0_6, lcp_~y=v_lcp_~y_3, lcp_~a.base=v_lcp_~a.base_2, lcp_#t~mem6=|v_lcp_#t~mem6_3|, #memory_int=|v_#memory_int_6|, lcp_#t~short7=|v_lcp_#t~short7_6|, lcp_#t~mem5=|v_lcp_#t~mem5_3|} AuxVars[] AssignedVars[lcp_#t~mem6, lcp_#t~short7, lcp_#t~mem5] {380#(or |lcp_#t~short7| (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |lcp_#in~a.base|))))} is VALID [2022-04-07 23:32:40,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {380#(or |lcp_#t~short7| (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |lcp_#in~a.base|))))} [133] L18-3-->L18-6: Formula: (not |v_lcp_#t~short7_2|) InVars {lcp_#t~short7=|v_lcp_#t~short7_2|} OutVars{lcp_#t~mem6=|v_lcp_#t~mem6_1|, lcp_#t~mem5=|v_lcp_#t~mem5_1|} AuxVars[] AssignedVars[lcp_#t~mem6, lcp_#t~mem5, lcp_#t~short7] {381#(not (= ((as const (Array Int Int)) 0) (select |#memory_int| |lcp_#in~a.base|)))} is VALID [2022-04-07 23:32:40,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {381#(not (= ((as const (Array Int Int)) 0) (select |#memory_int| |lcp_#in~a.base|)))} [123] L18-6-->lcpFINAL: Formula: (= |v_lcp_#res_1| v_lcp_~l~0_4) InVars {lcp_~l~0=v_lcp_~l~0_4} OutVars{lcp_#res=|v_lcp_#res_1|, lcp_~l~0=v_lcp_~l~0_4} AuxVars[] AssignedVars[lcp_#res] {381#(not (= ((as const (Array Int Int)) 0) (select |#memory_int| |lcp_#in~a.base|)))} is VALID [2022-04-07 23:32:40,662 INFO L290 TraceCheckUtils]: 28: Hoare triple {381#(not (= ((as const (Array Int Int)) 0) (select |#memory_int| |lcp_#in~a.base|)))} [132] lcpFINAL-->lcpEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {381#(not (= ((as const (Array Int Int)) 0) (select |#memory_int| |lcp_#in~a.base|)))} is VALID [2022-04-07 23:32:40,663 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {381#(not (= ((as const (Array Int Int)) 0) (select |#memory_int| |lcp_#in~a.base|)))} {360#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [147] lcpEXIT-->L44: AOR: Formula: (= |v_lcp_#resOutParam_1| |v_main_#t~ret18_4|) InVars {lcp_#res=|v_lcp_#resOutParam_1|} OutVars{main_#t~ret18=|v_main_#t~ret18_4|} AuxVars[] AssignedVars[main_#t~ret18, lcp_#res] LVA: Formula: (and (= v_main_~y~0_6 |v_lcp_#in~yInParam_1|) (= |v_lcp_#in~nInParam_1| v_main_~n~0_9) (= v_main_~x~0_6 |v_lcp_#in~xInParam_1|) (= |v_lcp_#in~a.offsetInParam_1| v_main_~a~0.offset_5) (= |v_lcp_#in~a.baseInParam_1| v_main_~a~0.base_5)) InVars {main_~a~0.base=v_main_~a~0.base_5, main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_6, main_~a~0.offset=v_main_~a~0.offset_5} OutVars{lcp_#in~a.base=|v_lcp_#in~a.baseInParam_1|, lcp_#in~a.offset=|v_lcp_#in~a.offsetInParam_1|, lcp_#in~n=|v_lcp_#in~nInParam_1|, lcp_#in~y=|v_lcp_#in~yInParam_1|, lcp_#in~x=|v_lcp_#in~xInParam_1|} AuxVars[] AssignedVars[lcp_#in~a.offset, lcp_#in~y, main_~x~0, lcp_#in~x, lcp_#in~a.base, main_~a~0.base, lcp_#in~n, main_~y~0, main_~n~0, main_~a~0.offset] {348#false} is VALID [2022-04-07 23:32:40,673 INFO L290 TraceCheckUtils]: 30: Hoare triple {348#false} [113] L44-->L45: Formula: (and (<= |v_main_#t~ret18_3| 2147483647) (= v_main_~l~1_1 |v_main_#t~ret18_3|) (<= 0 (+ |v_main_#t~ret18_3| 2147483648))) InVars {main_#t~ret18=|v_main_#t~ret18_3|} OutVars{main_~l~1=v_main_~l~1_1} AuxVars[] AssignedVars[main_#t~ret18, main_~l~1] {348#false} is VALID [2022-04-07 23:32:40,673 INFO L272 TraceCheckUtils]: 31: Hoare triple {348#false} [116] L45-->checkENTRY: Formula: (and (= v_main_~n~0_10 |v_check_#in~nInParam_1|) (= |v_check_#in~a.baseInParam_1| v_main_~a~0.base_6) (= v_main_~y~0_7 |v_check_#in~yInParam_1|) (= v_main_~x~0_7 |v_check_#in~xInParam_1|) (= |v_check_#in~a.offsetInParam_1| v_main_~a~0.offset_6) (= |v_check_#in~lInParam_1| v_main_~l~1_3)) InVars {main_~x~0=v_main_~x~0_7, main_~l~1=v_main_~l~1_3, main_~a~0.base=v_main_~a~0.base_6, main_~y~0=v_main_~y~0_7, main_~n~0=v_main_~n~0_10, main_~a~0.offset=v_main_~a~0.offset_6} OutVars{check_#in~y=|v_check_#in~yInParam_1|, check_#in~x=|v_check_#in~xInParam_1|, check_#in~a.offset=|v_check_#in~a.offsetInParam_1|, check_#in~a.base=|v_check_#in~a.baseInParam_1|, check_#in~l=|v_check_#in~lInParam_1|, check_#in~n=|v_check_#in~nInParam_1|} AuxVars[] AssignedVars[check_#in~y, check_#in~x, check_#in~a.offset, main_~x~0, main_~l~1, check_#in~a.base, main_~a~0.base, main_~y~0, main_~n~0, check_#in~l, main_~a~0.offset, check_#in~n] {348#false} is VALID [2022-04-07 23:32:40,674 INFO L290 TraceCheckUtils]: 32: Hoare triple {348#false} [122] checkENTRY-->L27: Formula: (and (= v_check_~x_2 |v_check_#in~x_1|) (= |v_check_#in~a.offset_1| v_check_~a.offset_1) (= v_check_~i~0_1 |v_check_#t~nondet9_2|) (= v_check_~l_2 |v_check_#in~l_1|) (= v_check_~n_2 |v_check_#in~n_1|) (= v_check_~a.base_1 |v_check_#in~a.base_1|) (<= 0 (+ 2147483648 |v_check_#t~nondet9_2|)) (= v_check_~y_2 |v_check_#in~y_1|) (<= |v_check_#t~nondet9_2| 2147483647)) InVars {check_#in~y=|v_check_#in~y_1|, check_#in~x=|v_check_#in~x_1|, check_#in~a.offset=|v_check_#in~a.offset_1|, check_#in~a.base=|v_check_#in~a.base_1|, check_#in~l=|v_check_#in~l_1|, check_#t~nondet9=|v_check_#t~nondet9_2|, check_#in~n=|v_check_#in~n_1|} OutVars{check_#in~y=|v_check_#in~y_1|, check_#in~x=|v_check_#in~x_1|, check_#in~a.offset=|v_check_#in~a.offset_1|, check_~a.base=v_check_~a.base_1, check_~i~0=v_check_~i~0_1, check_~y=v_check_~y_2, check_~x=v_check_~x_2, check_~a.offset=v_check_~a.offset_1, check_#in~a.base=|v_check_#in~a.base_1|, check_#in~l=|v_check_#in~l_1|, check_~n=v_check_~n_2, check_#in~n=|v_check_#in~n_1|, check_~l=v_check_~l_2} AuxVars[] AssignedVars[check_~y, check_~x, check_~a.base, check_~a.offset, check_~i~0, check_~n, check_#t~nondet9, check_~l] {348#false} is VALID [2022-04-07 23:32:40,674 INFO L272 TraceCheckUtils]: 33: Hoare triple {348#false} [131] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= 0 v_check_~i~0_4) (< v_check_~i~0_4 v_check_~l_5)) 1 0)) InVars {check_~i~0=v_check_~i~0_4, check_~l=v_check_~l_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[check_~i~0, assume_abort_if_not_#in~cond, check_~l] {347#true} is VALID [2022-04-07 23:32:40,674 INFO L290 TraceCheckUtils]: 34: Hoare triple {347#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {347#true} is VALID [2022-04-07 23:32:40,674 INFO L290 TraceCheckUtils]: 35: Hoare triple {347#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:32:40,674 INFO L290 TraceCheckUtils]: 36: Hoare triple {347#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:32:40,674 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {347#true} {348#false} [144] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= 0 v_check_~i~0_4) (< v_check_~i~0_4 v_check_~l_5)) 1 0)) InVars {check_~i~0=v_check_~i~0_4, check_~l=v_check_~l_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[check_~i~0, assume_abort_if_not_#in~cond, check_~l] {348#false} is VALID [2022-04-07 23:32:40,675 INFO L290 TraceCheckUtils]: 38: Hoare triple {348#false} [112] L27-1-->L28: Formula: (let ((.cse0 (select |v_#memory_int_3| v_check_~a.base_2)) (.cse1 (* v_check_~i~0_3 4))) (and (= (select .cse0 (+ (* v_check_~y_3 4) v_check_~a.offset_2 .cse1)) |v_check_#t~mem11_1|) (= (select .cse0 (+ (* v_check_~x_3 4) v_check_~a.offset_2 .cse1)) |v_check_#t~mem10_1|))) InVars {check_~y=v_check_~y_3, check_~x=v_check_~x_3, check_~a.base=v_check_~a.base_2, check_~a.offset=v_check_~a.offset_2, check_~i~0=v_check_~i~0_3, #memory_int=|v_#memory_int_3|} OutVars{check_~y=v_check_~y_3, check_~x=v_check_~x_3, check_#t~mem10=|v_check_#t~mem10_1|, check_~a.base=v_check_~a.base_2, check_~a.offset=v_check_~a.offset_2, check_~i~0=v_check_~i~0_3, check_#t~mem11=|v_check_#t~mem11_1|, #memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[check_#t~mem10, check_#t~mem11] {348#false} is VALID [2022-04-07 23:32:40,675 INFO L272 TraceCheckUtils]: 39: Hoare triple {348#false} [115] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= |v_check_#t~mem11_4| |v_check_#t~mem10_4|) 1 0)) InVars {check_#t~mem10=|v_check_#t~mem10_4|, check_#t~mem11=|v_check_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, check_#t~mem10, check_#t~mem11] {348#false} is VALID [2022-04-07 23:32:40,675 INFO L290 TraceCheckUtils]: 40: Hoare triple {348#false} [120] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {348#false} is VALID [2022-04-07 23:32:40,675 INFO L290 TraceCheckUtils]: 41: Hoare triple {348#false} [128] L13-->L13-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {348#false} is VALID [2022-04-07 23:32:40,675 INFO L290 TraceCheckUtils]: 42: Hoare triple {348#false} [137] L13-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {348#false} is VALID [2022-04-07 23:32:40,676 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 23:32:40,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:32:40,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420126359] [2022-04-07 23:32:40,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420126359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:32:40,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:32:40,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-07 23:32:40,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045256156] [2022-04-07 23:32:40,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:32:40,677 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-04-07 23:32:40,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:32:40,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 23:32:40,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:32:40,715 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 23:32:40,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:32:40,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 23:32:40,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-04-07 23:32:40,716 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 23:32:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:41,476 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2022-04-07 23:32:41,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 23:32:41,476 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-04-07 23:32:41,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:32:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 23:32:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2022-04-07 23:32:41,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 23:32:41,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2022-04-07 23:32:41,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 69 transitions. [2022-04-07 23:32:41,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:32:41,547 INFO L225 Difference]: With dead ends: 64 [2022-04-07 23:32:41,547 INFO L226 Difference]: Without dead ends: 42 [2022-04-07 23:32:41,548 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-04-07 23:32:41,548 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 65 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 23:32:41,549 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 43 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 23:32:41,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-07 23:32:41,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-07 23:32:41,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:32:41,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 23:32:41,553 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 23:32:41,553 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 23:32:41,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:41,555 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-07 23:32:41,555 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-07 23:32:41,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:32:41,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:32:41,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 42 states. [2022-04-07 23:32:41,556 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 42 states. [2022-04-07 23:32:41,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:41,558 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-07 23:32:41,558 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-07 23:32:41,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:32:41,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:32:41,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:32:41,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:32:41,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 23:32:41,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-04-07 23:32:41,560 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 43 [2022-04-07 23:32:41,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:32:41,560 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-04-07 23:32:41,560 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 23:32:41,560 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-07 23:32:41,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-07 23:32:41,561 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:32:41,561 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:32:41,561 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 23:32:41,561 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:32:41,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:32:41,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1342717920, now seen corresponding path program 1 times [2022-04-07 23:32:41,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:32:41,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611820486] [2022-04-07 23:32:41,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:32:41,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:32:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:41,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:32:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:41,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [96] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1)) (.cse1 (select |v_#memory_int_5| 2))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= (select .cse1 3) 46) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= 112 (select .cse1 2)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select .cse1 4) 99) (= (select .cse1 5) 0) (= 6 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {632#true} is VALID [2022-04-07 23:32:41,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {632#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {632#true} is VALID [2022-04-07 23:32:41,677 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {632#true} {632#true} [141] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {632#true} is VALID [2022-04-07 23:32:41,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 23:32:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:41,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {632#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {632#true} is VALID [2022-04-07 23:32:41,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {632#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {632#true} is VALID [2022-04-07 23:32:41,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {632#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {632#true} is VALID [2022-04-07 23:32:41,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {632#true} {632#true} [142] assume_abort_if_notEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (< v_main_~n~0_7 1073741824) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {632#true} is VALID [2022-04-07 23:32:41,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 23:32:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:41,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {667#(= |#memory_int| |old(#memory_int)|)} [107] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {668#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-07 23:32:41,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {668#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} [110] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {668#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-07 23:32:41,703 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {668#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {632#true} [145] #Ultimate.meminitEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc15.base_4|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_main_~n~0_8 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_8 4)) (= |v_#Ultimate.meminit_#ptr.offsetInParam_1| |v_main_#t~malloc15.offset_4|)) InVars {main_#t~malloc15.offset=|v_main_#t~malloc15.offset_4|, main_~n~0=v_main_~n~0_8, main_#t~malloc15.base=|v_main_#t~malloc15.base_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[main_#t~malloc15.offset, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_~n~0, #Ultimate.meminit_#ptr.base, main_#t~malloc15.base, #Ultimate.meminit_#ptr.offset] {644#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|))} is VALID [2022-04-07 23:32:41,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 23:32:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:41,707 INFO L290 TraceCheckUtils]: 0: Hoare triple {632#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {632#true} is VALID [2022-04-07 23:32:41,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {632#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {632#true} is VALID [2022-04-07 23:32:41,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {632#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {632#true} is VALID [2022-04-07 23:32:41,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {632#true} {645#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [143] assume_abort_if_notEXIT-->L43-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_5) (<= 0 v_main_~x~0_5)) 1 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, assume_abort_if_not_#in~cond] {645#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-07 23:32:41,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-07 23:32:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:41,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {632#true} [114] lcpENTRY-->L18-5: Formula: (and (= v_lcp_~a.base_1 |v_lcp_#in~a.base_1|) (= v_lcp_~n_1 |v_lcp_#in~n_1|) (= v_lcp_~l~0_1 0) (= v_lcp_~x_1 |v_lcp_#in~x_1|) (= v_lcp_~y_1 |v_lcp_#in~y_1|) (= |v_lcp_#in~a.offset_1| v_lcp_~a.offset_1)) InVars {lcp_#in~a.base=|v_lcp_#in~a.base_1|, lcp_#in~a.offset=|v_lcp_#in~a.offset_1|, lcp_#in~n=|v_lcp_#in~n_1|, lcp_#in~y=|v_lcp_#in~y_1|, lcp_#in~x=|v_lcp_#in~x_1|} OutVars{lcp_~x=v_lcp_~x_1, lcp_#in~a.offset=|v_lcp_#in~a.offset_1|, lcp_~l~0=v_lcp_~l~0_1, lcp_~a.offset=v_lcp_~a.offset_1, lcp_~y=v_lcp_~y_1, lcp_#in~y=|v_lcp_#in~y_1|, lcp_~a.base=v_lcp_~a.base_1, lcp_#in~x=|v_lcp_#in~x_1|, lcp_#in~a.base=|v_lcp_#in~a.base_1|, lcp_#in~n=|v_lcp_#in~n_1|, lcp_~n=v_lcp_~n_1} AuxVars[] AssignedVars[lcp_~x, lcp_~l~0, lcp_~a.offset, lcp_~y, lcp_~a.base, lcp_~n] {632#true} is VALID [2022-04-07 23:32:41,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {632#true} [118] L18-5-->L18-1: Formula: (let ((.cse1 (< (+ v_lcp_~y_2 v_lcp_~l~0_5) v_lcp_~n_2)) (.cse0 (< (+ v_lcp_~x_2 v_lcp_~l~0_5) v_lcp_~n_2))) (or (and (or (not .cse0) (not .cse1)) (not |v_lcp_#t~short7_5|)) (and .cse1 .cse0 |v_lcp_#t~short7_5|))) InVars {lcp_~x=v_lcp_~x_2, lcp_~l~0=v_lcp_~l~0_5, lcp_~y=v_lcp_~y_2, lcp_~n=v_lcp_~n_2} OutVars{lcp_~x=v_lcp_~x_2, lcp_#t~short7=|v_lcp_#t~short7_5|, lcp_~l~0=v_lcp_~l~0_5, lcp_~y=v_lcp_~y_2, lcp_~n=v_lcp_~n_2} AuxVars[] AssignedVars[lcp_#t~short7] {632#true} is VALID [2022-04-07 23:32:41,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {632#true} [125] L18-1-->L18-3: Formula: (not |v_lcp_#t~short7_8|) InVars {lcp_#t~short7=|v_lcp_#t~short7_8|} OutVars{lcp_#t~short7=|v_lcp_#t~short7_8|} AuxVars[] AssignedVars[] {632#true} is VALID [2022-04-07 23:32:41,714 INFO L290 TraceCheckUtils]: 3: Hoare triple {632#true} [133] L18-3-->L18-6: Formula: (not |v_lcp_#t~short7_2|) InVars {lcp_#t~short7=|v_lcp_#t~short7_2|} OutVars{lcp_#t~mem6=|v_lcp_#t~mem6_1|, lcp_#t~mem5=|v_lcp_#t~mem5_1|} AuxVars[] AssignedVars[lcp_#t~mem6, lcp_#t~mem5, lcp_#t~short7] {632#true} is VALID [2022-04-07 23:32:41,714 INFO L290 TraceCheckUtils]: 4: Hoare triple {632#true} [123] L18-6-->lcpFINAL: Formula: (= |v_lcp_#res_1| v_lcp_~l~0_4) InVars {lcp_~l~0=v_lcp_~l~0_4} OutVars{lcp_#res=|v_lcp_#res_1|, lcp_~l~0=v_lcp_~l~0_4} AuxVars[] AssignedVars[lcp_#res] {632#true} is VALID [2022-04-07 23:32:41,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {632#true} [132] lcpFINAL-->lcpEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {632#true} is VALID [2022-04-07 23:32:41,727 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {632#true} {645#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [147] lcpEXIT-->L44: AOR: Formula: (= |v_lcp_#resOutParam_1| |v_main_#t~ret18_4|) InVars {lcp_#res=|v_lcp_#resOutParam_1|} OutVars{main_#t~ret18=|v_main_#t~ret18_4|} AuxVars[] AssignedVars[main_#t~ret18, lcp_#res] LVA: Formula: (and (= v_main_~y~0_6 |v_lcp_#in~yInParam_1|) (= |v_lcp_#in~nInParam_1| v_main_~n~0_9) (= v_main_~x~0_6 |v_lcp_#in~xInParam_1|) (= |v_lcp_#in~a.offsetInParam_1| v_main_~a~0.offset_5) (= |v_lcp_#in~a.baseInParam_1| v_main_~a~0.base_5)) InVars {main_~a~0.base=v_main_~a~0.base_5, main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_6, main_~a~0.offset=v_main_~a~0.offset_5} OutVars{lcp_#in~a.base=|v_lcp_#in~a.baseInParam_1|, lcp_#in~a.offset=|v_lcp_#in~a.offsetInParam_1|, lcp_#in~n=|v_lcp_#in~nInParam_1|, lcp_#in~y=|v_lcp_#in~yInParam_1|, lcp_#in~x=|v_lcp_#in~xInParam_1|} AuxVars[] AssignedVars[lcp_#in~a.offset, lcp_#in~y, main_~x~0, lcp_#in~x, lcp_#in~a.base, main_~a~0.base, lcp_#in~n, main_~y~0, main_~n~0, main_~a~0.offset] {645#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-07 23:32:41,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-07 23:32:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:41,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {632#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {632#true} is VALID [2022-04-07 23:32:41,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {632#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {632#true} is VALID [2022-04-07 23:32:41,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {632#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {632#true} is VALID [2022-04-07 23:32:41,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {632#true} {658#(and (= (select (select |#memory_int| check_~a.base) (+ (* check_~i~0 4) (* 4 check_~x) check_~a.offset)) 0) (= (select (select |#memory_int| check_~a.base) (+ (* check_~i~0 4) (* 4 check_~y) check_~a.offset)) 0))} [144] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= 0 v_check_~i~0_4) (< v_check_~i~0_4 v_check_~l_5)) 1 0)) InVars {check_~i~0=v_check_~i~0_4, check_~l=v_check_~l_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[check_~i~0, assume_abort_if_not_#in~cond, check_~l] {658#(and (= (select (select |#memory_int| check_~a.base) (+ (* check_~i~0 4) (* 4 check_~x) check_~a.offset)) 0) (= (select (select |#memory_int| check_~a.base) (+ (* check_~i~0 4) (* 4 check_~y) check_~a.offset)) 0))} is VALID [2022-04-07 23:32:41,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {632#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:32:41,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [96] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1)) (.cse1 (select |v_#memory_int_5| 2))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= (select .cse1 3) 46) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= 112 (select .cse1 2)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select .cse1 4) 99) (= (select .cse1 5) 0) (= 6 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {632#true} is VALID [2022-04-07 23:32:41,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {632#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {632#true} is VALID [2022-04-07 23:32:41,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {632#true} {632#true} [141] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {632#true} is VALID [2022-04-07 23:32:41,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {632#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {632#true} is VALID [2022-04-07 23:32:41,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {632#true} [98] mainENTRY-->L38: Formula: (and (<= |v_main_#t~nondet14_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet14_2|) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[main_#t~nondet14, main_~n~0] {632#true} is VALID [2022-04-07 23:32:41,734 INFO L272 TraceCheckUtils]: 6: Hoare triple {632#true} [100] L38-->assume_abort_if_notENTRY: Formula: (= (ite (and (< v_main_~n~0_7 1073741824) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {632#true} is VALID [2022-04-07 23:32:41,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {632#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {632#true} is VALID [2022-04-07 23:32:41,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {632#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {632#true} is VALID [2022-04-07 23:32:41,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {632#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {632#true} is VALID [2022-04-07 23:32:41,735 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {632#true} {632#true} [142] assume_abort_if_notEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (< v_main_~n~0_7 1073741824) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {632#true} is VALID [2022-04-07 23:32:41,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {632#true} [101] L38-1-->L39: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_main_#t~malloc15.base_1| 1)) (not (= |v_main_#t~malloc15.base_1| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_#t~malloc15.base_1| (* v_main_~n~0_5 4))) (< |v_main_#t~malloc15.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_4| |v_main_#t~malloc15.base_1|) 0) (= |v_main_#t~malloc15.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, main_~n~0=v_main_~n~0_5, #valid=|v_#valid_4|} OutVars{main_#t~malloc15.offset=|v_main_#t~malloc15.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_3|, #length=|v_#length_1|, main_~n~0=v_main_~n~0_5, main_#t~malloc15.base=|v_main_#t~malloc15.base_1|} AuxVars[] AssignedVars[main_#t~malloc15.offset, #valid, #length, main_#t~malloc15.base] {632#true} is VALID [2022-04-07 23:32:41,735 INFO L272 TraceCheckUtils]: 12: Hoare triple {632#true} [103] L39-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc15.base_4|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_main_~n~0_8 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_8 4)) (= |v_#Ultimate.meminit_#ptr.offsetInParam_1| |v_main_#t~malloc15.offset_4|)) InVars {main_#t~malloc15.offset=|v_main_#t~malloc15.offset_4|, main_~n~0=v_main_~n~0_8, main_#t~malloc15.base=|v_main_#t~malloc15.base_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[main_#t~malloc15.offset, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_~n~0, #Ultimate.meminit_#ptr.base, main_#t~malloc15.base, #Ultimate.meminit_#ptr.offset] {667#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-07 23:32:41,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {667#(= |#memory_int| |old(#memory_int)|)} [107] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {668#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-07 23:32:41,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {668#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} [110] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {668#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-07 23:32:41,737 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {668#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {632#true} [145] #Ultimate.meminitEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc15.base_4|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_main_~n~0_8 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_8 4)) (= |v_#Ultimate.meminit_#ptr.offsetInParam_1| |v_main_#t~malloc15.offset_4|)) InVars {main_#t~malloc15.offset=|v_main_#t~malloc15.offset_4|, main_~n~0=v_main_~n~0_8, main_#t~malloc15.base=|v_main_#t~malloc15.base_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[main_#t~malloc15.offset, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_~n~0, #Ultimate.meminit_#ptr.base, main_#t~malloc15.base, #Ultimate.meminit_#ptr.offset] {644#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|))} is VALID [2022-04-07 23:32:41,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {644#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|))} [106] L39-1-->L43: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~a~0.offset_4 |v_main_#t~malloc15.offset_3|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet17_2|) (= v_main_~x~0_3 |v_main_#t~nondet16_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (= v_main_~a~0.base_4 |v_main_#t~malloc15.base_3|)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~malloc15.offset=|v_main_#t~malloc15.offset_3|, main_#t~malloc15.base=|v_main_#t~malloc15.base_3|, main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_#t~malloc15.offset=|v_main_#t~malloc15.offset_3|, main_~x~0=v_main_~x~0_3, main_~a~0.base=v_main_~a~0.base_4, main_~y~0=v_main_~y~0_3, main_#t~malloc15.base=|v_main_#t~malloc15.base_3|, main_~a~0.offset=v_main_~a~0.offset_4} AuxVars[] AssignedVars[main_#t~nondet16, main_~x~0, main_#t~nondet17, main_~a~0.base, main_~y~0, main_~a~0.offset] {645#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-07 23:32:41,738 INFO L272 TraceCheckUtils]: 17: Hoare triple {645#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [109] L43-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_5) (<= 0 v_main_~x~0_5)) 1 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, assume_abort_if_not_#in~cond] {632#true} is VALID [2022-04-07 23:32:41,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {632#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {632#true} is VALID [2022-04-07 23:32:41,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {632#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {632#true} is VALID [2022-04-07 23:32:41,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {632#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {632#true} is VALID [2022-04-07 23:32:41,738 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {632#true} {645#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [143] assume_abort_if_notEXIT-->L43-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_5) (<= 0 v_main_~x~0_5)) 1 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, assume_abort_if_not_#in~cond] {645#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-07 23:32:41,738 INFO L272 TraceCheckUtils]: 22: Hoare triple {645#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [111] L43-1-->lcpENTRY: Formula: (and (= v_main_~y~0_6 |v_lcp_#in~yInParam_1|) (= |v_lcp_#in~nInParam_1| v_main_~n~0_9) (= v_main_~x~0_6 |v_lcp_#in~xInParam_1|) (= |v_lcp_#in~a.offsetInParam_1| v_main_~a~0.offset_5) (= |v_lcp_#in~a.baseInParam_1| v_main_~a~0.base_5)) InVars {main_~a~0.base=v_main_~a~0.base_5, main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_6, main_~a~0.offset=v_main_~a~0.offset_5} OutVars{lcp_#in~a.base=|v_lcp_#in~a.baseInParam_1|, lcp_#in~a.offset=|v_lcp_#in~a.offsetInParam_1|, lcp_#in~n=|v_lcp_#in~nInParam_1|, lcp_#in~y=|v_lcp_#in~yInParam_1|, lcp_#in~x=|v_lcp_#in~xInParam_1|} AuxVars[] AssignedVars[lcp_#in~a.offset, lcp_#in~y, main_~x~0, lcp_#in~x, lcp_#in~a.base, main_~a~0.base, lcp_#in~n, main_~y~0, main_~n~0, main_~a~0.offset] {632#true} is VALID [2022-04-07 23:32:41,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {632#true} [114] lcpENTRY-->L18-5: Formula: (and (= v_lcp_~a.base_1 |v_lcp_#in~a.base_1|) (= v_lcp_~n_1 |v_lcp_#in~n_1|) (= v_lcp_~l~0_1 0) (= v_lcp_~x_1 |v_lcp_#in~x_1|) (= v_lcp_~y_1 |v_lcp_#in~y_1|) (= |v_lcp_#in~a.offset_1| v_lcp_~a.offset_1)) InVars {lcp_#in~a.base=|v_lcp_#in~a.base_1|, lcp_#in~a.offset=|v_lcp_#in~a.offset_1|, lcp_#in~n=|v_lcp_#in~n_1|, lcp_#in~y=|v_lcp_#in~y_1|, lcp_#in~x=|v_lcp_#in~x_1|} OutVars{lcp_~x=v_lcp_~x_1, lcp_#in~a.offset=|v_lcp_#in~a.offset_1|, lcp_~l~0=v_lcp_~l~0_1, lcp_~a.offset=v_lcp_~a.offset_1, lcp_~y=v_lcp_~y_1, lcp_#in~y=|v_lcp_#in~y_1|, lcp_~a.base=v_lcp_~a.base_1, lcp_#in~x=|v_lcp_#in~x_1|, lcp_#in~a.base=|v_lcp_#in~a.base_1|, lcp_#in~n=|v_lcp_#in~n_1|, lcp_~n=v_lcp_~n_1} AuxVars[] AssignedVars[lcp_~x, lcp_~l~0, lcp_~a.offset, lcp_~y, lcp_~a.base, lcp_~n] {632#true} is VALID [2022-04-07 23:32:41,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {632#true} [118] L18-5-->L18-1: Formula: (let ((.cse1 (< (+ v_lcp_~y_2 v_lcp_~l~0_5) v_lcp_~n_2)) (.cse0 (< (+ v_lcp_~x_2 v_lcp_~l~0_5) v_lcp_~n_2))) (or (and (or (not .cse0) (not .cse1)) (not |v_lcp_#t~short7_5|)) (and .cse1 .cse0 |v_lcp_#t~short7_5|))) InVars {lcp_~x=v_lcp_~x_2, lcp_~l~0=v_lcp_~l~0_5, lcp_~y=v_lcp_~y_2, lcp_~n=v_lcp_~n_2} OutVars{lcp_~x=v_lcp_~x_2, lcp_#t~short7=|v_lcp_#t~short7_5|, lcp_~l~0=v_lcp_~l~0_5, lcp_~y=v_lcp_~y_2, lcp_~n=v_lcp_~n_2} AuxVars[] AssignedVars[lcp_#t~short7] {632#true} is VALID [2022-04-07 23:32:41,739 INFO L290 TraceCheckUtils]: 25: Hoare triple {632#true} [125] L18-1-->L18-3: Formula: (not |v_lcp_#t~short7_8|) InVars {lcp_#t~short7=|v_lcp_#t~short7_8|} OutVars{lcp_#t~short7=|v_lcp_#t~short7_8|} AuxVars[] AssignedVars[] {632#true} is VALID [2022-04-07 23:32:41,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {632#true} [133] L18-3-->L18-6: Formula: (not |v_lcp_#t~short7_2|) InVars {lcp_#t~short7=|v_lcp_#t~short7_2|} OutVars{lcp_#t~mem6=|v_lcp_#t~mem6_1|, lcp_#t~mem5=|v_lcp_#t~mem5_1|} AuxVars[] AssignedVars[lcp_#t~mem6, lcp_#t~mem5, lcp_#t~short7] {632#true} is VALID [2022-04-07 23:32:41,739 INFO L290 TraceCheckUtils]: 27: Hoare triple {632#true} [123] L18-6-->lcpFINAL: Formula: (= |v_lcp_#res_1| v_lcp_~l~0_4) InVars {lcp_~l~0=v_lcp_~l~0_4} OutVars{lcp_#res=|v_lcp_#res_1|, lcp_~l~0=v_lcp_~l~0_4} AuxVars[] AssignedVars[lcp_#res] {632#true} is VALID [2022-04-07 23:32:41,739 INFO L290 TraceCheckUtils]: 28: Hoare triple {632#true} [132] lcpFINAL-->lcpEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {632#true} is VALID [2022-04-07 23:32:41,740 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {632#true} {645#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [147] lcpEXIT-->L44: AOR: Formula: (= |v_lcp_#resOutParam_1| |v_main_#t~ret18_4|) InVars {lcp_#res=|v_lcp_#resOutParam_1|} OutVars{main_#t~ret18=|v_main_#t~ret18_4|} AuxVars[] AssignedVars[main_#t~ret18, lcp_#res] LVA: Formula: (and (= v_main_~y~0_6 |v_lcp_#in~yInParam_1|) (= |v_lcp_#in~nInParam_1| v_main_~n~0_9) (= v_main_~x~0_6 |v_lcp_#in~xInParam_1|) (= |v_lcp_#in~a.offsetInParam_1| v_main_~a~0.offset_5) (= |v_lcp_#in~a.baseInParam_1| v_main_~a~0.base_5)) InVars {main_~a~0.base=v_main_~a~0.base_5, main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_6, main_~a~0.offset=v_main_~a~0.offset_5} OutVars{lcp_#in~a.base=|v_lcp_#in~a.baseInParam_1|, lcp_#in~a.offset=|v_lcp_#in~a.offsetInParam_1|, lcp_#in~n=|v_lcp_#in~nInParam_1|, lcp_#in~y=|v_lcp_#in~yInParam_1|, lcp_#in~x=|v_lcp_#in~xInParam_1|} AuxVars[] AssignedVars[lcp_#in~a.offset, lcp_#in~y, main_~x~0, lcp_#in~x, lcp_#in~a.base, main_~a~0.base, lcp_#in~n, main_~y~0, main_~n~0, main_~a~0.offset] {645#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-07 23:32:41,740 INFO L290 TraceCheckUtils]: 30: Hoare triple {645#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [113] L44-->L45: Formula: (and (<= |v_main_#t~ret18_3| 2147483647) (= v_main_~l~1_1 |v_main_#t~ret18_3|) (<= 0 (+ |v_main_#t~ret18_3| 2147483648))) InVars {main_#t~ret18=|v_main_#t~ret18_3|} OutVars{main_~l~1=v_main_~l~1_1} AuxVars[] AssignedVars[main_#t~ret18, main_~l~1] {645#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-07 23:32:41,741 INFO L272 TraceCheckUtils]: 31: Hoare triple {645#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [116] L45-->checkENTRY: Formula: (and (= v_main_~n~0_10 |v_check_#in~nInParam_1|) (= |v_check_#in~a.baseInParam_1| v_main_~a~0.base_6) (= v_main_~y~0_7 |v_check_#in~yInParam_1|) (= v_main_~x~0_7 |v_check_#in~xInParam_1|) (= |v_check_#in~a.offsetInParam_1| v_main_~a~0.offset_6) (= |v_check_#in~lInParam_1| v_main_~l~1_3)) InVars {main_~x~0=v_main_~x~0_7, main_~l~1=v_main_~l~1_3, main_~a~0.base=v_main_~a~0.base_6, main_~y~0=v_main_~y~0_7, main_~n~0=v_main_~n~0_10, main_~a~0.offset=v_main_~a~0.offset_6} OutVars{check_#in~y=|v_check_#in~yInParam_1|, check_#in~x=|v_check_#in~xInParam_1|, check_#in~a.offset=|v_check_#in~a.offsetInParam_1|, check_#in~a.base=|v_check_#in~a.baseInParam_1|, check_#in~l=|v_check_#in~lInParam_1|, check_#in~n=|v_check_#in~nInParam_1|} AuxVars[] AssignedVars[check_#in~y, check_#in~x, check_#in~a.offset, main_~x~0, main_~l~1, check_#in~a.base, main_~a~0.base, main_~y~0, main_~n~0, check_#in~l, main_~a~0.offset, check_#in~n] {657#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2022-04-07 23:32:41,742 INFO L290 TraceCheckUtils]: 32: Hoare triple {657#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} [122] checkENTRY-->L27: Formula: (and (= v_check_~x_2 |v_check_#in~x_1|) (= |v_check_#in~a.offset_1| v_check_~a.offset_1) (= v_check_~i~0_1 |v_check_#t~nondet9_2|) (= v_check_~l_2 |v_check_#in~l_1|) (= v_check_~n_2 |v_check_#in~n_1|) (= v_check_~a.base_1 |v_check_#in~a.base_1|) (<= 0 (+ 2147483648 |v_check_#t~nondet9_2|)) (= v_check_~y_2 |v_check_#in~y_1|) (<= |v_check_#t~nondet9_2| 2147483647)) InVars {check_#in~y=|v_check_#in~y_1|, check_#in~x=|v_check_#in~x_1|, check_#in~a.offset=|v_check_#in~a.offset_1|, check_#in~a.base=|v_check_#in~a.base_1|, check_#in~l=|v_check_#in~l_1|, check_#t~nondet9=|v_check_#t~nondet9_2|, check_#in~n=|v_check_#in~n_1|} OutVars{check_#in~y=|v_check_#in~y_1|, check_#in~x=|v_check_#in~x_1|, check_#in~a.offset=|v_check_#in~a.offset_1|, check_~a.base=v_check_~a.base_1, check_~i~0=v_check_~i~0_1, check_~y=v_check_~y_2, check_~x=v_check_~x_2, check_~a.offset=v_check_~a.offset_1, check_#in~a.base=|v_check_#in~a.base_1|, check_#in~l=|v_check_#in~l_1|, check_~n=v_check_~n_2, check_#in~n=|v_check_#in~n_1|, check_~l=v_check_~l_2} AuxVars[] AssignedVars[check_~y, check_~x, check_~a.base, check_~a.offset, check_~i~0, check_~n, check_#t~nondet9, check_~l] {658#(and (= (select (select |#memory_int| check_~a.base) (+ (* check_~i~0 4) (* 4 check_~x) check_~a.offset)) 0) (= (select (select |#memory_int| check_~a.base) (+ (* check_~i~0 4) (* 4 check_~y) check_~a.offset)) 0))} is VALID [2022-04-07 23:32:41,742 INFO L272 TraceCheckUtils]: 33: Hoare triple {658#(and (= (select (select |#memory_int| check_~a.base) (+ (* check_~i~0 4) (* 4 check_~x) check_~a.offset)) 0) (= (select (select |#memory_int| check_~a.base) (+ (* check_~i~0 4) (* 4 check_~y) check_~a.offset)) 0))} [131] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= 0 v_check_~i~0_4) (< v_check_~i~0_4 v_check_~l_5)) 1 0)) InVars {check_~i~0=v_check_~i~0_4, check_~l=v_check_~l_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[check_~i~0, assume_abort_if_not_#in~cond, check_~l] {632#true} is VALID [2022-04-07 23:32:41,742 INFO L290 TraceCheckUtils]: 34: Hoare triple {632#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {632#true} is VALID [2022-04-07 23:32:41,742 INFO L290 TraceCheckUtils]: 35: Hoare triple {632#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {632#true} is VALID [2022-04-07 23:32:41,742 INFO L290 TraceCheckUtils]: 36: Hoare triple {632#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {632#true} is VALID [2022-04-07 23:32:41,743 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {632#true} {658#(and (= (select (select |#memory_int| check_~a.base) (+ (* check_~i~0 4) (* 4 check_~x) check_~a.offset)) 0) (= (select (select |#memory_int| check_~a.base) (+ (* check_~i~0 4) (* 4 check_~y) check_~a.offset)) 0))} [144] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= 0 v_check_~i~0_4) (< v_check_~i~0_4 v_check_~l_5)) 1 0)) InVars {check_~i~0=v_check_~i~0_4, check_~l=v_check_~l_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[check_~i~0, assume_abort_if_not_#in~cond, check_~l] {658#(and (= (select (select |#memory_int| check_~a.base) (+ (* check_~i~0 4) (* 4 check_~x) check_~a.offset)) 0) (= (select (select |#memory_int| check_~a.base) (+ (* check_~i~0 4) (* 4 check_~y) check_~a.offset)) 0))} is VALID [2022-04-07 23:32:41,743 INFO L290 TraceCheckUtils]: 38: Hoare triple {658#(and (= (select (select |#memory_int| check_~a.base) (+ (* check_~i~0 4) (* 4 check_~x) check_~a.offset)) 0) (= (select (select |#memory_int| check_~a.base) (+ (* check_~i~0 4) (* 4 check_~y) check_~a.offset)) 0))} [112] L27-1-->L28: Formula: (let ((.cse0 (select |v_#memory_int_3| v_check_~a.base_2)) (.cse1 (* v_check_~i~0_3 4))) (and (= (select .cse0 (+ (* v_check_~y_3 4) v_check_~a.offset_2 .cse1)) |v_check_#t~mem11_1|) (= (select .cse0 (+ (* v_check_~x_3 4) v_check_~a.offset_2 .cse1)) |v_check_#t~mem10_1|))) InVars {check_~y=v_check_~y_3, check_~x=v_check_~x_3, check_~a.base=v_check_~a.base_2, check_~a.offset=v_check_~a.offset_2, check_~i~0=v_check_~i~0_3, #memory_int=|v_#memory_int_3|} OutVars{check_~y=v_check_~y_3, check_~x=v_check_~x_3, check_#t~mem10=|v_check_#t~mem10_1|, check_~a.base=v_check_~a.base_2, check_~a.offset=v_check_~a.offset_2, check_~i~0=v_check_~i~0_3, check_#t~mem11=|v_check_#t~mem11_1|, #memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[check_#t~mem10, check_#t~mem11] {663#(= |check_#t~mem11| |check_#t~mem10|)} is VALID [2022-04-07 23:32:41,744 INFO L272 TraceCheckUtils]: 39: Hoare triple {663#(= |check_#t~mem11| |check_#t~mem10|)} [115] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= |v_check_#t~mem11_4| |v_check_#t~mem10_4|) 1 0)) InVars {check_#t~mem10=|v_check_#t~mem10_4|, check_#t~mem11=|v_check_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, check_#t~mem10, check_#t~mem11] {664#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 23:32:41,744 INFO L290 TraceCheckUtils]: 40: Hoare triple {664#(not (= |__VERIFIER_assert_#in~cond| 0))} [120] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {665#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 23:32:41,744 INFO L290 TraceCheckUtils]: 41: Hoare triple {665#(not (= __VERIFIER_assert_~cond 0))} [128] L13-->L13-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {633#false} is VALID [2022-04-07 23:32:41,744 INFO L290 TraceCheckUtils]: 42: Hoare triple {633#false} [137] L13-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {633#false} is VALID [2022-04-07 23:32:41,745 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 23:32:41,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:32:41,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611820486] [2022-04-07 23:32:41,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611820486] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:32:41,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:32:41,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-07 23:32:41,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321991472] [2022-04-07 23:32:41,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:32:41,746 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-04-07 23:32:41,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:32:41,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 23:32:41,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:32:41,768 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 23:32:41,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:32:41,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 23:32:41,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-04-07 23:32:41,768 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 23:32:42,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:42,627 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2022-04-07 23:32:42,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 23:32:42,627 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-04-07 23:32:42,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:32:42,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 23:32:42,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 50 transitions. [2022-04-07 23:32:42,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 23:32:42,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 50 transitions. [2022-04-07 23:32:42,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 50 transitions. [2022-04-07 23:32:42,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:32:42,673 INFO L225 Difference]: With dead ends: 48 [2022-04-07 23:32:42,673 INFO L226 Difference]: Without dead ends: 44 [2022-04-07 23:32:42,673 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2022-04-07 23:32:42,674 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 69 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-07 23:32:42,674 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 46 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-07 23:32:42,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-07 23:32:42,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-07 23:32:42,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:32:42,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 23:32:42,678 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 23:32:42,678 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 23:32:42,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:42,680 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2022-04-07 23:32:42,680 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-04-07 23:32:42,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:32:42,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:32:42,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-07 23:32:42,681 INFO L87 Difference]: Start difference. First operand has 44 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-07 23:32:42,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:42,682 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2022-04-07 23:32:42,682 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-04-07 23:32:42,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:32:42,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:32:42,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:32:42,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:32:42,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 23:32:42,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-04-07 23:32:42,684 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 43 [2022-04-07 23:32:42,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:32:42,684 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-04-07 23:32:42,684 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 23:32:42,684 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-04-07 23:32:42,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-07 23:32:42,685 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:32:42,685 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:32:42,685 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 23:32:42,685 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:32:42,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:32:42,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1707305611, now seen corresponding path program 1 times [2022-04-07 23:32:42,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:32:42,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647543996] [2022-04-07 23:32:42,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:32:42,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:32:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:42,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:32:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:42,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {945#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [96] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1)) (.cse1 (select |v_#memory_int_5| 2))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= (select .cse1 3) 46) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= 112 (select .cse1 2)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select .cse1 4) 99) (= (select .cse1 5) 0) (= 6 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {910#true} is VALID [2022-04-07 23:32:42,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {910#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {910#true} is VALID [2022-04-07 23:32:42,825 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {910#true} {910#true} [141] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {910#true} is VALID [2022-04-07 23:32:42,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 23:32:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:42,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {910#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {910#true} is VALID [2022-04-07 23:32:42,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {910#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {910#true} is VALID [2022-04-07 23:32:42,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {910#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {910#true} is VALID [2022-04-07 23:32:42,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {910#true} {910#true} [142] assume_abort_if_notEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (< v_main_~n~0_7 1073741824) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {910#true} is VALID [2022-04-07 23:32:42,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 23:32:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:42,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {946#(= |#memory_int| |old(#memory_int)|)} [107] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {910#true} is VALID [2022-04-07 23:32:42,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {910#true} [110] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {910#true} is VALID [2022-04-07 23:32:42,843 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {910#true} {910#true} [145] #Ultimate.meminitEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc15.base_4|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_main_~n~0_8 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_8 4)) (= |v_#Ultimate.meminit_#ptr.offsetInParam_1| |v_main_#t~malloc15.offset_4|)) InVars {main_#t~malloc15.offset=|v_main_#t~malloc15.offset_4|, main_~n~0=v_main_~n~0_8, main_#t~malloc15.base=|v_main_#t~malloc15.base_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[main_#t~malloc15.offset, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_~n~0, #Ultimate.meminit_#ptr.base, main_#t~malloc15.base, #Ultimate.meminit_#ptr.offset] {910#true} is VALID [2022-04-07 23:32:42,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 23:32:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:42,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {910#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {910#true} is VALID [2022-04-07 23:32:42,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {910#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {910#true} is VALID [2022-04-07 23:32:42,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {910#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {910#true} is VALID [2022-04-07 23:32:42,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {910#true} {910#true} [143] assume_abort_if_notEXIT-->L43-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_5) (<= 0 v_main_~x~0_5)) 1 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, assume_abort_if_not_#in~cond] {910#true} is VALID [2022-04-07 23:32:42,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-07 23:32:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:42,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {910#true} [114] lcpENTRY-->L18-5: Formula: (and (= v_lcp_~a.base_1 |v_lcp_#in~a.base_1|) (= v_lcp_~n_1 |v_lcp_#in~n_1|) (= v_lcp_~l~0_1 0) (= v_lcp_~x_1 |v_lcp_#in~x_1|) (= v_lcp_~y_1 |v_lcp_#in~y_1|) (= |v_lcp_#in~a.offset_1| v_lcp_~a.offset_1)) InVars {lcp_#in~a.base=|v_lcp_#in~a.base_1|, lcp_#in~a.offset=|v_lcp_#in~a.offset_1|, lcp_#in~n=|v_lcp_#in~n_1|, lcp_#in~y=|v_lcp_#in~y_1|, lcp_#in~x=|v_lcp_#in~x_1|} OutVars{lcp_~x=v_lcp_~x_1, lcp_#in~a.offset=|v_lcp_#in~a.offset_1|, lcp_~l~0=v_lcp_~l~0_1, lcp_~a.offset=v_lcp_~a.offset_1, lcp_~y=v_lcp_~y_1, lcp_#in~y=|v_lcp_#in~y_1|, lcp_~a.base=v_lcp_~a.base_1, lcp_#in~x=|v_lcp_#in~x_1|, lcp_#in~a.base=|v_lcp_#in~a.base_1|, lcp_#in~n=|v_lcp_#in~n_1|, lcp_~n=v_lcp_~n_1} AuxVars[] AssignedVars[lcp_~x, lcp_~l~0, lcp_~a.offset, lcp_~y, lcp_~a.base, lcp_~n] {947#(and (<= lcp_~l~0 0) (= |lcp_#in~x| lcp_~x) (= |lcp_#in~y| lcp_~y) (= |lcp_#in~n| lcp_~n) (<= 0 lcp_~l~0))} is VALID [2022-04-07 23:32:42,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {947#(and (<= lcp_~l~0 0) (= |lcp_#in~x| lcp_~x) (= |lcp_#in~y| lcp_~y) (= |lcp_#in~n| lcp_~n) (<= 0 lcp_~l~0))} [118] L18-5-->L18-1: Formula: (let ((.cse1 (< (+ v_lcp_~y_2 v_lcp_~l~0_5) v_lcp_~n_2)) (.cse0 (< (+ v_lcp_~x_2 v_lcp_~l~0_5) v_lcp_~n_2))) (or (and (or (not .cse0) (not .cse1)) (not |v_lcp_#t~short7_5|)) (and .cse1 .cse0 |v_lcp_#t~short7_5|))) InVars {lcp_~x=v_lcp_~x_2, lcp_~l~0=v_lcp_~l~0_5, lcp_~y=v_lcp_~y_2, lcp_~n=v_lcp_~n_2} OutVars{lcp_~x=v_lcp_~x_2, lcp_#t~short7=|v_lcp_#t~short7_5|, lcp_~l~0=v_lcp_~l~0_5, lcp_~y=v_lcp_~y_2, lcp_~n=v_lcp_~n_2} AuxVars[] AssignedVars[lcp_#t~short7] {948#(and (<= lcp_~l~0 0) (<= 0 lcp_~l~0) (or |lcp_#t~short7| (<= |lcp_#in~n| |lcp_#in~x|) (<= |lcp_#in~n| |lcp_#in~y|)))} is VALID [2022-04-07 23:32:42,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {948#(and (<= lcp_~l~0 0) (<= 0 lcp_~l~0) (or |lcp_#t~short7| (<= |lcp_#in~n| |lcp_#in~x|) (<= |lcp_#in~n| |lcp_#in~y|)))} [125] L18-1-->L18-3: Formula: (not |v_lcp_#t~short7_8|) InVars {lcp_#t~short7=|v_lcp_#t~short7_8|} OutVars{lcp_#t~short7=|v_lcp_#t~short7_8|} AuxVars[] AssignedVars[] {949#(and (or (<= |lcp_#in~n| |lcp_#in~x|) (<= |lcp_#in~n| |lcp_#in~y|)) (<= lcp_~l~0 0) (<= 0 lcp_~l~0))} is VALID [2022-04-07 23:32:42,962 INFO L290 TraceCheckUtils]: 3: Hoare triple {949#(and (or (<= |lcp_#in~n| |lcp_#in~x|) (<= |lcp_#in~n| |lcp_#in~y|)) (<= lcp_~l~0 0) (<= 0 lcp_~l~0))} [133] L18-3-->L18-6: Formula: (not |v_lcp_#t~short7_2|) InVars {lcp_#t~short7=|v_lcp_#t~short7_2|} OutVars{lcp_#t~mem6=|v_lcp_#t~mem6_1|, lcp_#t~mem5=|v_lcp_#t~mem5_1|} AuxVars[] AssignedVars[lcp_#t~mem6, lcp_#t~mem5, lcp_#t~short7] {949#(and (or (<= |lcp_#in~n| |lcp_#in~x|) (<= |lcp_#in~n| |lcp_#in~y|)) (<= lcp_~l~0 0) (<= 0 lcp_~l~0))} is VALID [2022-04-07 23:32:42,962 INFO L290 TraceCheckUtils]: 4: Hoare triple {949#(and (or (<= |lcp_#in~n| |lcp_#in~x|) (<= |lcp_#in~n| |lcp_#in~y|)) (<= lcp_~l~0 0) (<= 0 lcp_~l~0))} [123] L18-6-->lcpFINAL: Formula: (= |v_lcp_#res_1| v_lcp_~l~0_4) InVars {lcp_~l~0=v_lcp_~l~0_4} OutVars{lcp_#res=|v_lcp_#res_1|, lcp_~l~0=v_lcp_~l~0_4} AuxVars[] AssignedVars[lcp_#res] {950#(and (or (<= |lcp_#in~n| |lcp_#in~x|) (<= |lcp_#in~n| |lcp_#in~y|)) (<= |lcp_#res| 0) (<= 0 |lcp_#res|))} is VALID [2022-04-07 23:32:42,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {950#(and (or (<= |lcp_#in~n| |lcp_#in~x|) (<= |lcp_#in~n| |lcp_#in~y|)) (<= |lcp_#res| 0) (<= 0 |lcp_#res|))} [132] lcpFINAL-->lcpEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {950#(and (or (<= |lcp_#in~n| |lcp_#in~x|) (<= |lcp_#in~n| |lcp_#in~y|)) (<= |lcp_#res| 0) (<= 0 |lcp_#res|))} is VALID [2022-04-07 23:32:42,964 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {950#(and (or (<= |lcp_#in~n| |lcp_#in~x|) (<= |lcp_#in~n| |lcp_#in~y|)) (<= |lcp_#res| 0) (<= 0 |lcp_#res|))} {910#true} [147] lcpEXIT-->L44: AOR: Formula: (= |v_lcp_#resOutParam_1| |v_main_#t~ret18_4|) InVars {lcp_#res=|v_lcp_#resOutParam_1|} OutVars{main_#t~ret18=|v_main_#t~ret18_4|} AuxVars[] AssignedVars[main_#t~ret18, lcp_#res] LVA: Formula: (and (= v_main_~y~0_6 |v_lcp_#in~yInParam_1|) (= |v_lcp_#in~nInParam_1| v_main_~n~0_9) (= v_main_~x~0_6 |v_lcp_#in~xInParam_1|) (= |v_lcp_#in~a.offsetInParam_1| v_main_~a~0.offset_5) (= |v_lcp_#in~a.baseInParam_1| v_main_~a~0.base_5)) InVars {main_~a~0.base=v_main_~a~0.base_5, main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_6, main_~a~0.offset=v_main_~a~0.offset_5} OutVars{lcp_#in~a.base=|v_lcp_#in~a.baseInParam_1|, lcp_#in~a.offset=|v_lcp_#in~a.offsetInParam_1|, lcp_#in~n=|v_lcp_#in~nInParam_1|, lcp_#in~y=|v_lcp_#in~yInParam_1|, lcp_#in~x=|v_lcp_#in~xInParam_1|} AuxVars[] AssignedVars[lcp_#in~a.offset, lcp_#in~y, main_~x~0, lcp_#in~x, lcp_#in~a.base, main_~a~0.base, lcp_#in~n, main_~y~0, main_~n~0, main_~a~0.offset] {933#(and (= |main_#t~ret18| 0) (or (<= main_~n~0 main_~x~0) (<= main_~n~0 main_~y~0)))} is VALID [2022-04-07 23:32:42,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-07 23:32:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:42,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {910#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {910#true} is VALID [2022-04-07 23:32:42,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {910#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {910#true} is VALID [2022-04-07 23:32:42,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {910#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {910#true} is VALID [2022-04-07 23:32:42,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {910#true} {936#(and (= check_~l 0) (or (<= check_~n check_~y) (<= check_~n check_~x)))} [144] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= 0 v_check_~i~0_4) (< v_check_~i~0_4 v_check_~l_5)) 1 0)) InVars {check_~i~0=v_check_~i~0_4, check_~l=v_check_~l_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[check_~i~0, assume_abort_if_not_#in~cond, check_~l] {936#(and (= check_~l 0) (or (<= check_~n check_~y) (<= check_~n check_~x)))} is VALID [2022-04-07 23:32:42,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-04-07 23:32:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:42,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {910#true} [120] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {910#true} is VALID [2022-04-07 23:32:42,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {910#true} [129] L13-->L13-3: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {910#true} is VALID [2022-04-07 23:32:42,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {910#true} [139] L13-3-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {910#true} is VALID [2022-04-07 23:32:42,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {910#true} {936#(and (= check_~l 0) (or (<= check_~n check_~y) (<= check_~n check_~x)))} [149] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= |v_check_#t~mem11_4| |v_check_#t~mem10_4|) 1 0)) InVars {check_#t~mem10=|v_check_#t~mem10_4|, check_#t~mem11=|v_check_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, check_#t~mem10, check_#t~mem11] {936#(and (= check_~l 0) (or (<= check_~n check_~y) (<= check_~n check_~x)))} is VALID [2022-04-07 23:32:42,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {910#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:32:42,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {945#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [96] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1)) (.cse1 (select |v_#memory_int_5| 2))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= (select .cse1 3) 46) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= 112 (select .cse1 2)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select .cse1 4) 99) (= (select .cse1 5) 0) (= 6 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {910#true} is VALID [2022-04-07 23:32:42,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {910#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {910#true} is VALID [2022-04-07 23:32:42,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {910#true} {910#true} [141] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {910#true} is VALID [2022-04-07 23:32:42,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {910#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {910#true} is VALID [2022-04-07 23:32:42,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {910#true} [98] mainENTRY-->L38: Formula: (and (<= |v_main_#t~nondet14_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet14_2|) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[main_#t~nondet14, main_~n~0] {910#true} is VALID [2022-04-07 23:32:42,985 INFO L272 TraceCheckUtils]: 6: Hoare triple {910#true} [100] L38-->assume_abort_if_notENTRY: Formula: (= (ite (and (< v_main_~n~0_7 1073741824) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {910#true} is VALID [2022-04-07 23:32:42,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {910#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {910#true} is VALID [2022-04-07 23:32:42,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {910#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {910#true} is VALID [2022-04-07 23:32:42,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {910#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {910#true} is VALID [2022-04-07 23:32:42,986 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {910#true} {910#true} [142] assume_abort_if_notEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (< v_main_~n~0_7 1073741824) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {910#true} is VALID [2022-04-07 23:32:42,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {910#true} [101] L38-1-->L39: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_main_#t~malloc15.base_1| 1)) (not (= |v_main_#t~malloc15.base_1| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_#t~malloc15.base_1| (* v_main_~n~0_5 4))) (< |v_main_#t~malloc15.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_4| |v_main_#t~malloc15.base_1|) 0) (= |v_main_#t~malloc15.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, main_~n~0=v_main_~n~0_5, #valid=|v_#valid_4|} OutVars{main_#t~malloc15.offset=|v_main_#t~malloc15.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_3|, #length=|v_#length_1|, main_~n~0=v_main_~n~0_5, main_#t~malloc15.base=|v_main_#t~malloc15.base_1|} AuxVars[] AssignedVars[main_#t~malloc15.offset, #valid, #length, main_#t~malloc15.base] {910#true} is VALID [2022-04-07 23:32:42,987 INFO L272 TraceCheckUtils]: 12: Hoare triple {910#true} [103] L39-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc15.base_4|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_main_~n~0_8 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_8 4)) (= |v_#Ultimate.meminit_#ptr.offsetInParam_1| |v_main_#t~malloc15.offset_4|)) InVars {main_#t~malloc15.offset=|v_main_#t~malloc15.offset_4|, main_~n~0=v_main_~n~0_8, main_#t~malloc15.base=|v_main_#t~malloc15.base_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[main_#t~malloc15.offset, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_~n~0, #Ultimate.meminit_#ptr.base, main_#t~malloc15.base, #Ultimate.meminit_#ptr.offset] {946#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-07 23:32:42,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {946#(= |#memory_int| |old(#memory_int)|)} [107] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {910#true} is VALID [2022-04-07 23:32:42,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {910#true} [110] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {910#true} is VALID [2022-04-07 23:32:42,987 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {910#true} {910#true} [145] #Ultimate.meminitEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc15.base_4|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_main_~n~0_8 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_8 4)) (= |v_#Ultimate.meminit_#ptr.offsetInParam_1| |v_main_#t~malloc15.offset_4|)) InVars {main_#t~malloc15.offset=|v_main_#t~malloc15.offset_4|, main_~n~0=v_main_~n~0_8, main_#t~malloc15.base=|v_main_#t~malloc15.base_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[main_#t~malloc15.offset, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_~n~0, #Ultimate.meminit_#ptr.base, main_#t~malloc15.base, #Ultimate.meminit_#ptr.offset] {910#true} is VALID [2022-04-07 23:32:42,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {910#true} [106] L39-1-->L43: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~a~0.offset_4 |v_main_#t~malloc15.offset_3|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet17_2|) (= v_main_~x~0_3 |v_main_#t~nondet16_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (= v_main_~a~0.base_4 |v_main_#t~malloc15.base_3|)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~malloc15.offset=|v_main_#t~malloc15.offset_3|, main_#t~malloc15.base=|v_main_#t~malloc15.base_3|, main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_#t~malloc15.offset=|v_main_#t~malloc15.offset_3|, main_~x~0=v_main_~x~0_3, main_~a~0.base=v_main_~a~0.base_4, main_~y~0=v_main_~y~0_3, main_#t~malloc15.base=|v_main_#t~malloc15.base_3|, main_~a~0.offset=v_main_~a~0.offset_4} AuxVars[] AssignedVars[main_#t~nondet16, main_~x~0, main_#t~nondet17, main_~a~0.base, main_~y~0, main_~a~0.offset] {910#true} is VALID [2022-04-07 23:32:42,987 INFO L272 TraceCheckUtils]: 17: Hoare triple {910#true} [109] L43-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_5) (<= 0 v_main_~x~0_5)) 1 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, assume_abort_if_not_#in~cond] {910#true} is VALID [2022-04-07 23:32:42,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {910#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {910#true} is VALID [2022-04-07 23:32:42,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {910#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {910#true} is VALID [2022-04-07 23:32:42,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {910#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {910#true} is VALID [2022-04-07 23:32:42,988 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {910#true} {910#true} [143] assume_abort_if_notEXIT-->L43-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_5) (<= 0 v_main_~x~0_5)) 1 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, assume_abort_if_not_#in~cond] {910#true} is VALID [2022-04-07 23:32:42,988 INFO L272 TraceCheckUtils]: 22: Hoare triple {910#true} [111] L43-1-->lcpENTRY: Formula: (and (= v_main_~y~0_6 |v_lcp_#in~yInParam_1|) (= |v_lcp_#in~nInParam_1| v_main_~n~0_9) (= v_main_~x~0_6 |v_lcp_#in~xInParam_1|) (= |v_lcp_#in~a.offsetInParam_1| v_main_~a~0.offset_5) (= |v_lcp_#in~a.baseInParam_1| v_main_~a~0.base_5)) InVars {main_~a~0.base=v_main_~a~0.base_5, main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_6, main_~a~0.offset=v_main_~a~0.offset_5} OutVars{lcp_#in~a.base=|v_lcp_#in~a.baseInParam_1|, lcp_#in~a.offset=|v_lcp_#in~a.offsetInParam_1|, lcp_#in~n=|v_lcp_#in~nInParam_1|, lcp_#in~y=|v_lcp_#in~yInParam_1|, lcp_#in~x=|v_lcp_#in~xInParam_1|} AuxVars[] AssignedVars[lcp_#in~a.offset, lcp_#in~y, main_~x~0, lcp_#in~x, lcp_#in~a.base, main_~a~0.base, lcp_#in~n, main_~y~0, main_~n~0, main_~a~0.offset] {910#true} is VALID [2022-04-07 23:32:42,992 INFO L290 TraceCheckUtils]: 23: Hoare triple {910#true} [114] lcpENTRY-->L18-5: Formula: (and (= v_lcp_~a.base_1 |v_lcp_#in~a.base_1|) (= v_lcp_~n_1 |v_lcp_#in~n_1|) (= v_lcp_~l~0_1 0) (= v_lcp_~x_1 |v_lcp_#in~x_1|) (= v_lcp_~y_1 |v_lcp_#in~y_1|) (= |v_lcp_#in~a.offset_1| v_lcp_~a.offset_1)) InVars {lcp_#in~a.base=|v_lcp_#in~a.base_1|, lcp_#in~a.offset=|v_lcp_#in~a.offset_1|, lcp_#in~n=|v_lcp_#in~n_1|, lcp_#in~y=|v_lcp_#in~y_1|, lcp_#in~x=|v_lcp_#in~x_1|} OutVars{lcp_~x=v_lcp_~x_1, lcp_#in~a.offset=|v_lcp_#in~a.offset_1|, lcp_~l~0=v_lcp_~l~0_1, lcp_~a.offset=v_lcp_~a.offset_1, lcp_~y=v_lcp_~y_1, lcp_#in~y=|v_lcp_#in~y_1|, lcp_~a.base=v_lcp_~a.base_1, lcp_#in~x=|v_lcp_#in~x_1|, lcp_#in~a.base=|v_lcp_#in~a.base_1|, lcp_#in~n=|v_lcp_#in~n_1|, lcp_~n=v_lcp_~n_1} AuxVars[] AssignedVars[lcp_~x, lcp_~l~0, lcp_~a.offset, lcp_~y, lcp_~a.base, lcp_~n] {947#(and (<= lcp_~l~0 0) (= |lcp_#in~x| lcp_~x) (= |lcp_#in~y| lcp_~y) (= |lcp_#in~n| lcp_~n) (<= 0 lcp_~l~0))} is VALID [2022-04-07 23:32:42,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {947#(and (<= lcp_~l~0 0) (= |lcp_#in~x| lcp_~x) (= |lcp_#in~y| lcp_~y) (= |lcp_#in~n| lcp_~n) (<= 0 lcp_~l~0))} [118] L18-5-->L18-1: Formula: (let ((.cse1 (< (+ v_lcp_~y_2 v_lcp_~l~0_5) v_lcp_~n_2)) (.cse0 (< (+ v_lcp_~x_2 v_lcp_~l~0_5) v_lcp_~n_2))) (or (and (or (not .cse0) (not .cse1)) (not |v_lcp_#t~short7_5|)) (and .cse1 .cse0 |v_lcp_#t~short7_5|))) InVars {lcp_~x=v_lcp_~x_2, lcp_~l~0=v_lcp_~l~0_5, lcp_~y=v_lcp_~y_2, lcp_~n=v_lcp_~n_2} OutVars{lcp_~x=v_lcp_~x_2, lcp_#t~short7=|v_lcp_#t~short7_5|, lcp_~l~0=v_lcp_~l~0_5, lcp_~y=v_lcp_~y_2, lcp_~n=v_lcp_~n_2} AuxVars[] AssignedVars[lcp_#t~short7] {948#(and (<= lcp_~l~0 0) (<= 0 lcp_~l~0) (or |lcp_#t~short7| (<= |lcp_#in~n| |lcp_#in~x|) (<= |lcp_#in~n| |lcp_#in~y|)))} is VALID [2022-04-07 23:32:42,993 INFO L290 TraceCheckUtils]: 25: Hoare triple {948#(and (<= lcp_~l~0 0) (<= 0 lcp_~l~0) (or |lcp_#t~short7| (<= |lcp_#in~n| |lcp_#in~x|) (<= |lcp_#in~n| |lcp_#in~y|)))} [125] L18-1-->L18-3: Formula: (not |v_lcp_#t~short7_8|) InVars {lcp_#t~short7=|v_lcp_#t~short7_8|} OutVars{lcp_#t~short7=|v_lcp_#t~short7_8|} AuxVars[] AssignedVars[] {949#(and (or (<= |lcp_#in~n| |lcp_#in~x|) (<= |lcp_#in~n| |lcp_#in~y|)) (<= lcp_~l~0 0) (<= 0 lcp_~l~0))} is VALID [2022-04-07 23:32:42,993 INFO L290 TraceCheckUtils]: 26: Hoare triple {949#(and (or (<= |lcp_#in~n| |lcp_#in~x|) (<= |lcp_#in~n| |lcp_#in~y|)) (<= lcp_~l~0 0) (<= 0 lcp_~l~0))} [133] L18-3-->L18-6: Formula: (not |v_lcp_#t~short7_2|) InVars {lcp_#t~short7=|v_lcp_#t~short7_2|} OutVars{lcp_#t~mem6=|v_lcp_#t~mem6_1|, lcp_#t~mem5=|v_lcp_#t~mem5_1|} AuxVars[] AssignedVars[lcp_#t~mem6, lcp_#t~mem5, lcp_#t~short7] {949#(and (or (<= |lcp_#in~n| |lcp_#in~x|) (<= |lcp_#in~n| |lcp_#in~y|)) (<= lcp_~l~0 0) (<= 0 lcp_~l~0))} is VALID [2022-04-07 23:32:42,993 INFO L290 TraceCheckUtils]: 27: Hoare triple {949#(and (or (<= |lcp_#in~n| |lcp_#in~x|) (<= |lcp_#in~n| |lcp_#in~y|)) (<= lcp_~l~0 0) (<= 0 lcp_~l~0))} [123] L18-6-->lcpFINAL: Formula: (= |v_lcp_#res_1| v_lcp_~l~0_4) InVars {lcp_~l~0=v_lcp_~l~0_4} OutVars{lcp_#res=|v_lcp_#res_1|, lcp_~l~0=v_lcp_~l~0_4} AuxVars[] AssignedVars[lcp_#res] {950#(and (or (<= |lcp_#in~n| |lcp_#in~x|) (<= |lcp_#in~n| |lcp_#in~y|)) (<= |lcp_#res| 0) (<= 0 |lcp_#res|))} is VALID [2022-04-07 23:32:42,994 INFO L290 TraceCheckUtils]: 28: Hoare triple {950#(and (or (<= |lcp_#in~n| |lcp_#in~x|) (<= |lcp_#in~n| |lcp_#in~y|)) (<= |lcp_#res| 0) (<= 0 |lcp_#res|))} [132] lcpFINAL-->lcpEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {950#(and (or (<= |lcp_#in~n| |lcp_#in~x|) (<= |lcp_#in~n| |lcp_#in~y|)) (<= |lcp_#res| 0) (<= 0 |lcp_#res|))} is VALID [2022-04-07 23:32:42,995 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {950#(and (or (<= |lcp_#in~n| |lcp_#in~x|) (<= |lcp_#in~n| |lcp_#in~y|)) (<= |lcp_#res| 0) (<= 0 |lcp_#res|))} {910#true} [147] lcpEXIT-->L44: AOR: Formula: (= |v_lcp_#resOutParam_1| |v_main_#t~ret18_4|) InVars {lcp_#res=|v_lcp_#resOutParam_1|} OutVars{main_#t~ret18=|v_main_#t~ret18_4|} AuxVars[] AssignedVars[main_#t~ret18, lcp_#res] LVA: Formula: (and (= v_main_~y~0_6 |v_lcp_#in~yInParam_1|) (= |v_lcp_#in~nInParam_1| v_main_~n~0_9) (= v_main_~x~0_6 |v_lcp_#in~xInParam_1|) (= |v_lcp_#in~a.offsetInParam_1| v_main_~a~0.offset_5) (= |v_lcp_#in~a.baseInParam_1| v_main_~a~0.base_5)) InVars {main_~a~0.base=v_main_~a~0.base_5, main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_6, main_~a~0.offset=v_main_~a~0.offset_5} OutVars{lcp_#in~a.base=|v_lcp_#in~a.baseInParam_1|, lcp_#in~a.offset=|v_lcp_#in~a.offsetInParam_1|, lcp_#in~n=|v_lcp_#in~nInParam_1|, lcp_#in~y=|v_lcp_#in~yInParam_1|, lcp_#in~x=|v_lcp_#in~xInParam_1|} AuxVars[] AssignedVars[lcp_#in~a.offset, lcp_#in~y, main_~x~0, lcp_#in~x, lcp_#in~a.base, main_~a~0.base, lcp_#in~n, main_~y~0, main_~n~0, main_~a~0.offset] {933#(and (= |main_#t~ret18| 0) (or (<= main_~n~0 main_~x~0) (<= main_~n~0 main_~y~0)))} is VALID [2022-04-07 23:32:42,995 INFO L290 TraceCheckUtils]: 30: Hoare triple {933#(and (= |main_#t~ret18| 0) (or (<= main_~n~0 main_~x~0) (<= main_~n~0 main_~y~0)))} [113] L44-->L45: Formula: (and (<= |v_main_#t~ret18_3| 2147483647) (= v_main_~l~1_1 |v_main_#t~ret18_3|) (<= 0 (+ |v_main_#t~ret18_3| 2147483648))) InVars {main_#t~ret18=|v_main_#t~ret18_3|} OutVars{main_~l~1=v_main_~l~1_1} AuxVars[] AssignedVars[main_#t~ret18, main_~l~1] {934#(and (= main_~l~1 0) (or (<= main_~n~0 main_~x~0) (<= main_~n~0 main_~y~0)))} is VALID [2022-04-07 23:32:42,996 INFO L272 TraceCheckUtils]: 31: Hoare triple {934#(and (= main_~l~1 0) (or (<= main_~n~0 main_~x~0) (<= main_~n~0 main_~y~0)))} [116] L45-->checkENTRY: Formula: (and (= v_main_~n~0_10 |v_check_#in~nInParam_1|) (= |v_check_#in~a.baseInParam_1| v_main_~a~0.base_6) (= v_main_~y~0_7 |v_check_#in~yInParam_1|) (= v_main_~x~0_7 |v_check_#in~xInParam_1|) (= |v_check_#in~a.offsetInParam_1| v_main_~a~0.offset_6) (= |v_check_#in~lInParam_1| v_main_~l~1_3)) InVars {main_~x~0=v_main_~x~0_7, main_~l~1=v_main_~l~1_3, main_~a~0.base=v_main_~a~0.base_6, main_~y~0=v_main_~y~0_7, main_~n~0=v_main_~n~0_10, main_~a~0.offset=v_main_~a~0.offset_6} OutVars{check_#in~y=|v_check_#in~yInParam_1|, check_#in~x=|v_check_#in~xInParam_1|, check_#in~a.offset=|v_check_#in~a.offsetInParam_1|, check_#in~a.base=|v_check_#in~a.baseInParam_1|, check_#in~l=|v_check_#in~lInParam_1|, check_#in~n=|v_check_#in~nInParam_1|} AuxVars[] AssignedVars[check_#in~y, check_#in~x, check_#in~a.offset, main_~x~0, main_~l~1, check_#in~a.base, main_~a~0.base, main_~y~0, main_~n~0, check_#in~l, main_~a~0.offset, check_#in~n] {935#(and (= |check_#in~l| 0) (or (<= |check_#in~n| |check_#in~x|) (<= |check_#in~n| |check_#in~y|)))} is VALID [2022-04-07 23:32:42,996 INFO L290 TraceCheckUtils]: 32: Hoare triple {935#(and (= |check_#in~l| 0) (or (<= |check_#in~n| |check_#in~x|) (<= |check_#in~n| |check_#in~y|)))} [122] checkENTRY-->L27: Formula: (and (= v_check_~x_2 |v_check_#in~x_1|) (= |v_check_#in~a.offset_1| v_check_~a.offset_1) (= v_check_~i~0_1 |v_check_#t~nondet9_2|) (= v_check_~l_2 |v_check_#in~l_1|) (= v_check_~n_2 |v_check_#in~n_1|) (= v_check_~a.base_1 |v_check_#in~a.base_1|) (<= 0 (+ 2147483648 |v_check_#t~nondet9_2|)) (= v_check_~y_2 |v_check_#in~y_1|) (<= |v_check_#t~nondet9_2| 2147483647)) InVars {check_#in~y=|v_check_#in~y_1|, check_#in~x=|v_check_#in~x_1|, check_#in~a.offset=|v_check_#in~a.offset_1|, check_#in~a.base=|v_check_#in~a.base_1|, check_#in~l=|v_check_#in~l_1|, check_#t~nondet9=|v_check_#t~nondet9_2|, check_#in~n=|v_check_#in~n_1|} OutVars{check_#in~y=|v_check_#in~y_1|, check_#in~x=|v_check_#in~x_1|, check_#in~a.offset=|v_check_#in~a.offset_1|, check_~a.base=v_check_~a.base_1, check_~i~0=v_check_~i~0_1, check_~y=v_check_~y_2, check_~x=v_check_~x_2, check_~a.offset=v_check_~a.offset_1, check_#in~a.base=|v_check_#in~a.base_1|, check_#in~l=|v_check_#in~l_1|, check_~n=v_check_~n_2, check_#in~n=|v_check_#in~n_1|, check_~l=v_check_~l_2} AuxVars[] AssignedVars[check_~y, check_~x, check_~a.base, check_~a.offset, check_~i~0, check_~n, check_#t~nondet9, check_~l] {936#(and (= check_~l 0) (or (<= check_~n check_~y) (<= check_~n check_~x)))} is VALID [2022-04-07 23:32:42,997 INFO L272 TraceCheckUtils]: 33: Hoare triple {936#(and (= check_~l 0) (or (<= check_~n check_~y) (<= check_~n check_~x)))} [131] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= 0 v_check_~i~0_4) (< v_check_~i~0_4 v_check_~l_5)) 1 0)) InVars {check_~i~0=v_check_~i~0_4, check_~l=v_check_~l_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[check_~i~0, assume_abort_if_not_#in~cond, check_~l] {910#true} is VALID [2022-04-07 23:32:42,997 INFO L290 TraceCheckUtils]: 34: Hoare triple {910#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {910#true} is VALID [2022-04-07 23:32:42,997 INFO L290 TraceCheckUtils]: 35: Hoare triple {910#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {910#true} is VALID [2022-04-07 23:32:42,997 INFO L290 TraceCheckUtils]: 36: Hoare triple {910#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {910#true} is VALID [2022-04-07 23:32:42,997 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {910#true} {936#(and (= check_~l 0) (or (<= check_~n check_~y) (<= check_~n check_~x)))} [144] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= 0 v_check_~i~0_4) (< v_check_~i~0_4 v_check_~l_5)) 1 0)) InVars {check_~i~0=v_check_~i~0_4, check_~l=v_check_~l_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[check_~i~0, assume_abort_if_not_#in~cond, check_~l] {936#(and (= check_~l 0) (or (<= check_~n check_~y) (<= check_~n check_~x)))} is VALID [2022-04-07 23:32:42,998 INFO L290 TraceCheckUtils]: 38: Hoare triple {936#(and (= check_~l 0) (or (<= check_~n check_~y) (<= check_~n check_~x)))} [112] L27-1-->L28: Formula: (let ((.cse0 (select |v_#memory_int_3| v_check_~a.base_2)) (.cse1 (* v_check_~i~0_3 4))) (and (= (select .cse0 (+ (* v_check_~y_3 4) v_check_~a.offset_2 .cse1)) |v_check_#t~mem11_1|) (= (select .cse0 (+ (* v_check_~x_3 4) v_check_~a.offset_2 .cse1)) |v_check_#t~mem10_1|))) InVars {check_~y=v_check_~y_3, check_~x=v_check_~x_3, check_~a.base=v_check_~a.base_2, check_~a.offset=v_check_~a.offset_2, check_~i~0=v_check_~i~0_3, #memory_int=|v_#memory_int_3|} OutVars{check_~y=v_check_~y_3, check_~x=v_check_~x_3, check_#t~mem10=|v_check_#t~mem10_1|, check_~a.base=v_check_~a.base_2, check_~a.offset=v_check_~a.offset_2, check_~i~0=v_check_~i~0_3, check_#t~mem11=|v_check_#t~mem11_1|, #memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[check_#t~mem10, check_#t~mem11] {936#(and (= check_~l 0) (or (<= check_~n check_~y) (<= check_~n check_~x)))} is VALID [2022-04-07 23:32:42,998 INFO L272 TraceCheckUtils]: 39: Hoare triple {936#(and (= check_~l 0) (or (<= check_~n check_~y) (<= check_~n check_~x)))} [115] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= |v_check_#t~mem11_4| |v_check_#t~mem10_4|) 1 0)) InVars {check_#t~mem10=|v_check_#t~mem10_4|, check_#t~mem11=|v_check_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, check_#t~mem10, check_#t~mem11] {910#true} is VALID [2022-04-07 23:32:42,998 INFO L290 TraceCheckUtils]: 40: Hoare triple {910#true} [120] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {910#true} is VALID [2022-04-07 23:32:42,998 INFO L290 TraceCheckUtils]: 41: Hoare triple {910#true} [129] L13-->L13-3: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {910#true} is VALID [2022-04-07 23:32:42,998 INFO L290 TraceCheckUtils]: 42: Hoare triple {910#true} [139] L13-3-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {910#true} is VALID [2022-04-07 23:32:42,999 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {910#true} {936#(and (= check_~l 0) (or (<= check_~n check_~y) (<= check_~n check_~x)))} [149] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= |v_check_#t~mem11_4| |v_check_#t~mem10_4|) 1 0)) InVars {check_#t~mem10=|v_check_#t~mem10_4|, check_#t~mem11=|v_check_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, check_#t~mem10, check_#t~mem11] {936#(and (= check_~l 0) (or (<= check_~n check_~y) (<= check_~n check_~x)))} is VALID [2022-04-07 23:32:42,999 INFO L290 TraceCheckUtils]: 44: Hoare triple {936#(and (= check_~l 0) (or (<= check_~n check_~y) (<= check_~n check_~x)))} [119] L28-1-->L31: Formula: true InVars {} OutVars{check_#t~mem10=|v_check_#t~mem10_3|, check_#t~mem11=|v_check_#t~mem11_3|} AuxVars[] AssignedVars[check_#t~mem10, check_#t~mem11] {936#(and (= check_~l 0) (or (<= check_~n check_~y) (<= check_~n check_~x)))} is VALID [2022-04-07 23:32:43,000 INFO L290 TraceCheckUtils]: 45: Hoare triple {936#(and (= check_~l 0) (or (<= check_~n check_~y) (<= check_~n check_~x)))} [126] L31-->L32: Formula: (let ((.cse0 (select |v_#memory_int_4| v_check_~a.base_3)) (.cse1 (* v_check_~l_4 4))) (and (< (+ v_check_~l_4 v_check_~x_4) v_check_~n_3) (< (+ v_check_~l_4 v_check_~y_4) v_check_~n_3) (= (select .cse0 (+ (* v_check_~y_4 4) .cse1 v_check_~a.offset_3)) |v_check_#t~mem13_1|) (= |v_check_#t~mem12_1| (select .cse0 (+ .cse1 (* v_check_~x_4 4) v_check_~a.offset_3))))) InVars {check_~y=v_check_~y_4, check_~x=v_check_~x_4, check_~a.base=v_check_~a.base_3, check_~a.offset=v_check_~a.offset_3, #memory_int=|v_#memory_int_4|, check_~n=v_check_~n_3, check_~l=v_check_~l_4} OutVars{check_#t~mem13=|v_check_#t~mem13_1|, check_~y=v_check_~y_4, check_~x=v_check_~x_4, check_~a.base=v_check_~a.base_3, check_~a.offset=v_check_~a.offset_3, check_#t~mem12=|v_check_#t~mem12_1|, #memory_int=|v_#memory_int_4|, check_~n=v_check_~n_3, check_~l=v_check_~l_4} AuxVars[] AssignedVars[check_#t~mem13, check_#t~mem12] {911#false} is VALID [2022-04-07 23:32:43,000 INFO L272 TraceCheckUtils]: 46: Hoare triple {911#false} [135] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= |v_check_#t~mem13_4| |v_check_#t~mem12_4|)) 1 0)) InVars {check_#t~mem13=|v_check_#t~mem13_4|, check_#t~mem12=|v_check_#t~mem12_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[check_#t~mem13, __VERIFIER_assert_#in~cond, check_#t~mem12] {911#false} is VALID [2022-04-07 23:32:43,000 INFO L290 TraceCheckUtils]: 47: Hoare triple {911#false} [120] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {911#false} is VALID [2022-04-07 23:32:43,000 INFO L290 TraceCheckUtils]: 48: Hoare triple {911#false} [128] L13-->L13-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {911#false} is VALID [2022-04-07 23:32:43,000 INFO L290 TraceCheckUtils]: 49: Hoare triple {911#false} [137] L13-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {911#false} is VALID [2022-04-07 23:32:43,000 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 23:32:43,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:32:43,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647543996] [2022-04-07 23:32:43,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647543996] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:32:43,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:32:43,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-07 23:32:43,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303674113] [2022-04-07 23:32:43,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:32:43,001 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2022-04-07 23:32:43,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:32:43,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 23:32:43,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:32:43,030 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 23:32:43,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:32:43,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 23:32:43,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-04-07 23:32:43,031 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 23:32:44,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:44,029 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-04-07 23:32:44,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 23:32:44,030 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2022-04-07 23:32:44,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:32:44,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 23:32:44,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 68 transitions. [2022-04-07 23:32:44,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 23:32:44,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 68 transitions. [2022-04-07 23:32:44,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 68 transitions. [2022-04-07 23:32:44,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:32:44,089 INFO L225 Difference]: With dead ends: 64 [2022-04-07 23:32:44,090 INFO L226 Difference]: Without dead ends: 48 [2022-04-07 23:32:44,090 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2022-04-07 23:32:44,091 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 72 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-07 23:32:44,091 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 46 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-07 23:32:44,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-07 23:32:44,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-04-07 23:32:44,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:32:44,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 46 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 23:32:44,113 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 46 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 23:32:44,113 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 46 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 23:32:44,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:44,114 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-04-07 23:32:44,114 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-04-07 23:32:44,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:32:44,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:32:44,115 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 48 states. [2022-04-07 23:32:44,115 INFO L87 Difference]: Start difference. First operand has 46 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 48 states. [2022-04-07 23:32:44,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:44,117 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-04-07 23:32:44,117 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-04-07 23:32:44,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:32:44,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:32:44,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:32:44,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:32:44,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 23:32:44,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-04-07 23:32:44,118 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 50 [2022-04-07 23:32:44,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:32:44,119 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-04-07 23:32:44,119 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 23:32:44,119 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-04-07 23:32:44,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-07 23:32:44,120 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:32:44,120 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:32:44,120 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 23:32:44,120 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:32:44,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:32:44,120 INFO L85 PathProgramCache]: Analyzing trace with hash -573911401, now seen corresponding path program 1 times [2022-04-07 23:32:44,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:32:44,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799340118] [2022-04-07 23:32:44,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:32:44,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:32:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:44,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:32:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:44,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {1262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [96] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1)) (.cse1 (select |v_#memory_int_5| 2))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= (select .cse1 3) 46) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= 112 (select .cse1 2)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select .cse1 4) 99) (= (select .cse1 5) 0) (= 6 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1224#true} is VALID [2022-04-07 23:32:44,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {1224#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:44,210 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1224#true} {1224#true} [141] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:44,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 23:32:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:44,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {1224#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1224#true} is VALID [2022-04-07 23:32:44,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {1224#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:44,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {1224#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:44,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1224#true} {1224#true} [142] assume_abort_if_notEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (< v_main_~n~0_7 1073741824) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1224#true} is VALID [2022-04-07 23:32:44,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 23:32:44,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:44,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {1263#(= |#memory_int| |old(#memory_int)|)} [107] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {1224#true} is VALID [2022-04-07 23:32:44,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {1224#true} [110] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:44,221 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1224#true} {1224#true} [145] #Ultimate.meminitEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc15.base_4|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_main_~n~0_8 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_8 4)) (= |v_#Ultimate.meminit_#ptr.offsetInParam_1| |v_main_#t~malloc15.offset_4|)) InVars {main_#t~malloc15.offset=|v_main_#t~malloc15.offset_4|, main_~n~0=v_main_~n~0_8, main_#t~malloc15.base=|v_main_#t~malloc15.base_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[main_#t~malloc15.offset, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_~n~0, #Ultimate.meminit_#ptr.base, main_#t~malloc15.base, #Ultimate.meminit_#ptr.offset] {1224#true} is VALID [2022-04-07 23:32:44,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 23:32:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:44,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {1224#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1224#true} is VALID [2022-04-07 23:32:44,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {1224#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:44,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {1224#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:44,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1224#true} {1224#true} [143] assume_abort_if_notEXIT-->L43-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_5) (<= 0 v_main_~x~0_5)) 1 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, assume_abort_if_not_#in~cond] {1224#true} is VALID [2022-04-07 23:32:44,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-07 23:32:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:44,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {1224#true} [114] lcpENTRY-->L18-5: Formula: (and (= v_lcp_~a.base_1 |v_lcp_#in~a.base_1|) (= v_lcp_~n_1 |v_lcp_#in~n_1|) (= v_lcp_~l~0_1 0) (= v_lcp_~x_1 |v_lcp_#in~x_1|) (= v_lcp_~y_1 |v_lcp_#in~y_1|) (= |v_lcp_#in~a.offset_1| v_lcp_~a.offset_1)) InVars {lcp_#in~a.base=|v_lcp_#in~a.base_1|, lcp_#in~a.offset=|v_lcp_#in~a.offset_1|, lcp_#in~n=|v_lcp_#in~n_1|, lcp_#in~y=|v_lcp_#in~y_1|, lcp_#in~x=|v_lcp_#in~x_1|} OutVars{lcp_~x=v_lcp_~x_1, lcp_#in~a.offset=|v_lcp_#in~a.offset_1|, lcp_~l~0=v_lcp_~l~0_1, lcp_~a.offset=v_lcp_~a.offset_1, lcp_~y=v_lcp_~y_1, lcp_#in~y=|v_lcp_#in~y_1|, lcp_~a.base=v_lcp_~a.base_1, lcp_#in~x=|v_lcp_#in~x_1|, lcp_#in~a.base=|v_lcp_#in~a.base_1|, lcp_#in~n=|v_lcp_#in~n_1|, lcp_~n=v_lcp_~n_1} AuxVars[] AssignedVars[lcp_~x, lcp_~l~0, lcp_~a.offset, lcp_~y, lcp_~a.base, lcp_~n] {1264#(and (= |lcp_#in~x| lcp_~x) (= |lcp_#in~y| lcp_~y) (= |lcp_#in~n| lcp_~n))} is VALID [2022-04-07 23:32:44,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {1264#(and (= |lcp_#in~x| lcp_~x) (= |lcp_#in~y| lcp_~y) (= |lcp_#in~n| lcp_~n))} [118] L18-5-->L18-1: Formula: (let ((.cse1 (< (+ v_lcp_~y_2 v_lcp_~l~0_5) v_lcp_~n_2)) (.cse0 (< (+ v_lcp_~x_2 v_lcp_~l~0_5) v_lcp_~n_2))) (or (and (or (not .cse0) (not .cse1)) (not |v_lcp_#t~short7_5|)) (and .cse1 .cse0 |v_lcp_#t~short7_5|))) InVars {lcp_~x=v_lcp_~x_2, lcp_~l~0=v_lcp_~l~0_5, lcp_~y=v_lcp_~y_2, lcp_~n=v_lcp_~n_2} OutVars{lcp_~x=v_lcp_~x_2, lcp_#t~short7=|v_lcp_#t~short7_5|, lcp_~l~0=v_lcp_~l~0_5, lcp_~y=v_lcp_~y_2, lcp_~n=v_lcp_~n_2} AuxVars[] AssignedVars[lcp_#t~short7] {1264#(and (= |lcp_#in~x| lcp_~x) (= |lcp_#in~y| lcp_~y) (= |lcp_#in~n| lcp_~n))} is VALID [2022-04-07 23:32:44,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {1264#(and (= |lcp_#in~x| lcp_~x) (= |lcp_#in~y| lcp_~y) (= |lcp_#in~n| lcp_~n))} [124] L18-1-->L18-3: Formula: (let ((.cse0 (select |v_#memory_int_6| v_lcp_~a.base_2)) (.cse1 (* v_lcp_~l~0_6 4))) (and (= (select .cse0 (+ v_lcp_~a.offset_2 .cse1 (* v_lcp_~y_3 4))) |v_lcp_#t~mem6_3|) (let ((.cse2 (= |v_lcp_#t~mem6_3| |v_lcp_#t~mem5_3|))) (or (and (not |v_lcp_#t~short7_6|) (not .cse2)) (and .cse2 |v_lcp_#t~short7_6|))) (= |v_lcp_#t~mem5_3| (select .cse0 (+ v_lcp_~a.offset_2 .cse1 (* v_lcp_~x_3 4)))) |v_lcp_#t~short7_7|)) InVars {lcp_~x=v_lcp_~x_3, lcp_~a.offset=v_lcp_~a.offset_2, lcp_~l~0=v_lcp_~l~0_6, lcp_~y=v_lcp_~y_3, lcp_~a.base=v_lcp_~a.base_2, #memory_int=|v_#memory_int_6|, lcp_#t~short7=|v_lcp_#t~short7_7|} OutVars{lcp_~x=v_lcp_~x_3, lcp_~a.offset=v_lcp_~a.offset_2, lcp_~l~0=v_lcp_~l~0_6, lcp_~y=v_lcp_~y_3, lcp_~a.base=v_lcp_~a.base_2, lcp_#t~mem6=|v_lcp_#t~mem6_3|, #memory_int=|v_#memory_int_6|, lcp_#t~short7=|v_lcp_#t~short7_6|, lcp_#t~mem5=|v_lcp_#t~mem5_3|} AuxVars[] AssignedVars[lcp_#t~mem6, lcp_#t~short7, lcp_#t~mem5] {1264#(and (= |lcp_#in~x| lcp_~x) (= |lcp_#in~y| lcp_~y) (= |lcp_#in~n| lcp_~n))} is VALID [2022-04-07 23:32:44,314 INFO L290 TraceCheckUtils]: 3: Hoare triple {1264#(and (= |lcp_#in~x| lcp_~x) (= |lcp_#in~y| lcp_~y) (= |lcp_#in~n| lcp_~n))} [134] L18-3-->L18-5: Formula: (and (= (+ v_lcp_~l~0_3 1) v_lcp_~l~0_2) |v_lcp_#t~short7_4|) InVars {lcp_#t~short7=|v_lcp_#t~short7_4|, lcp_~l~0=v_lcp_~l~0_3} OutVars{lcp_#t~mem6=|v_lcp_#t~mem6_2|, lcp_#t~mem5=|v_lcp_#t~mem5_2|, lcp_~l~0=v_lcp_~l~0_2, lcp_#t~post8=|v_lcp_#t~post8_1|} AuxVars[] AssignedVars[lcp_~l~0, lcp_#t~mem6, lcp_#t~mem5, lcp_#t~short7, lcp_#t~post8] {1264#(and (= |lcp_#in~x| lcp_~x) (= |lcp_#in~y| lcp_~y) (= |lcp_#in~n| lcp_~n))} is VALID [2022-04-07 23:32:44,314 INFO L290 TraceCheckUtils]: 4: Hoare triple {1264#(and (= |lcp_#in~x| lcp_~x) (= |lcp_#in~y| lcp_~y) (= |lcp_#in~n| lcp_~n))} [118] L18-5-->L18-1: Formula: (let ((.cse1 (< (+ v_lcp_~y_2 v_lcp_~l~0_5) v_lcp_~n_2)) (.cse0 (< (+ v_lcp_~x_2 v_lcp_~l~0_5) v_lcp_~n_2))) (or (and (or (not .cse0) (not .cse1)) (not |v_lcp_#t~short7_5|)) (and .cse1 .cse0 |v_lcp_#t~short7_5|))) InVars {lcp_~x=v_lcp_~x_2, lcp_~l~0=v_lcp_~l~0_5, lcp_~y=v_lcp_~y_2, lcp_~n=v_lcp_~n_2} OutVars{lcp_~x=v_lcp_~x_2, lcp_#t~short7=|v_lcp_#t~short7_5|, lcp_~l~0=v_lcp_~l~0_5, lcp_~y=v_lcp_~y_2, lcp_~n=v_lcp_~n_2} AuxVars[] AssignedVars[lcp_#t~short7] {1265#(or |lcp_#t~short7| (<= |lcp_#in~n| (+ |lcp_#in~x| lcp_~l~0)) (<= |lcp_#in~n| (+ |lcp_#in~y| lcp_~l~0)))} is VALID [2022-04-07 23:32:44,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {1265#(or |lcp_#t~short7| (<= |lcp_#in~n| (+ |lcp_#in~x| lcp_~l~0)) (<= |lcp_#in~n| (+ |lcp_#in~y| lcp_~l~0)))} [125] L18-1-->L18-3: Formula: (not |v_lcp_#t~short7_8|) InVars {lcp_#t~short7=|v_lcp_#t~short7_8|} OutVars{lcp_#t~short7=|v_lcp_#t~short7_8|} AuxVars[] AssignedVars[] {1266#(or (<= |lcp_#in~n| (+ |lcp_#in~x| lcp_~l~0)) (<= |lcp_#in~n| (+ |lcp_#in~y| lcp_~l~0)))} is VALID [2022-04-07 23:32:44,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {1266#(or (<= |lcp_#in~n| (+ |lcp_#in~x| lcp_~l~0)) (<= |lcp_#in~n| (+ |lcp_#in~y| lcp_~l~0)))} [133] L18-3-->L18-6: Formula: (not |v_lcp_#t~short7_2|) InVars {lcp_#t~short7=|v_lcp_#t~short7_2|} OutVars{lcp_#t~mem6=|v_lcp_#t~mem6_1|, lcp_#t~mem5=|v_lcp_#t~mem5_1|} AuxVars[] AssignedVars[lcp_#t~mem6, lcp_#t~mem5, lcp_#t~short7] {1266#(or (<= |lcp_#in~n| (+ |lcp_#in~x| lcp_~l~0)) (<= |lcp_#in~n| (+ |lcp_#in~y| lcp_~l~0)))} is VALID [2022-04-07 23:32:44,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {1266#(or (<= |lcp_#in~n| (+ |lcp_#in~x| lcp_~l~0)) (<= |lcp_#in~n| (+ |lcp_#in~y| lcp_~l~0)))} [123] L18-6-->lcpFINAL: Formula: (= |v_lcp_#res_1| v_lcp_~l~0_4) InVars {lcp_~l~0=v_lcp_~l~0_4} OutVars{lcp_#res=|v_lcp_#res_1|, lcp_~l~0=v_lcp_~l~0_4} AuxVars[] AssignedVars[lcp_#res] {1267#(or (<= |lcp_#in~n| (+ |lcp_#in~x| |lcp_#res|)) (<= |lcp_#in~n| (+ |lcp_#in~y| |lcp_#res|)))} is VALID [2022-04-07 23:32:44,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {1267#(or (<= |lcp_#in~n| (+ |lcp_#in~x| |lcp_#res|)) (<= |lcp_#in~n| (+ |lcp_#in~y| |lcp_#res|)))} [132] lcpFINAL-->lcpEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1267#(or (<= |lcp_#in~n| (+ |lcp_#in~x| |lcp_#res|)) (<= |lcp_#in~n| (+ |lcp_#in~y| |lcp_#res|)))} is VALID [2022-04-07 23:32:44,316 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1267#(or (<= |lcp_#in~n| (+ |lcp_#in~x| |lcp_#res|)) (<= |lcp_#in~n| (+ |lcp_#in~y| |lcp_#res|)))} {1224#true} [147] lcpEXIT-->L44: AOR: Formula: (= |v_lcp_#resOutParam_1| |v_main_#t~ret18_4|) InVars {lcp_#res=|v_lcp_#resOutParam_1|} OutVars{main_#t~ret18=|v_main_#t~ret18_4|} AuxVars[] AssignedVars[main_#t~ret18, lcp_#res] LVA: Formula: (and (= v_main_~y~0_6 |v_lcp_#in~yInParam_1|) (= |v_lcp_#in~nInParam_1| v_main_~n~0_9) (= v_main_~x~0_6 |v_lcp_#in~xInParam_1|) (= |v_lcp_#in~a.offsetInParam_1| v_main_~a~0.offset_5) (= |v_lcp_#in~a.baseInParam_1| v_main_~a~0.base_5)) InVars {main_~a~0.base=v_main_~a~0.base_5, main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_6, main_~a~0.offset=v_main_~a~0.offset_5} OutVars{lcp_#in~a.base=|v_lcp_#in~a.baseInParam_1|, lcp_#in~a.offset=|v_lcp_#in~a.offsetInParam_1|, lcp_#in~n=|v_lcp_#in~nInParam_1|, lcp_#in~y=|v_lcp_#in~yInParam_1|, lcp_#in~x=|v_lcp_#in~xInParam_1|} AuxVars[] AssignedVars[lcp_#in~a.offset, lcp_#in~y, main_~x~0, lcp_#in~x, lcp_#in~a.base, main_~a~0.base, lcp_#in~n, main_~y~0, main_~n~0, main_~a~0.offset] {1250#(or (<= main_~n~0 (+ |main_#t~ret18| main_~x~0)) (<= main_~n~0 (+ |main_#t~ret18| main_~y~0)))} is VALID [2022-04-07 23:32:44,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-07 23:32:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:44,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {1224#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1224#true} is VALID [2022-04-07 23:32:44,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {1224#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:44,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {1224#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:44,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1224#true} {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} [144] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= 0 v_check_~i~0_4) (< v_check_~i~0_4 v_check_~l_5)) 1 0)) InVars {check_~i~0=v_check_~i~0_4, check_~l=v_check_~l_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[check_~i~0, assume_abort_if_not_#in~cond, check_~l] {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} is VALID [2022-04-07 23:32:44,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-07 23:32:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:44,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {1224#true} [120] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1224#true} is VALID [2022-04-07 23:32:44,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {1224#true} [129] L13-->L13-3: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:44,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {1224#true} [139] L13-3-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:44,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1224#true} {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} [149] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= |v_check_#t~mem11_4| |v_check_#t~mem10_4|) 1 0)) InVars {check_#t~mem10=|v_check_#t~mem10_4|, check_#t~mem11=|v_check_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, check_#t~mem10, check_#t~mem11] {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} is VALID [2022-04-07 23:32:44,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {1224#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:32:44,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {1262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [96] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1)) (.cse1 (select |v_#memory_int_5| 2))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= (select .cse1 3) 46) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= 112 (select .cse1 2)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select .cse1 4) 99) (= (select .cse1 5) 0) (= 6 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1224#true} is VALID [2022-04-07 23:32:44,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {1224#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:44,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1224#true} {1224#true} [141] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:44,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {1224#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:44,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {1224#true} [98] mainENTRY-->L38: Formula: (and (<= |v_main_#t~nondet14_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet14_2|) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[main_#t~nondet14, main_~n~0] {1224#true} is VALID [2022-04-07 23:32:44,328 INFO L272 TraceCheckUtils]: 6: Hoare triple {1224#true} [100] L38-->assume_abort_if_notENTRY: Formula: (= (ite (and (< v_main_~n~0_7 1073741824) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1224#true} is VALID [2022-04-07 23:32:44,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {1224#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1224#true} is VALID [2022-04-07 23:32:44,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {1224#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:44,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {1224#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:44,328 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1224#true} {1224#true} [142] assume_abort_if_notEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (< v_main_~n~0_7 1073741824) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1224#true} is VALID [2022-04-07 23:32:44,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {1224#true} [101] L38-1-->L39: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_main_#t~malloc15.base_1| 1)) (not (= |v_main_#t~malloc15.base_1| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_#t~malloc15.base_1| (* v_main_~n~0_5 4))) (< |v_main_#t~malloc15.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_4| |v_main_#t~malloc15.base_1|) 0) (= |v_main_#t~malloc15.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, main_~n~0=v_main_~n~0_5, #valid=|v_#valid_4|} OutVars{main_#t~malloc15.offset=|v_main_#t~malloc15.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_3|, #length=|v_#length_1|, main_~n~0=v_main_~n~0_5, main_#t~malloc15.base=|v_main_#t~malloc15.base_1|} AuxVars[] AssignedVars[main_#t~malloc15.offset, #valid, #length, main_#t~malloc15.base] {1224#true} is VALID [2022-04-07 23:32:44,330 INFO L272 TraceCheckUtils]: 12: Hoare triple {1224#true} [103] L39-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc15.base_4|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_main_~n~0_8 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_8 4)) (= |v_#Ultimate.meminit_#ptr.offsetInParam_1| |v_main_#t~malloc15.offset_4|)) InVars {main_#t~malloc15.offset=|v_main_#t~malloc15.offset_4|, main_~n~0=v_main_~n~0_8, main_#t~malloc15.base=|v_main_#t~malloc15.base_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[main_#t~malloc15.offset, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_~n~0, #Ultimate.meminit_#ptr.base, main_#t~malloc15.base, #Ultimate.meminit_#ptr.offset] {1263#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-07 23:32:44,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {1263#(= |#memory_int| |old(#memory_int)|)} [107] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {1224#true} is VALID [2022-04-07 23:32:44,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {1224#true} [110] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:44,330 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1224#true} {1224#true} [145] #Ultimate.meminitEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc15.base_4|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_main_~n~0_8 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_8 4)) (= |v_#Ultimate.meminit_#ptr.offsetInParam_1| |v_main_#t~malloc15.offset_4|)) InVars {main_#t~malloc15.offset=|v_main_#t~malloc15.offset_4|, main_~n~0=v_main_~n~0_8, main_#t~malloc15.base=|v_main_#t~malloc15.base_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[main_#t~malloc15.offset, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_~n~0, #Ultimate.meminit_#ptr.base, main_#t~malloc15.base, #Ultimate.meminit_#ptr.offset] {1224#true} is VALID [2022-04-07 23:32:44,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {1224#true} [106] L39-1-->L43: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~a~0.offset_4 |v_main_#t~malloc15.offset_3|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet17_2|) (= v_main_~x~0_3 |v_main_#t~nondet16_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (= v_main_~a~0.base_4 |v_main_#t~malloc15.base_3|)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~malloc15.offset=|v_main_#t~malloc15.offset_3|, main_#t~malloc15.base=|v_main_#t~malloc15.base_3|, main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_#t~malloc15.offset=|v_main_#t~malloc15.offset_3|, main_~x~0=v_main_~x~0_3, main_~a~0.base=v_main_~a~0.base_4, main_~y~0=v_main_~y~0_3, main_#t~malloc15.base=|v_main_#t~malloc15.base_3|, main_~a~0.offset=v_main_~a~0.offset_4} AuxVars[] AssignedVars[main_#t~nondet16, main_~x~0, main_#t~nondet17, main_~a~0.base, main_~y~0, main_~a~0.offset] {1224#true} is VALID [2022-04-07 23:32:44,330 INFO L272 TraceCheckUtils]: 17: Hoare triple {1224#true} [109] L43-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_5) (<= 0 v_main_~x~0_5)) 1 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, assume_abort_if_not_#in~cond] {1224#true} is VALID [2022-04-07 23:32:44,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {1224#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1224#true} is VALID [2022-04-07 23:32:44,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {1224#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:44,331 INFO L290 TraceCheckUtils]: 20: Hoare triple {1224#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:44,331 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1224#true} {1224#true} [143] assume_abort_if_notEXIT-->L43-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_5) (<= 0 v_main_~x~0_5)) 1 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, assume_abort_if_not_#in~cond] {1224#true} is VALID [2022-04-07 23:32:44,331 INFO L272 TraceCheckUtils]: 22: Hoare triple {1224#true} [111] L43-1-->lcpENTRY: Formula: (and (= v_main_~y~0_6 |v_lcp_#in~yInParam_1|) (= |v_lcp_#in~nInParam_1| v_main_~n~0_9) (= v_main_~x~0_6 |v_lcp_#in~xInParam_1|) (= |v_lcp_#in~a.offsetInParam_1| v_main_~a~0.offset_5) (= |v_lcp_#in~a.baseInParam_1| v_main_~a~0.base_5)) InVars {main_~a~0.base=v_main_~a~0.base_5, main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_6, main_~a~0.offset=v_main_~a~0.offset_5} OutVars{lcp_#in~a.base=|v_lcp_#in~a.baseInParam_1|, lcp_#in~a.offset=|v_lcp_#in~a.offsetInParam_1|, lcp_#in~n=|v_lcp_#in~nInParam_1|, lcp_#in~y=|v_lcp_#in~yInParam_1|, lcp_#in~x=|v_lcp_#in~xInParam_1|} AuxVars[] AssignedVars[lcp_#in~a.offset, lcp_#in~y, main_~x~0, lcp_#in~x, lcp_#in~a.base, main_~a~0.base, lcp_#in~n, main_~y~0, main_~n~0, main_~a~0.offset] {1224#true} is VALID [2022-04-07 23:32:44,331 INFO L290 TraceCheckUtils]: 23: Hoare triple {1224#true} [114] lcpENTRY-->L18-5: Formula: (and (= v_lcp_~a.base_1 |v_lcp_#in~a.base_1|) (= v_lcp_~n_1 |v_lcp_#in~n_1|) (= v_lcp_~l~0_1 0) (= v_lcp_~x_1 |v_lcp_#in~x_1|) (= v_lcp_~y_1 |v_lcp_#in~y_1|) (= |v_lcp_#in~a.offset_1| v_lcp_~a.offset_1)) InVars {lcp_#in~a.base=|v_lcp_#in~a.base_1|, lcp_#in~a.offset=|v_lcp_#in~a.offset_1|, lcp_#in~n=|v_lcp_#in~n_1|, lcp_#in~y=|v_lcp_#in~y_1|, lcp_#in~x=|v_lcp_#in~x_1|} OutVars{lcp_~x=v_lcp_~x_1, lcp_#in~a.offset=|v_lcp_#in~a.offset_1|, lcp_~l~0=v_lcp_~l~0_1, lcp_~a.offset=v_lcp_~a.offset_1, lcp_~y=v_lcp_~y_1, lcp_#in~y=|v_lcp_#in~y_1|, lcp_~a.base=v_lcp_~a.base_1, lcp_#in~x=|v_lcp_#in~x_1|, lcp_#in~a.base=|v_lcp_#in~a.base_1|, lcp_#in~n=|v_lcp_#in~n_1|, lcp_~n=v_lcp_~n_1} AuxVars[] AssignedVars[lcp_~x, lcp_~l~0, lcp_~a.offset, lcp_~y, lcp_~a.base, lcp_~n] {1264#(and (= |lcp_#in~x| lcp_~x) (= |lcp_#in~y| lcp_~y) (= |lcp_#in~n| lcp_~n))} is VALID [2022-04-07 23:32:44,332 INFO L290 TraceCheckUtils]: 24: Hoare triple {1264#(and (= |lcp_#in~x| lcp_~x) (= |lcp_#in~y| lcp_~y) (= |lcp_#in~n| lcp_~n))} [118] L18-5-->L18-1: Formula: (let ((.cse1 (< (+ v_lcp_~y_2 v_lcp_~l~0_5) v_lcp_~n_2)) (.cse0 (< (+ v_lcp_~x_2 v_lcp_~l~0_5) v_lcp_~n_2))) (or (and (or (not .cse0) (not .cse1)) (not |v_lcp_#t~short7_5|)) (and .cse1 .cse0 |v_lcp_#t~short7_5|))) InVars {lcp_~x=v_lcp_~x_2, lcp_~l~0=v_lcp_~l~0_5, lcp_~y=v_lcp_~y_2, lcp_~n=v_lcp_~n_2} OutVars{lcp_~x=v_lcp_~x_2, lcp_#t~short7=|v_lcp_#t~short7_5|, lcp_~l~0=v_lcp_~l~0_5, lcp_~y=v_lcp_~y_2, lcp_~n=v_lcp_~n_2} AuxVars[] AssignedVars[lcp_#t~short7] {1264#(and (= |lcp_#in~x| lcp_~x) (= |lcp_#in~y| lcp_~y) (= |lcp_#in~n| lcp_~n))} is VALID [2022-04-07 23:32:44,332 INFO L290 TraceCheckUtils]: 25: Hoare triple {1264#(and (= |lcp_#in~x| lcp_~x) (= |lcp_#in~y| lcp_~y) (= |lcp_#in~n| lcp_~n))} [124] L18-1-->L18-3: Formula: (let ((.cse0 (select |v_#memory_int_6| v_lcp_~a.base_2)) (.cse1 (* v_lcp_~l~0_6 4))) (and (= (select .cse0 (+ v_lcp_~a.offset_2 .cse1 (* v_lcp_~y_3 4))) |v_lcp_#t~mem6_3|) (let ((.cse2 (= |v_lcp_#t~mem6_3| |v_lcp_#t~mem5_3|))) (or (and (not |v_lcp_#t~short7_6|) (not .cse2)) (and .cse2 |v_lcp_#t~short7_6|))) (= |v_lcp_#t~mem5_3| (select .cse0 (+ v_lcp_~a.offset_2 .cse1 (* v_lcp_~x_3 4)))) |v_lcp_#t~short7_7|)) InVars {lcp_~x=v_lcp_~x_3, lcp_~a.offset=v_lcp_~a.offset_2, lcp_~l~0=v_lcp_~l~0_6, lcp_~y=v_lcp_~y_3, lcp_~a.base=v_lcp_~a.base_2, #memory_int=|v_#memory_int_6|, lcp_#t~short7=|v_lcp_#t~short7_7|} OutVars{lcp_~x=v_lcp_~x_3, lcp_~a.offset=v_lcp_~a.offset_2, lcp_~l~0=v_lcp_~l~0_6, lcp_~y=v_lcp_~y_3, lcp_~a.base=v_lcp_~a.base_2, lcp_#t~mem6=|v_lcp_#t~mem6_3|, #memory_int=|v_#memory_int_6|, lcp_#t~short7=|v_lcp_#t~short7_6|, lcp_#t~mem5=|v_lcp_#t~mem5_3|} AuxVars[] AssignedVars[lcp_#t~mem6, lcp_#t~short7, lcp_#t~mem5] {1264#(and (= |lcp_#in~x| lcp_~x) (= |lcp_#in~y| lcp_~y) (= |lcp_#in~n| lcp_~n))} is VALID [2022-04-07 23:32:44,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {1264#(and (= |lcp_#in~x| lcp_~x) (= |lcp_#in~y| lcp_~y) (= |lcp_#in~n| lcp_~n))} [134] L18-3-->L18-5: Formula: (and (= (+ v_lcp_~l~0_3 1) v_lcp_~l~0_2) |v_lcp_#t~short7_4|) InVars {lcp_#t~short7=|v_lcp_#t~short7_4|, lcp_~l~0=v_lcp_~l~0_3} OutVars{lcp_#t~mem6=|v_lcp_#t~mem6_2|, lcp_#t~mem5=|v_lcp_#t~mem5_2|, lcp_~l~0=v_lcp_~l~0_2, lcp_#t~post8=|v_lcp_#t~post8_1|} AuxVars[] AssignedVars[lcp_~l~0, lcp_#t~mem6, lcp_#t~mem5, lcp_#t~short7, lcp_#t~post8] {1264#(and (= |lcp_#in~x| lcp_~x) (= |lcp_#in~y| lcp_~y) (= |lcp_#in~n| lcp_~n))} is VALID [2022-04-07 23:32:44,333 INFO L290 TraceCheckUtils]: 27: Hoare triple {1264#(and (= |lcp_#in~x| lcp_~x) (= |lcp_#in~y| lcp_~y) (= |lcp_#in~n| lcp_~n))} [118] L18-5-->L18-1: Formula: (let ((.cse1 (< (+ v_lcp_~y_2 v_lcp_~l~0_5) v_lcp_~n_2)) (.cse0 (< (+ v_lcp_~x_2 v_lcp_~l~0_5) v_lcp_~n_2))) (or (and (or (not .cse0) (not .cse1)) (not |v_lcp_#t~short7_5|)) (and .cse1 .cse0 |v_lcp_#t~short7_5|))) InVars {lcp_~x=v_lcp_~x_2, lcp_~l~0=v_lcp_~l~0_5, lcp_~y=v_lcp_~y_2, lcp_~n=v_lcp_~n_2} OutVars{lcp_~x=v_lcp_~x_2, lcp_#t~short7=|v_lcp_#t~short7_5|, lcp_~l~0=v_lcp_~l~0_5, lcp_~y=v_lcp_~y_2, lcp_~n=v_lcp_~n_2} AuxVars[] AssignedVars[lcp_#t~short7] {1265#(or |lcp_#t~short7| (<= |lcp_#in~n| (+ |lcp_#in~x| lcp_~l~0)) (<= |lcp_#in~n| (+ |lcp_#in~y| lcp_~l~0)))} is VALID [2022-04-07 23:32:44,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {1265#(or |lcp_#t~short7| (<= |lcp_#in~n| (+ |lcp_#in~x| lcp_~l~0)) (<= |lcp_#in~n| (+ |lcp_#in~y| lcp_~l~0)))} [125] L18-1-->L18-3: Formula: (not |v_lcp_#t~short7_8|) InVars {lcp_#t~short7=|v_lcp_#t~short7_8|} OutVars{lcp_#t~short7=|v_lcp_#t~short7_8|} AuxVars[] AssignedVars[] {1266#(or (<= |lcp_#in~n| (+ |lcp_#in~x| lcp_~l~0)) (<= |lcp_#in~n| (+ |lcp_#in~y| lcp_~l~0)))} is VALID [2022-04-07 23:32:44,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {1266#(or (<= |lcp_#in~n| (+ |lcp_#in~x| lcp_~l~0)) (<= |lcp_#in~n| (+ |lcp_#in~y| lcp_~l~0)))} [133] L18-3-->L18-6: Formula: (not |v_lcp_#t~short7_2|) InVars {lcp_#t~short7=|v_lcp_#t~short7_2|} OutVars{lcp_#t~mem6=|v_lcp_#t~mem6_1|, lcp_#t~mem5=|v_lcp_#t~mem5_1|} AuxVars[] AssignedVars[lcp_#t~mem6, lcp_#t~mem5, lcp_#t~short7] {1266#(or (<= |lcp_#in~n| (+ |lcp_#in~x| lcp_~l~0)) (<= |lcp_#in~n| (+ |lcp_#in~y| lcp_~l~0)))} is VALID [2022-04-07 23:32:44,334 INFO L290 TraceCheckUtils]: 30: Hoare triple {1266#(or (<= |lcp_#in~n| (+ |lcp_#in~x| lcp_~l~0)) (<= |lcp_#in~n| (+ |lcp_#in~y| lcp_~l~0)))} [123] L18-6-->lcpFINAL: Formula: (= |v_lcp_#res_1| v_lcp_~l~0_4) InVars {lcp_~l~0=v_lcp_~l~0_4} OutVars{lcp_#res=|v_lcp_#res_1|, lcp_~l~0=v_lcp_~l~0_4} AuxVars[] AssignedVars[lcp_#res] {1267#(or (<= |lcp_#in~n| (+ |lcp_#in~x| |lcp_#res|)) (<= |lcp_#in~n| (+ |lcp_#in~y| |lcp_#res|)))} is VALID [2022-04-07 23:32:44,334 INFO L290 TraceCheckUtils]: 31: Hoare triple {1267#(or (<= |lcp_#in~n| (+ |lcp_#in~x| |lcp_#res|)) (<= |lcp_#in~n| (+ |lcp_#in~y| |lcp_#res|)))} [132] lcpFINAL-->lcpEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1267#(or (<= |lcp_#in~n| (+ |lcp_#in~x| |lcp_#res|)) (<= |lcp_#in~n| (+ |lcp_#in~y| |lcp_#res|)))} is VALID [2022-04-07 23:32:44,335 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1267#(or (<= |lcp_#in~n| (+ |lcp_#in~x| |lcp_#res|)) (<= |lcp_#in~n| (+ |lcp_#in~y| |lcp_#res|)))} {1224#true} [147] lcpEXIT-->L44: AOR: Formula: (= |v_lcp_#resOutParam_1| |v_main_#t~ret18_4|) InVars {lcp_#res=|v_lcp_#resOutParam_1|} OutVars{main_#t~ret18=|v_main_#t~ret18_4|} AuxVars[] AssignedVars[main_#t~ret18, lcp_#res] LVA: Formula: (and (= v_main_~y~0_6 |v_lcp_#in~yInParam_1|) (= |v_lcp_#in~nInParam_1| v_main_~n~0_9) (= v_main_~x~0_6 |v_lcp_#in~xInParam_1|) (= |v_lcp_#in~a.offsetInParam_1| v_main_~a~0.offset_5) (= |v_lcp_#in~a.baseInParam_1| v_main_~a~0.base_5)) InVars {main_~a~0.base=v_main_~a~0.base_5, main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_6, main_~a~0.offset=v_main_~a~0.offset_5} OutVars{lcp_#in~a.base=|v_lcp_#in~a.baseInParam_1|, lcp_#in~a.offset=|v_lcp_#in~a.offsetInParam_1|, lcp_#in~n=|v_lcp_#in~nInParam_1|, lcp_#in~y=|v_lcp_#in~yInParam_1|, lcp_#in~x=|v_lcp_#in~xInParam_1|} AuxVars[] AssignedVars[lcp_#in~a.offset, lcp_#in~y, main_~x~0, lcp_#in~x, lcp_#in~a.base, main_~a~0.base, lcp_#in~n, main_~y~0, main_~n~0, main_~a~0.offset] {1250#(or (<= main_~n~0 (+ |main_#t~ret18| main_~x~0)) (<= main_~n~0 (+ |main_#t~ret18| main_~y~0)))} is VALID [2022-04-07 23:32:44,336 INFO L290 TraceCheckUtils]: 33: Hoare triple {1250#(or (<= main_~n~0 (+ |main_#t~ret18| main_~x~0)) (<= main_~n~0 (+ |main_#t~ret18| main_~y~0)))} [113] L44-->L45: Formula: (and (<= |v_main_#t~ret18_3| 2147483647) (= v_main_~l~1_1 |v_main_#t~ret18_3|) (<= 0 (+ |v_main_#t~ret18_3| 2147483648))) InVars {main_#t~ret18=|v_main_#t~ret18_3|} OutVars{main_~l~1=v_main_~l~1_1} AuxVars[] AssignedVars[main_#t~ret18, main_~l~1] {1251#(or (<= main_~n~0 (+ main_~l~1 main_~y~0)) (<= main_~n~0 (+ main_~l~1 main_~x~0)))} is VALID [2022-04-07 23:32:44,336 INFO L272 TraceCheckUtils]: 34: Hoare triple {1251#(or (<= main_~n~0 (+ main_~l~1 main_~y~0)) (<= main_~n~0 (+ main_~l~1 main_~x~0)))} [116] L45-->checkENTRY: Formula: (and (= v_main_~n~0_10 |v_check_#in~nInParam_1|) (= |v_check_#in~a.baseInParam_1| v_main_~a~0.base_6) (= v_main_~y~0_7 |v_check_#in~yInParam_1|) (= v_main_~x~0_7 |v_check_#in~xInParam_1|) (= |v_check_#in~a.offsetInParam_1| v_main_~a~0.offset_6) (= |v_check_#in~lInParam_1| v_main_~l~1_3)) InVars {main_~x~0=v_main_~x~0_7, main_~l~1=v_main_~l~1_3, main_~a~0.base=v_main_~a~0.base_6, main_~y~0=v_main_~y~0_7, main_~n~0=v_main_~n~0_10, main_~a~0.offset=v_main_~a~0.offset_6} OutVars{check_#in~y=|v_check_#in~yInParam_1|, check_#in~x=|v_check_#in~xInParam_1|, check_#in~a.offset=|v_check_#in~a.offsetInParam_1|, check_#in~a.base=|v_check_#in~a.baseInParam_1|, check_#in~l=|v_check_#in~lInParam_1|, check_#in~n=|v_check_#in~nInParam_1|} AuxVars[] AssignedVars[check_#in~y, check_#in~x, check_#in~a.offset, main_~x~0, main_~l~1, check_#in~a.base, main_~a~0.base, main_~y~0, main_~n~0, check_#in~l, main_~a~0.offset, check_#in~n] {1252#(or (<= |check_#in~n| (+ |check_#in~x| |check_#in~l|)) (<= |check_#in~n| (+ |check_#in~y| |check_#in~l|)))} is VALID [2022-04-07 23:32:44,337 INFO L290 TraceCheckUtils]: 35: Hoare triple {1252#(or (<= |check_#in~n| (+ |check_#in~x| |check_#in~l|)) (<= |check_#in~n| (+ |check_#in~y| |check_#in~l|)))} [122] checkENTRY-->L27: Formula: (and (= v_check_~x_2 |v_check_#in~x_1|) (= |v_check_#in~a.offset_1| v_check_~a.offset_1) (= v_check_~i~0_1 |v_check_#t~nondet9_2|) (= v_check_~l_2 |v_check_#in~l_1|) (= v_check_~n_2 |v_check_#in~n_1|) (= v_check_~a.base_1 |v_check_#in~a.base_1|) (<= 0 (+ 2147483648 |v_check_#t~nondet9_2|)) (= v_check_~y_2 |v_check_#in~y_1|) (<= |v_check_#t~nondet9_2| 2147483647)) InVars {check_#in~y=|v_check_#in~y_1|, check_#in~x=|v_check_#in~x_1|, check_#in~a.offset=|v_check_#in~a.offset_1|, check_#in~a.base=|v_check_#in~a.base_1|, check_#in~l=|v_check_#in~l_1|, check_#t~nondet9=|v_check_#t~nondet9_2|, check_#in~n=|v_check_#in~n_1|} OutVars{check_#in~y=|v_check_#in~y_1|, check_#in~x=|v_check_#in~x_1|, check_#in~a.offset=|v_check_#in~a.offset_1|, check_~a.base=v_check_~a.base_1, check_~i~0=v_check_~i~0_1, check_~y=v_check_~y_2, check_~x=v_check_~x_2, check_~a.offset=v_check_~a.offset_1, check_#in~a.base=|v_check_#in~a.base_1|, check_#in~l=|v_check_#in~l_1|, check_~n=v_check_~n_2, check_#in~n=|v_check_#in~n_1|, check_~l=v_check_~l_2} AuxVars[] AssignedVars[check_~y, check_~x, check_~a.base, check_~a.offset, check_~i~0, check_~n, check_#t~nondet9, check_~l] {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} is VALID [2022-04-07 23:32:44,337 INFO L272 TraceCheckUtils]: 36: Hoare triple {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} [131] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= 0 v_check_~i~0_4) (< v_check_~i~0_4 v_check_~l_5)) 1 0)) InVars {check_~i~0=v_check_~i~0_4, check_~l=v_check_~l_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[check_~i~0, assume_abort_if_not_#in~cond, check_~l] {1224#true} is VALID [2022-04-07 23:32:44,337 INFO L290 TraceCheckUtils]: 37: Hoare triple {1224#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1224#true} is VALID [2022-04-07 23:32:44,337 INFO L290 TraceCheckUtils]: 38: Hoare triple {1224#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:44,337 INFO L290 TraceCheckUtils]: 39: Hoare triple {1224#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:44,338 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1224#true} {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} [144] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= 0 v_check_~i~0_4) (< v_check_~i~0_4 v_check_~l_5)) 1 0)) InVars {check_~i~0=v_check_~i~0_4, check_~l=v_check_~l_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[check_~i~0, assume_abort_if_not_#in~cond, check_~l] {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} is VALID [2022-04-07 23:32:44,338 INFO L290 TraceCheckUtils]: 41: Hoare triple {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} [112] L27-1-->L28: Formula: (let ((.cse0 (select |v_#memory_int_3| v_check_~a.base_2)) (.cse1 (* v_check_~i~0_3 4))) (and (= (select .cse0 (+ (* v_check_~y_3 4) v_check_~a.offset_2 .cse1)) |v_check_#t~mem11_1|) (= (select .cse0 (+ (* v_check_~x_3 4) v_check_~a.offset_2 .cse1)) |v_check_#t~mem10_1|))) InVars {check_~y=v_check_~y_3, check_~x=v_check_~x_3, check_~a.base=v_check_~a.base_2, check_~a.offset=v_check_~a.offset_2, check_~i~0=v_check_~i~0_3, #memory_int=|v_#memory_int_3|} OutVars{check_~y=v_check_~y_3, check_~x=v_check_~x_3, check_#t~mem10=|v_check_#t~mem10_1|, check_~a.base=v_check_~a.base_2, check_~a.offset=v_check_~a.offset_2, check_~i~0=v_check_~i~0_3, check_#t~mem11=|v_check_#t~mem11_1|, #memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[check_#t~mem10, check_#t~mem11] {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} is VALID [2022-04-07 23:32:44,338 INFO L272 TraceCheckUtils]: 42: Hoare triple {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} [115] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= |v_check_#t~mem11_4| |v_check_#t~mem10_4|) 1 0)) InVars {check_#t~mem10=|v_check_#t~mem10_4|, check_#t~mem11=|v_check_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, check_#t~mem10, check_#t~mem11] {1224#true} is VALID [2022-04-07 23:32:44,338 INFO L290 TraceCheckUtils]: 43: Hoare triple {1224#true} [120] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1224#true} is VALID [2022-04-07 23:32:44,338 INFO L290 TraceCheckUtils]: 44: Hoare triple {1224#true} [129] L13-->L13-3: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:44,338 INFO L290 TraceCheckUtils]: 45: Hoare triple {1224#true} [139] L13-3-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:44,339 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1224#true} {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} [149] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= |v_check_#t~mem11_4| |v_check_#t~mem10_4|) 1 0)) InVars {check_#t~mem10=|v_check_#t~mem10_4|, check_#t~mem11=|v_check_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, check_#t~mem10, check_#t~mem11] {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} is VALID [2022-04-07 23:32:44,339 INFO L290 TraceCheckUtils]: 47: Hoare triple {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} [119] L28-1-->L31: Formula: true InVars {} OutVars{check_#t~mem10=|v_check_#t~mem10_3|, check_#t~mem11=|v_check_#t~mem11_3|} AuxVars[] AssignedVars[check_#t~mem10, check_#t~mem11] {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} is VALID [2022-04-07 23:32:44,339 INFO L290 TraceCheckUtils]: 48: Hoare triple {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} [126] L31-->L32: Formula: (let ((.cse0 (select |v_#memory_int_4| v_check_~a.base_3)) (.cse1 (* v_check_~l_4 4))) (and (< (+ v_check_~l_4 v_check_~x_4) v_check_~n_3) (< (+ v_check_~l_4 v_check_~y_4) v_check_~n_3) (= (select .cse0 (+ (* v_check_~y_4 4) .cse1 v_check_~a.offset_3)) |v_check_#t~mem13_1|) (= |v_check_#t~mem12_1| (select .cse0 (+ .cse1 (* v_check_~x_4 4) v_check_~a.offset_3))))) InVars {check_~y=v_check_~y_4, check_~x=v_check_~x_4, check_~a.base=v_check_~a.base_3, check_~a.offset=v_check_~a.offset_3, #memory_int=|v_#memory_int_4|, check_~n=v_check_~n_3, check_~l=v_check_~l_4} OutVars{check_#t~mem13=|v_check_#t~mem13_1|, check_~y=v_check_~y_4, check_~x=v_check_~x_4, check_~a.base=v_check_~a.base_3, check_~a.offset=v_check_~a.offset_3, check_#t~mem12=|v_check_#t~mem12_1|, #memory_int=|v_#memory_int_4|, check_~n=v_check_~n_3, check_~l=v_check_~l_4} AuxVars[] AssignedVars[check_#t~mem13, check_#t~mem12] {1225#false} is VALID [2022-04-07 23:32:44,340 INFO L272 TraceCheckUtils]: 49: Hoare triple {1225#false} [135] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= |v_check_#t~mem13_4| |v_check_#t~mem12_4|)) 1 0)) InVars {check_#t~mem13=|v_check_#t~mem13_4|, check_#t~mem12=|v_check_#t~mem12_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[check_#t~mem13, __VERIFIER_assert_#in~cond, check_#t~mem12] {1225#false} is VALID [2022-04-07 23:32:44,340 INFO L290 TraceCheckUtils]: 50: Hoare triple {1225#false} [120] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1225#false} is VALID [2022-04-07 23:32:44,340 INFO L290 TraceCheckUtils]: 51: Hoare triple {1225#false} [128] L13-->L13-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1225#false} is VALID [2022-04-07 23:32:44,340 INFO L290 TraceCheckUtils]: 52: Hoare triple {1225#false} [137] L13-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1225#false} is VALID [2022-04-07 23:32:44,340 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-07 23:32:44,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:32:44,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799340118] [2022-04-07 23:32:44,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799340118] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:32:44,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401263552] [2022-04-07 23:32:44,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:32:44,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:32:44,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:32:44,342 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 23:32:44,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 23:32:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:44,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-07 23:32:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:44,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:32:45,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {1224#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:45,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {1224#true} [96] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1)) (.cse1 (select |v_#memory_int_5| 2))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= (select .cse1 3) 46) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= 112 (select .cse1 2)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select .cse1 4) 99) (= (select .cse1 5) 0) (= 6 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1224#true} is VALID [2022-04-07 23:32:45,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {1224#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:45,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1224#true} {1224#true} [141] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:45,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {1224#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:45,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {1224#true} [98] mainENTRY-->L38: Formula: (and (<= |v_main_#t~nondet14_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet14_2|) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[main_#t~nondet14, main_~n~0] {1224#true} is VALID [2022-04-07 23:32:45,751 INFO L272 TraceCheckUtils]: 6: Hoare triple {1224#true} [100] L38-->assume_abort_if_notENTRY: Formula: (= (ite (and (< v_main_~n~0_7 1073741824) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1224#true} is VALID [2022-04-07 23:32:45,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {1224#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1224#true} is VALID [2022-04-07 23:32:45,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {1224#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:45,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {1224#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:45,751 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1224#true} {1224#true} [142] assume_abort_if_notEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (< v_main_~n~0_7 1073741824) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1224#true} is VALID [2022-04-07 23:32:45,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {1224#true} [101] L38-1-->L39: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_main_#t~malloc15.base_1| 1)) (not (= |v_main_#t~malloc15.base_1| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_#t~malloc15.base_1| (* v_main_~n~0_5 4))) (< |v_main_#t~malloc15.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_4| |v_main_#t~malloc15.base_1|) 0) (= |v_main_#t~malloc15.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, main_~n~0=v_main_~n~0_5, #valid=|v_#valid_4|} OutVars{main_#t~malloc15.offset=|v_main_#t~malloc15.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_3|, #length=|v_#length_1|, main_~n~0=v_main_~n~0_5, main_#t~malloc15.base=|v_main_#t~malloc15.base_1|} AuxVars[] AssignedVars[main_#t~malloc15.offset, #valid, #length, main_#t~malloc15.base] {1224#true} is VALID [2022-04-07 23:32:45,752 INFO L272 TraceCheckUtils]: 12: Hoare triple {1224#true} [103] L39-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc15.base_4|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_main_~n~0_8 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_8 4)) (= |v_#Ultimate.meminit_#ptr.offsetInParam_1| |v_main_#t~malloc15.offset_4|)) InVars {main_#t~malloc15.offset=|v_main_#t~malloc15.offset_4|, main_~n~0=v_main_~n~0_8, main_#t~malloc15.base=|v_main_#t~malloc15.base_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[main_#t~malloc15.offset, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_~n~0, #Ultimate.meminit_#ptr.base, main_#t~malloc15.base, #Ultimate.meminit_#ptr.offset] {1224#true} is VALID [2022-04-07 23:32:45,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {1224#true} [107] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {1224#true} is VALID [2022-04-07 23:32:45,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {1224#true} [110] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:45,752 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1224#true} {1224#true} [145] #Ultimate.meminitEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc15.base_4|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_main_~n~0_8 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_8 4)) (= |v_#Ultimate.meminit_#ptr.offsetInParam_1| |v_main_#t~malloc15.offset_4|)) InVars {main_#t~malloc15.offset=|v_main_#t~malloc15.offset_4|, main_~n~0=v_main_~n~0_8, main_#t~malloc15.base=|v_main_#t~malloc15.base_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[main_#t~malloc15.offset, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_~n~0, #Ultimate.meminit_#ptr.base, main_#t~malloc15.base, #Ultimate.meminit_#ptr.offset] {1224#true} is VALID [2022-04-07 23:32:45,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {1224#true} [106] L39-1-->L43: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~a~0.offset_4 |v_main_#t~malloc15.offset_3|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet17_2|) (= v_main_~x~0_3 |v_main_#t~nondet16_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (= v_main_~a~0.base_4 |v_main_#t~malloc15.base_3|)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~malloc15.offset=|v_main_#t~malloc15.offset_3|, main_#t~malloc15.base=|v_main_#t~malloc15.base_3|, main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_#t~malloc15.offset=|v_main_#t~malloc15.offset_3|, main_~x~0=v_main_~x~0_3, main_~a~0.base=v_main_~a~0.base_4, main_~y~0=v_main_~y~0_3, main_#t~malloc15.base=|v_main_#t~malloc15.base_3|, main_~a~0.offset=v_main_~a~0.offset_4} AuxVars[] AssignedVars[main_#t~nondet16, main_~x~0, main_#t~nondet17, main_~a~0.base, main_~y~0, main_~a~0.offset] {1224#true} is VALID [2022-04-07 23:32:45,752 INFO L272 TraceCheckUtils]: 17: Hoare triple {1224#true} [109] L43-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_5) (<= 0 v_main_~x~0_5)) 1 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, assume_abort_if_not_#in~cond] {1224#true} is VALID [2022-04-07 23:32:45,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {1224#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1224#true} is VALID [2022-04-07 23:32:45,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {1224#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:45,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {1224#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:45,753 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1224#true} {1224#true} [143] assume_abort_if_notEXIT-->L43-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_5) (<= 0 v_main_~x~0_5)) 1 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, assume_abort_if_not_#in~cond] {1224#true} is VALID [2022-04-07 23:32:45,753 INFO L272 TraceCheckUtils]: 22: Hoare triple {1224#true} [111] L43-1-->lcpENTRY: Formula: (and (= v_main_~y~0_6 |v_lcp_#in~yInParam_1|) (= |v_lcp_#in~nInParam_1| v_main_~n~0_9) (= v_main_~x~0_6 |v_lcp_#in~xInParam_1|) (= |v_lcp_#in~a.offsetInParam_1| v_main_~a~0.offset_5) (= |v_lcp_#in~a.baseInParam_1| v_main_~a~0.base_5)) InVars {main_~a~0.base=v_main_~a~0.base_5, main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_6, main_~a~0.offset=v_main_~a~0.offset_5} OutVars{lcp_#in~a.base=|v_lcp_#in~a.baseInParam_1|, lcp_#in~a.offset=|v_lcp_#in~a.offsetInParam_1|, lcp_#in~n=|v_lcp_#in~nInParam_1|, lcp_#in~y=|v_lcp_#in~yInParam_1|, lcp_#in~x=|v_lcp_#in~xInParam_1|} AuxVars[] AssignedVars[lcp_#in~a.offset, lcp_#in~y, main_~x~0, lcp_#in~x, lcp_#in~a.base, main_~a~0.base, lcp_#in~n, main_~y~0, main_~n~0, main_~a~0.offset] {1224#true} is VALID [2022-04-07 23:32:45,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {1224#true} [114] lcpENTRY-->L18-5: Formula: (and (= v_lcp_~a.base_1 |v_lcp_#in~a.base_1|) (= v_lcp_~n_1 |v_lcp_#in~n_1|) (= v_lcp_~l~0_1 0) (= v_lcp_~x_1 |v_lcp_#in~x_1|) (= v_lcp_~y_1 |v_lcp_#in~y_1|) (= |v_lcp_#in~a.offset_1| v_lcp_~a.offset_1)) InVars {lcp_#in~a.base=|v_lcp_#in~a.base_1|, lcp_#in~a.offset=|v_lcp_#in~a.offset_1|, lcp_#in~n=|v_lcp_#in~n_1|, lcp_#in~y=|v_lcp_#in~y_1|, lcp_#in~x=|v_lcp_#in~x_1|} OutVars{lcp_~x=v_lcp_~x_1, lcp_#in~a.offset=|v_lcp_#in~a.offset_1|, lcp_~l~0=v_lcp_~l~0_1, lcp_~a.offset=v_lcp_~a.offset_1, lcp_~y=v_lcp_~y_1, lcp_#in~y=|v_lcp_#in~y_1|, lcp_~a.base=v_lcp_~a.base_1, lcp_#in~x=|v_lcp_#in~x_1|, lcp_#in~a.base=|v_lcp_#in~a.base_1|, lcp_#in~n=|v_lcp_#in~n_1|, lcp_~n=v_lcp_~n_1} AuxVars[] AssignedVars[lcp_~x, lcp_~l~0, lcp_~a.offset, lcp_~y, lcp_~a.base, lcp_~n] {1340#(and (<= lcp_~y |lcp_#in~y|) (<= |lcp_#in~n| lcp_~n) (<= lcp_~x |lcp_#in~x|))} is VALID [2022-04-07 23:32:45,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {1340#(and (<= lcp_~y |lcp_#in~y|) (<= |lcp_#in~n| lcp_~n) (<= lcp_~x |lcp_#in~x|))} [118] L18-5-->L18-1: Formula: (let ((.cse1 (< (+ v_lcp_~y_2 v_lcp_~l~0_5) v_lcp_~n_2)) (.cse0 (< (+ v_lcp_~x_2 v_lcp_~l~0_5) v_lcp_~n_2))) (or (and (or (not .cse0) (not .cse1)) (not |v_lcp_#t~short7_5|)) (and .cse1 .cse0 |v_lcp_#t~short7_5|))) InVars {lcp_~x=v_lcp_~x_2, lcp_~l~0=v_lcp_~l~0_5, lcp_~y=v_lcp_~y_2, lcp_~n=v_lcp_~n_2} OutVars{lcp_~x=v_lcp_~x_2, lcp_#t~short7=|v_lcp_#t~short7_5|, lcp_~l~0=v_lcp_~l~0_5, lcp_~y=v_lcp_~y_2, lcp_~n=v_lcp_~n_2} AuxVars[] AssignedVars[lcp_#t~short7] {1340#(and (<= lcp_~y |lcp_#in~y|) (<= |lcp_#in~n| lcp_~n) (<= lcp_~x |lcp_#in~x|))} is VALID [2022-04-07 23:32:45,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {1340#(and (<= lcp_~y |lcp_#in~y|) (<= |lcp_#in~n| lcp_~n) (<= lcp_~x |lcp_#in~x|))} [124] L18-1-->L18-3: Formula: (let ((.cse0 (select |v_#memory_int_6| v_lcp_~a.base_2)) (.cse1 (* v_lcp_~l~0_6 4))) (and (= (select .cse0 (+ v_lcp_~a.offset_2 .cse1 (* v_lcp_~y_3 4))) |v_lcp_#t~mem6_3|) (let ((.cse2 (= |v_lcp_#t~mem6_3| |v_lcp_#t~mem5_3|))) (or (and (not |v_lcp_#t~short7_6|) (not .cse2)) (and .cse2 |v_lcp_#t~short7_6|))) (= |v_lcp_#t~mem5_3| (select .cse0 (+ v_lcp_~a.offset_2 .cse1 (* v_lcp_~x_3 4)))) |v_lcp_#t~short7_7|)) InVars {lcp_~x=v_lcp_~x_3, lcp_~a.offset=v_lcp_~a.offset_2, lcp_~l~0=v_lcp_~l~0_6, lcp_~y=v_lcp_~y_3, lcp_~a.base=v_lcp_~a.base_2, #memory_int=|v_#memory_int_6|, lcp_#t~short7=|v_lcp_#t~short7_7|} OutVars{lcp_~x=v_lcp_~x_3, lcp_~a.offset=v_lcp_~a.offset_2, lcp_~l~0=v_lcp_~l~0_6, lcp_~y=v_lcp_~y_3, lcp_~a.base=v_lcp_~a.base_2, lcp_#t~mem6=|v_lcp_#t~mem6_3|, #memory_int=|v_#memory_int_6|, lcp_#t~short7=|v_lcp_#t~short7_6|, lcp_#t~mem5=|v_lcp_#t~mem5_3|} AuxVars[] AssignedVars[lcp_#t~mem6, lcp_#t~short7, lcp_#t~mem5] {1340#(and (<= lcp_~y |lcp_#in~y|) (<= |lcp_#in~n| lcp_~n) (<= lcp_~x |lcp_#in~x|))} is VALID [2022-04-07 23:32:45,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {1340#(and (<= lcp_~y |lcp_#in~y|) (<= |lcp_#in~n| lcp_~n) (<= lcp_~x |lcp_#in~x|))} [134] L18-3-->L18-5: Formula: (and (= (+ v_lcp_~l~0_3 1) v_lcp_~l~0_2) |v_lcp_#t~short7_4|) InVars {lcp_#t~short7=|v_lcp_#t~short7_4|, lcp_~l~0=v_lcp_~l~0_3} OutVars{lcp_#t~mem6=|v_lcp_#t~mem6_2|, lcp_#t~mem5=|v_lcp_#t~mem5_2|, lcp_~l~0=v_lcp_~l~0_2, lcp_#t~post8=|v_lcp_#t~post8_1|} AuxVars[] AssignedVars[lcp_~l~0, lcp_#t~mem6, lcp_#t~mem5, lcp_#t~short7, lcp_#t~post8] {1340#(and (<= lcp_~y |lcp_#in~y|) (<= |lcp_#in~n| lcp_~n) (<= lcp_~x |lcp_#in~x|))} is VALID [2022-04-07 23:32:45,755 INFO L290 TraceCheckUtils]: 27: Hoare triple {1340#(and (<= lcp_~y |lcp_#in~y|) (<= |lcp_#in~n| lcp_~n) (<= lcp_~x |lcp_#in~x|))} [118] L18-5-->L18-1: Formula: (let ((.cse1 (< (+ v_lcp_~y_2 v_lcp_~l~0_5) v_lcp_~n_2)) (.cse0 (< (+ v_lcp_~x_2 v_lcp_~l~0_5) v_lcp_~n_2))) (or (and (or (not .cse0) (not .cse1)) (not |v_lcp_#t~short7_5|)) (and .cse1 .cse0 |v_lcp_#t~short7_5|))) InVars {lcp_~x=v_lcp_~x_2, lcp_~l~0=v_lcp_~l~0_5, lcp_~y=v_lcp_~y_2, lcp_~n=v_lcp_~n_2} OutVars{lcp_~x=v_lcp_~x_2, lcp_#t~short7=|v_lcp_#t~short7_5|, lcp_~l~0=v_lcp_~l~0_5, lcp_~y=v_lcp_~y_2, lcp_~n=v_lcp_~n_2} AuxVars[] AssignedVars[lcp_#t~short7] {1265#(or |lcp_#t~short7| (<= |lcp_#in~n| (+ |lcp_#in~x| lcp_~l~0)) (<= |lcp_#in~n| (+ |lcp_#in~y| lcp_~l~0)))} is VALID [2022-04-07 23:32:45,756 INFO L290 TraceCheckUtils]: 28: Hoare triple {1265#(or |lcp_#t~short7| (<= |lcp_#in~n| (+ |lcp_#in~x| lcp_~l~0)) (<= |lcp_#in~n| (+ |lcp_#in~y| lcp_~l~0)))} [125] L18-1-->L18-3: Formula: (not |v_lcp_#t~short7_8|) InVars {lcp_#t~short7=|v_lcp_#t~short7_8|} OutVars{lcp_#t~short7=|v_lcp_#t~short7_8|} AuxVars[] AssignedVars[] {1266#(or (<= |lcp_#in~n| (+ |lcp_#in~x| lcp_~l~0)) (<= |lcp_#in~n| (+ |lcp_#in~y| lcp_~l~0)))} is VALID [2022-04-07 23:32:45,756 INFO L290 TraceCheckUtils]: 29: Hoare triple {1266#(or (<= |lcp_#in~n| (+ |lcp_#in~x| lcp_~l~0)) (<= |lcp_#in~n| (+ |lcp_#in~y| lcp_~l~0)))} [133] L18-3-->L18-6: Formula: (not |v_lcp_#t~short7_2|) InVars {lcp_#t~short7=|v_lcp_#t~short7_2|} OutVars{lcp_#t~mem6=|v_lcp_#t~mem6_1|, lcp_#t~mem5=|v_lcp_#t~mem5_1|} AuxVars[] AssignedVars[lcp_#t~mem6, lcp_#t~mem5, lcp_#t~short7] {1266#(or (<= |lcp_#in~n| (+ |lcp_#in~x| lcp_~l~0)) (<= |lcp_#in~n| (+ |lcp_#in~y| lcp_~l~0)))} is VALID [2022-04-07 23:32:45,757 INFO L290 TraceCheckUtils]: 30: Hoare triple {1266#(or (<= |lcp_#in~n| (+ |lcp_#in~x| lcp_~l~0)) (<= |lcp_#in~n| (+ |lcp_#in~y| lcp_~l~0)))} [123] L18-6-->lcpFINAL: Formula: (= |v_lcp_#res_1| v_lcp_~l~0_4) InVars {lcp_~l~0=v_lcp_~l~0_4} OutVars{lcp_#res=|v_lcp_#res_1|, lcp_~l~0=v_lcp_~l~0_4} AuxVars[] AssignedVars[lcp_#res] {1267#(or (<= |lcp_#in~n| (+ |lcp_#in~x| |lcp_#res|)) (<= |lcp_#in~n| (+ |lcp_#in~y| |lcp_#res|)))} is VALID [2022-04-07 23:32:45,757 INFO L290 TraceCheckUtils]: 31: Hoare triple {1267#(or (<= |lcp_#in~n| (+ |lcp_#in~x| |lcp_#res|)) (<= |lcp_#in~n| (+ |lcp_#in~y| |lcp_#res|)))} [132] lcpFINAL-->lcpEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1267#(or (<= |lcp_#in~n| (+ |lcp_#in~x| |lcp_#res|)) (<= |lcp_#in~n| (+ |lcp_#in~y| |lcp_#res|)))} is VALID [2022-04-07 23:32:45,761 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1267#(or (<= |lcp_#in~n| (+ |lcp_#in~x| |lcp_#res|)) (<= |lcp_#in~n| (+ |lcp_#in~y| |lcp_#res|)))} {1224#true} [147] lcpEXIT-->L44: AOR: Formula: (= |v_lcp_#resOutParam_1| |v_main_#t~ret18_4|) InVars {lcp_#res=|v_lcp_#resOutParam_1|} OutVars{main_#t~ret18=|v_main_#t~ret18_4|} AuxVars[] AssignedVars[main_#t~ret18, lcp_#res] LVA: Formula: (and (= v_main_~y~0_6 |v_lcp_#in~yInParam_1|) (= |v_lcp_#in~nInParam_1| v_main_~n~0_9) (= v_main_~x~0_6 |v_lcp_#in~xInParam_1|) (= |v_lcp_#in~a.offsetInParam_1| v_main_~a~0.offset_5) (= |v_lcp_#in~a.baseInParam_1| v_main_~a~0.base_5)) InVars {main_~a~0.base=v_main_~a~0.base_5, main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_6, main_~a~0.offset=v_main_~a~0.offset_5} OutVars{lcp_#in~a.base=|v_lcp_#in~a.baseInParam_1|, lcp_#in~a.offset=|v_lcp_#in~a.offsetInParam_1|, lcp_#in~n=|v_lcp_#in~nInParam_1|, lcp_#in~y=|v_lcp_#in~yInParam_1|, lcp_#in~x=|v_lcp_#in~xInParam_1|} AuxVars[] AssignedVars[lcp_#in~a.offset, lcp_#in~y, main_~x~0, lcp_#in~x, lcp_#in~a.base, main_~a~0.base, lcp_#in~n, main_~y~0, main_~n~0, main_~a~0.offset] {1250#(or (<= main_~n~0 (+ |main_#t~ret18| main_~x~0)) (<= main_~n~0 (+ |main_#t~ret18| main_~y~0)))} is VALID [2022-04-07 23:32:45,761 INFO L290 TraceCheckUtils]: 33: Hoare triple {1250#(or (<= main_~n~0 (+ |main_#t~ret18| main_~x~0)) (<= main_~n~0 (+ |main_#t~ret18| main_~y~0)))} [113] L44-->L45: Formula: (and (<= |v_main_#t~ret18_3| 2147483647) (= v_main_~l~1_1 |v_main_#t~ret18_3|) (<= 0 (+ |v_main_#t~ret18_3| 2147483648))) InVars {main_#t~ret18=|v_main_#t~ret18_3|} OutVars{main_~l~1=v_main_~l~1_1} AuxVars[] AssignedVars[main_#t~ret18, main_~l~1] {1251#(or (<= main_~n~0 (+ main_~l~1 main_~y~0)) (<= main_~n~0 (+ main_~l~1 main_~x~0)))} is VALID [2022-04-07 23:32:45,764 INFO L272 TraceCheckUtils]: 34: Hoare triple {1251#(or (<= main_~n~0 (+ main_~l~1 main_~y~0)) (<= main_~n~0 (+ main_~l~1 main_~x~0)))} [116] L45-->checkENTRY: Formula: (and (= v_main_~n~0_10 |v_check_#in~nInParam_1|) (= |v_check_#in~a.baseInParam_1| v_main_~a~0.base_6) (= v_main_~y~0_7 |v_check_#in~yInParam_1|) (= v_main_~x~0_7 |v_check_#in~xInParam_1|) (= |v_check_#in~a.offsetInParam_1| v_main_~a~0.offset_6) (= |v_check_#in~lInParam_1| v_main_~l~1_3)) InVars {main_~x~0=v_main_~x~0_7, main_~l~1=v_main_~l~1_3, main_~a~0.base=v_main_~a~0.base_6, main_~y~0=v_main_~y~0_7, main_~n~0=v_main_~n~0_10, main_~a~0.offset=v_main_~a~0.offset_6} OutVars{check_#in~y=|v_check_#in~yInParam_1|, check_#in~x=|v_check_#in~xInParam_1|, check_#in~a.offset=|v_check_#in~a.offsetInParam_1|, check_#in~a.base=|v_check_#in~a.baseInParam_1|, check_#in~l=|v_check_#in~lInParam_1|, check_#in~n=|v_check_#in~nInParam_1|} AuxVars[] AssignedVars[check_#in~y, check_#in~x, check_#in~a.offset, main_~x~0, main_~l~1, check_#in~a.base, main_~a~0.base, main_~y~0, main_~n~0, check_#in~l, main_~a~0.offset, check_#in~n] {1252#(or (<= |check_#in~n| (+ |check_#in~x| |check_#in~l|)) (<= |check_#in~n| (+ |check_#in~y| |check_#in~l|)))} is VALID [2022-04-07 23:32:45,765 INFO L290 TraceCheckUtils]: 35: Hoare triple {1252#(or (<= |check_#in~n| (+ |check_#in~x| |check_#in~l|)) (<= |check_#in~n| (+ |check_#in~y| |check_#in~l|)))} [122] checkENTRY-->L27: Formula: (and (= v_check_~x_2 |v_check_#in~x_1|) (= |v_check_#in~a.offset_1| v_check_~a.offset_1) (= v_check_~i~0_1 |v_check_#t~nondet9_2|) (= v_check_~l_2 |v_check_#in~l_1|) (= v_check_~n_2 |v_check_#in~n_1|) (= v_check_~a.base_1 |v_check_#in~a.base_1|) (<= 0 (+ 2147483648 |v_check_#t~nondet9_2|)) (= v_check_~y_2 |v_check_#in~y_1|) (<= |v_check_#t~nondet9_2| 2147483647)) InVars {check_#in~y=|v_check_#in~y_1|, check_#in~x=|v_check_#in~x_1|, check_#in~a.offset=|v_check_#in~a.offset_1|, check_#in~a.base=|v_check_#in~a.base_1|, check_#in~l=|v_check_#in~l_1|, check_#t~nondet9=|v_check_#t~nondet9_2|, check_#in~n=|v_check_#in~n_1|} OutVars{check_#in~y=|v_check_#in~y_1|, check_#in~x=|v_check_#in~x_1|, check_#in~a.offset=|v_check_#in~a.offset_1|, check_~a.base=v_check_~a.base_1, check_~i~0=v_check_~i~0_1, check_~y=v_check_~y_2, check_~x=v_check_~x_2, check_~a.offset=v_check_~a.offset_1, check_#in~a.base=|v_check_#in~a.base_1|, check_#in~l=|v_check_#in~l_1|, check_~n=v_check_~n_2, check_#in~n=|v_check_#in~n_1|, check_~l=v_check_~l_2} AuxVars[] AssignedVars[check_~y, check_~x, check_~a.base, check_~a.offset, check_~i~0, check_~n, check_#t~nondet9, check_~l] {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} is VALID [2022-04-07 23:32:45,765 INFO L272 TraceCheckUtils]: 36: Hoare triple {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} [131] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= 0 v_check_~i~0_4) (< v_check_~i~0_4 v_check_~l_5)) 1 0)) InVars {check_~i~0=v_check_~i~0_4, check_~l=v_check_~l_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[check_~i~0, assume_abort_if_not_#in~cond, check_~l] {1224#true} is VALID [2022-04-07 23:32:45,765 INFO L290 TraceCheckUtils]: 37: Hoare triple {1224#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1224#true} is VALID [2022-04-07 23:32:45,765 INFO L290 TraceCheckUtils]: 38: Hoare triple {1224#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:45,766 INFO L290 TraceCheckUtils]: 39: Hoare triple {1224#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:45,766 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1224#true} {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} [144] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= 0 v_check_~i~0_4) (< v_check_~i~0_4 v_check_~l_5)) 1 0)) InVars {check_~i~0=v_check_~i~0_4, check_~l=v_check_~l_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[check_~i~0, assume_abort_if_not_#in~cond, check_~l] {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} is VALID [2022-04-07 23:32:45,766 INFO L290 TraceCheckUtils]: 41: Hoare triple {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} [112] L27-1-->L28: Formula: (let ((.cse0 (select |v_#memory_int_3| v_check_~a.base_2)) (.cse1 (* v_check_~i~0_3 4))) (and (= (select .cse0 (+ (* v_check_~y_3 4) v_check_~a.offset_2 .cse1)) |v_check_#t~mem11_1|) (= (select .cse0 (+ (* v_check_~x_3 4) v_check_~a.offset_2 .cse1)) |v_check_#t~mem10_1|))) InVars {check_~y=v_check_~y_3, check_~x=v_check_~x_3, check_~a.base=v_check_~a.base_2, check_~a.offset=v_check_~a.offset_2, check_~i~0=v_check_~i~0_3, #memory_int=|v_#memory_int_3|} OutVars{check_~y=v_check_~y_3, check_~x=v_check_~x_3, check_#t~mem10=|v_check_#t~mem10_1|, check_~a.base=v_check_~a.base_2, check_~a.offset=v_check_~a.offset_2, check_~i~0=v_check_~i~0_3, check_#t~mem11=|v_check_#t~mem11_1|, #memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[check_#t~mem10, check_#t~mem11] {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} is VALID [2022-04-07 23:32:45,767 INFO L272 TraceCheckUtils]: 42: Hoare triple {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} [115] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= |v_check_#t~mem11_4| |v_check_#t~mem10_4|) 1 0)) InVars {check_#t~mem10=|v_check_#t~mem10_4|, check_#t~mem11=|v_check_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, check_#t~mem10, check_#t~mem11] {1224#true} is VALID [2022-04-07 23:32:45,767 INFO L290 TraceCheckUtils]: 43: Hoare triple {1224#true} [120] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1224#true} is VALID [2022-04-07 23:32:45,767 INFO L290 TraceCheckUtils]: 44: Hoare triple {1224#true} [129] L13-->L13-3: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:45,767 INFO L290 TraceCheckUtils]: 45: Hoare triple {1224#true} [139] L13-3-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:45,767 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1224#true} {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} [149] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= |v_check_#t~mem11_4| |v_check_#t~mem10_4|) 1 0)) InVars {check_#t~mem10=|v_check_#t~mem10_4|, check_#t~mem11=|v_check_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, check_#t~mem10, check_#t~mem11] {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} is VALID [2022-04-07 23:32:45,768 INFO L290 TraceCheckUtils]: 47: Hoare triple {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} [119] L28-1-->L31: Formula: true InVars {} OutVars{check_#t~mem10=|v_check_#t~mem10_3|, check_#t~mem11=|v_check_#t~mem11_3|} AuxVars[] AssignedVars[check_#t~mem10, check_#t~mem11] {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} is VALID [2022-04-07 23:32:45,768 INFO L290 TraceCheckUtils]: 48: Hoare triple {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} [126] L31-->L32: Formula: (let ((.cse0 (select |v_#memory_int_4| v_check_~a.base_3)) (.cse1 (* v_check_~l_4 4))) (and (< (+ v_check_~l_4 v_check_~x_4) v_check_~n_3) (< (+ v_check_~l_4 v_check_~y_4) v_check_~n_3) (= (select .cse0 (+ (* v_check_~y_4 4) .cse1 v_check_~a.offset_3)) |v_check_#t~mem13_1|) (= |v_check_#t~mem12_1| (select .cse0 (+ .cse1 (* v_check_~x_4 4) v_check_~a.offset_3))))) InVars {check_~y=v_check_~y_4, check_~x=v_check_~x_4, check_~a.base=v_check_~a.base_3, check_~a.offset=v_check_~a.offset_3, #memory_int=|v_#memory_int_4|, check_~n=v_check_~n_3, check_~l=v_check_~l_4} OutVars{check_#t~mem13=|v_check_#t~mem13_1|, check_~y=v_check_~y_4, check_~x=v_check_~x_4, check_~a.base=v_check_~a.base_3, check_~a.offset=v_check_~a.offset_3, check_#t~mem12=|v_check_#t~mem12_1|, #memory_int=|v_#memory_int_4|, check_~n=v_check_~n_3, check_~l=v_check_~l_4} AuxVars[] AssignedVars[check_#t~mem13, check_#t~mem12] {1225#false} is VALID [2022-04-07 23:32:45,768 INFO L272 TraceCheckUtils]: 49: Hoare triple {1225#false} [135] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= |v_check_#t~mem13_4| |v_check_#t~mem12_4|)) 1 0)) InVars {check_#t~mem13=|v_check_#t~mem13_4|, check_#t~mem12=|v_check_#t~mem12_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[check_#t~mem13, __VERIFIER_assert_#in~cond, check_#t~mem12] {1225#false} is VALID [2022-04-07 23:32:45,769 INFO L290 TraceCheckUtils]: 50: Hoare triple {1225#false} [120] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1225#false} is VALID [2022-04-07 23:32:45,769 INFO L290 TraceCheckUtils]: 51: Hoare triple {1225#false} [128] L13-->L13-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1225#false} is VALID [2022-04-07 23:32:45,769 INFO L290 TraceCheckUtils]: 52: Hoare triple {1225#false} [137] L13-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1225#false} is VALID [2022-04-07 23:32:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-07 23:32:45,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:32:47,196 INFO L290 TraceCheckUtils]: 52: Hoare triple {1225#false} [137] L13-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1225#false} is VALID [2022-04-07 23:32:47,197 INFO L290 TraceCheckUtils]: 51: Hoare triple {1225#false} [128] L13-->L13-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1225#false} is VALID [2022-04-07 23:32:47,197 INFO L290 TraceCheckUtils]: 50: Hoare triple {1225#false} [120] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1225#false} is VALID [2022-04-07 23:32:47,197 INFO L272 TraceCheckUtils]: 49: Hoare triple {1225#false} [135] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= |v_check_#t~mem13_4| |v_check_#t~mem12_4|)) 1 0)) InVars {check_#t~mem13=|v_check_#t~mem13_4|, check_#t~mem12=|v_check_#t~mem12_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[check_#t~mem13, __VERIFIER_assert_#in~cond, check_#t~mem12] {1225#false} is VALID [2022-04-07 23:32:47,197 INFO L290 TraceCheckUtils]: 48: Hoare triple {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} [126] L31-->L32: Formula: (let ((.cse0 (select |v_#memory_int_4| v_check_~a.base_3)) (.cse1 (* v_check_~l_4 4))) (and (< (+ v_check_~l_4 v_check_~x_4) v_check_~n_3) (< (+ v_check_~l_4 v_check_~y_4) v_check_~n_3) (= (select .cse0 (+ (* v_check_~y_4 4) .cse1 v_check_~a.offset_3)) |v_check_#t~mem13_1|) (= |v_check_#t~mem12_1| (select .cse0 (+ .cse1 (* v_check_~x_4 4) v_check_~a.offset_3))))) InVars {check_~y=v_check_~y_4, check_~x=v_check_~x_4, check_~a.base=v_check_~a.base_3, check_~a.offset=v_check_~a.offset_3, #memory_int=|v_#memory_int_4|, check_~n=v_check_~n_3, check_~l=v_check_~l_4} OutVars{check_#t~mem13=|v_check_#t~mem13_1|, check_~y=v_check_~y_4, check_~x=v_check_~x_4, check_~a.base=v_check_~a.base_3, check_~a.offset=v_check_~a.offset_3, check_#t~mem12=|v_check_#t~mem12_1|, #memory_int=|v_#memory_int_4|, check_~n=v_check_~n_3, check_~l=v_check_~l_4} AuxVars[] AssignedVars[check_#t~mem13, check_#t~mem12] {1225#false} is VALID [2022-04-07 23:32:47,198 INFO L290 TraceCheckUtils]: 47: Hoare triple {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} [119] L28-1-->L31: Formula: true InVars {} OutVars{check_#t~mem10=|v_check_#t~mem10_3|, check_#t~mem11=|v_check_#t~mem11_3|} AuxVars[] AssignedVars[check_#t~mem10, check_#t~mem11] {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} is VALID [2022-04-07 23:32:47,198 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1224#true} {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} [149] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= |v_check_#t~mem11_4| |v_check_#t~mem10_4|) 1 0)) InVars {check_#t~mem10=|v_check_#t~mem10_4|, check_#t~mem11=|v_check_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, check_#t~mem10, check_#t~mem11] {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} is VALID [2022-04-07 23:32:47,198 INFO L290 TraceCheckUtils]: 45: Hoare triple {1224#true} [139] L13-3-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:47,199 INFO L290 TraceCheckUtils]: 44: Hoare triple {1224#true} [129] L13-->L13-3: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:47,199 INFO L290 TraceCheckUtils]: 43: Hoare triple {1224#true} [120] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1224#true} is VALID [2022-04-07 23:32:47,199 INFO L272 TraceCheckUtils]: 42: Hoare triple {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} [115] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= |v_check_#t~mem11_4| |v_check_#t~mem10_4|) 1 0)) InVars {check_#t~mem10=|v_check_#t~mem10_4|, check_#t~mem11=|v_check_#t~mem11_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, check_#t~mem10, check_#t~mem11] {1224#true} is VALID [2022-04-07 23:32:47,200 INFO L290 TraceCheckUtils]: 41: Hoare triple {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} [112] L27-1-->L28: Formula: (let ((.cse0 (select |v_#memory_int_3| v_check_~a.base_2)) (.cse1 (* v_check_~i~0_3 4))) (and (= (select .cse0 (+ (* v_check_~y_3 4) v_check_~a.offset_2 .cse1)) |v_check_#t~mem11_1|) (= (select .cse0 (+ (* v_check_~x_3 4) v_check_~a.offset_2 .cse1)) |v_check_#t~mem10_1|))) InVars {check_~y=v_check_~y_3, check_~x=v_check_~x_3, check_~a.base=v_check_~a.base_2, check_~a.offset=v_check_~a.offset_2, check_~i~0=v_check_~i~0_3, #memory_int=|v_#memory_int_3|} OutVars{check_~y=v_check_~y_3, check_~x=v_check_~x_3, check_#t~mem10=|v_check_#t~mem10_1|, check_~a.base=v_check_~a.base_2, check_~a.offset=v_check_~a.offset_2, check_~i~0=v_check_~i~0_3, check_#t~mem11=|v_check_#t~mem11_1|, #memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[check_#t~mem10, check_#t~mem11] {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} is VALID [2022-04-07 23:32:47,200 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1224#true} {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} [144] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= 0 v_check_~i~0_4) (< v_check_~i~0_4 v_check_~l_5)) 1 0)) InVars {check_~i~0=v_check_~i~0_4, check_~l=v_check_~l_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[check_~i~0, assume_abort_if_not_#in~cond, check_~l] {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} is VALID [2022-04-07 23:32:47,200 INFO L290 TraceCheckUtils]: 39: Hoare triple {1224#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:47,200 INFO L290 TraceCheckUtils]: 38: Hoare triple {1224#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:47,200 INFO L290 TraceCheckUtils]: 37: Hoare triple {1224#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1224#true} is VALID [2022-04-07 23:32:47,200 INFO L272 TraceCheckUtils]: 36: Hoare triple {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} [131] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= 0 v_check_~i~0_4) (< v_check_~i~0_4 v_check_~l_5)) 1 0)) InVars {check_~i~0=v_check_~i~0_4, check_~l=v_check_~l_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[check_~i~0, assume_abort_if_not_#in~cond, check_~l] {1224#true} is VALID [2022-04-07 23:32:47,203 INFO L290 TraceCheckUtils]: 35: Hoare triple {1252#(or (<= |check_#in~n| (+ |check_#in~x| |check_#in~l|)) (<= |check_#in~n| (+ |check_#in~y| |check_#in~l|)))} [122] checkENTRY-->L27: Formula: (and (= v_check_~x_2 |v_check_#in~x_1|) (= |v_check_#in~a.offset_1| v_check_~a.offset_1) (= v_check_~i~0_1 |v_check_#t~nondet9_2|) (= v_check_~l_2 |v_check_#in~l_1|) (= v_check_~n_2 |v_check_#in~n_1|) (= v_check_~a.base_1 |v_check_#in~a.base_1|) (<= 0 (+ 2147483648 |v_check_#t~nondet9_2|)) (= v_check_~y_2 |v_check_#in~y_1|) (<= |v_check_#t~nondet9_2| 2147483647)) InVars {check_#in~y=|v_check_#in~y_1|, check_#in~x=|v_check_#in~x_1|, check_#in~a.offset=|v_check_#in~a.offset_1|, check_#in~a.base=|v_check_#in~a.base_1|, check_#in~l=|v_check_#in~l_1|, check_#t~nondet9=|v_check_#t~nondet9_2|, check_#in~n=|v_check_#in~n_1|} OutVars{check_#in~y=|v_check_#in~y_1|, check_#in~x=|v_check_#in~x_1|, check_#in~a.offset=|v_check_#in~a.offset_1|, check_~a.base=v_check_~a.base_1, check_~i~0=v_check_~i~0_1, check_~y=v_check_~y_2, check_~x=v_check_~x_2, check_~a.offset=v_check_~a.offset_1, check_#in~a.base=|v_check_#in~a.base_1|, check_#in~l=|v_check_#in~l_1|, check_~n=v_check_~n_2, check_#in~n=|v_check_#in~n_1|, check_~l=v_check_~l_2} AuxVars[] AssignedVars[check_~y, check_~x, check_~a.base, check_~a.offset, check_~i~0, check_~n, check_#t~nondet9, check_~l] {1253#(or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x)))} is VALID [2022-04-07 23:32:47,204 INFO L272 TraceCheckUtils]: 34: Hoare triple {1251#(or (<= main_~n~0 (+ main_~l~1 main_~y~0)) (<= main_~n~0 (+ main_~l~1 main_~x~0)))} [116] L45-->checkENTRY: Formula: (and (= v_main_~n~0_10 |v_check_#in~nInParam_1|) (= |v_check_#in~a.baseInParam_1| v_main_~a~0.base_6) (= v_main_~y~0_7 |v_check_#in~yInParam_1|) (= v_main_~x~0_7 |v_check_#in~xInParam_1|) (= |v_check_#in~a.offsetInParam_1| v_main_~a~0.offset_6) (= |v_check_#in~lInParam_1| v_main_~l~1_3)) InVars {main_~x~0=v_main_~x~0_7, main_~l~1=v_main_~l~1_3, main_~a~0.base=v_main_~a~0.base_6, main_~y~0=v_main_~y~0_7, main_~n~0=v_main_~n~0_10, main_~a~0.offset=v_main_~a~0.offset_6} OutVars{check_#in~y=|v_check_#in~yInParam_1|, check_#in~x=|v_check_#in~xInParam_1|, check_#in~a.offset=|v_check_#in~a.offsetInParam_1|, check_#in~a.base=|v_check_#in~a.baseInParam_1|, check_#in~l=|v_check_#in~lInParam_1|, check_#in~n=|v_check_#in~nInParam_1|} AuxVars[] AssignedVars[check_#in~y, check_#in~x, check_#in~a.offset, main_~x~0, main_~l~1, check_#in~a.base, main_~a~0.base, main_~y~0, main_~n~0, check_#in~l, main_~a~0.offset, check_#in~n] {1252#(or (<= |check_#in~n| (+ |check_#in~x| |check_#in~l|)) (<= |check_#in~n| (+ |check_#in~y| |check_#in~l|)))} is VALID [2022-04-07 23:32:47,204 INFO L290 TraceCheckUtils]: 33: Hoare triple {1250#(or (<= main_~n~0 (+ |main_#t~ret18| main_~x~0)) (<= main_~n~0 (+ |main_#t~ret18| main_~y~0)))} [113] L44-->L45: Formula: (and (<= |v_main_#t~ret18_3| 2147483647) (= v_main_~l~1_1 |v_main_#t~ret18_3|) (<= 0 (+ |v_main_#t~ret18_3| 2147483648))) InVars {main_#t~ret18=|v_main_#t~ret18_3|} OutVars{main_~l~1=v_main_~l~1_1} AuxVars[] AssignedVars[main_#t~ret18, main_~l~1] {1251#(or (<= main_~n~0 (+ main_~l~1 main_~y~0)) (<= main_~n~0 (+ main_~l~1 main_~x~0)))} is VALID [2022-04-07 23:32:47,207 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1267#(or (<= |lcp_#in~n| (+ |lcp_#in~x| |lcp_#res|)) (<= |lcp_#in~n| (+ |lcp_#in~y| |lcp_#res|)))} {1224#true} [147] lcpEXIT-->L44: AOR: Formula: (= |v_lcp_#resOutParam_1| |v_main_#t~ret18_4|) InVars {lcp_#res=|v_lcp_#resOutParam_1|} OutVars{main_#t~ret18=|v_main_#t~ret18_4|} AuxVars[] AssignedVars[main_#t~ret18, lcp_#res] LVA: Formula: (and (= v_main_~y~0_6 |v_lcp_#in~yInParam_1|) (= |v_lcp_#in~nInParam_1| v_main_~n~0_9) (= v_main_~x~0_6 |v_lcp_#in~xInParam_1|) (= |v_lcp_#in~a.offsetInParam_1| v_main_~a~0.offset_5) (= |v_lcp_#in~a.baseInParam_1| v_main_~a~0.base_5)) InVars {main_~a~0.base=v_main_~a~0.base_5, main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_6, main_~a~0.offset=v_main_~a~0.offset_5} OutVars{lcp_#in~a.base=|v_lcp_#in~a.baseInParam_1|, lcp_#in~a.offset=|v_lcp_#in~a.offsetInParam_1|, lcp_#in~n=|v_lcp_#in~nInParam_1|, lcp_#in~y=|v_lcp_#in~yInParam_1|, lcp_#in~x=|v_lcp_#in~xInParam_1|} AuxVars[] AssignedVars[lcp_#in~a.offset, lcp_#in~y, main_~x~0, lcp_#in~x, lcp_#in~a.base, main_~a~0.base, lcp_#in~n, main_~y~0, main_~n~0, main_~a~0.offset] {1250#(or (<= main_~n~0 (+ |main_#t~ret18| main_~x~0)) (<= main_~n~0 (+ |main_#t~ret18| main_~y~0)))} is VALID [2022-04-07 23:32:47,208 INFO L290 TraceCheckUtils]: 31: Hoare triple {1267#(or (<= |lcp_#in~n| (+ |lcp_#in~x| |lcp_#res|)) (<= |lcp_#in~n| (+ |lcp_#in~y| |lcp_#res|)))} [132] lcpFINAL-->lcpEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1267#(or (<= |lcp_#in~n| (+ |lcp_#in~x| |lcp_#res|)) (<= |lcp_#in~n| (+ |lcp_#in~y| |lcp_#res|)))} is VALID [2022-04-07 23:32:47,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {1266#(or (<= |lcp_#in~n| (+ |lcp_#in~x| lcp_~l~0)) (<= |lcp_#in~n| (+ |lcp_#in~y| lcp_~l~0)))} [123] L18-6-->lcpFINAL: Formula: (= |v_lcp_#res_1| v_lcp_~l~0_4) InVars {lcp_~l~0=v_lcp_~l~0_4} OutVars{lcp_#res=|v_lcp_#res_1|, lcp_~l~0=v_lcp_~l~0_4} AuxVars[] AssignedVars[lcp_#res] {1267#(or (<= |lcp_#in~n| (+ |lcp_#in~x| |lcp_#res|)) (<= |lcp_#in~n| (+ |lcp_#in~y| |lcp_#res|)))} is VALID [2022-04-07 23:32:47,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {1266#(or (<= |lcp_#in~n| (+ |lcp_#in~x| lcp_~l~0)) (<= |lcp_#in~n| (+ |lcp_#in~y| lcp_~l~0)))} [133] L18-3-->L18-6: Formula: (not |v_lcp_#t~short7_2|) InVars {lcp_#t~short7=|v_lcp_#t~short7_2|} OutVars{lcp_#t~mem6=|v_lcp_#t~mem6_1|, lcp_#t~mem5=|v_lcp_#t~mem5_1|} AuxVars[] AssignedVars[lcp_#t~mem6, lcp_#t~mem5, lcp_#t~short7] {1266#(or (<= |lcp_#in~n| (+ |lcp_#in~x| lcp_~l~0)) (<= |lcp_#in~n| (+ |lcp_#in~y| lcp_~l~0)))} is VALID [2022-04-07 23:32:47,209 INFO L290 TraceCheckUtils]: 28: Hoare triple {1265#(or |lcp_#t~short7| (<= |lcp_#in~n| (+ |lcp_#in~x| lcp_~l~0)) (<= |lcp_#in~n| (+ |lcp_#in~y| lcp_~l~0)))} [125] L18-1-->L18-3: Formula: (not |v_lcp_#t~short7_8|) InVars {lcp_#t~short7=|v_lcp_#t~short7_8|} OutVars{lcp_#t~short7=|v_lcp_#t~short7_8|} AuxVars[] AssignedVars[] {1266#(or (<= |lcp_#in~n| (+ |lcp_#in~x| lcp_~l~0)) (<= |lcp_#in~n| (+ |lcp_#in~y| lcp_~l~0)))} is VALID [2022-04-07 23:32:47,209 INFO L290 TraceCheckUtils]: 27: Hoare triple {1506#(and (or (<= (+ |lcp_#in~n| lcp_~x) (+ |lcp_#in~y| lcp_~n)) (<= (+ |lcp_#in~n| lcp_~x) (+ |lcp_#in~x| lcp_~n))) (or (<= (+ |lcp_#in~n| lcp_~y) (+ |lcp_#in~x| lcp_~n)) (<= (+ |lcp_#in~n| lcp_~y) (+ |lcp_#in~y| lcp_~n))))} [118] L18-5-->L18-1: Formula: (let ((.cse1 (< (+ v_lcp_~y_2 v_lcp_~l~0_5) v_lcp_~n_2)) (.cse0 (< (+ v_lcp_~x_2 v_lcp_~l~0_5) v_lcp_~n_2))) (or (and (or (not .cse0) (not .cse1)) (not |v_lcp_#t~short7_5|)) (and .cse1 .cse0 |v_lcp_#t~short7_5|))) InVars {lcp_~x=v_lcp_~x_2, lcp_~l~0=v_lcp_~l~0_5, lcp_~y=v_lcp_~y_2, lcp_~n=v_lcp_~n_2} OutVars{lcp_~x=v_lcp_~x_2, lcp_#t~short7=|v_lcp_#t~short7_5|, lcp_~l~0=v_lcp_~l~0_5, lcp_~y=v_lcp_~y_2, lcp_~n=v_lcp_~n_2} AuxVars[] AssignedVars[lcp_#t~short7] {1265#(or |lcp_#t~short7| (<= |lcp_#in~n| (+ |lcp_#in~x| lcp_~l~0)) (<= |lcp_#in~n| (+ |lcp_#in~y| lcp_~l~0)))} is VALID [2022-04-07 23:32:47,210 INFO L290 TraceCheckUtils]: 26: Hoare triple {1506#(and (or (<= (+ |lcp_#in~n| lcp_~x) (+ |lcp_#in~y| lcp_~n)) (<= (+ |lcp_#in~n| lcp_~x) (+ |lcp_#in~x| lcp_~n))) (or (<= (+ |lcp_#in~n| lcp_~y) (+ |lcp_#in~x| lcp_~n)) (<= (+ |lcp_#in~n| lcp_~y) (+ |lcp_#in~y| lcp_~n))))} [134] L18-3-->L18-5: Formula: (and (= (+ v_lcp_~l~0_3 1) v_lcp_~l~0_2) |v_lcp_#t~short7_4|) InVars {lcp_#t~short7=|v_lcp_#t~short7_4|, lcp_~l~0=v_lcp_~l~0_3} OutVars{lcp_#t~mem6=|v_lcp_#t~mem6_2|, lcp_#t~mem5=|v_lcp_#t~mem5_2|, lcp_~l~0=v_lcp_~l~0_2, lcp_#t~post8=|v_lcp_#t~post8_1|} AuxVars[] AssignedVars[lcp_~l~0, lcp_#t~mem6, lcp_#t~mem5, lcp_#t~short7, lcp_#t~post8] {1506#(and (or (<= (+ |lcp_#in~n| lcp_~x) (+ |lcp_#in~y| lcp_~n)) (<= (+ |lcp_#in~n| lcp_~x) (+ |lcp_#in~x| lcp_~n))) (or (<= (+ |lcp_#in~n| lcp_~y) (+ |lcp_#in~x| lcp_~n)) (<= (+ |lcp_#in~n| lcp_~y) (+ |lcp_#in~y| lcp_~n))))} is VALID [2022-04-07 23:32:47,211 INFO L290 TraceCheckUtils]: 25: Hoare triple {1506#(and (or (<= (+ |lcp_#in~n| lcp_~x) (+ |lcp_#in~y| lcp_~n)) (<= (+ |lcp_#in~n| lcp_~x) (+ |lcp_#in~x| lcp_~n))) (or (<= (+ |lcp_#in~n| lcp_~y) (+ |lcp_#in~x| lcp_~n)) (<= (+ |lcp_#in~n| lcp_~y) (+ |lcp_#in~y| lcp_~n))))} [124] L18-1-->L18-3: Formula: (let ((.cse0 (select |v_#memory_int_6| v_lcp_~a.base_2)) (.cse1 (* v_lcp_~l~0_6 4))) (and (= (select .cse0 (+ v_lcp_~a.offset_2 .cse1 (* v_lcp_~y_3 4))) |v_lcp_#t~mem6_3|) (let ((.cse2 (= |v_lcp_#t~mem6_3| |v_lcp_#t~mem5_3|))) (or (and (not |v_lcp_#t~short7_6|) (not .cse2)) (and .cse2 |v_lcp_#t~short7_6|))) (= |v_lcp_#t~mem5_3| (select .cse0 (+ v_lcp_~a.offset_2 .cse1 (* v_lcp_~x_3 4)))) |v_lcp_#t~short7_7|)) InVars {lcp_~x=v_lcp_~x_3, lcp_~a.offset=v_lcp_~a.offset_2, lcp_~l~0=v_lcp_~l~0_6, lcp_~y=v_lcp_~y_3, lcp_~a.base=v_lcp_~a.base_2, #memory_int=|v_#memory_int_6|, lcp_#t~short7=|v_lcp_#t~short7_7|} OutVars{lcp_~x=v_lcp_~x_3, lcp_~a.offset=v_lcp_~a.offset_2, lcp_~l~0=v_lcp_~l~0_6, lcp_~y=v_lcp_~y_3, lcp_~a.base=v_lcp_~a.base_2, lcp_#t~mem6=|v_lcp_#t~mem6_3|, #memory_int=|v_#memory_int_6|, lcp_#t~short7=|v_lcp_#t~short7_6|, lcp_#t~mem5=|v_lcp_#t~mem5_3|} AuxVars[] AssignedVars[lcp_#t~mem6, lcp_#t~short7, lcp_#t~mem5] {1506#(and (or (<= (+ |lcp_#in~n| lcp_~x) (+ |lcp_#in~y| lcp_~n)) (<= (+ |lcp_#in~n| lcp_~x) (+ |lcp_#in~x| lcp_~n))) (or (<= (+ |lcp_#in~n| lcp_~y) (+ |lcp_#in~x| lcp_~n)) (<= (+ |lcp_#in~n| lcp_~y) (+ |lcp_#in~y| lcp_~n))))} is VALID [2022-04-07 23:32:47,211 INFO L290 TraceCheckUtils]: 24: Hoare triple {1506#(and (or (<= (+ |lcp_#in~n| lcp_~x) (+ |lcp_#in~y| lcp_~n)) (<= (+ |lcp_#in~n| lcp_~x) (+ |lcp_#in~x| lcp_~n))) (or (<= (+ |lcp_#in~n| lcp_~y) (+ |lcp_#in~x| lcp_~n)) (<= (+ |lcp_#in~n| lcp_~y) (+ |lcp_#in~y| lcp_~n))))} [118] L18-5-->L18-1: Formula: (let ((.cse1 (< (+ v_lcp_~y_2 v_lcp_~l~0_5) v_lcp_~n_2)) (.cse0 (< (+ v_lcp_~x_2 v_lcp_~l~0_5) v_lcp_~n_2))) (or (and (or (not .cse0) (not .cse1)) (not |v_lcp_#t~short7_5|)) (and .cse1 .cse0 |v_lcp_#t~short7_5|))) InVars {lcp_~x=v_lcp_~x_2, lcp_~l~0=v_lcp_~l~0_5, lcp_~y=v_lcp_~y_2, lcp_~n=v_lcp_~n_2} OutVars{lcp_~x=v_lcp_~x_2, lcp_#t~short7=|v_lcp_#t~short7_5|, lcp_~l~0=v_lcp_~l~0_5, lcp_~y=v_lcp_~y_2, lcp_~n=v_lcp_~n_2} AuxVars[] AssignedVars[lcp_#t~short7] {1506#(and (or (<= (+ |lcp_#in~n| lcp_~x) (+ |lcp_#in~y| lcp_~n)) (<= (+ |lcp_#in~n| lcp_~x) (+ |lcp_#in~x| lcp_~n))) (or (<= (+ |lcp_#in~n| lcp_~y) (+ |lcp_#in~x| lcp_~n)) (<= (+ |lcp_#in~n| lcp_~y) (+ |lcp_#in~y| lcp_~n))))} is VALID [2022-04-07 23:32:47,212 INFO L290 TraceCheckUtils]: 23: Hoare triple {1224#true} [114] lcpENTRY-->L18-5: Formula: (and (= v_lcp_~a.base_1 |v_lcp_#in~a.base_1|) (= v_lcp_~n_1 |v_lcp_#in~n_1|) (= v_lcp_~l~0_1 0) (= v_lcp_~x_1 |v_lcp_#in~x_1|) (= v_lcp_~y_1 |v_lcp_#in~y_1|) (= |v_lcp_#in~a.offset_1| v_lcp_~a.offset_1)) InVars {lcp_#in~a.base=|v_lcp_#in~a.base_1|, lcp_#in~a.offset=|v_lcp_#in~a.offset_1|, lcp_#in~n=|v_lcp_#in~n_1|, lcp_#in~y=|v_lcp_#in~y_1|, lcp_#in~x=|v_lcp_#in~x_1|} OutVars{lcp_~x=v_lcp_~x_1, lcp_#in~a.offset=|v_lcp_#in~a.offset_1|, lcp_~l~0=v_lcp_~l~0_1, lcp_~a.offset=v_lcp_~a.offset_1, lcp_~y=v_lcp_~y_1, lcp_#in~y=|v_lcp_#in~y_1|, lcp_~a.base=v_lcp_~a.base_1, lcp_#in~x=|v_lcp_#in~x_1|, lcp_#in~a.base=|v_lcp_#in~a.base_1|, lcp_#in~n=|v_lcp_#in~n_1|, lcp_~n=v_lcp_~n_1} AuxVars[] AssignedVars[lcp_~x, lcp_~l~0, lcp_~a.offset, lcp_~y, lcp_~a.base, lcp_~n] {1506#(and (or (<= (+ |lcp_#in~n| lcp_~x) (+ |lcp_#in~y| lcp_~n)) (<= (+ |lcp_#in~n| lcp_~x) (+ |lcp_#in~x| lcp_~n))) (or (<= (+ |lcp_#in~n| lcp_~y) (+ |lcp_#in~x| lcp_~n)) (<= (+ |lcp_#in~n| lcp_~y) (+ |lcp_#in~y| lcp_~n))))} is VALID [2022-04-07 23:32:47,212 INFO L272 TraceCheckUtils]: 22: Hoare triple {1224#true} [111] L43-1-->lcpENTRY: Formula: (and (= v_main_~y~0_6 |v_lcp_#in~yInParam_1|) (= |v_lcp_#in~nInParam_1| v_main_~n~0_9) (= v_main_~x~0_6 |v_lcp_#in~xInParam_1|) (= |v_lcp_#in~a.offsetInParam_1| v_main_~a~0.offset_5) (= |v_lcp_#in~a.baseInParam_1| v_main_~a~0.base_5)) InVars {main_~a~0.base=v_main_~a~0.base_5, main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_6, main_~a~0.offset=v_main_~a~0.offset_5} OutVars{lcp_#in~a.base=|v_lcp_#in~a.baseInParam_1|, lcp_#in~a.offset=|v_lcp_#in~a.offsetInParam_1|, lcp_#in~n=|v_lcp_#in~nInParam_1|, lcp_#in~y=|v_lcp_#in~yInParam_1|, lcp_#in~x=|v_lcp_#in~xInParam_1|} AuxVars[] AssignedVars[lcp_#in~a.offset, lcp_#in~y, main_~x~0, lcp_#in~x, lcp_#in~a.base, main_~a~0.base, lcp_#in~n, main_~y~0, main_~n~0, main_~a~0.offset] {1224#true} is VALID [2022-04-07 23:32:47,212 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1224#true} {1224#true} [143] assume_abort_if_notEXIT-->L43-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_5) (<= 0 v_main_~x~0_5)) 1 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, assume_abort_if_not_#in~cond] {1224#true} is VALID [2022-04-07 23:32:47,212 INFO L290 TraceCheckUtils]: 20: Hoare triple {1224#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:47,212 INFO L290 TraceCheckUtils]: 19: Hoare triple {1224#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:47,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {1224#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1224#true} is VALID [2022-04-07 23:32:47,212 INFO L272 TraceCheckUtils]: 17: Hoare triple {1224#true} [109] L43-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~y~0_5) (<= 0 v_main_~x~0_5)) 1 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, assume_abort_if_not_#in~cond] {1224#true} is VALID [2022-04-07 23:32:47,213 INFO L290 TraceCheckUtils]: 16: Hoare triple {1224#true} [106] L39-1-->L43: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~a~0.offset_4 |v_main_#t~malloc15.offset_3|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet17_2|) (= v_main_~x~0_3 |v_main_#t~nondet16_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (= v_main_~a~0.base_4 |v_main_#t~malloc15.base_3|)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~malloc15.offset=|v_main_#t~malloc15.offset_3|, main_#t~malloc15.base=|v_main_#t~malloc15.base_3|, main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_#t~malloc15.offset=|v_main_#t~malloc15.offset_3|, main_~x~0=v_main_~x~0_3, main_~a~0.base=v_main_~a~0.base_4, main_~y~0=v_main_~y~0_3, main_#t~malloc15.base=|v_main_#t~malloc15.base_3|, main_~a~0.offset=v_main_~a~0.offset_4} AuxVars[] AssignedVars[main_#t~nondet16, main_~x~0, main_#t~nondet17, main_~a~0.base, main_~y~0, main_~a~0.offset] {1224#true} is VALID [2022-04-07 23:32:47,213 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1224#true} {1224#true} [145] #Ultimate.meminitEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc15.base_4|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_main_~n~0_8 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_8 4)) (= |v_#Ultimate.meminit_#ptr.offsetInParam_1| |v_main_#t~malloc15.offset_4|)) InVars {main_#t~malloc15.offset=|v_main_#t~malloc15.offset_4|, main_~n~0=v_main_~n~0_8, main_#t~malloc15.base=|v_main_#t~malloc15.base_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[main_#t~malloc15.offset, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_~n~0, #Ultimate.meminit_#ptr.base, main_#t~malloc15.base, #Ultimate.meminit_#ptr.offset] {1224#true} is VALID [2022-04-07 23:32:47,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {1224#true} [110] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:47,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {1224#true} [107] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {1224#true} is VALID [2022-04-07 23:32:47,213 INFO L272 TraceCheckUtils]: 12: Hoare triple {1224#true} [103] L39-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc15.base_4|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_main_~n~0_8 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_8 4)) (= |v_#Ultimate.meminit_#ptr.offsetInParam_1| |v_main_#t~malloc15.offset_4|)) InVars {main_#t~malloc15.offset=|v_main_#t~malloc15.offset_4|, main_~n~0=v_main_~n~0_8, main_#t~malloc15.base=|v_main_#t~malloc15.base_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[main_#t~malloc15.offset, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_~n~0, #Ultimate.meminit_#ptr.base, main_#t~malloc15.base, #Ultimate.meminit_#ptr.offset] {1224#true} is VALID [2022-04-07 23:32:47,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {1224#true} [101] L38-1-->L39: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_main_#t~malloc15.base_1| 1)) (not (= |v_main_#t~malloc15.base_1| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_#t~malloc15.base_1| (* v_main_~n~0_5 4))) (< |v_main_#t~malloc15.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_4| |v_main_#t~malloc15.base_1|) 0) (= |v_main_#t~malloc15.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, main_~n~0=v_main_~n~0_5, #valid=|v_#valid_4|} OutVars{main_#t~malloc15.offset=|v_main_#t~malloc15.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_3|, #length=|v_#length_1|, main_~n~0=v_main_~n~0_5, main_#t~malloc15.base=|v_main_#t~malloc15.base_1|} AuxVars[] AssignedVars[main_#t~malloc15.offset, #valid, #length, main_#t~malloc15.base] {1224#true} is VALID [2022-04-07 23:32:47,213 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1224#true} {1224#true} [142] assume_abort_if_notEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (< v_main_~n~0_7 1073741824) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1224#true} is VALID [2022-04-07 23:32:47,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {1224#true} [108] L6-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:47,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {1224#true} [105] L6-->L6-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:47,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {1224#true} [102] assume_abort_if_notENTRY-->L6: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1224#true} is VALID [2022-04-07 23:32:47,213 INFO L272 TraceCheckUtils]: 6: Hoare triple {1224#true} [100] L38-->assume_abort_if_notENTRY: Formula: (= (ite (and (< v_main_~n~0_7 1073741824) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1224#true} is VALID [2022-04-07 23:32:47,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {1224#true} [98] mainENTRY-->L38: Formula: (and (<= |v_main_#t~nondet14_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet14_2|) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[main_#t~nondet14, main_~n~0] {1224#true} is VALID [2022-04-07 23:32:47,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {1224#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:47,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1224#true} {1224#true} [141] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:47,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {1224#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:47,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {1224#true} [96] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1)) (.cse1 (select |v_#memory_int_5| 2))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= (select .cse1 3) 46) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= 112 (select .cse1 2)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select .cse1 4) 99) (= (select .cse1 5) 0) (= 6 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1224#true} is VALID [2022-04-07 23:32:47,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {1224#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1224#true} is VALID [2022-04-07 23:32:47,214 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-07 23:32:47,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401263552] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 23:32:47,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 23:32:47,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 14 [2022-04-07 23:32:47,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89022436] [2022-04-07 23:32:47,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 23:32:47,215 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2022-04-07 23:32:47,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:32:47,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 23:32:47,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:32:47,273 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 23:32:47,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:32:47,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 23:32:47,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-04-07 23:32:47,274 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 23:32:48,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:48,075 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-04-07 23:32:48,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 23:32:48,076 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2022-04-07 23:32:48,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:32:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 23:32:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 50 transitions. [2022-04-07 23:32:48,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 23:32:48,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 50 transitions. [2022-04-07 23:32:48,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 50 transitions. [2022-04-07 23:32:48,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:32:48,123 INFO L225 Difference]: With dead ends: 49 [2022-04-07 23:32:48,123 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 23:32:48,123 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2022-04-07 23:32:48,124 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 55 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 23:32:48,124 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 43 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 23:32:48,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 23:32:48,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 23:32:48,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:32:48,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 23:32:48,125 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 23:32:48,125 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 23:32:48,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:48,125 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 23:32:48,125 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 23:32:48,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:32:48,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:32:48,125 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 23:32:48,125 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 23:32:48,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:48,125 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 23:32:48,125 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 23:32:48,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:32:48,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:32:48,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:32:48,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:32:48,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 23:32:48,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 23:32:48,126 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2022-04-07 23:32:48,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:32:48,126 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 23:32:48,126 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 23:32:48,126 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 23:32:48,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:32:48,128 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 23:32:48,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 23:32:48,333 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:32:48,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 23:32:48,544 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-07 23:32:48,544 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 23:32:48,544 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 23:32:48,544 INFO L885 garLoopResultBuilder]: At program point lcpENTRY(lines 16 22) the Hoare annotation is: true [2022-04-07 23:32:48,544 INFO L878 garLoopResultBuilder]: At program point L18-5(lines 18 20) the Hoare annotation is: (and (= |lcp_#in~x| lcp_~x) (= |lcp_#in~y| lcp_~y) (= |lcp_#in~n| lcp_~n) (= |lcp_#in~a.base| lcp_~a.base)) [2022-04-07 23:32:48,544 INFO L882 garLoopResultBuilder]: For program point L18-6(lines 18 20) no Hoare annotation was computed. [2022-04-07 23:32:48,544 INFO L882 garLoopResultBuilder]: For program point L18-1(line 18) no Hoare annotation was computed. [2022-04-07 23:32:48,544 INFO L882 garLoopResultBuilder]: For program point lcpFINAL(lines 16 22) no Hoare annotation was computed. [2022-04-07 23:32:48,544 INFO L882 garLoopResultBuilder]: For program point L18-3(lines 18 20) no Hoare annotation was computed. [2022-04-07 23:32:48,544 INFO L882 garLoopResultBuilder]: For program point lcpEXIT(lines 16 22) no Hoare annotation was computed. [2022-04-07 23:32:48,544 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 23:32:48,544 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 23:32:48,545 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 23:32:48,545 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 23:32:48,545 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2022-04-07 23:32:48,545 INFO L882 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-04-07 23:32:48,545 INFO L882 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-04-07 23:32:48,545 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-04-07 23:32:48,545 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 35 49) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-04-07 23:32:48,545 INFO L878 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-04-07 23:32:48,545 INFO L882 garLoopResultBuilder]: For program point L38-1(line 38) no Hoare annotation was computed. [2022-04-07 23:32:48,545 INFO L878 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-04-07 23:32:48,545 INFO L882 garLoopResultBuilder]: For program point L39-1(line 39) no Hoare annotation was computed. [2022-04-07 23:32:48,545 INFO L878 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc15.base|)))) [2022-04-07 23:32:48,545 INFO L878 garLoopResultBuilder]: At program point L43-1(line 43) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc15.base|)))) [2022-04-07 23:32:48,545 INFO L882 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2022-04-07 23:32:48,545 INFO L878 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (or (<= main_~n~0 (+ main_~l~1 main_~y~0)) (<= main_~n~0 (+ main_~l~1 main_~x~0))) (= .cse0 (select |#memory_int| |main_#t~malloc15.base|)))) [2022-04-07 23:32:48,545 INFO L882 garLoopResultBuilder]: For program point L45-1(line 45) no Hoare annotation was computed. [2022-04-07 23:32:48,546 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 35 49) no Hoare annotation was computed. [2022-04-07 23:32:48,546 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 35 49) no Hoare annotation was computed. [2022-04-07 23:32:48,546 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 12 14) the Hoare annotation is: true [2022-04-07 23:32:48,546 INFO L882 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2022-04-07 23:32:48,546 INFO L882 garLoopResultBuilder]: For program point L13-1(line 13) no Hoare annotation was computed. [2022-04-07 23:32:48,546 INFO L882 garLoopResultBuilder]: For program point L13-3(lines 12 14) no Hoare annotation was computed. [2022-04-07 23:32:48,546 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2022-04-07 23:32:48,546 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 12 14) no Hoare annotation was computed. [2022-04-07 23:32:48,546 INFO L882 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-04-07 23:32:48,546 INFO L878 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 (and (not (<= |check_#in~n| (+ |check_#in~x| |check_#in~l|))) (not (<= |check_#in~n| (+ |check_#in~y| |check_#in~l|)))) (let ((.cse1 (select |#memory_int| check_~a.base)) (.cse2 (* check_~i~0 4))) (and (or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x))) (= |check_#t~mem11| |check_#t~mem10|) (= (select .cse1 (+ .cse2 (* 4 check_~x) check_~a.offset)) 0) (= (select .cse1 (+ .cse2 (* 4 check_~y) check_~a.offset)) 0)))) (or .cse0 (and (not (<= |check_#in~n| |check_#in~y|)) (not (<= |check_#in~n| |check_#in~x|))) (= check_~l 0) (not (= |check_#in~l| 0))))) [2022-04-07 23:32:48,546 INFO L882 garLoopResultBuilder]: For program point L28-1(line 28) no Hoare annotation was computed. [2022-04-07 23:32:48,546 INFO L885 garLoopResultBuilder]: At program point checkENTRY(lines 24 33) the Hoare annotation is: true [2022-04-07 23:32:48,546 INFO L882 garLoopResultBuilder]: For program point L31(lines 31 32) no Hoare annotation was computed. [2022-04-07 23:32:48,546 INFO L878 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (let ((.cse0 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 (and (not (<= |check_#in~n| (+ |check_#in~x| |check_#in~l|))) (not (<= |check_#in~n| (+ |check_#in~y| |check_#in~l|)))) (let ((.cse1 (select |#memory_int| check_~a.base)) (.cse2 (* check_~i~0 4))) (and (or (<= check_~n (+ check_~l check_~y)) (<= check_~n (+ check_~l check_~x))) (= (select .cse1 (+ .cse2 (* 4 check_~x) check_~a.offset)) 0) (= (select .cse1 (+ .cse2 (* 4 check_~y) check_~a.offset)) 0)))) (or .cse0 (and (not (<= |check_#in~n| |check_#in~y|)) (not (<= |check_#in~n| |check_#in~x|))) (= check_~l 0) (not (= |check_#in~l| 0))))) [2022-04-07 23:32:48,547 INFO L878 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (or (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))) (and (not (<= |check_#in~n| (+ |check_#in~x| |check_#in~l|))) (not (<= |check_#in~n| (+ |check_#in~y| |check_#in~l|))))) [2022-04-07 23:32:48,547 INFO L882 garLoopResultBuilder]: For program point L31-2(lines 24 33) no Hoare annotation was computed. [2022-04-07 23:32:48,547 INFO L882 garLoopResultBuilder]: For program point L32-1(line 32) no Hoare annotation was computed. [2022-04-07 23:32:48,547 INFO L882 garLoopResultBuilder]: For program point checkEXIT(lines 24 33) no Hoare annotation was computed. [2022-04-07 23:32:48,547 INFO L878 garLoopResultBuilder]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-04-07 23:32:48,547 INFO L882 garLoopResultBuilder]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2022-04-07 23:32:48,547 INFO L882 garLoopResultBuilder]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2022-04-07 23:32:48,549 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-07 23:32:48,550 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 23:32:48,555 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 23:32:48,555 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-07 23:32:48,555 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-07 23:32:48,556 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-07 23:32:48,557 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 23:32:48,557 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-07 23:32:48,557 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-07 23:32:48,557 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-07 23:32:48,557 WARN L170 areAnnotationChecker]: L18-6 has no Hoare annotation [2022-04-07 23:32:48,557 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-04-07 23:32:48,557 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-07 23:32:48,557 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-07 23:32:48,557 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 23:32:48,557 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-07 23:32:48,557 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-07 23:32:48,557 WARN L170 areAnnotationChecker]: L18-6 has no Hoare annotation [2022-04-07 23:32:48,557 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-04-07 23:32:48,557 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-04-07 23:32:48,557 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2022-04-07 23:32:48,557 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2022-04-07 23:32:48,557 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2022-04-07 23:32:48,558 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-07 23:32:48,558 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-07 23:32:48,558 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-07 23:32:48,558 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-07 23:32:48,558 WARN L170 areAnnotationChecker]: lcpFINAL has no Hoare annotation [2022-04-07 23:32:48,558 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2022-04-07 23:32:48,558 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2022-04-07 23:32:48,558 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 23:32:48,558 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 23:32:48,558 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2022-04-07 23:32:48,558 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-07 23:32:48,558 WARN L170 areAnnotationChecker]: lcpEXIT has no Hoare annotation [2022-04-07 23:32:48,558 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-07 23:32:48,558 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-04-07 23:32:48,559 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-07 23:32:48,559 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-07 23:32:48,559 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-07 23:32:48,559 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2022-04-07 23:32:48,559 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2022-04-07 23:32:48,559 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2022-04-07 23:32:48,559 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 23:32:48,560 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 23:32:48,560 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 23:32:48,560 INFO L163 areAnnotationChecker]: CFG has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 23:32:48,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 11:32:48 BasicIcfg [2022-04-07 23:32:48,575 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 23:32:48,576 INFO L158 Benchmark]: Toolchain (without parser) took 9816.83ms. Allocated memory was 226.5MB in the beginning and 345.0MB in the end (delta: 118.5MB). Free memory was 171.8MB in the beginning and 237.8MB in the end (delta: -66.0MB). Peak memory consumption was 52.8MB. Max. memory is 8.0GB. [2022-04-07 23:32:48,577 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 226.5MB. Free memory was 188.5MB in the beginning and 188.5MB in the end (delta: 70.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 23:32:48,577 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.64ms. Allocated memory was 226.5MB in the beginning and 287.3MB in the end (delta: 60.8MB). Free memory was 171.7MB in the beginning and 259.9MB in the end (delta: -88.2MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. [2022-04-07 23:32:48,577 INFO L158 Benchmark]: Boogie Preprocessor took 40.18ms. Allocated memory is still 287.3MB. Free memory was 259.9MB in the beginning and 257.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 23:32:48,577 INFO L158 Benchmark]: RCFGBuilder took 394.72ms. Allocated memory is still 287.3MB. Free memory was 257.8MB in the beginning and 241.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-04-07 23:32:48,578 INFO L158 Benchmark]: IcfgTransformer took 50.25ms. Allocated memory is still 287.3MB. Free memory was 241.0MB in the beginning and 238.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 23:32:48,579 INFO L158 Benchmark]: TraceAbstraction took 9085.79ms. Allocated memory was 287.3MB in the beginning and 345.0MB in the end (delta: 57.7MB). Free memory was 238.4MB in the beginning and 237.8MB in the end (delta: 522.2kB). Peak memory consumption was 58.7MB. Max. memory is 8.0GB. [2022-04-07 23:32:48,580 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 226.5MB. Free memory was 188.5MB in the beginning and 188.5MB in the end (delta: 70.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 241.64ms. Allocated memory was 226.5MB in the beginning and 287.3MB in the end (delta: 60.8MB). Free memory was 171.7MB in the beginning and 259.9MB in the end (delta: -88.2MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.18ms. Allocated memory is still 287.3MB. Free memory was 259.9MB in the beginning and 257.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 394.72ms. Allocated memory is still 287.3MB. Free memory was 257.8MB in the beginning and 241.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * IcfgTransformer took 50.25ms. Allocated memory is still 287.3MB. Free memory was 241.0MB in the beginning and 238.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 9085.79ms. Allocated memory was 287.3MB in the beginning and 345.0MB in the end (delta: 57.7MB). Free memory was 238.4MB in the beginning and 237.8MB in the end (delta: 522.2kB). Peak memory consumption was 58.7MB. 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 - PositiveResult [Line: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 325 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 317 mSDsluCounter, 221 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62 mSDsCounter, 180 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1374 IncrementalHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 180 mSolverCounterUnsat, 159 mSDtfsCounter, 1374 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 248 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 46 PreInvPairs, 55 NumberOfFragments, 284 HoareAnnotationTreeSize, 46 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 308 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 283 NumberOfCodeBlocks, 283 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 329 ConstructedInterpolants, 0 QuantifiedInterpolants, 1274 SizeOfPredicates, 13 NumberOfNonLiveVariables, 231 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 95/101 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((\old(x) == x && \old(y) == y) && \old(n) == n) && a == a RESULT: Ultimate proved your program to be correct! [2022-04-07 23:32:48,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...