/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/loops/lu.cmp.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:05:36,115 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:05:36,116 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:05:36,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:05:36,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:05:36,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:05:36,154 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:05:36,156 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:05:36,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:05:36,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:05:36,161 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:05:36,162 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:05:36,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:05:36,164 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:05:36,165 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:05:36,167 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:05:36,167 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:05:36,168 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:05:36,169 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:05:36,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:05:36,174 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:05:36,175 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:05:36,175 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:05:36,176 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:05:36,177 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:05:36,179 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:05:36,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:05:36,179 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:05:36,180 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:05:36,180 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:05:36,181 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:05:36,181 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:05:36,182 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:05:36,182 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:05:36,183 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:05:36,183 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:05:36,183 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:05:36,184 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:05:36,184 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:05:36,184 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:05:36,184 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:05:36,185 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:05:36,186 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:05:36,204 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:05:36,204 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:05:36,205 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:05:36,205 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:05:36,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:05:36,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:05:36,206 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:05:36,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:05:36,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:05:36,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:05:36,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:05:36,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:05:36,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:05:36,207 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:05:36,207 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:05:36,207 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:05:36,207 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:05:36,207 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:05:36,208 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:05:36,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:05:36,208 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:05:36,208 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:05:36,208 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:05:36,208 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:05:36,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:05:36,208 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:05:36,208 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:05:36,208 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:05:36,209 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:05:36,209 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-27 21:05:36,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:05:36,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:05:36,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:05:36,389 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:05:36,390 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:05:36,391 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/lu.cmp.c [2022-04-27 21:05:36,444 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a17942247/4d6148ee88914bb38e316d04a0c07d0d/FLAGa3cdbb4a9 [2022-04-27 21:05:36,732 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:05:36,732 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/lu.cmp.c [2022-04-27 21:05:36,741 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a17942247/4d6148ee88914bb38e316d04a0c07d0d/FLAGa3cdbb4a9 [2022-04-27 21:05:37,174 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a17942247/4d6148ee88914bb38e316d04a0c07d0d [2022-04-27 21:05:37,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:05:37,177 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:05:37,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:05:37,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:05:37,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:05:37,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:05:37" (1/1) ... [2022-04-27 21:05:37,192 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60a1d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:37, skipping insertion in model container [2022-04-27 21:05:37,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:05:37" (1/1) ... [2022-04-27 21:05:37,197 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:05:37,219 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:05:37,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/lu.cmp.c[318,331] [2022-04-27 21:05:37,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:05:37,380 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:05:37,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/lu.cmp.c[318,331] [2022-04-27 21:05:37,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:05:37,411 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:05:37,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:37 WrapperNode [2022-04-27 21:05:37,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:05:37,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:05:37,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:05:37,412 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:05:37,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:37" (1/1) ... [2022-04-27 21:05:37,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:37" (1/1) ... [2022-04-27 21:05:37,425 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:37" (1/1) ... [2022-04-27 21:05:37,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:37" (1/1) ... [2022-04-27 21:05:37,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:37" (1/1) ... [2022-04-27 21:05:37,442 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:37" (1/1) ... [2022-04-27 21:05:37,443 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:37" (1/1) ... [2022-04-27 21:05:37,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:05:37,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:05:37,445 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:05:37,446 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:05:37,446 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:37" (1/1) ... [2022-04-27 21:05:37,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:05:37,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:05:37,483 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-27 21:05:37,484 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-27 21:05:37,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:05:37,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:05:37,507 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:05:37,507 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:05:37,507 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs [2022-04-27 21:05:37,507 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:05:37,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ludcmp [2022-04-27 21:05:37,507 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:05:37,507 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:05:37,507 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:05:37,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:05:37,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:05:37,508 INFO L130 BoogieDeclarations]: Found specification of procedure ludcmp [2022-04-27 21:05:37,508 INFO L130 BoogieDeclarations]: Found specification of procedure fabs [2022-04-27 21:05:37,508 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:05:37,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-04-27 21:05:37,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-04-27 21:05:37,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 21:05:37,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:05:37,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:05:37,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:05:37,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:05:37,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:05:37,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:05:37,565 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:05:37,566 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:05:37,803 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:05:37,808 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:05:37,808 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-04-27 21:05:37,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:05:37 BoogieIcfgContainer [2022-04-27 21:05:37,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:05:37,810 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:05:37,810 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:05:37,811 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:05:37,813 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:05:37" (1/1) ... [2022-04-27 21:05:37,831 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:05:37,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:05:37 BasicIcfg [2022-04-27 21:05:37,874 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:05:37,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:05:37,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:05:37,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:05:37,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:05:37" (1/4) ... [2022-04-27 21:05:37,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388fb689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:05:37, skipping insertion in model container [2022-04-27 21:05:37,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:37" (2/4) ... [2022-04-27 21:05:37,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388fb689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:05:37, skipping insertion in model container [2022-04-27 21:05:37,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:05:37" (3/4) ... [2022-04-27 21:05:37,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388fb689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:05:37, skipping insertion in model container [2022-04-27 21:05:37,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:05:37" (4/4) ... [2022-04-27 21:05:37,880 INFO L111 eAbstractionObserver]: Analyzing ICFG lu.cmp.cqvasr [2022-04-27 21:05:37,889 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:05:37,889 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:05:37,924 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:05:37,929 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3e5a1b88, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@71bba206 [2022-04-27 21:05:37,929 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:05:37,935 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 53 states have internal predecessors, (81), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 21:05:37,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:05:37,942 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:05:37,942 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:05:37,942 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:05:37,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:05:37,946 INFO L85 PathProgramCache]: Analyzing trace with hash -708032411, now seen corresponding path program 1 times [2022-04-27 21:05:37,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:05:37,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941368381] [2022-04-27 21:05:37,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:37,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:05:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:38,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:05:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:38,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {72#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [219] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_21| 1))) (and (= |v_~#a~0.offset_15| 0) (= 5 |v_~#b~0.base_4|) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_11| 5) 1) (= (select .cse0 1) 0) (= |v_~#a~0.base_15| 4) (= |v_#NULL.base_1| 0) (= (select |v_#valid_11| 3) 1) (= |v_~#x~0.offset_4| 0) (= (select |v_#valid_11| 6) 1) (= 9 (select |v_#length_5| 2)) (= |v_~#b~0.offset_4| 0) (= (select |v_#length_5| 3) 12) (= (select |v_#valid_11| 2) 1) (= (let ((.cse1 ((as const (Array Int Real)) 0.0))) (store (store (store |v_#memory_real_34| |v_~#a~0.base_15| .cse1) |v_~#b~0.base_4| .cse1) |v_~#x~0.base_4| .cse1)) |v_#memory_real_31|) (= 20000 (select |v_#length_5| 4)) (= 400 (select |v_#length_5| 5)) (= (select .cse0 0) 48) (= 1 (select |v_#valid_11| 1)) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_11| 0) 0) (= (select |v_#valid_11| 4) 1) (= 400 (select |v_#length_5| 6)) (= |v_~#x~0.base_4| 6))) InVars {#memory_int=|v_#memory_int_21|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #memory_real=|v_#memory_real_34|, #valid=|v_#valid_11|} OutVars{~#x~0.offset=|v_~#x~0.offset_4|, ~#a~0.base=|v_~#a~0.base_15|, #NULL.offset=|v_#NULL.offset_1|, #memory_real=|v_#memory_real_31|, ~#b~0.base=|v_~#b~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_11|, ~#b~0.offset=|v_~#b~0.offset_4|, ~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_21|, #length=|v_#length_5|, ~#a~0.offset=|v_~#a~0.offset_15|} AuxVars[] AssignedVars[~#x~0.offset, ~#b~0.offset, ~#x~0.base, ~#a~0.base, #NULL.offset, ~#a~0.offset, #memory_real, ~#b~0.base, #NULL.base] {67#true} is VALID [2022-04-27 21:05:38,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {67#true} is VALID [2022-04-27 21:05:38,109 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67#true} {67#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {67#true} is VALID [2022-04-27 21:05:38,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {67#true} [217] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {72#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:05:38,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {72#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [219] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_21| 1))) (and (= |v_~#a~0.offset_15| 0) (= 5 |v_~#b~0.base_4|) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_11| 5) 1) (= (select .cse0 1) 0) (= |v_~#a~0.base_15| 4) (= |v_#NULL.base_1| 0) (= (select |v_#valid_11| 3) 1) (= |v_~#x~0.offset_4| 0) (= (select |v_#valid_11| 6) 1) (= 9 (select |v_#length_5| 2)) (= |v_~#b~0.offset_4| 0) (= (select |v_#length_5| 3) 12) (= (select |v_#valid_11| 2) 1) (= (let ((.cse1 ((as const (Array Int Real)) 0.0))) (store (store (store |v_#memory_real_34| |v_~#a~0.base_15| .cse1) |v_~#b~0.base_4| .cse1) |v_~#x~0.base_4| .cse1)) |v_#memory_real_31|) (= 20000 (select |v_#length_5| 4)) (= 400 (select |v_#length_5| 5)) (= (select .cse0 0) 48) (= 1 (select |v_#valid_11| 1)) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_11| 0) 0) (= (select |v_#valid_11| 4) 1) (= 400 (select |v_#length_5| 6)) (= |v_~#x~0.base_4| 6))) InVars {#memory_int=|v_#memory_int_21|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #memory_real=|v_#memory_real_34|, #valid=|v_#valid_11|} OutVars{~#x~0.offset=|v_~#x~0.offset_4|, ~#a~0.base=|v_~#a~0.base_15|, #NULL.offset=|v_#NULL.offset_1|, #memory_real=|v_#memory_real_31|, ~#b~0.base=|v_~#b~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_11|, ~#b~0.offset=|v_~#b~0.offset_4|, ~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_21|, #length=|v_#length_5|, ~#a~0.offset=|v_~#a~0.offset_15|} AuxVars[] AssignedVars[~#x~0.offset, ~#b~0.offset, ~#x~0.base, ~#a~0.base, #NULL.offset, ~#a~0.offset, #memory_real, ~#b~0.base, #NULL.base] {67#true} is VALID [2022-04-27 21:05:38,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {67#true} is VALID [2022-04-27 21:05:38,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67#true} {67#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {67#true} is VALID [2022-04-27 21:05:38,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {67#true} [218] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {67#true} is VALID [2022-04-27 21:05:38,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {67#true} [221] mainENTRY-->L93-3: Formula: (and (= v_main_~i~0_8 0) (= v_main_~nmax~0_1 50) (= v_main_~n~0_4 5) (= v_main_~eps~0_1 (/ 1.0 1000000.0))) InVars {} OutVars{main_~chkerr~0=v_main_~chkerr~0_1, main_~w~0=v_main_~w~0_4, main_~eps~0=v_main_~eps~0_1, main_~j~0=v_main_~j~0_9, main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~nmax~0=v_main_~nmax~0_1} AuxVars[] AssignedVars[main_~chkerr~0, main_~w~0, main_~eps~0, main_~j~0, main_~i~0, main_~n~0, main_~nmax~0] {67#true} is VALID [2022-04-27 21:05:38,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {67#true} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {67#true} is VALID [2022-04-27 21:05:38,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {67#true} [227] L96-3-->L96-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {68#false} is VALID [2022-04-27 21:05:38,113 INFO L272 TraceCheckUtils]: 8: Hoare triple {68#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {68#false} is VALID [2022-04-27 21:05:38,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {68#false} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {68#false} is VALID [2022-04-27 21:05:38,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {68#false} [246] L6-->L7: Formula: (= 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[] {68#false} is VALID [2022-04-27 21:05:38,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {68#false} [251] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68#false} is VALID [2022-04-27 21:05:38,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:05:38,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:05:38,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941368381] [2022-04-27 21:05:38,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941368381] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:05:38,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:05:38,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 21:05:38,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606146917] [2022-04-27 21:05:38,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:05:38,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:05:38,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:05:38,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:38,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:05:38,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 21:05:38,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:05:38,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 21:05:38,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:05:38,170 INFO L87 Difference]: Start difference. First operand has 64 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 53 states have internal predecessors, (81), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:38,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:38,543 INFO L93 Difference]: Finished difference Result 147 states and 225 transitions. [2022-04-27 21:05:38,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 21:05:38,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:05:38,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:05:38,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2022-04-27 21:05:38,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:38,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2022-04-27 21:05:38,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 225 transitions. [2022-04-27 21:05:38,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:05:38,786 INFO L225 Difference]: With dead ends: 147 [2022-04-27 21:05:38,786 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 21:05:38,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:05:38,793 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 38 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:05:38,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 73 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:05:38,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 21:05:38,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2022-04-27 21:05:38,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:05:38,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:05:38,817 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:05:38,818 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:05:38,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:38,821 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-27 21:05:38,822 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-27 21:05:38,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:38,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:38,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-04-27 21:05:38,823 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-04-27 21:05:38,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:38,826 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-27 21:05:38,826 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-27 21:05:38,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:38,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:38,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:05:38,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:05:38,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:05:38,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-27 21:05:38,837 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2022-04-27 21:05:38,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:05:38,837 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-27 21:05:38,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:38,838 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-27 21:05:38,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:05:38,838 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:05:38,839 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:05:38,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:05:38,839 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:05:38,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:05:38,840 INFO L85 PathProgramCache]: Analyzing trace with hash -707108890, now seen corresponding path program 1 times [2022-04-27 21:05:38,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:05:38,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431764641] [2022-04-27 21:05:38,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:38,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:05:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:38,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:05:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:38,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {353#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [219] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_21| 1))) (and (= |v_~#a~0.offset_15| 0) (= 5 |v_~#b~0.base_4|) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_11| 5) 1) (= (select .cse0 1) 0) (= |v_~#a~0.base_15| 4) (= |v_#NULL.base_1| 0) (= (select |v_#valid_11| 3) 1) (= |v_~#x~0.offset_4| 0) (= (select |v_#valid_11| 6) 1) (= 9 (select |v_#length_5| 2)) (= |v_~#b~0.offset_4| 0) (= (select |v_#length_5| 3) 12) (= (select |v_#valid_11| 2) 1) (= (let ((.cse1 ((as const (Array Int Real)) 0.0))) (store (store (store |v_#memory_real_34| |v_~#a~0.base_15| .cse1) |v_~#b~0.base_4| .cse1) |v_~#x~0.base_4| .cse1)) |v_#memory_real_31|) (= 20000 (select |v_#length_5| 4)) (= 400 (select |v_#length_5| 5)) (= (select .cse0 0) 48) (= 1 (select |v_#valid_11| 1)) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_11| 0) 0) (= (select |v_#valid_11| 4) 1) (= 400 (select |v_#length_5| 6)) (= |v_~#x~0.base_4| 6))) InVars {#memory_int=|v_#memory_int_21|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #memory_real=|v_#memory_real_34|, #valid=|v_#valid_11|} OutVars{~#x~0.offset=|v_~#x~0.offset_4|, ~#a~0.base=|v_~#a~0.base_15|, #NULL.offset=|v_#NULL.offset_1|, #memory_real=|v_#memory_real_31|, ~#b~0.base=|v_~#b~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_11|, ~#b~0.offset=|v_~#b~0.offset_4|, ~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_21|, #length=|v_#length_5|, ~#a~0.offset=|v_~#a~0.offset_15|} AuxVars[] AssignedVars[~#x~0.offset, ~#b~0.offset, ~#x~0.base, ~#a~0.base, #NULL.offset, ~#a~0.offset, #memory_real, ~#b~0.base, #NULL.base] {346#true} is VALID [2022-04-27 21:05:38,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {346#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {346#true} is VALID [2022-04-27 21:05:38,974 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {346#true} {346#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {346#true} is VALID [2022-04-27 21:05:38,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {346#true} [217] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {353#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:05:38,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {353#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [219] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_21| 1))) (and (= |v_~#a~0.offset_15| 0) (= 5 |v_~#b~0.base_4|) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_11| 5) 1) (= (select .cse0 1) 0) (= |v_~#a~0.base_15| 4) (= |v_#NULL.base_1| 0) (= (select |v_#valid_11| 3) 1) (= |v_~#x~0.offset_4| 0) (= (select |v_#valid_11| 6) 1) (= 9 (select |v_#length_5| 2)) (= |v_~#b~0.offset_4| 0) (= (select |v_#length_5| 3) 12) (= (select |v_#valid_11| 2) 1) (= (let ((.cse1 ((as const (Array Int Real)) 0.0))) (store (store (store |v_#memory_real_34| |v_~#a~0.base_15| .cse1) |v_~#b~0.base_4| .cse1) |v_~#x~0.base_4| .cse1)) |v_#memory_real_31|) (= 20000 (select |v_#length_5| 4)) (= 400 (select |v_#length_5| 5)) (= (select .cse0 0) 48) (= 1 (select |v_#valid_11| 1)) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_11| 0) 0) (= (select |v_#valid_11| 4) 1) (= 400 (select |v_#length_5| 6)) (= |v_~#x~0.base_4| 6))) InVars {#memory_int=|v_#memory_int_21|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #memory_real=|v_#memory_real_34|, #valid=|v_#valid_11|} OutVars{~#x~0.offset=|v_~#x~0.offset_4|, ~#a~0.base=|v_~#a~0.base_15|, #NULL.offset=|v_#NULL.offset_1|, #memory_real=|v_#memory_real_31|, ~#b~0.base=|v_~#b~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_11|, ~#b~0.offset=|v_~#b~0.offset_4|, ~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_21|, #length=|v_#length_5|, ~#a~0.offset=|v_~#a~0.offset_15|} AuxVars[] AssignedVars[~#x~0.offset, ~#b~0.offset, ~#x~0.base, ~#a~0.base, #NULL.offset, ~#a~0.offset, #memory_real, ~#b~0.base, #NULL.base] {346#true} is VALID [2022-04-27 21:05:38,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {346#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {346#true} is VALID [2022-04-27 21:05:38,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {346#true} {346#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {346#true} is VALID [2022-04-27 21:05:38,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {346#true} [218] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {346#true} is VALID [2022-04-27 21:05:38,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {346#true} [221] mainENTRY-->L93-3: Formula: (and (= v_main_~i~0_8 0) (= v_main_~nmax~0_1 50) (= v_main_~n~0_4 5) (= v_main_~eps~0_1 (/ 1.0 1000000.0))) InVars {} OutVars{main_~chkerr~0=v_main_~chkerr~0_1, main_~w~0=v_main_~w~0_4, main_~eps~0=v_main_~eps~0_1, main_~j~0=v_main_~j~0_9, main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~nmax~0=v_main_~nmax~0_1} AuxVars[] AssignedVars[main_~chkerr~0, main_~w~0, main_~eps~0, main_~j~0, main_~i~0, main_~n~0, main_~nmax~0] {351#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:38,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {351#(= (+ main_~n~0 (- 5)) 0)} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {352#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 21:05:38,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {352#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {347#false} is VALID [2022-04-27 21:05:38,980 INFO L272 TraceCheckUtils]: 8: Hoare triple {347#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {347#false} is VALID [2022-04-27 21:05:38,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {347#false} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {347#false} is VALID [2022-04-27 21:05:38,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {347#false} [246] L6-->L7: Formula: (= 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[] {347#false} is VALID [2022-04-27 21:05:38,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {347#false} [251] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#false} is VALID [2022-04-27 21:05:38,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:05:38,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:05:38,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431764641] [2022-04-27 21:05:38,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431764641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:05:38,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:05:38,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 21:05:38,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746134241] [2022-04-27 21:05:38,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:05:38,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:05:38,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:05:38,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:38,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:05:38,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:05:38,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:05:38,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:05:38,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:05:38,994 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:39,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:39,130 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-27 21:05:39,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:05:39,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:05:39,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:05:39,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:39,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-27 21:05:39,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:39,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-27 21:05:39,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2022-04-27 21:05:39,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:05:39,169 INFO L225 Difference]: With dead ends: 40 [2022-04-27 21:05:39,169 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 21:05:39,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:05:39,171 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 24 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:05:39,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 25 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:05:39,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 21:05:39,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2022-04-27 21:05:39,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:05:39,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:05:39,175 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:05:39,175 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:05:39,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:39,176 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 21:05:39,176 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 21:05:39,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:39,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:39,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-04-27 21:05:39,177 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-04-27 21:05:39,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:39,179 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 21:05:39,179 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 21:05:39,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:39,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:39,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:05:39,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:05:39,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:05:39,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-27 21:05:39,181 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 12 [2022-04-27 21:05:39,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:05:39,181 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-27 21:05:39,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:39,182 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-27 21:05:39,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 21:05:39,182 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:05:39,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:05:39,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:05:39,183 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:05:39,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:05:39,183 INFO L85 PathProgramCache]: Analyzing trace with hash -740655430, now seen corresponding path program 1 times [2022-04-27 21:05:39,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:05:39,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567522810] [2022-04-27 21:05:39,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:39,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:05:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:39,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:05:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:39,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {505#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [219] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_21| 1))) (and (= |v_~#a~0.offset_15| 0) (= 5 |v_~#b~0.base_4|) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_11| 5) 1) (= (select .cse0 1) 0) (= |v_~#a~0.base_15| 4) (= |v_#NULL.base_1| 0) (= (select |v_#valid_11| 3) 1) (= |v_~#x~0.offset_4| 0) (= (select |v_#valid_11| 6) 1) (= 9 (select |v_#length_5| 2)) (= |v_~#b~0.offset_4| 0) (= (select |v_#length_5| 3) 12) (= (select |v_#valid_11| 2) 1) (= (let ((.cse1 ((as const (Array Int Real)) 0.0))) (store (store (store |v_#memory_real_34| |v_~#a~0.base_15| .cse1) |v_~#b~0.base_4| .cse1) |v_~#x~0.base_4| .cse1)) |v_#memory_real_31|) (= 20000 (select |v_#length_5| 4)) (= 400 (select |v_#length_5| 5)) (= (select .cse0 0) 48) (= 1 (select |v_#valid_11| 1)) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_11| 0) 0) (= (select |v_#valid_11| 4) 1) (= 400 (select |v_#length_5| 6)) (= |v_~#x~0.base_4| 6))) InVars {#memory_int=|v_#memory_int_21|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #memory_real=|v_#memory_real_34|, #valid=|v_#valid_11|} OutVars{~#x~0.offset=|v_~#x~0.offset_4|, ~#a~0.base=|v_~#a~0.base_15|, #NULL.offset=|v_#NULL.offset_1|, #memory_real=|v_#memory_real_31|, ~#b~0.base=|v_~#b~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_11|, ~#b~0.offset=|v_~#b~0.offset_4|, ~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_21|, #length=|v_#length_5|, ~#a~0.offset=|v_~#a~0.offset_15|} AuxVars[] AssignedVars[~#x~0.offset, ~#b~0.offset, ~#x~0.base, ~#a~0.base, #NULL.offset, ~#a~0.offset, #memory_real, ~#b~0.base, #NULL.base] {497#true} is VALID [2022-04-27 21:05:39,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {497#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {497#true} is VALID [2022-04-27 21:05:39,282 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {497#true} {497#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {497#true} is VALID [2022-04-27 21:05:39,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {497#true} [217] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {505#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:05:39,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {505#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [219] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_21| 1))) (and (= |v_~#a~0.offset_15| 0) (= 5 |v_~#b~0.base_4|) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_11| 5) 1) (= (select .cse0 1) 0) (= |v_~#a~0.base_15| 4) (= |v_#NULL.base_1| 0) (= (select |v_#valid_11| 3) 1) (= |v_~#x~0.offset_4| 0) (= (select |v_#valid_11| 6) 1) (= 9 (select |v_#length_5| 2)) (= |v_~#b~0.offset_4| 0) (= (select |v_#length_5| 3) 12) (= (select |v_#valid_11| 2) 1) (= (let ((.cse1 ((as const (Array Int Real)) 0.0))) (store (store (store |v_#memory_real_34| |v_~#a~0.base_15| .cse1) |v_~#b~0.base_4| .cse1) |v_~#x~0.base_4| .cse1)) |v_#memory_real_31|) (= 20000 (select |v_#length_5| 4)) (= 400 (select |v_#length_5| 5)) (= (select .cse0 0) 48) (= 1 (select |v_#valid_11| 1)) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_11| 0) 0) (= (select |v_#valid_11| 4) 1) (= 400 (select |v_#length_5| 6)) (= |v_~#x~0.base_4| 6))) InVars {#memory_int=|v_#memory_int_21|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #memory_real=|v_#memory_real_34|, #valid=|v_#valid_11|} OutVars{~#x~0.offset=|v_~#x~0.offset_4|, ~#a~0.base=|v_~#a~0.base_15|, #NULL.offset=|v_#NULL.offset_1|, #memory_real=|v_#memory_real_31|, ~#b~0.base=|v_~#b~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_11|, ~#b~0.offset=|v_~#b~0.offset_4|, ~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_21|, #length=|v_#length_5|, ~#a~0.offset=|v_~#a~0.offset_15|} AuxVars[] AssignedVars[~#x~0.offset, ~#b~0.offset, ~#x~0.base, ~#a~0.base, #NULL.offset, ~#a~0.offset, #memory_real, ~#b~0.base, #NULL.base] {497#true} is VALID [2022-04-27 21:05:39,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {497#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {497#true} is VALID [2022-04-27 21:05:39,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {497#true} {497#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {497#true} is VALID [2022-04-27 21:05:39,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {497#true} [218] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {497#true} is VALID [2022-04-27 21:05:39,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {497#true} [221] mainENTRY-->L93-3: Formula: (and (= v_main_~i~0_8 0) (= v_main_~nmax~0_1 50) (= v_main_~n~0_4 5) (= v_main_~eps~0_1 (/ 1.0 1000000.0))) InVars {} OutVars{main_~chkerr~0=v_main_~chkerr~0_1, main_~w~0=v_main_~w~0_4, main_~eps~0=v_main_~eps~0_1, main_~j~0=v_main_~j~0_9, main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~nmax~0=v_main_~nmax~0_1} AuxVars[] AssignedVars[main_~chkerr~0, main_~w~0, main_~eps~0, main_~j~0, main_~i~0, main_~n~0, main_~nmax~0] {502#(< main_~i~0 50)} is VALID [2022-04-27 21:05:39,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {502#(< main_~i~0 50)} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {502#(< main_~i~0 50)} is VALID [2022-04-27 21:05:39,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {502#(< main_~i~0 50)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {502#(< main_~i~0 50)} is VALID [2022-04-27 21:05:39,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {502#(< main_~i~0 50)} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {502#(< main_~i~0 50)} is VALID [2022-04-27 21:05:39,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {502#(< main_~i~0 50)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {502#(< main_~i~0 50)} is VALID [2022-04-27 21:05:39,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {502#(< main_~i~0 50)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {502#(< main_~i~0 50)} is VALID [2022-04-27 21:05:39,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {502#(< main_~i~0 50)} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {502#(< main_~i~0 50)} is VALID [2022-04-27 21:05:39,287 INFO L272 TraceCheckUtils]: 12: Hoare triple {502#(< main_~i~0 50)} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {503#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:05:39,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {503#(not (= |__VERIFIER_assert_#in~cond| 0))} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {504#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:05:39,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {504#(not (= __VERIFIER_assert_~cond 0))} [246] L6-->L7: Formula: (= 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[] {498#false} is VALID [2022-04-27 21:05:39,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {498#false} [251] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {498#false} is VALID [2022-04-27 21:05:39,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 21:05:39,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:05:39,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567522810] [2022-04-27 21:05:39,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567522810] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:05:39,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:05:39,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:05:39,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097619214] [2022-04-27 21:05:39,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:05:39,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 21:05:39,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:05:39,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:39,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:05:39,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:05:39,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:05:39,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:05:39,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:05:39,301 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:39,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:39,502 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-27 21:05:39,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 21:05:39,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 21:05:39,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:05:39,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:39,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-27 21:05:39,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:39,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-27 21:05:39,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-27 21:05:39,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:05:39,537 INFO L225 Difference]: With dead ends: 36 [2022-04-27 21:05:39,537 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 21:05:39,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 21:05:39,538 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:05:39,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 36 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:05:39,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 21:05:39,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-27 21:05:39,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:05:39,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:05:39,545 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:05:39,545 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:05:39,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:39,546 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 21:05:39,546 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 21:05:39,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:39,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:39,547 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 34 states. [2022-04-27 21:05:39,547 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 34 states. [2022-04-27 21:05:39,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:39,548 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 21:05:39,548 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 21:05:39,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:39,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:39,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:05:39,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:05:39,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:05:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-27 21:05:39,549 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 16 [2022-04-27 21:05:39,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:05:39,549 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-27 21:05:39,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:39,550 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-27 21:05:39,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 21:05:39,550 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:05:39,550 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:05:39,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 21:05:39,550 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:05:39,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:05:39,551 INFO L85 PathProgramCache]: Analyzing trace with hash 213602113, now seen corresponding path program 1 times [2022-04-27 21:05:39,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:05:39,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877287285] [2022-04-27 21:05:39,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:39,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:05:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:39,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:05:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:39,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {693#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [219] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_21| 1))) (and (= |v_~#a~0.offset_15| 0) (= 5 |v_~#b~0.base_4|) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_11| 5) 1) (= (select .cse0 1) 0) (= |v_~#a~0.base_15| 4) (= |v_#NULL.base_1| 0) (= (select |v_#valid_11| 3) 1) (= |v_~#x~0.offset_4| 0) (= (select |v_#valid_11| 6) 1) (= 9 (select |v_#length_5| 2)) (= |v_~#b~0.offset_4| 0) (= (select |v_#length_5| 3) 12) (= (select |v_#valid_11| 2) 1) (= (let ((.cse1 ((as const (Array Int Real)) 0.0))) (store (store (store |v_#memory_real_34| |v_~#a~0.base_15| .cse1) |v_~#b~0.base_4| .cse1) |v_~#x~0.base_4| .cse1)) |v_#memory_real_31|) (= 20000 (select |v_#length_5| 4)) (= 400 (select |v_#length_5| 5)) (= (select .cse0 0) 48) (= 1 (select |v_#valid_11| 1)) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_11| 0) 0) (= (select |v_#valid_11| 4) 1) (= 400 (select |v_#length_5| 6)) (= |v_~#x~0.base_4| 6))) InVars {#memory_int=|v_#memory_int_21|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #memory_real=|v_#memory_real_34|, #valid=|v_#valid_11|} OutVars{~#x~0.offset=|v_~#x~0.offset_4|, ~#a~0.base=|v_~#a~0.base_15|, #NULL.offset=|v_#NULL.offset_1|, #memory_real=|v_#memory_real_31|, ~#b~0.base=|v_~#b~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_11|, ~#b~0.offset=|v_~#b~0.offset_4|, ~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_21|, #length=|v_#length_5|, ~#a~0.offset=|v_~#a~0.offset_15|} AuxVars[] AssignedVars[~#x~0.offset, ~#b~0.offset, ~#x~0.base, ~#a~0.base, #NULL.offset, ~#a~0.offset, #memory_real, ~#b~0.base, #NULL.base] {680#true} is VALID [2022-04-27 21:05:39,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {680#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 21:05:39,625 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {680#true} {680#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 21:05:39,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 21:05:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:39,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {680#true} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {680#true} is VALID [2022-04-27 21:05:39,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {680#true} [247] L6-->L6-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 21:05:39,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {680#true} [253] L6-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 21:05:39,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {680#true} {685#(= main_~i~0 0)} [306] __VERIFIER_assertEXIT-->L102: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {685#(= main_~i~0 0)} is VALID [2022-04-27 21:05:39,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {680#true} [217] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {693#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:05:39,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {693#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [219] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_21| 1))) (and (= |v_~#a~0.offset_15| 0) (= 5 |v_~#b~0.base_4|) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_11| 5) 1) (= (select .cse0 1) 0) (= |v_~#a~0.base_15| 4) (= |v_#NULL.base_1| 0) (= (select |v_#valid_11| 3) 1) (= |v_~#x~0.offset_4| 0) (= (select |v_#valid_11| 6) 1) (= 9 (select |v_#length_5| 2)) (= |v_~#b~0.offset_4| 0) (= (select |v_#length_5| 3) 12) (= (select |v_#valid_11| 2) 1) (= (let ((.cse1 ((as const (Array Int Real)) 0.0))) (store (store (store |v_#memory_real_34| |v_~#a~0.base_15| .cse1) |v_~#b~0.base_4| .cse1) |v_~#x~0.base_4| .cse1)) |v_#memory_real_31|) (= 20000 (select |v_#length_5| 4)) (= 400 (select |v_#length_5| 5)) (= (select .cse0 0) 48) (= 1 (select |v_#valid_11| 1)) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_11| 0) 0) (= (select |v_#valid_11| 4) 1) (= 400 (select |v_#length_5| 6)) (= |v_~#x~0.base_4| 6))) InVars {#memory_int=|v_#memory_int_21|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #memory_real=|v_#memory_real_34|, #valid=|v_#valid_11|} OutVars{~#x~0.offset=|v_~#x~0.offset_4|, ~#a~0.base=|v_~#a~0.base_15|, #NULL.offset=|v_#NULL.offset_1|, #memory_real=|v_#memory_real_31|, ~#b~0.base=|v_~#b~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_11|, ~#b~0.offset=|v_~#b~0.offset_4|, ~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_21|, #length=|v_#length_5|, ~#a~0.offset=|v_~#a~0.offset_15|} AuxVars[] AssignedVars[~#x~0.offset, ~#b~0.offset, ~#x~0.base, ~#a~0.base, #NULL.offset, ~#a~0.offset, #memory_real, ~#b~0.base, #NULL.base] {680#true} is VALID [2022-04-27 21:05:39,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {680#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 21:05:39,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {680#true} {680#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 21:05:39,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {680#true} [218] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 21:05:39,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {680#true} [221] mainENTRY-->L93-3: Formula: (and (= v_main_~i~0_8 0) (= v_main_~nmax~0_1 50) (= v_main_~n~0_4 5) (= v_main_~eps~0_1 (/ 1.0 1000000.0))) InVars {} OutVars{main_~chkerr~0=v_main_~chkerr~0_1, main_~w~0=v_main_~w~0_4, main_~eps~0=v_main_~eps~0_1, main_~j~0=v_main_~j~0_9, main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~nmax~0=v_main_~nmax~0_1} AuxVars[] AssignedVars[main_~chkerr~0, main_~w~0, main_~eps~0, main_~j~0, main_~i~0, main_~n~0, main_~nmax~0] {685#(= main_~i~0 0)} is VALID [2022-04-27 21:05:39,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {685#(= main_~i~0 0)} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {685#(= main_~i~0 0)} is VALID [2022-04-27 21:05:39,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {685#(= main_~i~0 0)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {685#(= main_~i~0 0)} is VALID [2022-04-27 21:05:39,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {685#(= main_~i~0 0)} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {685#(= main_~i~0 0)} is VALID [2022-04-27 21:05:39,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {685#(= main_~i~0 0)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {685#(= main_~i~0 0)} is VALID [2022-04-27 21:05:39,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {685#(= main_~i~0 0)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {685#(= main_~i~0 0)} is VALID [2022-04-27 21:05:39,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {685#(= main_~i~0 0)} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {685#(= main_~i~0 0)} is VALID [2022-04-27 21:05:39,634 INFO L272 TraceCheckUtils]: 12: Hoare triple {685#(= main_~i~0 0)} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {680#true} is VALID [2022-04-27 21:05:39,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {680#true} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {680#true} is VALID [2022-04-27 21:05:39,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {680#true} [247] L6-->L6-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 21:05:39,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {680#true} [253] L6-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 21:05:39,635 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {680#true} {685#(= main_~i~0 0)} [306] __VERIFIER_assertEXIT-->L102: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {685#(= main_~i~0 0)} is VALID [2022-04-27 21:05:39,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {685#(= main_~i~0 0)} [238] L102-->L93-2: Formula: (let ((.cse0 (+ |v_~#b~0.offset_3| (* v_main_~i~0_7 8)))) (and (= (store |v_#memory_real_28| |v_~#b~0.base_3| (store (select |v_#memory_real_28| |v_~#b~0.base_3|) .cse0 v_main_~w~0_3)) |v_#memory_real_27|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_~#b~0.base_3| (store (select |v_#memory_int_18| |v_~#b~0.base_3|) .cse0 (select (select |v_#memory_int_17| |v_~#b~0.base_3|) .cse0)))))) InVars {main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_18|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_28|, ~#b~0.base=|v_~#b~0.base_3|} OutVars{main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_17|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_27|, ~#b~0.base=|v_~#b~0.base_3|} AuxVars[] AssignedVars[#memory_int, #memory_real] {685#(= main_~i~0 0)} is VALID [2022-04-27 21:05:39,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {685#(= main_~i~0 0)} [245] L93-2-->L93-3: Formula: (= v_main_~i~0_11 (+ v_main_~i~0_12 1)) InVars {main_~i~0=v_main_~i~0_12} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_11} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {690#(<= main_~i~0 1)} is VALID [2022-04-27 21:05:39,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {690#(<= main_~i~0 1)} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {690#(<= main_~i~0 1)} is VALID [2022-04-27 21:05:39,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {690#(<= main_~i~0 1)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {690#(<= main_~i~0 1)} is VALID [2022-04-27 21:05:39,637 INFO L290 TraceCheckUtils]: 21: Hoare triple {690#(<= main_~i~0 1)} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {690#(<= main_~i~0 1)} is VALID [2022-04-27 21:05:39,637 INFO L290 TraceCheckUtils]: 22: Hoare triple {690#(<= main_~i~0 1)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {690#(<= main_~i~0 1)} is VALID [2022-04-27 21:05:39,637 INFO L290 TraceCheckUtils]: 23: Hoare triple {690#(<= main_~i~0 1)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {690#(<= main_~i~0 1)} is VALID [2022-04-27 21:05:39,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {690#(<= main_~i~0 1)} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {690#(<= main_~i~0 1)} is VALID [2022-04-27 21:05:39,638 INFO L272 TraceCheckUtils]: 25: Hoare triple {690#(<= main_~i~0 1)} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {691#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:05:39,639 INFO L290 TraceCheckUtils]: 26: Hoare triple {691#(not (= |__VERIFIER_assert_#in~cond| 0))} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {692#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:05:39,639 INFO L290 TraceCheckUtils]: 27: Hoare triple {692#(not (= __VERIFIER_assert_~cond 0))} [246] L6-->L7: Formula: (= 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[] {681#false} is VALID [2022-04-27 21:05:39,639 INFO L290 TraceCheckUtils]: 28: Hoare triple {681#false} [251] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {681#false} is VALID [2022-04-27 21:05:39,640 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 21:05:39,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:05:39,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877287285] [2022-04-27 21:05:39,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877287285] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:05:39,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73457012] [2022-04-27 21:05:39,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:39,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:05:39,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:05:39,642 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-27 21:05:39,676 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-27 21:05:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:39,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 21:05:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:39,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:05:39,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {680#true} [217] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 21:05:39,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {680#true} [219] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_21| 1))) (and (= |v_~#a~0.offset_15| 0) (= 5 |v_~#b~0.base_4|) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_11| 5) 1) (= (select .cse0 1) 0) (= |v_~#a~0.base_15| 4) (= |v_#NULL.base_1| 0) (= (select |v_#valid_11| 3) 1) (= |v_~#x~0.offset_4| 0) (= (select |v_#valid_11| 6) 1) (= 9 (select |v_#length_5| 2)) (= |v_~#b~0.offset_4| 0) (= (select |v_#length_5| 3) 12) (= (select |v_#valid_11| 2) 1) (= (let ((.cse1 ((as const (Array Int Real)) 0.0))) (store (store (store |v_#memory_real_34| |v_~#a~0.base_15| .cse1) |v_~#b~0.base_4| .cse1) |v_~#x~0.base_4| .cse1)) |v_#memory_real_31|) (= 20000 (select |v_#length_5| 4)) (= 400 (select |v_#length_5| 5)) (= (select .cse0 0) 48) (= 1 (select |v_#valid_11| 1)) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_11| 0) 0) (= (select |v_#valid_11| 4) 1) (= 400 (select |v_#length_5| 6)) (= |v_~#x~0.base_4| 6))) InVars {#memory_int=|v_#memory_int_21|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #memory_real=|v_#memory_real_34|, #valid=|v_#valid_11|} OutVars{~#x~0.offset=|v_~#x~0.offset_4|, ~#a~0.base=|v_~#a~0.base_15|, #NULL.offset=|v_#NULL.offset_1|, #memory_real=|v_#memory_real_31|, ~#b~0.base=|v_~#b~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_11|, ~#b~0.offset=|v_~#b~0.offset_4|, ~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_21|, #length=|v_#length_5|, ~#a~0.offset=|v_~#a~0.offset_15|} AuxVars[] AssignedVars[~#x~0.offset, ~#b~0.offset, ~#x~0.base, ~#a~0.base, #NULL.offset, ~#a~0.offset, #memory_real, ~#b~0.base, #NULL.base] {680#true} is VALID [2022-04-27 21:05:39,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {680#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 21:05:39,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {680#true} {680#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 21:05:39,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {680#true} [218] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 21:05:39,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {680#true} [221] mainENTRY-->L93-3: Formula: (and (= v_main_~i~0_8 0) (= v_main_~nmax~0_1 50) (= v_main_~n~0_4 5) (= v_main_~eps~0_1 (/ 1.0 1000000.0))) InVars {} OutVars{main_~chkerr~0=v_main_~chkerr~0_1, main_~w~0=v_main_~w~0_4, main_~eps~0=v_main_~eps~0_1, main_~j~0=v_main_~j~0_9, main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~nmax~0=v_main_~nmax~0_1} AuxVars[] AssignedVars[main_~chkerr~0, main_~w~0, main_~eps~0, main_~j~0, main_~i~0, main_~n~0, main_~nmax~0] {712#(<= 5 main_~n~0)} is VALID [2022-04-27 21:05:39,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {712#(<= 5 main_~n~0)} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {716#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 21:05:39,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {716#(and (<= 5 main_~n~0) (<= main_~j~0 0))} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {716#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 21:05:39,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {716#(and (<= 5 main_~n~0) (<= main_~j~0 0))} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {716#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 21:05:39,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {716#(and (<= 5 main_~n~0) (<= main_~j~0 0))} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {716#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 21:05:39,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {716#(and (<= 5 main_~n~0) (<= main_~j~0 0))} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {729#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-27 21:05:39,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {729#(and (<= 5 main_~n~0) (<= main_~j~0 1))} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {681#false} is VALID [2022-04-27 21:05:39,898 INFO L272 TraceCheckUtils]: 12: Hoare triple {681#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {681#false} is VALID [2022-04-27 21:05:39,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {681#false} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {681#false} is VALID [2022-04-27 21:05:39,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {681#false} [247] L6-->L6-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {681#false} is VALID [2022-04-27 21:05:39,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {681#false} [253] L6-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {681#false} is VALID [2022-04-27 21:05:39,898 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {681#false} {681#false} [306] __VERIFIER_assertEXIT-->L102: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {681#false} is VALID [2022-04-27 21:05:39,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {681#false} [238] L102-->L93-2: Formula: (let ((.cse0 (+ |v_~#b~0.offset_3| (* v_main_~i~0_7 8)))) (and (= (store |v_#memory_real_28| |v_~#b~0.base_3| (store (select |v_#memory_real_28| |v_~#b~0.base_3|) .cse0 v_main_~w~0_3)) |v_#memory_real_27|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_~#b~0.base_3| (store (select |v_#memory_int_18| |v_~#b~0.base_3|) .cse0 (select (select |v_#memory_int_17| |v_~#b~0.base_3|) .cse0)))))) InVars {main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_18|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_28|, ~#b~0.base=|v_~#b~0.base_3|} OutVars{main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_17|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_27|, ~#b~0.base=|v_~#b~0.base_3|} AuxVars[] AssignedVars[#memory_int, #memory_real] {681#false} is VALID [2022-04-27 21:05:39,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {681#false} [245] L93-2-->L93-3: Formula: (= v_main_~i~0_11 (+ v_main_~i~0_12 1)) InVars {main_~i~0=v_main_~i~0_12} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_11} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {681#false} is VALID [2022-04-27 21:05:39,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {681#false} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {681#false} is VALID [2022-04-27 21:05:39,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {681#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {681#false} is VALID [2022-04-27 21:05:39,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {681#false} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {681#false} is VALID [2022-04-27 21:05:39,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {681#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {681#false} is VALID [2022-04-27 21:05:39,899 INFO L290 TraceCheckUtils]: 23: Hoare triple {681#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {681#false} is VALID [2022-04-27 21:05:39,899 INFO L290 TraceCheckUtils]: 24: Hoare triple {681#false} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {681#false} is VALID [2022-04-27 21:05:39,899 INFO L272 TraceCheckUtils]: 25: Hoare triple {681#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {681#false} is VALID [2022-04-27 21:05:39,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {681#false} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {681#false} is VALID [2022-04-27 21:05:39,900 INFO L290 TraceCheckUtils]: 27: Hoare triple {681#false} [246] L6-->L7: Formula: (= 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[] {681#false} is VALID [2022-04-27 21:05:39,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {681#false} [251] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {681#false} is VALID [2022-04-27 21:05:39,900 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 21:05:39,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:05:40,072 INFO L290 TraceCheckUtils]: 28: Hoare triple {681#false} [251] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {681#false} is VALID [2022-04-27 21:05:40,072 INFO L290 TraceCheckUtils]: 27: Hoare triple {681#false} [246] L6-->L7: Formula: (= 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[] {681#false} is VALID [2022-04-27 21:05:40,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {681#false} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {681#false} is VALID [2022-04-27 21:05:40,073 INFO L272 TraceCheckUtils]: 25: Hoare triple {681#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {681#false} is VALID [2022-04-27 21:05:40,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {681#false} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {681#false} is VALID [2022-04-27 21:05:40,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {681#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {681#false} is VALID [2022-04-27 21:05:40,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {681#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {681#false} is VALID [2022-04-27 21:05:40,073 INFO L290 TraceCheckUtils]: 21: Hoare triple {681#false} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {681#false} is VALID [2022-04-27 21:05:40,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {681#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {681#false} is VALID [2022-04-27 21:05:40,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {681#false} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {681#false} is VALID [2022-04-27 21:05:40,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {681#false} [245] L93-2-->L93-3: Formula: (= v_main_~i~0_11 (+ v_main_~i~0_12 1)) InVars {main_~i~0=v_main_~i~0_12} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_11} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {681#false} is VALID [2022-04-27 21:05:40,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {681#false} [238] L102-->L93-2: Formula: (let ((.cse0 (+ |v_~#b~0.offset_3| (* v_main_~i~0_7 8)))) (and (= (store |v_#memory_real_28| |v_~#b~0.base_3| (store (select |v_#memory_real_28| |v_~#b~0.base_3|) .cse0 v_main_~w~0_3)) |v_#memory_real_27|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_~#b~0.base_3| (store (select |v_#memory_int_18| |v_~#b~0.base_3|) .cse0 (select (select |v_#memory_int_17| |v_~#b~0.base_3|) .cse0)))))) InVars {main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_18|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_28|, ~#b~0.base=|v_~#b~0.base_3|} OutVars{main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_17|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_27|, ~#b~0.base=|v_~#b~0.base_3|} AuxVars[] AssignedVars[#memory_int, #memory_real] {681#false} is VALID [2022-04-27 21:05:40,074 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {680#true} {681#false} [306] __VERIFIER_assertEXIT-->L102: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {681#false} is VALID [2022-04-27 21:05:40,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {680#true} [253] L6-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 21:05:40,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {680#true} [247] L6-->L6-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 21:05:40,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {680#true} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {680#true} is VALID [2022-04-27 21:05:40,074 INFO L272 TraceCheckUtils]: 12: Hoare triple {681#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {680#true} is VALID [2022-04-27 21:05:40,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {835#(<= main_~j~0 main_~n~0)} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {681#false} is VALID [2022-04-27 21:05:40,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {839#(<= (+ main_~j~0 1) main_~n~0)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {835#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 21:05:40,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {839#(<= (+ main_~j~0 1) main_~n~0)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {839#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 21:05:40,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {839#(<= (+ main_~j~0 1) main_~n~0)} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {839#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 21:05:40,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {839#(<= (+ main_~j~0 1) main_~n~0)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {839#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 21:05:40,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {852#(<= 1 main_~n~0)} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {839#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 21:05:40,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {680#true} [221] mainENTRY-->L93-3: Formula: (and (= v_main_~i~0_8 0) (= v_main_~nmax~0_1 50) (= v_main_~n~0_4 5) (= v_main_~eps~0_1 (/ 1.0 1000000.0))) InVars {} OutVars{main_~chkerr~0=v_main_~chkerr~0_1, main_~w~0=v_main_~w~0_4, main_~eps~0=v_main_~eps~0_1, main_~j~0=v_main_~j~0_9, main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~nmax~0=v_main_~nmax~0_1} AuxVars[] AssignedVars[main_~chkerr~0, main_~w~0, main_~eps~0, main_~j~0, main_~i~0, main_~n~0, main_~nmax~0] {852#(<= 1 main_~n~0)} is VALID [2022-04-27 21:05:40,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {680#true} [218] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 21:05:40,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {680#true} {680#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 21:05:40,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {680#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 21:05:40,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {680#true} [219] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_21| 1))) (and (= |v_~#a~0.offset_15| 0) (= 5 |v_~#b~0.base_4|) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_11| 5) 1) (= (select .cse0 1) 0) (= |v_~#a~0.base_15| 4) (= |v_#NULL.base_1| 0) (= (select |v_#valid_11| 3) 1) (= |v_~#x~0.offset_4| 0) (= (select |v_#valid_11| 6) 1) (= 9 (select |v_#length_5| 2)) (= |v_~#b~0.offset_4| 0) (= (select |v_#length_5| 3) 12) (= (select |v_#valid_11| 2) 1) (= (let ((.cse1 ((as const (Array Int Real)) 0.0))) (store (store (store |v_#memory_real_34| |v_~#a~0.base_15| .cse1) |v_~#b~0.base_4| .cse1) |v_~#x~0.base_4| .cse1)) |v_#memory_real_31|) (= 20000 (select |v_#length_5| 4)) (= 400 (select |v_#length_5| 5)) (= (select .cse0 0) 48) (= 1 (select |v_#valid_11| 1)) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_11| 0) 0) (= (select |v_#valid_11| 4) 1) (= 400 (select |v_#length_5| 6)) (= |v_~#x~0.base_4| 6))) InVars {#memory_int=|v_#memory_int_21|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #memory_real=|v_#memory_real_34|, #valid=|v_#valid_11|} OutVars{~#x~0.offset=|v_~#x~0.offset_4|, ~#a~0.base=|v_~#a~0.base_15|, #NULL.offset=|v_#NULL.offset_1|, #memory_real=|v_#memory_real_31|, ~#b~0.base=|v_~#b~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_11|, ~#b~0.offset=|v_~#b~0.offset_4|, ~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_21|, #length=|v_#length_5|, ~#a~0.offset=|v_~#a~0.offset_15|} AuxVars[] AssignedVars[~#x~0.offset, ~#b~0.offset, ~#x~0.base, ~#a~0.base, #NULL.offset, ~#a~0.offset, #memory_real, ~#b~0.base, #NULL.base] {680#true} is VALID [2022-04-27 21:05:40,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {680#true} [217] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 21:05:40,078 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 21:05:40,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73457012] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:05:40,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:05:40,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2022-04-27 21:05:40,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789087351] [2022-04-27 21:05:40,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:05:40,081 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-04-27 21:05:40,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:05:40,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 21:05:40,120 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-27 21:05:40,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 21:05:40,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:05:40,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 21:05:40,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-04-27 21:05:40,124 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 21:05:40,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:40,689 INFO L93 Difference]: Finished difference Result 103 states and 130 transitions. [2022-04-27 21:05:40,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-27 21:05:40,689 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-04-27 21:05:40,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:05:40,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 21:05:40,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 121 transitions. [2022-04-27 21:05:40,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 21:05:40,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 121 transitions. [2022-04-27 21:05:40,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 121 transitions. [2022-04-27 21:05:40,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:05:40,779 INFO L225 Difference]: With dead ends: 103 [2022-04-27 21:05:40,779 INFO L226 Difference]: Without dead ends: 83 [2022-04-27 21:05:40,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=223, Invalid=647, Unknown=0, NotChecked=0, Total=870 [2022-04-27 21:05:40,780 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 136 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:05:40,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 48 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:05:40,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-27 21:05:40,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2022-04-27 21:05:40,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:05:40,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 81 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 21:05:40,808 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 81 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 21:05:40,808 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 81 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 21:05:40,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:40,810 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2022-04-27 21:05:40,810 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2022-04-27 21:05:40,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:40,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:40,811 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 83 states. [2022-04-27 21:05:40,811 INFO L87 Difference]: Start difference. First operand has 81 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 83 states. [2022-04-27 21:05:40,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:40,813 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2022-04-27 21:05:40,813 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2022-04-27 21:05:40,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:40,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:40,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:05:40,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:05:40,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 21:05:40,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2022-04-27 21:05:40,816 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 29 [2022-04-27 21:05:40,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:05:40,816 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2022-04-27 21:05:40,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 21:05:40,816 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2022-04-27 21:05:40,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-27 21:05:40,817 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:05:40,817 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:05:40,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 21:05:41,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:05:41,033 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:05:41,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:05:41,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1801298995, now seen corresponding path program 1 times [2022-04-27 21:05:41,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:05:41,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930938171] [2022-04-27 21:05:41,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:41,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:05:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:41,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:05:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:41,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {1339#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [219] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_21| 1))) (and (= |v_~#a~0.offset_15| 0) (= 5 |v_~#b~0.base_4|) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_11| 5) 1) (= (select .cse0 1) 0) (= |v_~#a~0.base_15| 4) (= |v_#NULL.base_1| 0) (= (select |v_#valid_11| 3) 1) (= |v_~#x~0.offset_4| 0) (= (select |v_#valid_11| 6) 1) (= 9 (select |v_#length_5| 2)) (= |v_~#b~0.offset_4| 0) (= (select |v_#length_5| 3) 12) (= (select |v_#valid_11| 2) 1) (= (let ((.cse1 ((as const (Array Int Real)) 0.0))) (store (store (store |v_#memory_real_34| |v_~#a~0.base_15| .cse1) |v_~#b~0.base_4| .cse1) |v_~#x~0.base_4| .cse1)) |v_#memory_real_31|) (= 20000 (select |v_#length_5| 4)) (= 400 (select |v_#length_5| 5)) (= (select .cse0 0) 48) (= 1 (select |v_#valid_11| 1)) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_11| 0) 0) (= (select |v_#valid_11| 4) 1) (= 400 (select |v_#length_5| 6)) (= |v_~#x~0.base_4| 6))) InVars {#memory_int=|v_#memory_int_21|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #memory_real=|v_#memory_real_34|, #valid=|v_#valid_11|} OutVars{~#x~0.offset=|v_~#x~0.offset_4|, ~#a~0.base=|v_~#a~0.base_15|, #NULL.offset=|v_#NULL.offset_1|, #memory_real=|v_#memory_real_31|, ~#b~0.base=|v_~#b~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_11|, ~#b~0.offset=|v_~#b~0.offset_4|, ~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_21|, #length=|v_#length_5|, ~#a~0.offset=|v_~#a~0.offset_15|} AuxVars[] AssignedVars[~#x~0.offset, ~#b~0.offset, ~#x~0.base, ~#a~0.base, #NULL.offset, ~#a~0.offset, #memory_real, ~#b~0.base, #NULL.base] {1321#true} is VALID [2022-04-27 21:05:41,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {1321#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1321#true} is VALID [2022-04-27 21:05:41,237 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1321#true} {1321#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1321#true} is VALID [2022-04-27 21:05:41,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-27 21:05:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:41,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {1321#true} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1321#true} is VALID [2022-04-27 21:05:41,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {1321#true} [247] L6-->L6-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1321#true} is VALID [2022-04-27 21:05:41,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {1321#true} [253] L6-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1321#true} is VALID [2022-04-27 21:05:41,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1321#true} {1326#(= (+ main_~n~0 (- 5)) 0)} [306] __VERIFIER_assertEXIT-->L102: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-27 21:05:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:41,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {1321#true} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1321#true} is VALID [2022-04-27 21:05:41,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {1321#true} [247] L6-->L6-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1321#true} is VALID [2022-04-27 21:05:41,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {1321#true} [253] L6-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1321#true} is VALID [2022-04-27 21:05:41,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1321#true} {1326#(= (+ main_~n~0 (- 5)) 0)} [306] __VERIFIER_assertEXIT-->L102: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {1321#true} [217] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1339#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:05:41,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {1339#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [219] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_21| 1))) (and (= |v_~#a~0.offset_15| 0) (= 5 |v_~#b~0.base_4|) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_11| 5) 1) (= (select .cse0 1) 0) (= |v_~#a~0.base_15| 4) (= |v_#NULL.base_1| 0) (= (select |v_#valid_11| 3) 1) (= |v_~#x~0.offset_4| 0) (= (select |v_#valid_11| 6) 1) (= 9 (select |v_#length_5| 2)) (= |v_~#b~0.offset_4| 0) (= (select |v_#length_5| 3) 12) (= (select |v_#valid_11| 2) 1) (= (let ((.cse1 ((as const (Array Int Real)) 0.0))) (store (store (store |v_#memory_real_34| |v_~#a~0.base_15| .cse1) |v_~#b~0.base_4| .cse1) |v_~#x~0.base_4| .cse1)) |v_#memory_real_31|) (= 20000 (select |v_#length_5| 4)) (= 400 (select |v_#length_5| 5)) (= (select .cse0 0) 48) (= 1 (select |v_#valid_11| 1)) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_11| 0) 0) (= (select |v_#valid_11| 4) 1) (= 400 (select |v_#length_5| 6)) (= |v_~#x~0.base_4| 6))) InVars {#memory_int=|v_#memory_int_21|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #memory_real=|v_#memory_real_34|, #valid=|v_#valid_11|} OutVars{~#x~0.offset=|v_~#x~0.offset_4|, ~#a~0.base=|v_~#a~0.base_15|, #NULL.offset=|v_#NULL.offset_1|, #memory_real=|v_#memory_real_31|, ~#b~0.base=|v_~#b~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_11|, ~#b~0.offset=|v_~#b~0.offset_4|, ~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_21|, #length=|v_#length_5|, ~#a~0.offset=|v_~#a~0.offset_15|} AuxVars[] AssignedVars[~#x~0.offset, ~#b~0.offset, ~#x~0.base, ~#a~0.base, #NULL.offset, ~#a~0.offset, #memory_real, ~#b~0.base, #NULL.base] {1321#true} is VALID [2022-04-27 21:05:41,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {1321#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1321#true} is VALID [2022-04-27 21:05:41,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1321#true} {1321#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1321#true} is VALID [2022-04-27 21:05:41,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {1321#true} [218] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1321#true} is VALID [2022-04-27 21:05:41,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {1321#true} [221] mainENTRY-->L93-3: Formula: (and (= v_main_~i~0_8 0) (= v_main_~nmax~0_1 50) (= v_main_~n~0_4 5) (= v_main_~eps~0_1 (/ 1.0 1000000.0))) InVars {} OutVars{main_~chkerr~0=v_main_~chkerr~0_1, main_~w~0=v_main_~w~0_4, main_~eps~0=v_main_~eps~0_1, main_~j~0=v_main_~j~0_9, main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~nmax~0=v_main_~nmax~0_1} AuxVars[] AssignedVars[main_~chkerr~0, main_~w~0, main_~eps~0, main_~j~0, main_~i~0, main_~n~0, main_~nmax~0] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,251 INFO L290 TraceCheckUtils]: 17: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,253 INFO L272 TraceCheckUtils]: 24: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1321#true} is VALID [2022-04-27 21:05:41,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {1321#true} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1321#true} is VALID [2022-04-27 21:05:41,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {1321#true} [247] L6-->L6-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1321#true} is VALID [2022-04-27 21:05:41,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {1321#true} [253] L6-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1321#true} is VALID [2022-04-27 21:05:41,254 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1321#true} {1326#(= (+ main_~n~0 (- 5)) 0)} [306] __VERIFIER_assertEXIT-->L102: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [238] L102-->L93-2: Formula: (let ((.cse0 (+ |v_~#b~0.offset_3| (* v_main_~i~0_7 8)))) (and (= (store |v_#memory_real_28| |v_~#b~0.base_3| (store (select |v_#memory_real_28| |v_~#b~0.base_3|) .cse0 v_main_~w~0_3)) |v_#memory_real_27|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_~#b~0.base_3| (store (select |v_#memory_int_18| |v_~#b~0.base_3|) .cse0 (select (select |v_#memory_int_17| |v_~#b~0.base_3|) .cse0)))))) InVars {main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_18|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_28|, ~#b~0.base=|v_~#b~0.base_3|} OutVars{main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_17|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_27|, ~#b~0.base=|v_~#b~0.base_3|} AuxVars[] AssignedVars[#memory_int, #memory_real] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [245] L93-2-->L93-3: Formula: (= v_main_~i~0_11 (+ v_main_~i~0_12 1)) InVars {main_~i~0=v_main_~i~0_12} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_11} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,255 INFO L290 TraceCheckUtils]: 31: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,255 INFO L290 TraceCheckUtils]: 32: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,256 INFO L290 TraceCheckUtils]: 33: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,256 INFO L290 TraceCheckUtils]: 34: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,256 INFO L290 TraceCheckUtils]: 35: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,257 INFO L290 TraceCheckUtils]: 36: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,257 INFO L290 TraceCheckUtils]: 37: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,258 INFO L290 TraceCheckUtils]: 38: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,258 INFO L290 TraceCheckUtils]: 39: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,258 INFO L290 TraceCheckUtils]: 40: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,259 INFO L290 TraceCheckUtils]: 41: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,259 INFO L290 TraceCheckUtils]: 42: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,259 INFO L290 TraceCheckUtils]: 43: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,260 INFO L290 TraceCheckUtils]: 44: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,260 INFO L290 TraceCheckUtils]: 45: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,260 INFO L290 TraceCheckUtils]: 46: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,261 INFO L290 TraceCheckUtils]: 47: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,261 INFO L290 TraceCheckUtils]: 48: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,261 INFO L272 TraceCheckUtils]: 49: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1321#true} is VALID [2022-04-27 21:05:41,261 INFO L290 TraceCheckUtils]: 50: Hoare triple {1321#true} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1321#true} is VALID [2022-04-27 21:05:41,261 INFO L290 TraceCheckUtils]: 51: Hoare triple {1321#true} [247] L6-->L6-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1321#true} is VALID [2022-04-27 21:05:41,262 INFO L290 TraceCheckUtils]: 52: Hoare triple {1321#true} [253] L6-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1321#true} is VALID [2022-04-27 21:05:41,262 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {1321#true} {1326#(= (+ main_~n~0 (- 5)) 0)} [306] __VERIFIER_assertEXIT-->L102: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,262 INFO L290 TraceCheckUtils]: 54: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [238] L102-->L93-2: Formula: (let ((.cse0 (+ |v_~#b~0.offset_3| (* v_main_~i~0_7 8)))) (and (= (store |v_#memory_real_28| |v_~#b~0.base_3| (store (select |v_#memory_real_28| |v_~#b~0.base_3|) .cse0 v_main_~w~0_3)) |v_#memory_real_27|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_~#b~0.base_3| (store (select |v_#memory_int_18| |v_~#b~0.base_3|) .cse0 (select (select |v_#memory_int_17| |v_~#b~0.base_3|) .cse0)))))) InVars {main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_18|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_28|, ~#b~0.base=|v_~#b~0.base_3|} OutVars{main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_17|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_27|, ~#b~0.base=|v_~#b~0.base_3|} AuxVars[] AssignedVars[#memory_int, #memory_real] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,263 INFO L290 TraceCheckUtils]: 55: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [245] L93-2-->L93-3: Formula: (= v_main_~i~0_11 (+ v_main_~i~0_12 1)) InVars {main_~i~0=v_main_~i~0_12} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_11} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 21:05:41,263 INFO L290 TraceCheckUtils]: 56: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 21:05:41,264 INFO L290 TraceCheckUtils]: 57: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 21:05:41,264 INFO L290 TraceCheckUtils]: 58: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 21:05:41,264 INFO L290 TraceCheckUtils]: 59: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 21:05:41,265 INFO L290 TraceCheckUtils]: 60: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 21:05:41,265 INFO L290 TraceCheckUtils]: 61: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 21:05:41,265 INFO L290 TraceCheckUtils]: 62: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 21:05:41,266 INFO L290 TraceCheckUtils]: 63: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 21:05:41,266 INFO L290 TraceCheckUtils]: 64: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 21:05:41,267 INFO L290 TraceCheckUtils]: 65: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 21:05:41,267 INFO L290 TraceCheckUtils]: 66: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 21:05:41,267 INFO L290 TraceCheckUtils]: 67: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 21:05:41,268 INFO L290 TraceCheckUtils]: 68: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 21:05:41,268 INFO L290 TraceCheckUtils]: 69: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 21:05:41,269 INFO L290 TraceCheckUtils]: 70: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 21:05:41,269 INFO L290 TraceCheckUtils]: 71: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 21:05:41,269 INFO L290 TraceCheckUtils]: 72: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 21:05:41,270 INFO L290 TraceCheckUtils]: 73: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {1336#(<= main_~i~0 5)} is VALID [2022-04-27 21:05:41,270 INFO L272 TraceCheckUtils]: 74: Hoare triple {1336#(<= main_~i~0 5)} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1337#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:05:41,271 INFO L290 TraceCheckUtils]: 75: Hoare triple {1337#(not (= |__VERIFIER_assert_#in~cond| 0))} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1338#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:05:41,271 INFO L290 TraceCheckUtils]: 76: Hoare triple {1338#(not (= __VERIFIER_assert_~cond 0))} [246] L6-->L7: Formula: (= 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[] {1322#false} is VALID [2022-04-27 21:05:41,271 INFO L290 TraceCheckUtils]: 77: Hoare triple {1322#false} [251] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1322#false} is VALID [2022-04-27 21:05:41,272 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 150 proven. 2 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2022-04-27 21:05:41,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:05:41,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930938171] [2022-04-27 21:05:41,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930938171] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:05:41,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513575593] [2022-04-27 21:05:41,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:41,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:05:41,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:05:41,288 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:05:41,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 21:05:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:41,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 21:05:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:41,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:05:41,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {1321#true} [217] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1321#true} is VALID [2022-04-27 21:05:41,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {1321#true} [219] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_21| 1))) (and (= |v_~#a~0.offset_15| 0) (= 5 |v_~#b~0.base_4|) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_11| 5) 1) (= (select .cse0 1) 0) (= |v_~#a~0.base_15| 4) (= |v_#NULL.base_1| 0) (= (select |v_#valid_11| 3) 1) (= |v_~#x~0.offset_4| 0) (= (select |v_#valid_11| 6) 1) (= 9 (select |v_#length_5| 2)) (= |v_~#b~0.offset_4| 0) (= (select |v_#length_5| 3) 12) (= (select |v_#valid_11| 2) 1) (= (let ((.cse1 ((as const (Array Int Real)) 0.0))) (store (store (store |v_#memory_real_34| |v_~#a~0.base_15| .cse1) |v_~#b~0.base_4| .cse1) |v_~#x~0.base_4| .cse1)) |v_#memory_real_31|) (= 20000 (select |v_#length_5| 4)) (= 400 (select |v_#length_5| 5)) (= (select .cse0 0) 48) (= 1 (select |v_#valid_11| 1)) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_11| 0) 0) (= (select |v_#valid_11| 4) 1) (= 400 (select |v_#length_5| 6)) (= |v_~#x~0.base_4| 6))) InVars {#memory_int=|v_#memory_int_21|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #memory_real=|v_#memory_real_34|, #valid=|v_#valid_11|} OutVars{~#x~0.offset=|v_~#x~0.offset_4|, ~#a~0.base=|v_~#a~0.base_15|, #NULL.offset=|v_#NULL.offset_1|, #memory_real=|v_#memory_real_31|, ~#b~0.base=|v_~#b~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_11|, ~#b~0.offset=|v_~#b~0.offset_4|, ~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_21|, #length=|v_#length_5|, ~#a~0.offset=|v_~#a~0.offset_15|} AuxVars[] AssignedVars[~#x~0.offset, ~#b~0.offset, ~#x~0.base, ~#a~0.base, #NULL.offset, ~#a~0.offset, #memory_real, ~#b~0.base, #NULL.base] {1321#true} is VALID [2022-04-27 21:05:41,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {1321#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1321#true} is VALID [2022-04-27 21:05:41,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1321#true} {1321#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1321#true} is VALID [2022-04-27 21:05:41,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {1321#true} [218] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1321#true} is VALID [2022-04-27 21:05:41,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {1321#true} [221] mainENTRY-->L93-3: Formula: (and (= v_main_~i~0_8 0) (= v_main_~nmax~0_1 50) (= v_main_~n~0_4 5) (= v_main_~eps~0_1 (/ 1.0 1000000.0))) InVars {} OutVars{main_~chkerr~0=v_main_~chkerr~0_1, main_~w~0=v_main_~w~0_4, main_~eps~0=v_main_~eps~0_1, main_~j~0=v_main_~j~0_9, main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~nmax~0=v_main_~nmax~0_1} AuxVars[] AssignedVars[main_~chkerr~0, main_~w~0, main_~eps~0, main_~j~0, main_~i~0, main_~n~0, main_~nmax~0] {1358#(<= 5 main_~n~0)} is VALID [2022-04-27 21:05:41,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {1358#(<= 5 main_~n~0)} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {1362#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 21:05:41,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {1362#(and (<= 5 main_~n~0) (<= main_~j~0 0))} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1362#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 21:05:41,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {1362#(and (<= 5 main_~n~0) (<= main_~j~0 0))} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1362#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 21:05:41,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {1362#(and (<= 5 main_~n~0) (<= main_~j~0 0))} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1362#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 21:05:41,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {1362#(and (<= 5 main_~n~0) (<= main_~j~0 0))} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1375#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-27 21:05:41,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {1375#(and (<= 5 main_~n~0) (<= main_~j~0 1))} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1375#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-27 21:05:41,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {1375#(and (<= 5 main_~n~0) (<= main_~j~0 1))} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1375#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-27 21:05:41,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {1375#(and (<= 5 main_~n~0) (<= main_~j~0 1))} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1375#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-27 21:05:41,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {1375#(and (<= 5 main_~n~0) (<= main_~j~0 1))} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1388#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-27 21:05:41,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {1388#(and (<= 5 main_~n~0) (<= main_~j~0 2))} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1388#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-27 21:05:41,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {1388#(and (<= 5 main_~n~0) (<= main_~j~0 2))} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1388#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-27 21:05:41,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {1388#(and (<= 5 main_~n~0) (<= main_~j~0 2))} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1388#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-27 21:05:41,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {1388#(and (<= 5 main_~n~0) (<= main_~j~0 2))} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1401#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-27 21:05:41,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {1401#(and (<= 5 main_~n~0) (<= main_~j~0 3))} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1401#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-27 21:05:41,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {1401#(and (<= 5 main_~n~0) (<= main_~j~0 3))} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1401#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-27 21:05:41,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {1401#(and (<= 5 main_~n~0) (<= main_~j~0 3))} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1401#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-27 21:05:41,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {1401#(and (<= 5 main_~n~0) (<= main_~j~0 3))} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1414#(and (<= 5 main_~n~0) (<= main_~j~0 4))} is VALID [2022-04-27 21:05:41,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {1414#(and (<= 5 main_~n~0) (<= main_~j~0 4))} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {1322#false} is VALID [2022-04-27 21:05:41,736 INFO L272 TraceCheckUtils]: 24: Hoare triple {1322#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1322#false} is VALID [2022-04-27 21:05:41,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {1322#false} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1322#false} is VALID [2022-04-27 21:05:41,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {1322#false} [247] L6-->L6-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1322#false} is VALID [2022-04-27 21:05:41,736 INFO L290 TraceCheckUtils]: 27: Hoare triple {1322#false} [253] L6-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1322#false} is VALID [2022-04-27 21:05:41,736 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1322#false} {1322#false} [306] __VERIFIER_assertEXIT-->L102: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1322#false} is VALID [2022-04-27 21:05:41,736 INFO L290 TraceCheckUtils]: 29: Hoare triple {1322#false} [238] L102-->L93-2: Formula: (let ((.cse0 (+ |v_~#b~0.offset_3| (* v_main_~i~0_7 8)))) (and (= (store |v_#memory_real_28| |v_~#b~0.base_3| (store (select |v_#memory_real_28| |v_~#b~0.base_3|) .cse0 v_main_~w~0_3)) |v_#memory_real_27|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_~#b~0.base_3| (store (select |v_#memory_int_18| |v_~#b~0.base_3|) .cse0 (select (select |v_#memory_int_17| |v_~#b~0.base_3|) .cse0)))))) InVars {main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_18|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_28|, ~#b~0.base=|v_~#b~0.base_3|} OutVars{main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_17|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_27|, ~#b~0.base=|v_~#b~0.base_3|} AuxVars[] AssignedVars[#memory_int, #memory_real] {1322#false} is VALID [2022-04-27 21:05:41,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {1322#false} [245] L93-2-->L93-3: Formula: (= v_main_~i~0_11 (+ v_main_~i~0_12 1)) InVars {main_~i~0=v_main_~i~0_12} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_11} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1322#false} is VALID [2022-04-27 21:05:41,737 INFO L290 TraceCheckUtils]: 31: Hoare triple {1322#false} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {1322#false} is VALID [2022-04-27 21:05:41,737 INFO L290 TraceCheckUtils]: 32: Hoare triple {1322#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1322#false} is VALID [2022-04-27 21:05:41,737 INFO L290 TraceCheckUtils]: 33: Hoare triple {1322#false} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1322#false} is VALID [2022-04-27 21:05:41,737 INFO L290 TraceCheckUtils]: 34: Hoare triple {1322#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1322#false} is VALID [2022-04-27 21:05:41,737 INFO L290 TraceCheckUtils]: 35: Hoare triple {1322#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1322#false} is VALID [2022-04-27 21:05:41,737 INFO L290 TraceCheckUtils]: 36: Hoare triple {1322#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1322#false} is VALID [2022-04-27 21:05:41,737 INFO L290 TraceCheckUtils]: 37: Hoare triple {1322#false} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1322#false} is VALID [2022-04-27 21:05:41,737 INFO L290 TraceCheckUtils]: 38: Hoare triple {1322#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1322#false} is VALID [2022-04-27 21:05:41,737 INFO L290 TraceCheckUtils]: 39: Hoare triple {1322#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1322#false} is VALID [2022-04-27 21:05:41,737 INFO L290 TraceCheckUtils]: 40: Hoare triple {1322#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1322#false} is VALID [2022-04-27 21:05:41,737 INFO L290 TraceCheckUtils]: 41: Hoare triple {1322#false} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1322#false} is VALID [2022-04-27 21:05:41,738 INFO L290 TraceCheckUtils]: 42: Hoare triple {1322#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1322#false} is VALID [2022-04-27 21:05:41,738 INFO L290 TraceCheckUtils]: 43: Hoare triple {1322#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1322#false} is VALID [2022-04-27 21:05:41,738 INFO L290 TraceCheckUtils]: 44: Hoare triple {1322#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1322#false} is VALID [2022-04-27 21:05:41,738 INFO L290 TraceCheckUtils]: 45: Hoare triple {1322#false} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1322#false} is VALID [2022-04-27 21:05:41,738 INFO L290 TraceCheckUtils]: 46: Hoare triple {1322#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1322#false} is VALID [2022-04-27 21:05:41,738 INFO L290 TraceCheckUtils]: 47: Hoare triple {1322#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1322#false} is VALID [2022-04-27 21:05:41,738 INFO L290 TraceCheckUtils]: 48: Hoare triple {1322#false} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {1322#false} is VALID [2022-04-27 21:05:41,738 INFO L272 TraceCheckUtils]: 49: Hoare triple {1322#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1322#false} is VALID [2022-04-27 21:05:41,738 INFO L290 TraceCheckUtils]: 50: Hoare triple {1322#false} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1322#false} is VALID [2022-04-27 21:05:41,738 INFO L290 TraceCheckUtils]: 51: Hoare triple {1322#false} [247] L6-->L6-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1322#false} is VALID [2022-04-27 21:05:41,738 INFO L290 TraceCheckUtils]: 52: Hoare triple {1322#false} [253] L6-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1322#false} is VALID [2022-04-27 21:05:41,738 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {1322#false} {1322#false} [306] __VERIFIER_assertEXIT-->L102: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1322#false} is VALID [2022-04-27 21:05:41,739 INFO L290 TraceCheckUtils]: 54: Hoare triple {1322#false} [238] L102-->L93-2: Formula: (let ((.cse0 (+ |v_~#b~0.offset_3| (* v_main_~i~0_7 8)))) (and (= (store |v_#memory_real_28| |v_~#b~0.base_3| (store (select |v_#memory_real_28| |v_~#b~0.base_3|) .cse0 v_main_~w~0_3)) |v_#memory_real_27|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_~#b~0.base_3| (store (select |v_#memory_int_18| |v_~#b~0.base_3|) .cse0 (select (select |v_#memory_int_17| |v_~#b~0.base_3|) .cse0)))))) InVars {main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_18|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_28|, ~#b~0.base=|v_~#b~0.base_3|} OutVars{main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_17|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_27|, ~#b~0.base=|v_~#b~0.base_3|} AuxVars[] AssignedVars[#memory_int, #memory_real] {1322#false} is VALID [2022-04-27 21:05:41,739 INFO L290 TraceCheckUtils]: 55: Hoare triple {1322#false} [245] L93-2-->L93-3: Formula: (= v_main_~i~0_11 (+ v_main_~i~0_12 1)) InVars {main_~i~0=v_main_~i~0_12} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_11} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1322#false} is VALID [2022-04-27 21:05:41,739 INFO L290 TraceCheckUtils]: 56: Hoare triple {1322#false} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {1322#false} is VALID [2022-04-27 21:05:41,739 INFO L290 TraceCheckUtils]: 57: Hoare triple {1322#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1322#false} is VALID [2022-04-27 21:05:41,739 INFO L290 TraceCheckUtils]: 58: Hoare triple {1322#false} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1322#false} is VALID [2022-04-27 21:05:41,739 INFO L290 TraceCheckUtils]: 59: Hoare triple {1322#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1322#false} is VALID [2022-04-27 21:05:41,739 INFO L290 TraceCheckUtils]: 60: Hoare triple {1322#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1322#false} is VALID [2022-04-27 21:05:41,739 INFO L290 TraceCheckUtils]: 61: Hoare triple {1322#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1322#false} is VALID [2022-04-27 21:05:41,739 INFO L290 TraceCheckUtils]: 62: Hoare triple {1322#false} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1322#false} is VALID [2022-04-27 21:05:41,739 INFO L290 TraceCheckUtils]: 63: Hoare triple {1322#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1322#false} is VALID [2022-04-27 21:05:41,739 INFO L290 TraceCheckUtils]: 64: Hoare triple {1322#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1322#false} is VALID [2022-04-27 21:05:41,739 INFO L290 TraceCheckUtils]: 65: Hoare triple {1322#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1322#false} is VALID [2022-04-27 21:05:41,740 INFO L290 TraceCheckUtils]: 66: Hoare triple {1322#false} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1322#false} is VALID [2022-04-27 21:05:41,740 INFO L290 TraceCheckUtils]: 67: Hoare triple {1322#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1322#false} is VALID [2022-04-27 21:05:41,740 INFO L290 TraceCheckUtils]: 68: Hoare triple {1322#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1322#false} is VALID [2022-04-27 21:05:41,740 INFO L290 TraceCheckUtils]: 69: Hoare triple {1322#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1322#false} is VALID [2022-04-27 21:05:41,740 INFO L290 TraceCheckUtils]: 70: Hoare triple {1322#false} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1322#false} is VALID [2022-04-27 21:05:41,740 INFO L290 TraceCheckUtils]: 71: Hoare triple {1322#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1322#false} is VALID [2022-04-27 21:05:41,740 INFO L290 TraceCheckUtils]: 72: Hoare triple {1322#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1322#false} is VALID [2022-04-27 21:05:41,740 INFO L290 TraceCheckUtils]: 73: Hoare triple {1322#false} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {1322#false} is VALID [2022-04-27 21:05:41,740 INFO L272 TraceCheckUtils]: 74: Hoare triple {1322#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1322#false} is VALID [2022-04-27 21:05:41,740 INFO L290 TraceCheckUtils]: 75: Hoare triple {1322#false} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1322#false} is VALID [2022-04-27 21:05:41,740 INFO L290 TraceCheckUtils]: 76: Hoare triple {1322#false} [246] L6-->L7: Formula: (= 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[] {1322#false} is VALID [2022-04-27 21:05:41,741 INFO L290 TraceCheckUtils]: 77: Hoare triple {1322#false} [251] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1322#false} is VALID [2022-04-27 21:05:41,741 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 148 proven. 28 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2022-04-27 21:05:41,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:05:42,026 INFO L290 TraceCheckUtils]: 77: Hoare triple {1322#false} [251] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1322#false} is VALID [2022-04-27 21:05:42,026 INFO L290 TraceCheckUtils]: 76: Hoare triple {1322#false} [246] L6-->L7: Formula: (= 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[] {1322#false} is VALID [2022-04-27 21:05:42,026 INFO L290 TraceCheckUtils]: 75: Hoare triple {1322#false} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1322#false} is VALID [2022-04-27 21:05:42,027 INFO L272 TraceCheckUtils]: 74: Hoare triple {1322#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1322#false} is VALID [2022-04-27 21:05:42,028 INFO L290 TraceCheckUtils]: 73: Hoare triple {1322#false} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {1322#false} is VALID [2022-04-27 21:05:42,028 INFO L290 TraceCheckUtils]: 72: Hoare triple {1322#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1322#false} is VALID [2022-04-27 21:05:42,028 INFO L290 TraceCheckUtils]: 71: Hoare triple {1322#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1322#false} is VALID [2022-04-27 21:05:42,028 INFO L290 TraceCheckUtils]: 70: Hoare triple {1322#false} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1322#false} is VALID [2022-04-27 21:05:42,029 INFO L290 TraceCheckUtils]: 69: Hoare triple {1322#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1322#false} is VALID [2022-04-27 21:05:42,029 INFO L290 TraceCheckUtils]: 68: Hoare triple {1322#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1322#false} is VALID [2022-04-27 21:05:42,029 INFO L290 TraceCheckUtils]: 67: Hoare triple {1322#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1322#false} is VALID [2022-04-27 21:05:42,029 INFO L290 TraceCheckUtils]: 66: Hoare triple {1322#false} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1322#false} is VALID [2022-04-27 21:05:42,029 INFO L290 TraceCheckUtils]: 65: Hoare triple {1322#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1322#false} is VALID [2022-04-27 21:05:42,029 INFO L290 TraceCheckUtils]: 64: Hoare triple {1322#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1322#false} is VALID [2022-04-27 21:05:42,029 INFO L290 TraceCheckUtils]: 63: Hoare triple {1322#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1322#false} is VALID [2022-04-27 21:05:42,029 INFO L290 TraceCheckUtils]: 62: Hoare triple {1322#false} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1322#false} is VALID [2022-04-27 21:05:42,029 INFO L290 TraceCheckUtils]: 61: Hoare triple {1322#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1322#false} is VALID [2022-04-27 21:05:42,029 INFO L290 TraceCheckUtils]: 60: Hoare triple {1322#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1322#false} is VALID [2022-04-27 21:05:42,029 INFO L290 TraceCheckUtils]: 59: Hoare triple {1322#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1322#false} is VALID [2022-04-27 21:05:42,029 INFO L290 TraceCheckUtils]: 58: Hoare triple {1322#false} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1322#false} is VALID [2022-04-27 21:05:42,030 INFO L290 TraceCheckUtils]: 57: Hoare triple {1322#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1322#false} is VALID [2022-04-27 21:05:42,031 INFO L290 TraceCheckUtils]: 56: Hoare triple {1322#false} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {1322#false} is VALID [2022-04-27 21:05:42,031 INFO L290 TraceCheckUtils]: 55: Hoare triple {1322#false} [245] L93-2-->L93-3: Formula: (= v_main_~i~0_11 (+ v_main_~i~0_12 1)) InVars {main_~i~0=v_main_~i~0_12} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_11} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1322#false} is VALID [2022-04-27 21:05:42,032 INFO L290 TraceCheckUtils]: 54: Hoare triple {1322#false} [238] L102-->L93-2: Formula: (let ((.cse0 (+ |v_~#b~0.offset_3| (* v_main_~i~0_7 8)))) (and (= (store |v_#memory_real_28| |v_~#b~0.base_3| (store (select |v_#memory_real_28| |v_~#b~0.base_3|) .cse0 v_main_~w~0_3)) |v_#memory_real_27|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_~#b~0.base_3| (store (select |v_#memory_int_18| |v_~#b~0.base_3|) .cse0 (select (select |v_#memory_int_17| |v_~#b~0.base_3|) .cse0)))))) InVars {main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_18|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_28|, ~#b~0.base=|v_~#b~0.base_3|} OutVars{main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_17|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_27|, ~#b~0.base=|v_~#b~0.base_3|} AuxVars[] AssignedVars[#memory_int, #memory_real] {1322#false} is VALID [2022-04-27 21:05:42,032 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {1321#true} {1322#false} [306] __VERIFIER_assertEXIT-->L102: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1322#false} is VALID [2022-04-27 21:05:42,036 INFO L290 TraceCheckUtils]: 52: Hoare triple {1321#true} [253] L6-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1321#true} is VALID [2022-04-27 21:05:42,036 INFO L290 TraceCheckUtils]: 51: Hoare triple {1321#true} [247] L6-->L6-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1321#true} is VALID [2022-04-27 21:05:42,037 INFO L290 TraceCheckUtils]: 50: Hoare triple {1321#true} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1321#true} is VALID [2022-04-27 21:05:42,037 INFO L272 TraceCheckUtils]: 49: Hoare triple {1322#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1321#true} is VALID [2022-04-27 21:05:42,037 INFO L290 TraceCheckUtils]: 48: Hoare triple {1322#false} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {1322#false} is VALID [2022-04-27 21:05:42,037 INFO L290 TraceCheckUtils]: 47: Hoare triple {1322#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1322#false} is VALID [2022-04-27 21:05:42,037 INFO L290 TraceCheckUtils]: 46: Hoare triple {1322#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1322#false} is VALID [2022-04-27 21:05:42,037 INFO L290 TraceCheckUtils]: 45: Hoare triple {1322#false} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1322#false} is VALID [2022-04-27 21:05:42,037 INFO L290 TraceCheckUtils]: 44: Hoare triple {1322#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1322#false} is VALID [2022-04-27 21:05:42,037 INFO L290 TraceCheckUtils]: 43: Hoare triple {1322#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1322#false} is VALID [2022-04-27 21:05:42,037 INFO L290 TraceCheckUtils]: 42: Hoare triple {1322#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1322#false} is VALID [2022-04-27 21:05:42,037 INFO L290 TraceCheckUtils]: 41: Hoare triple {1322#false} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1322#false} is VALID [2022-04-27 21:05:42,037 INFO L290 TraceCheckUtils]: 40: Hoare triple {1322#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1322#false} is VALID [2022-04-27 21:05:42,037 INFO L290 TraceCheckUtils]: 39: Hoare triple {1322#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1322#false} is VALID [2022-04-27 21:05:42,037 INFO L290 TraceCheckUtils]: 38: Hoare triple {1322#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1322#false} is VALID [2022-04-27 21:05:42,038 INFO L290 TraceCheckUtils]: 37: Hoare triple {1322#false} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1322#false} is VALID [2022-04-27 21:05:42,038 INFO L290 TraceCheckUtils]: 36: Hoare triple {1322#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1322#false} is VALID [2022-04-27 21:05:42,038 INFO L290 TraceCheckUtils]: 35: Hoare triple {1322#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1322#false} is VALID [2022-04-27 21:05:42,038 INFO L290 TraceCheckUtils]: 34: Hoare triple {1322#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1322#false} is VALID [2022-04-27 21:05:42,038 INFO L290 TraceCheckUtils]: 33: Hoare triple {1322#false} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1322#false} is VALID [2022-04-27 21:05:42,038 INFO L290 TraceCheckUtils]: 32: Hoare triple {1322#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1322#false} is VALID [2022-04-27 21:05:42,038 INFO L290 TraceCheckUtils]: 31: Hoare triple {1322#false} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {1322#false} is VALID [2022-04-27 21:05:42,038 INFO L290 TraceCheckUtils]: 30: Hoare triple {1322#false} [245] L93-2-->L93-3: Formula: (= v_main_~i~0_11 (+ v_main_~i~0_12 1)) InVars {main_~i~0=v_main_~i~0_12} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_11} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1322#false} is VALID [2022-04-27 21:05:42,038 INFO L290 TraceCheckUtils]: 29: Hoare triple {1322#false} [238] L102-->L93-2: Formula: (let ((.cse0 (+ |v_~#b~0.offset_3| (* v_main_~i~0_7 8)))) (and (= (store |v_#memory_real_28| |v_~#b~0.base_3| (store (select |v_#memory_real_28| |v_~#b~0.base_3|) .cse0 v_main_~w~0_3)) |v_#memory_real_27|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_~#b~0.base_3| (store (select |v_#memory_int_18| |v_~#b~0.base_3|) .cse0 (select (select |v_#memory_int_17| |v_~#b~0.base_3|) .cse0)))))) InVars {main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_18|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_28|, ~#b~0.base=|v_~#b~0.base_3|} OutVars{main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_17|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_27|, ~#b~0.base=|v_~#b~0.base_3|} AuxVars[] AssignedVars[#memory_int, #memory_real] {1322#false} is VALID [2022-04-27 21:05:42,039 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1321#true} {1322#false} [306] __VERIFIER_assertEXIT-->L102: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1322#false} is VALID [2022-04-27 21:05:42,039 INFO L290 TraceCheckUtils]: 27: Hoare triple {1321#true} [253] L6-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1321#true} is VALID [2022-04-27 21:05:42,039 INFO L290 TraceCheckUtils]: 26: Hoare triple {1321#true} [247] L6-->L6-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1321#true} is VALID [2022-04-27 21:05:42,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {1321#true} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1321#true} is VALID [2022-04-27 21:05:42,039 INFO L272 TraceCheckUtils]: 24: Hoare triple {1322#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1321#true} is VALID [2022-04-27 21:05:42,039 INFO L290 TraceCheckUtils]: 23: Hoare triple {1742#(<= main_~j~0 main_~n~0)} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {1322#false} is VALID [2022-04-27 21:05:42,040 INFO L290 TraceCheckUtils]: 22: Hoare triple {1746#(<= (+ main_~j~0 1) main_~n~0)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1742#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 21:05:42,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {1746#(<= (+ main_~j~0 1) main_~n~0)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1746#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 21:05:42,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {1746#(<= (+ main_~j~0 1) main_~n~0)} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1746#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 21:05:42,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {1746#(<= (+ main_~j~0 1) main_~n~0)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1746#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 21:05:42,044 INFO L290 TraceCheckUtils]: 18: Hoare triple {1759#(<= (+ main_~j~0 2) main_~n~0)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1746#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 21:05:42,044 INFO L290 TraceCheckUtils]: 17: Hoare triple {1759#(<= (+ main_~j~0 2) main_~n~0)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1759#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 21:05:42,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {1759#(<= (+ main_~j~0 2) main_~n~0)} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1759#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 21:05:42,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {1759#(<= (+ main_~j~0 2) main_~n~0)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1759#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 21:05:42,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {1772#(<= (+ main_~j~0 3) main_~n~0)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1759#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 21:05:42,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {1772#(<= (+ main_~j~0 3) main_~n~0)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1772#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-27 21:05:42,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {1772#(<= (+ main_~j~0 3) main_~n~0)} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1772#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-27 21:05:42,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {1772#(<= (+ main_~j~0 3) main_~n~0)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1772#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-27 21:05:42,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {1785#(<= (+ main_~j~0 4) main_~n~0)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1772#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-27 21:05:42,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {1785#(<= (+ main_~j~0 4) main_~n~0)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1785#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-27 21:05:42,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {1785#(<= (+ main_~j~0 4) main_~n~0)} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1785#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-27 21:05:42,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {1785#(<= (+ main_~j~0 4) main_~n~0)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1785#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-27 21:05:42,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {1798#(<= 4 main_~n~0)} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {1785#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-27 21:05:42,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {1321#true} [221] mainENTRY-->L93-3: Formula: (and (= v_main_~i~0_8 0) (= v_main_~nmax~0_1 50) (= v_main_~n~0_4 5) (= v_main_~eps~0_1 (/ 1.0 1000000.0))) InVars {} OutVars{main_~chkerr~0=v_main_~chkerr~0_1, main_~w~0=v_main_~w~0_4, main_~eps~0=v_main_~eps~0_1, main_~j~0=v_main_~j~0_9, main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~nmax~0=v_main_~nmax~0_1} AuxVars[] AssignedVars[main_~chkerr~0, main_~w~0, main_~eps~0, main_~j~0, main_~i~0, main_~n~0, main_~nmax~0] {1798#(<= 4 main_~n~0)} is VALID [2022-04-27 21:05:42,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {1321#true} [218] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1321#true} is VALID [2022-04-27 21:05:42,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1321#true} {1321#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1321#true} is VALID [2022-04-27 21:05:42,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {1321#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1321#true} is VALID [2022-04-27 21:05:42,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {1321#true} [219] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_21| 1))) (and (= |v_~#a~0.offset_15| 0) (= 5 |v_~#b~0.base_4|) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_11| 5) 1) (= (select .cse0 1) 0) (= |v_~#a~0.base_15| 4) (= |v_#NULL.base_1| 0) (= (select |v_#valid_11| 3) 1) (= |v_~#x~0.offset_4| 0) (= (select |v_#valid_11| 6) 1) (= 9 (select |v_#length_5| 2)) (= |v_~#b~0.offset_4| 0) (= (select |v_#length_5| 3) 12) (= (select |v_#valid_11| 2) 1) (= (let ((.cse1 ((as const (Array Int Real)) 0.0))) (store (store (store |v_#memory_real_34| |v_~#a~0.base_15| .cse1) |v_~#b~0.base_4| .cse1) |v_~#x~0.base_4| .cse1)) |v_#memory_real_31|) (= 20000 (select |v_#length_5| 4)) (= 400 (select |v_#length_5| 5)) (= (select .cse0 0) 48) (= 1 (select |v_#valid_11| 1)) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_11| 0) 0) (= (select |v_#valid_11| 4) 1) (= 400 (select |v_#length_5| 6)) (= |v_~#x~0.base_4| 6))) InVars {#memory_int=|v_#memory_int_21|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #memory_real=|v_#memory_real_34|, #valid=|v_#valid_11|} OutVars{~#x~0.offset=|v_~#x~0.offset_4|, ~#a~0.base=|v_~#a~0.base_15|, #NULL.offset=|v_#NULL.offset_1|, #memory_real=|v_#memory_real_31|, ~#b~0.base=|v_~#b~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_11|, ~#b~0.offset=|v_~#b~0.offset_4|, ~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_21|, #length=|v_#length_5|, ~#a~0.offset=|v_~#a~0.offset_15|} AuxVars[] AssignedVars[~#x~0.offset, ~#b~0.offset, ~#x~0.base, ~#a~0.base, #NULL.offset, ~#a~0.offset, #memory_real, ~#b~0.base, #NULL.base] {1321#true} is VALID [2022-04-27 21:05:42,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {1321#true} [217] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1321#true} is VALID [2022-04-27 21:05:42,058 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 152 proven. 28 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-04-27 21:05:42,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513575593] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:05:42,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:05:42,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-04-27 21:05:42,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70339192] [2022-04-27 21:05:42,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:05:42,059 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.052631578947368) internal successors, (77), 18 states have internal predecessors, (77), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2022-04-27 21:05:42,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:05:42,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 4.052631578947368) internal successors, (77), 18 states have internal predecessors, (77), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 21:05:42,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:05:42,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 21:05:42,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:05:42,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 21:05:42,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2022-04-27 21:05:42,120 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand has 20 states, 19 states have (on average 4.052631578947368) internal successors, (77), 18 states have internal predecessors, (77), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 21:05:42,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:42,676 INFO L93 Difference]: Finished difference Result 227 states and 275 transitions. [2022-04-27 21:05:42,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 21:05:42,677 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.052631578947368) internal successors, (77), 18 states have internal predecessors, (77), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2022-04-27 21:05:42,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:05:42,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 4.052631578947368) internal successors, (77), 18 states have internal predecessors, (77), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 21:05:42,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 67 transitions. [2022-04-27 21:05:42,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 4.052631578947368) internal successors, (77), 18 states have internal predecessors, (77), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 21:05:42,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 67 transitions. [2022-04-27 21:05:42,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 67 transitions. [2022-04-27 21:05:42,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:05:42,727 INFO L225 Difference]: With dead ends: 227 [2022-04-27 21:05:42,727 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:05:42,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=642, Unknown=0, NotChecked=0, Total=870 [2022-04-27 21:05:42,729 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 91 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:05:42,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 56 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:05:42,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:05:42,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:05:42,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:05:42,729 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-27 21:05:42,729 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-27 21:05:42,729 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-27 21:05:42,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:42,730 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:05:42,730 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:05:42,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:42,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:42,730 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-27 21:05:42,730 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-27 21:05:42,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:42,730 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:05:42,730 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:05:42,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:42,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:42,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:05:42,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:05:42,730 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-27 21:05:42,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:05:42,730 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2022-04-27 21:05:42,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:05:42,730 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:05:42,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.052631578947368) internal successors, (77), 18 states have internal predecessors, (77), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 21:05:42,731 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:05:42,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:42,733 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:05:42,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 21:05:42,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:05:42,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:05:43,192 INFO L895 garLoopResultBuilder]: At program point ludcmpENTRY(lines 111 155) the Hoare annotation is: (= |old(#memory_real)| |#memory_real|) [2022-04-27 21:05:43,192 INFO L899 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2022-04-27 21:05:43,192 INFO L899 garLoopResultBuilder]: For program point ludcmpFINAL(lines 111 155) no Hoare annotation was computed. [2022-04-27 21:05:43,192 INFO L902 garLoopResultBuilder]: At program point L118-3(lines 118 136) the Hoare annotation is: true [2022-04-27 21:05:43,192 INFO L899 garLoopResultBuilder]: For program point ludcmpEXIT(lines 111 155) no Hoare annotation was computed. [2022-04-27 21:05:43,192 INFO L899 garLoopResultBuilder]: For program point L118-4(lines 118 136) no Hoare annotation was computed. [2022-04-27 21:05:43,192 INFO L902 garLoopResultBuilder]: At program point L120(line 120) the Hoare annotation is: true [2022-04-27 21:05:43,192 INFO L902 garLoopResultBuilder]: At program point L138-3(lines 138 144) the Hoare annotation is: true [2022-04-27 21:05:43,193 INFO L899 garLoopResultBuilder]: For program point L120-1(line 120) no Hoare annotation was computed. [2022-04-27 21:05:43,193 INFO L899 garLoopResultBuilder]: For program point L138-4(lines 138 144) no Hoare annotation was computed. [2022-04-27 21:05:43,193 INFO L902 garLoopResultBuilder]: At program point L141-3(lines 141 142) the Hoare annotation is: true [2022-04-27 21:05:43,193 INFO L902 garLoopResultBuilder]: At program point L121-3(lines 121 128) the Hoare annotation is: true [2022-04-27 21:05:43,193 INFO L902 garLoopResultBuilder]: At program point L146-3(lines 146 152) the Hoare annotation is: true [2022-04-27 21:05:43,193 INFO L899 garLoopResultBuilder]: For program point L141-4(lines 141 142) no Hoare annotation was computed. [2022-04-27 21:05:43,193 INFO L899 garLoopResultBuilder]: For program point L141-2(lines 141 142) no Hoare annotation was computed. [2022-04-27 21:05:43,193 INFO L899 garLoopResultBuilder]: For program point L121-4(lines 121 128) no Hoare annotation was computed. [2022-04-27 21:05:43,193 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 126) no Hoare annotation was computed. [2022-04-27 21:05:43,193 INFO L899 garLoopResultBuilder]: For program point L146-4(lines 146 152) no Hoare annotation was computed. [2022-04-27 21:05:43,193 INFO L902 garLoopResultBuilder]: At program point L149-3(lines 149 150) the Hoare annotation is: true [2022-04-27 21:05:43,193 INFO L899 garLoopResultBuilder]: For program point L138-2(lines 138 144) no Hoare annotation was computed. [2022-04-27 21:05:43,193 INFO L902 garLoopResultBuilder]: At program point L129-3(lines 129 135) the Hoare annotation is: true [2022-04-27 21:05:43,193 INFO L902 garLoopResultBuilder]: At program point L125-3(lines 125 126) the Hoare annotation is: true [2022-04-27 21:05:43,193 INFO L899 garLoopResultBuilder]: For program point L124-1(lines 124 126) no Hoare annotation was computed. [2022-04-27 21:05:43,193 INFO L899 garLoopResultBuilder]: For program point L149-4(lines 149 150) no Hoare annotation was computed. [2022-04-27 21:05:43,193 INFO L899 garLoopResultBuilder]: For program point L149-2(lines 149 150) no Hoare annotation was computed. [2022-04-27 21:05:43,193 INFO L899 garLoopResultBuilder]: For program point L118-2(lines 118 136) no Hoare annotation was computed. [2022-04-27 21:05:43,193 INFO L902 garLoopResultBuilder]: At program point L132-3(lines 132 133) the Hoare annotation is: true [2022-04-27 21:05:43,193 INFO L899 garLoopResultBuilder]: For program point L125-2(lines 125 126) no Hoare annotation was computed. [2022-04-27 21:05:43,193 INFO L899 garLoopResultBuilder]: For program point L121-2(lines 121 128) no Hoare annotation was computed. [2022-04-27 21:05:43,193 INFO L899 garLoopResultBuilder]: For program point L146-2(lines 146 152) no Hoare annotation was computed. [2022-04-27 21:05:43,193 INFO L899 garLoopResultBuilder]: For program point L132-4(lines 132 133) no Hoare annotation was computed. [2022-04-27 21:05:43,194 INFO L899 garLoopResultBuilder]: For program point L132-2(lines 132 133) no Hoare annotation was computed. [2022-04-27 21:05:43,194 INFO L899 garLoopResultBuilder]: For program point L129-2(lines 129 135) no Hoare annotation was computed. [2022-04-27 21:05:43,194 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 21:05:43,194 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:05:43,194 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:05:43,194 INFO L902 garLoopResultBuilder]: At program point fabsENTRY(lines 76 83) the Hoare annotation is: true [2022-04-27 21:05:43,194 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 81) no Hoare annotation was computed. [2022-04-27 21:05:43,194 INFO L899 garLoopResultBuilder]: For program point L80-2(lines 80 81) no Hoare annotation was computed. [2022-04-27 21:05:43,194 INFO L899 garLoopResultBuilder]: For program point fabsFINAL(lines 76 83) no Hoare annotation was computed. [2022-04-27 21:05:43,194 INFO L899 garLoopResultBuilder]: For program point fabsEXIT(lines 76 83) no Hoare annotation was computed. [2022-04-27 21:05:43,194 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:05:43,194 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:05:43,194 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:05:43,194 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:05:43,194 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 85 109) the Hoare annotation is: (= |old(#memory_real)| |#memory_real|) [2022-04-27 21:05:43,194 INFO L895 garLoopResultBuilder]: At program point L93-3(lines 93 104) the Hoare annotation is: (= 5 main_~n~0) [2022-04-27 21:05:43,194 INFO L902 garLoopResultBuilder]: At program point L93-4(lines 93 104) the Hoare annotation is: true [2022-04-27 21:05:43,194 INFO L895 garLoopResultBuilder]: At program point L96-3(lines 96 101) the Hoare annotation is: (and (<= main_~i~0 main_~n~0) (= 5 main_~n~0)) [2022-04-27 21:05:43,194 INFO L899 garLoopResultBuilder]: For program point L106(line 106) no Hoare annotation was computed. [2022-04-27 21:05:43,194 INFO L895 garLoopResultBuilder]: At program point L96-4(lines 96 101) the Hoare annotation is: (and (<= main_~i~0 main_~n~0) (= 5 main_~n~0)) [2022-04-27 21:05:43,194 INFO L899 garLoopResultBuilder]: For program point L99(line 99) no Hoare annotation was computed. [2022-04-27 21:05:43,194 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 85 109) no Hoare annotation was computed. [2022-04-27 21:05:43,194 INFO L899 garLoopResultBuilder]: For program point L102(line 102) no Hoare annotation was computed. [2022-04-27 21:05:43,195 INFO L899 garLoopResultBuilder]: For program point L99-2(line 99) no Hoare annotation was computed. [2022-04-27 21:05:43,195 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 85 109) no Hoare annotation was computed. [2022-04-27 21:05:43,195 INFO L899 garLoopResultBuilder]: For program point L93-2(lines 93 104) no Hoare annotation was computed. [2022-04-27 21:05:43,195 INFO L899 garLoopResultBuilder]: For program point L96-2(lines 96 101) no Hoare annotation was computed. [2022-04-27 21:05:43,195 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-27 21:05:43,195 INFO L899 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2022-04-27 21:05:43,195 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-27 21:05:43,195 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2022-04-27 21:05:43,195 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2022-04-27 21:05:43,195 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2022-04-27 21:05:43,197 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-27 21:05:43,199 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:05:43,202 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:05:43,202 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-27 21:05:43,203 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 21:05:43,203 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-04-27 21:05:43,203 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:05:43,203 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-27 21:05:43,203 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-27 21:05:43,203 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 21:05:43,203 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 21:05:43,203 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-04-27 21:05:43,203 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-04-27 21:05:43,203 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:05:43,205 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-04-27 21:05:43,205 WARN L170 areAnnotationChecker]: ludcmpFINAL has no Hoare annotation [2022-04-27 21:05:43,205 WARN L170 areAnnotationChecker]: L118-4 has no Hoare annotation [2022-04-27 21:05:43,205 WARN L170 areAnnotationChecker]: L118-4 has no Hoare annotation [2022-04-27 21:05:43,205 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 21:05:43,205 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 21:05:43,205 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-27 21:05:43,205 WARN L170 areAnnotationChecker]: L80-2 has no Hoare annotation [2022-04-27 21:05:43,205 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-04-27 21:05:43,205 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-04-27 21:05:43,205 WARN L170 areAnnotationChecker]: ludcmpEXIT has no Hoare annotation [2022-04-27 21:05:43,205 WARN L170 areAnnotationChecker]: L118-4 has no Hoare annotation [2022-04-27 21:05:43,205 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:05:43,205 WARN L170 areAnnotationChecker]: fabsFINAL has no Hoare annotation [2022-04-27 21:05:43,205 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-04-27 21:05:43,205 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2022-04-27 21:05:43,205 WARN L170 areAnnotationChecker]: L138-4 has no Hoare annotation [2022-04-27 21:05:43,205 WARN L170 areAnnotationChecker]: L138-4 has no Hoare annotation [2022-04-27 21:05:43,205 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: fabsEXIT has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: L96-2 has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: L138-4 has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: L141-4 has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: L141-4 has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: L141-2 has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: L93-2 has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: L146-4 has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: L146-4 has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: L141-4 has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: L141-2 has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: L121-4 has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: L121-4 has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: L146-4 has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: L149-4 has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: L149-4 has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: L149-2 has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: L138-2 has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: L121-4 has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: L149-4 has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: L149-2 has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: L118-2 has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: L118-2 has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-04-27 21:05:43,206 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-04-27 21:05:43,207 WARN L170 areAnnotationChecker]: L125-2 has no Hoare annotation [2022-04-27 21:05:43,207 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-04-27 21:05:43,207 WARN L170 areAnnotationChecker]: L146-2 has no Hoare annotation [2022-04-27 21:05:43,207 WARN L170 areAnnotationChecker]: L118-2 has no Hoare annotation [2022-04-27 21:05:43,207 WARN L170 areAnnotationChecker]: L132-4 has no Hoare annotation [2022-04-27 21:05:43,207 WARN L170 areAnnotationChecker]: L132-4 has no Hoare annotation [2022-04-27 21:05:43,207 WARN L170 areAnnotationChecker]: L132-2 has no Hoare annotation [2022-04-27 21:05:43,207 WARN L170 areAnnotationChecker]: L125-2 has no Hoare annotation [2022-04-27 21:05:43,207 WARN L170 areAnnotationChecker]: L121-2 has no Hoare annotation [2022-04-27 21:05:43,207 WARN L170 areAnnotationChecker]: L132-4 has no Hoare annotation [2022-04-27 21:05:43,207 WARN L170 areAnnotationChecker]: L132-2 has no Hoare annotation [2022-04-27 21:05:43,207 WARN L170 areAnnotationChecker]: L129-2 has no Hoare annotation [2022-04-27 21:05:43,207 INFO L163 areAnnotationChecker]: CFG has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 21:05:43,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:05:43 BasicIcfg [2022-04-27 21:05:43,215 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:05:43,216 INFO L158 Benchmark]: Toolchain (without parser) took 6038.99ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 124.2MB in the beginning and 77.5MB in the end (delta: 46.7MB). Peak memory consumption was 84.2MB. Max. memory is 8.0GB. [2022-04-27 21:05:43,216 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 180.4MB. Free memory was 140.5MB in the beginning and 140.4MB in the end (delta: 72.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:05:43,217 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.39ms. Allocated memory is still 180.4MB. Free memory was 124.0MB in the beginning and 150.4MB in the end (delta: -26.4MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. [2022-04-27 21:05:43,217 INFO L158 Benchmark]: Boogie Preprocessor took 32.75ms. Allocated memory is still 180.4MB. Free memory was 150.4MB in the beginning and 147.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:05:43,217 INFO L158 Benchmark]: RCFGBuilder took 363.97ms. Allocated memory is still 180.4MB. Free memory was 147.9MB in the beginning and 127.3MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-04-27 21:05:43,217 INFO L158 Benchmark]: IcfgTransformer took 64.50ms. Allocated memory is still 180.4MB. Free memory was 127.3MB in the beginning and 124.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:05:43,217 INFO L158 Benchmark]: TraceAbstraction took 5340.02ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 124.2MB in the beginning and 77.5MB in the end (delta: 46.7MB). Peak memory consumption was 83.3MB. Max. memory is 8.0GB. [2022-04-27 21:05:43,218 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 180.4MB. Free memory was 140.5MB in the beginning and 140.4MB in the end (delta: 72.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 232.39ms. Allocated memory is still 180.4MB. Free memory was 124.0MB in the beginning and 150.4MB in the end (delta: -26.4MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.75ms. Allocated memory is still 180.4MB. Free memory was 150.4MB in the beginning and 147.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 363.97ms. Allocated memory is still 180.4MB. Free memory was 147.9MB in the beginning and 127.3MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * IcfgTransformer took 64.50ms. Allocated memory is still 180.4MB. Free memory was 127.3MB in the beginning and 124.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 5340.02ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 124.2MB in the beginning and 77.5MB in the end (delta: 46.7MB). Peak memory consumption was 83.3MB. 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: 7]: 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 6 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 5, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 313 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 307 mSDsluCounter, 238 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 121 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 456 IncrementalHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 117 mSDtfsCounter, 456 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 287 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=4, InterpolantAutomatonStates: 56, 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, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 54 PreInvPairs, 130 NumberOfFragments, 66 HoareAnnotationTreeSize, 54 FomulaSimplifications, 596 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 21 FomulaSimplificationsInter, 489 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 352 ConstructedInterpolants, 0 QuantifiedInterpolants, 1097 SizeOfPredicates, 4 NumberOfNonLiveVariables, 564 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 928/997 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: 93]: Loop Invariant Derived loop invariant: 5 == n - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: i <= n && 5 == n - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 149]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-04-27 21:05:43,242 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...