/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/lu.cmp.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:16:59,896 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:16:59,906 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:16:59,946 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:16:59,946 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:16:59,947 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:16:59,948 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:16:59,949 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:16:59,950 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:16:59,951 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:16:59,954 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:16:59,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:16:59,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:16:59,962 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:16:59,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:16:59,965 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:16:59,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:16:59,967 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:16:59,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:16:59,975 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:16:59,976 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:16:59,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:16:59,978 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:16:59,980 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:16:59,981 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:16:59,982 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:16:59,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:16:59,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:16:59,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:16:59,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:16:59,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:16:59,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:16:59,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:16:59,985 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:16:59,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:16:59,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:16:59,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:16:59,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:16:59,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:16:59,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:16:59,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:16:59,990 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:16:59,991 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:17:00,015 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:17:00,015 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:17:00,015 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:17:00,016 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:17:00,016 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:17:00,016 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:17:00,016 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:17:00,017 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:17:00,017 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:17:00,017 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:17:00,017 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:17:00,018 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:17:00,018 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:17:00,018 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:17:00,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:17:00,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:17:00,018 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:17:00,019 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:17:00,019 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:17:00,019 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:17:00,019 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:17:00,019 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:17:00,020 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:17:00,020 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:17:00,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:17:00,020 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:17:00,020 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:17:00,020 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:17:00,020 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:17:00,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:17:00,020 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:17:00,021 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:17:00,021 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:17:00,021 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/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 10:17:00,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:17:00,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:17:00,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:17:00,232 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:17:00,233 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:17:00,233 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 10:17:00,278 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5663d6ec2/5c6849b5798c44a28210888816c8ce2f/FLAG2b9edf4e6 [2022-04-27 10:17:00,603 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:17:00,603 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/lu.cmp.c [2022-04-27 10:17:00,610 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5663d6ec2/5c6849b5798c44a28210888816c8ce2f/FLAG2b9edf4e6 [2022-04-27 10:17:01,043 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5663d6ec2/5c6849b5798c44a28210888816c8ce2f [2022-04-27 10:17:01,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:17:01,046 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:17:01,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:17:01,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:17:01,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:17:01,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:17:01" (1/1) ... [2022-04-27 10:17:01,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33341470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:01, skipping insertion in model container [2022-04-27 10:17:01,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:17:01" (1/1) ... [2022-04-27 10:17:01,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:17:01,078 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:17:01,245 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 10:17:01,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:17:01,308 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:17:01,317 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 10:17:01,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:17:01,370 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:17:01,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:01 WrapperNode [2022-04-27 10:17:01,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:17:01,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:17:01,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:17:01,372 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:17:01,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:01" (1/1) ... [2022-04-27 10:17:01,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:01" (1/1) ... [2022-04-27 10:17:01,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:01" (1/1) ... [2022-04-27 10:17:01,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:01" (1/1) ... [2022-04-27 10:17:01,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:01" (1/1) ... [2022-04-27 10:17:01,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:01" (1/1) ... [2022-04-27 10:17:01,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:01" (1/1) ... [2022-04-27 10:17:01,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:17:01,435 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:17:01,435 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:17:01,435 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:17:01,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:01" (1/1) ... [2022-04-27 10:17:01,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:17:01,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:01,489 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 10:17:01,492 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 10:17:01,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:17:01,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:17:01,532 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:17:01,533 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:17:01,534 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs [2022-04-27 10:17:01,534 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:17:01,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ludcmp [2022-04-27 10:17:01,534 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:17:01,534 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:17:01,534 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:17:01,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:17:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:17:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure ludcmp [2022-04-27 10:17:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure fabs [2022-04-27 10:17:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:17:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-04-27 10:17:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-04-27 10:17:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 10:17:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:17:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:17:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:17:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:17:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:17:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:17:01,591 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:17:01,592 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:17:01,854 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:17:01,859 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:17:01,859 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-04-27 10:17:01,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:17:01 BoogieIcfgContainer [2022-04-27 10:17:01,861 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:17:01,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:17:01,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:17:01,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:17:01,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:17:01" (1/3) ... [2022-04-27 10:17:01,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe1e24c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:17:01, skipping insertion in model container [2022-04-27 10:17:01,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:01" (2/3) ... [2022-04-27 10:17:01,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe1e24c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:17:01, skipping insertion in model container [2022-04-27 10:17:01,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:17:01" (3/3) ... [2022-04-27 10:17:01,888 INFO L111 eAbstractionObserver]: Analyzing ICFG lu.cmp.c [2022-04-27 10:17:01,900 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:17:01,900 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:17:01,942 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:17:01,947 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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@393a85d7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@308077ba [2022-04-27 10:17:01,948 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:17:01,953 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 10:17:01,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:17:01,959 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:01,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:17:01,959 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:01,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:01,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1448102218, now seen corresponding path program 1 times [2022-04-27 10:17:01,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:01,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812328873] [2022-04-27 10:17:01,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:01,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:02,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:02,196 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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {67#true} is VALID [2022-04-27 10:17:02,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-27 10:17:02,197 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67#true} {67#true} #214#return; {67#true} is VALID [2022-04-27 10:17:02,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {67#true} call ULTIMATE.init(); {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 10:17:02,200 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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {67#true} is VALID [2022-04-27 10:17:02,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-27 10:17:02,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67#true} {67#true} #214#return; {67#true} is VALID [2022-04-27 10:17:02,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {67#true} call #t~ret37 := main(); {67#true} is VALID [2022-04-27 10:17:02,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {67#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {67#true} is VALID [2022-04-27 10:17:02,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {67#true} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {67#true} is VALID [2022-04-27 10:17:02,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {67#true} assume !true; {68#false} is VALID [2022-04-27 10:17:02,202 INFO L272 TraceCheckUtils]: 8: Hoare triple {68#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {68#false} is VALID [2022-04-27 10:17:02,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {68#false} ~cond := #in~cond; {68#false} is VALID [2022-04-27 10:17:02,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {68#false} assume 0 == ~cond; {68#false} is VALID [2022-04-27 10:17:02,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {68#false} assume !false; {68#false} is VALID [2022-04-27 10:17:02,203 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 10:17:02,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:02,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812328873] [2022-04-27 10:17:02,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812328873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:17:02,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:17:02,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:17:02,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531294150] [2022-04-27 10:17:02,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:17:02,210 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 10:17:02,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:02,213 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 10:17:02,232 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 10:17:02,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:17:02,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:02,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:17:02,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:17:02,254 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 10:17:02,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:02,566 INFO L93 Difference]: Finished difference Result 147 states and 225 transitions. [2022-04-27 10:17:02,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:17:02,567 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 10:17:02,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:02,568 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 10:17:02,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2022-04-27 10:17:02,579 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 10:17:02,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2022-04-27 10:17:02,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 225 transitions. [2022-04-27 10:17:02,757 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 10:17:02,762 INFO L225 Difference]: With dead ends: 147 [2022-04-27 10:17:02,762 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 10:17:02,764 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 10:17:02,766 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 10:17:02,767 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 10:17:02,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 10:17:02,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2022-04-27 10:17:02,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:02,784 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 10:17:02,785 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 10:17:02,785 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 10:17:02,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:02,787 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-27 10:17:02,787 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-27 10:17:02,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:02,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:02,788 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 10:17:02,788 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 10:17:02,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:02,789 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-27 10:17:02,789 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-27 10:17:02,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:02,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:02,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:02,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:02,790 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 10:17:02,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-27 10:17:02,792 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2022-04-27 10:17:02,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:02,792 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-27 10:17:02,792 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 10:17:02,792 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-27 10:17:02,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:17:02,793 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:02,793 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:17:02,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:17:02,793 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:02,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:02,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1436096445, now seen corresponding path program 1 times [2022-04-27 10:17:02,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:02,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044403915] [2022-04-27 10:17:02,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:02,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:02,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:02,859 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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {346#true} is VALID [2022-04-27 10:17:02,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {346#true} assume true; {346#true} is VALID [2022-04-27 10:17:02,859 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {346#true} {346#true} #214#return; {346#true} is VALID [2022-04-27 10:17:02,860 INFO L272 TraceCheckUtils]: 0: Hoare triple {346#true} call ULTIMATE.init(); {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 10:17:02,861 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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {346#true} is VALID [2022-04-27 10:17:02,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {346#true} assume true; {346#true} is VALID [2022-04-27 10:17:02,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {346#true} {346#true} #214#return; {346#true} is VALID [2022-04-27 10:17:02,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {346#true} call #t~ret37 := main(); {346#true} is VALID [2022-04-27 10:17:02,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {346#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {351#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:02,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {351#(= (+ main_~n~0 (- 5)) 0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {352#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:02,863 INFO L290 TraceCheckUtils]: 7: Hoare triple {352#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} assume !(~j~0 <= ~n~0); {347#false} is VALID [2022-04-27 10:17:02,863 INFO L272 TraceCheckUtils]: 8: Hoare triple {347#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {347#false} is VALID [2022-04-27 10:17:02,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {347#false} ~cond := #in~cond; {347#false} is VALID [2022-04-27 10:17:02,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {347#false} assume 0 == ~cond; {347#false} is VALID [2022-04-27 10:17:02,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {347#false} assume !false; {347#false} is VALID [2022-04-27 10:17:02,863 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 10:17:02,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:02,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044403915] [2022-04-27 10:17:02,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044403915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:17:02,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:17:02,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:17:02,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646352400] [2022-04-27 10:17:02,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:17:02,865 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 10:17:02,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:02,866 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 10:17:02,874 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 10:17:02,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:17:02,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:02,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:17:02,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:17:02,875 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 10:17:02,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:02,980 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-27 10:17:02,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:17:02,980 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 10:17:02,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:02,981 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 10:17:02,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-27 10:17:02,982 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 10:17:02,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-27 10:17:02,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2022-04-27 10:17:03,022 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 10:17:03,023 INFO L225 Difference]: With dead ends: 40 [2022-04-27 10:17:03,023 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 10:17:03,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:17:03,024 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 10:17:03,025 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 10:17:03,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 10:17:03,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2022-04-27 10:17:03,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:03,028 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 10:17:03,028 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 10:17:03,028 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 10:17:03,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:03,029 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 10:17:03,029 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 10:17:03,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:03,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:03,030 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 10:17:03,030 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 10:17:03,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:03,031 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 10:17:03,031 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 10:17:03,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:03,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:03,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:03,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:03,032 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 10:17:03,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-27 10:17:03,033 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 12 [2022-04-27 10:17:03,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:03,033 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-27 10:17:03,033 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 10:17:03,033 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-27 10:17:03,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 10:17:03,033 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:03,034 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:17:03,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:17:03,034 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:03,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:03,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1858105272, now seen corresponding path program 1 times [2022-04-27 10:17:03,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:03,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60671825] [2022-04-27 10:17:03,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:03,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:03,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:03,109 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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {497#true} is VALID [2022-04-27 10:17:03,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {497#true} assume true; {497#true} is VALID [2022-04-27 10:17:03,109 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {497#true} {497#true} #214#return; {497#true} is VALID [2022-04-27 10:17:03,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {497#true} call ULTIMATE.init(); {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 10:17:03,110 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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {497#true} is VALID [2022-04-27 10:17:03,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {497#true} assume true; {497#true} is VALID [2022-04-27 10:17:03,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {497#true} {497#true} #214#return; {497#true} is VALID [2022-04-27 10:17:03,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {497#true} call #t~ret37 := main(); {497#true} is VALID [2022-04-27 10:17:03,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {497#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {502#(< main_~i~0 50)} is VALID [2022-04-27 10:17:03,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {502#(< main_~i~0 50)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {502#(< main_~i~0 50)} is VALID [2022-04-27 10:17:03,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {502#(< main_~i~0 50)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {502#(< main_~i~0 50)} is VALID [2022-04-27 10:17:03,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {502#(< main_~i~0 50)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {502#(< main_~i~0 50)} is VALID [2022-04-27 10:17:03,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {502#(< main_~i~0 50)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {502#(< main_~i~0 50)} is VALID [2022-04-27 10:17:03,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {502#(< main_~i~0 50)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {502#(< main_~i~0 50)} is VALID [2022-04-27 10:17:03,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {502#(< main_~i~0 50)} assume !(~j~0 <= ~n~0); {502#(< main_~i~0 50)} is VALID [2022-04-27 10:17:03,114 INFO L272 TraceCheckUtils]: 12: Hoare triple {502#(< main_~i~0 50)} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {503#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:17:03,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {503#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {504#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:17:03,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {504#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {498#false} is VALID [2022-04-27 10:17:03,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {498#false} assume !false; {498#false} is VALID [2022-04-27 10:17:03,115 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 10:17:03,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:03,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60671825] [2022-04-27 10:17:03,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60671825] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:17:03,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:17:03,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:17:03,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818416767] [2022-04-27 10:17:03,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:17:03,116 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 10:17:03,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:03,117 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 10:17:03,127 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 10:17:03,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:17:03,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:03,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:17:03,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:17:03,128 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 10:17:03,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:03,322 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-27 10:17:03,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:17:03,322 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 10:17:03,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:03,323 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 10:17:03,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-27 10:17:03,324 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 10:17:03,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-27 10:17:03,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-27 10:17:03,355 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 10:17:03,356 INFO L225 Difference]: With dead ends: 36 [2022-04-27 10:17:03,356 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 10:17:03,356 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 10:17:03,357 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 10:17:03,357 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 10:17:03,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 10:17:03,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-27 10:17:03,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:03,363 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 10:17:03,363 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 10:17:03,364 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 10:17:03,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:03,364 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 10:17:03,365 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 10:17:03,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:03,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:03,365 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 10:17:03,365 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 10:17:03,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:03,366 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 10:17:03,366 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 10:17:03,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:03,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:03,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:03,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:03,367 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 10:17:03,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-27 10:17:03,368 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 16 [2022-04-27 10:17:03,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:03,368 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-27 10:17:03,368 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 10:17:03,368 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-27 10:17:03,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 10:17:03,369 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:03,369 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 10:17:03,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 10:17:03,369 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:03,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:03,369 INFO L85 PathProgramCache]: Analyzing trace with hash 419710194, now seen corresponding path program 1 times [2022-04-27 10:17:03,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:03,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773595311] [2022-04-27 10:17:03,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:03,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:03,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:03,437 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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {680#true} is VALID [2022-04-27 10:17:03,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {680#true} assume true; {680#true} is VALID [2022-04-27 10:17:03,437 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {680#true} {680#true} #214#return; {680#true} is VALID [2022-04-27 10:17:03,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 10:17:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:03,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {680#true} ~cond := #in~cond; {680#true} is VALID [2022-04-27 10:17:03,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {680#true} assume !(0 == ~cond); {680#true} is VALID [2022-04-27 10:17:03,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {680#true} assume true; {680#true} is VALID [2022-04-27 10:17:03,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {680#true} {685#(= main_~i~0 0)} #210#return; {685#(= main_~i~0 0)} is VALID [2022-04-27 10:17:03,442 INFO L272 TraceCheckUtils]: 0: Hoare triple {680#true} call ULTIMATE.init(); {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 10:17:03,442 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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {680#true} is VALID [2022-04-27 10:17:03,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {680#true} assume true; {680#true} is VALID [2022-04-27 10:17:03,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {680#true} {680#true} #214#return; {680#true} is VALID [2022-04-27 10:17:03,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {680#true} call #t~ret37 := main(); {680#true} is VALID [2022-04-27 10:17:03,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {680#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {685#(= main_~i~0 0)} is VALID [2022-04-27 10:17:03,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {685#(= main_~i~0 0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {685#(= main_~i~0 0)} is VALID [2022-04-27 10:17:03,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {685#(= main_~i~0 0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {685#(= main_~i~0 0)} is VALID [2022-04-27 10:17:03,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {685#(= main_~i~0 0)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {685#(= main_~i~0 0)} is VALID [2022-04-27 10:17:03,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {685#(= main_~i~0 0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {685#(= main_~i~0 0)} is VALID [2022-04-27 10:17:03,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {685#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {685#(= main_~i~0 0)} is VALID [2022-04-27 10:17:03,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {685#(= main_~i~0 0)} assume !(~j~0 <= ~n~0); {685#(= main_~i~0 0)} is VALID [2022-04-27 10:17:03,445 INFO L272 TraceCheckUtils]: 12: Hoare triple {685#(= main_~i~0 0)} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {680#true} is VALID [2022-04-27 10:17:03,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {680#true} ~cond := #in~cond; {680#true} is VALID [2022-04-27 10:17:03,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {680#true} assume !(0 == ~cond); {680#true} is VALID [2022-04-27 10:17:03,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {680#true} assume true; {680#true} is VALID [2022-04-27 10:17:03,446 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {680#true} {685#(= main_~i~0 0)} #210#return; {685#(= main_~i~0 0)} is VALID [2022-04-27 10:17:03,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {685#(= main_~i~0 0)} call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); {685#(= main_~i~0 0)} is VALID [2022-04-27 10:17:03,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {685#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {690#(<= main_~i~0 1)} is VALID [2022-04-27 10:17:03,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {690#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {690#(<= main_~i~0 1)} is VALID [2022-04-27 10:17:03,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {690#(<= main_~i~0 1)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {690#(<= main_~i~0 1)} is VALID [2022-04-27 10:17:03,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {690#(<= main_~i~0 1)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {690#(<= main_~i~0 1)} is VALID [2022-04-27 10:17:03,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {690#(<= main_~i~0 1)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {690#(<= main_~i~0 1)} is VALID [2022-04-27 10:17:03,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {690#(<= main_~i~0 1)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {690#(<= main_~i~0 1)} is VALID [2022-04-27 10:17:03,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {690#(<= main_~i~0 1)} assume !(~j~0 <= ~n~0); {690#(<= main_~i~0 1)} is VALID [2022-04-27 10:17:03,449 INFO L272 TraceCheckUtils]: 25: Hoare triple {690#(<= main_~i~0 1)} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {691#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:17:03,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {691#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {692#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:17:03,450 INFO L290 TraceCheckUtils]: 27: Hoare triple {692#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {681#false} is VALID [2022-04-27 10:17:03,450 INFO L290 TraceCheckUtils]: 28: Hoare triple {681#false} assume !false; {681#false} is VALID [2022-04-27 10:17:03,450 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 10:17:03,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:03,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773595311] [2022-04-27 10:17:03,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773595311] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:17:03,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313305219] [2022-04-27 10:17:03,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:03,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:03,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:03,452 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 10:17:03,486 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 10:17:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:03,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 10:17:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:03,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:17:03,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {680#true} call ULTIMATE.init(); {680#true} is VALID [2022-04-27 10:17:03,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {680#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {680#true} is VALID [2022-04-27 10:17:03,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {680#true} assume true; {680#true} is VALID [2022-04-27 10:17:03,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {680#true} {680#true} #214#return; {680#true} is VALID [2022-04-27 10:17:03,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {680#true} call #t~ret37 := main(); {680#true} is VALID [2022-04-27 10:17:03,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {680#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {712#(<= 5 main_~n~0)} is VALID [2022-04-27 10:17:03,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {712#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {716#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 10:17:03,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {716#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {716#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 10:17:03,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {716#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {716#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 10:17:03,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {716#(and (<= 5 main_~n~0) (<= main_~j~0 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {716#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 10:17:03,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {716#(and (<= 5 main_~n~0) (<= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {729#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:03,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {729#(and (<= 5 main_~n~0) (<= main_~j~0 1))} assume !(~j~0 <= ~n~0); {681#false} is VALID [2022-04-27 10:17:03,671 INFO L272 TraceCheckUtils]: 12: Hoare triple {681#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {681#false} is VALID [2022-04-27 10:17:03,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {681#false} ~cond := #in~cond; {681#false} is VALID [2022-04-27 10:17:03,671 INFO L290 TraceCheckUtils]: 14: Hoare triple {681#false} assume !(0 == ~cond); {681#false} is VALID [2022-04-27 10:17:03,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {681#false} assume true; {681#false} is VALID [2022-04-27 10:17:03,671 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {681#false} {681#false} #210#return; {681#false} is VALID [2022-04-27 10:17:03,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {681#false} call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); {681#false} is VALID [2022-04-27 10:17:03,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {681#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {681#false} is VALID [2022-04-27 10:17:03,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {681#false} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {681#false} is VALID [2022-04-27 10:17:03,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {681#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {681#false} is VALID [2022-04-27 10:17:03,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {681#false} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {681#false} is VALID [2022-04-27 10:17:03,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {681#false} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {681#false} is VALID [2022-04-27 10:17:03,672 INFO L290 TraceCheckUtils]: 23: Hoare triple {681#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {681#false} is VALID [2022-04-27 10:17:03,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {681#false} assume !(~j~0 <= ~n~0); {681#false} is VALID [2022-04-27 10:17:03,673 INFO L272 TraceCheckUtils]: 25: Hoare triple {681#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {681#false} is VALID [2022-04-27 10:17:03,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {681#false} ~cond := #in~cond; {681#false} is VALID [2022-04-27 10:17:03,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {681#false} assume 0 == ~cond; {681#false} is VALID [2022-04-27 10:17:03,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {681#false} assume !false; {681#false} is VALID [2022-04-27 10:17:03,673 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 10:17:03,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:17:03,787 INFO L290 TraceCheckUtils]: 28: Hoare triple {681#false} assume !false; {681#false} is VALID [2022-04-27 10:17:03,787 INFO L290 TraceCheckUtils]: 27: Hoare triple {681#false} assume 0 == ~cond; {681#false} is VALID [2022-04-27 10:17:03,787 INFO L290 TraceCheckUtils]: 26: Hoare triple {681#false} ~cond := #in~cond; {681#false} is VALID [2022-04-27 10:17:03,788 INFO L272 TraceCheckUtils]: 25: Hoare triple {681#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {681#false} is VALID [2022-04-27 10:17:03,788 INFO L290 TraceCheckUtils]: 24: Hoare triple {681#false} assume !(~j~0 <= ~n~0); {681#false} is VALID [2022-04-27 10:17:03,788 INFO L290 TraceCheckUtils]: 23: Hoare triple {681#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {681#false} is VALID [2022-04-27 10:17:03,788 INFO L290 TraceCheckUtils]: 22: Hoare triple {681#false} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {681#false} is VALID [2022-04-27 10:17:03,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {681#false} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {681#false} is VALID [2022-04-27 10:17:03,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {681#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {681#false} is VALID [2022-04-27 10:17:03,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {681#false} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {681#false} is VALID [2022-04-27 10:17:03,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {681#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {681#false} is VALID [2022-04-27 10:17:03,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {681#false} call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); {681#false} is VALID [2022-04-27 10:17:03,789 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {680#true} {681#false} #210#return; {681#false} is VALID [2022-04-27 10:17:03,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {680#true} assume true; {680#true} is VALID [2022-04-27 10:17:03,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {680#true} assume !(0 == ~cond); {680#true} is VALID [2022-04-27 10:17:03,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {680#true} ~cond := #in~cond; {680#true} is VALID [2022-04-27 10:17:03,789 INFO L272 TraceCheckUtils]: 12: Hoare triple {681#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {680#true} is VALID [2022-04-27 10:17:03,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {835#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {681#false} is VALID [2022-04-27 10:17:03,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {839#(<= (+ main_~j~0 1) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {835#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 10:17:03,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {839#(<= (+ main_~j~0 1) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {839#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:17:03,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {839#(<= (+ main_~j~0 1) main_~n~0)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {839#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:17:03,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {839#(<= (+ main_~j~0 1) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {839#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:17:03,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {852#(<= 1 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {839#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:17:03,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {680#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {852#(<= 1 main_~n~0)} is VALID [2022-04-27 10:17:03,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {680#true} call #t~ret37 := main(); {680#true} is VALID [2022-04-27 10:17:03,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {680#true} {680#true} #214#return; {680#true} is VALID [2022-04-27 10:17:03,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {680#true} assume true; {680#true} is VALID [2022-04-27 10:17:03,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {680#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {680#true} is VALID [2022-04-27 10:17:03,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {680#true} call ULTIMATE.init(); {680#true} is VALID [2022-04-27 10:17:03,793 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 10:17:03,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313305219] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:17:03,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:17:03,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2022-04-27 10:17:03,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313529583] [2022-04-27 10:17:03,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:17:03,794 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 10:17:03,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:03,794 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 10:17:03,830 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 10:17:03,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 10:17:03,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:03,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 10:17:03,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-04-27 10:17:03,831 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 10:17:04,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:04,429 INFO L93 Difference]: Finished difference Result 103 states and 130 transitions. [2022-04-27 10:17:04,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-27 10:17:04,429 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 10:17:04,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:04,429 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 10:17:04,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 121 transitions. [2022-04-27 10:17:04,432 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 10:17:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 121 transitions. [2022-04-27 10:17:04,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 121 transitions. [2022-04-27 10:17:04,517 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 10:17:04,519 INFO L225 Difference]: With dead ends: 103 [2022-04-27 10:17:04,519 INFO L226 Difference]: Without dead ends: 83 [2022-04-27 10:17:04,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=223, Invalid=647, Unknown=0, NotChecked=0, Total=870 [2022-04-27 10:17:04,520 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 10:17:04,520 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 10:17:04,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-27 10:17:04,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2022-04-27 10:17:04,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:04,548 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 10:17:04,548 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 10:17:04,548 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 10:17:04,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:04,550 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2022-04-27 10:17:04,550 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2022-04-27 10:17:04,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:04,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:04,551 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 10:17:04,551 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 10:17:04,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:04,553 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2022-04-27 10:17:04,553 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2022-04-27 10:17:04,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:04,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:04,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:04,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:04,554 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 10:17:04,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2022-04-27 10:17:04,556 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 29 [2022-04-27 10:17:04,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:04,556 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2022-04-27 10:17:04,556 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 10:17:04,556 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2022-04-27 10:17:04,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-27 10:17:04,557 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:04,557 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 10:17:04,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 10:17:04,773 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 10:17:04,774 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:04,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:04,774 INFO L85 PathProgramCache]: Analyzing trace with hash -129272829, now seen corresponding path program 1 times [2022-04-27 10:17:04,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:04,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707389973] [2022-04-27 10:17:04,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:04,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:04,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:04,914 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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1321#true} is VALID [2022-04-27 10:17:04,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {1321#true} assume true; {1321#true} is VALID [2022-04-27 10:17:04,915 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1321#true} {1321#true} #214#return; {1321#true} is VALID [2022-04-27 10:17:04,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-27 10:17:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:04,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {1321#true} ~cond := #in~cond; {1321#true} is VALID [2022-04-27 10:17:04,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {1321#true} assume !(0 == ~cond); {1321#true} is VALID [2022-04-27 10:17:04,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {1321#true} assume true; {1321#true} is VALID [2022-04-27 10:17:04,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1321#true} {1326#(= (+ main_~n~0 (- 5)) 0)} #210#return; {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-27 10:17:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:04,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {1321#true} ~cond := #in~cond; {1321#true} is VALID [2022-04-27 10:17:04,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {1321#true} assume !(0 == ~cond); {1321#true} is VALID [2022-04-27 10:17:04,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {1321#true} assume true; {1321#true} is VALID [2022-04-27 10:17:04,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1321#true} {1326#(= (+ main_~n~0 (- 5)) 0)} #210#return; {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {1321#true} call ULTIMATE.init(); {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 10:17:04,923 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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1321#true} is VALID [2022-04-27 10:17:04,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {1321#true} assume true; {1321#true} is VALID [2022-04-27 10:17:04,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1321#true} {1321#true} #214#return; {1321#true} is VALID [2022-04-27 10:17:04,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {1321#true} call #t~ret37 := main(); {1321#true} is VALID [2022-04-27 10:17:04,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {1321#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} assume !(~i~0 == ~j~0); {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,927 INFO L290 TraceCheckUtils]: 15: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,927 INFO L290 TraceCheckUtils]: 16: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} assume !(~i~0 == ~j~0); {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,928 INFO L290 TraceCheckUtils]: 19: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} assume !(~i~0 == ~j~0); {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,929 INFO L290 TraceCheckUtils]: 22: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,930 INFO L290 TraceCheckUtils]: 23: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} assume !(~j~0 <= ~n~0); {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,930 INFO L272 TraceCheckUtils]: 24: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1321#true} is VALID [2022-04-27 10:17:04,930 INFO L290 TraceCheckUtils]: 25: Hoare triple {1321#true} ~cond := #in~cond; {1321#true} is VALID [2022-04-27 10:17:04,930 INFO L290 TraceCheckUtils]: 26: Hoare triple {1321#true} assume !(0 == ~cond); {1321#true} is VALID [2022-04-27 10:17:04,930 INFO L290 TraceCheckUtils]: 27: Hoare triple {1321#true} assume true; {1321#true} is VALID [2022-04-27 10:17:04,931 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1321#true} {1326#(= (+ main_~n~0 (- 5)) 0)} #210#return; {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,931 INFO L290 TraceCheckUtils]: 29: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,931 INFO L290 TraceCheckUtils]: 30: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,932 INFO L290 TraceCheckUtils]: 31: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,932 INFO L290 TraceCheckUtils]: 32: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,933 INFO L290 TraceCheckUtils]: 33: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,933 INFO L290 TraceCheckUtils]: 34: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,933 INFO L290 TraceCheckUtils]: 35: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,934 INFO L290 TraceCheckUtils]: 36: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,934 INFO L290 TraceCheckUtils]: 37: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,934 INFO L290 TraceCheckUtils]: 38: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,935 INFO L290 TraceCheckUtils]: 39: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,935 INFO L290 TraceCheckUtils]: 40: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,935 INFO L290 TraceCheckUtils]: 41: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} assume !(~i~0 == ~j~0); {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,936 INFO L290 TraceCheckUtils]: 42: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,936 INFO L290 TraceCheckUtils]: 43: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,936 INFO L290 TraceCheckUtils]: 44: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,937 INFO L290 TraceCheckUtils]: 45: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} assume !(~i~0 == ~j~0); {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,937 INFO L290 TraceCheckUtils]: 46: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,937 INFO L290 TraceCheckUtils]: 47: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,938 INFO L290 TraceCheckUtils]: 48: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} assume !(~j~0 <= ~n~0); {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,938 INFO L272 TraceCheckUtils]: 49: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1321#true} is VALID [2022-04-27 10:17:04,938 INFO L290 TraceCheckUtils]: 50: Hoare triple {1321#true} ~cond := #in~cond; {1321#true} is VALID [2022-04-27 10:17:04,938 INFO L290 TraceCheckUtils]: 51: Hoare triple {1321#true} assume !(0 == ~cond); {1321#true} is VALID [2022-04-27 10:17:04,938 INFO L290 TraceCheckUtils]: 52: Hoare triple {1321#true} assume true; {1321#true} is VALID [2022-04-27 10:17:04,938 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {1321#true} {1326#(= (+ main_~n~0 (- 5)) 0)} #210#return; {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,939 INFO L290 TraceCheckUtils]: 54: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,939 INFO L290 TraceCheckUtils]: 55: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1326#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,939 INFO L290 TraceCheckUtils]: 56: Hoare triple {1326#(= (+ main_~n~0 (- 5)) 0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:04,940 INFO L290 TraceCheckUtils]: 57: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:04,940 INFO L290 TraceCheckUtils]: 58: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} assume !(~i~0 == ~j~0); {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:04,941 INFO L290 TraceCheckUtils]: 59: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:04,941 INFO L290 TraceCheckUtils]: 60: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:04,941 INFO L290 TraceCheckUtils]: 61: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:04,942 INFO L290 TraceCheckUtils]: 62: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} assume !(~i~0 == ~j~0); {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:04,942 INFO L290 TraceCheckUtils]: 63: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:04,942 INFO L290 TraceCheckUtils]: 64: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:04,943 INFO L290 TraceCheckUtils]: 65: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:04,943 INFO L290 TraceCheckUtils]: 66: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:04,944 INFO L290 TraceCheckUtils]: 67: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:04,944 INFO L290 TraceCheckUtils]: 68: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:04,944 INFO L290 TraceCheckUtils]: 69: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:04,945 INFO L290 TraceCheckUtils]: 70: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:04,945 INFO L290 TraceCheckUtils]: 71: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:04,946 INFO L290 TraceCheckUtils]: 72: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:04,946 INFO L290 TraceCheckUtils]: 73: Hoare triple {1335#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} assume !(~j~0 <= ~n~0); {1336#(<= main_~i~0 5)} is VALID [2022-04-27 10:17:04,946 INFO L272 TraceCheckUtils]: 74: Hoare triple {1336#(<= main_~i~0 5)} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1337#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:17:04,947 INFO L290 TraceCheckUtils]: 75: Hoare triple {1337#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1338#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:17:04,947 INFO L290 TraceCheckUtils]: 76: Hoare triple {1338#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1322#false} is VALID [2022-04-27 10:17:04,947 INFO L290 TraceCheckUtils]: 77: Hoare triple {1322#false} assume !false; {1322#false} is VALID [2022-04-27 10:17:04,948 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 10:17:04,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:04,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707389973] [2022-04-27 10:17:04,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707389973] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:17:04,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700319601] [2022-04-27 10:17:04,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:04,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:04,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:04,949 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 10:17:04,950 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 10:17:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:05,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 10:17:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:05,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:17:05,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {1321#true} call ULTIMATE.init(); {1321#true} is VALID [2022-04-27 10:17:05,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {1321#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1321#true} is VALID [2022-04-27 10:17:05,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {1321#true} assume true; {1321#true} is VALID [2022-04-27 10:17:05,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1321#true} {1321#true} #214#return; {1321#true} is VALID [2022-04-27 10:17:05,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {1321#true} call #t~ret37 := main(); {1321#true} is VALID [2022-04-27 10:17:05,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {1321#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {1358#(<= 5 main_~n~0)} is VALID [2022-04-27 10:17:05,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {1358#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1362#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 10:17:05,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {1362#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1362#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 10:17:05,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {1362#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1362#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 10:17:05,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {1362#(and (<= 5 main_~n~0) (<= main_~j~0 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1362#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 10:17:05,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {1362#(and (<= 5 main_~n~0) (<= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1375#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:05,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {1375#(and (<= 5 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1375#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:05,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {1375#(and (<= 5 main_~n~0) (<= main_~j~0 1))} assume !(~i~0 == ~j~0); {1375#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:05,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {1375#(and (<= 5 main_~n~0) (<= main_~j~0 1))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1375#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:05,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {1375#(and (<= 5 main_~n~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1388#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-27 10:17:05,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {1388#(and (<= 5 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1388#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-27 10:17:05,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {1388#(and (<= 5 main_~n~0) (<= main_~j~0 2))} assume !(~i~0 == ~j~0); {1388#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-27 10:17:05,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {1388#(and (<= 5 main_~n~0) (<= main_~j~0 2))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1388#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-27 10:17:05,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {1388#(and (<= 5 main_~n~0) (<= main_~j~0 2))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1401#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-27 10:17:05,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {1401#(and (<= 5 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1401#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-27 10:17:05,417 INFO L290 TraceCheckUtils]: 20: Hoare triple {1401#(and (<= 5 main_~n~0) (<= main_~j~0 3))} assume !(~i~0 == ~j~0); {1401#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-27 10:17:05,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {1401#(and (<= 5 main_~n~0) (<= main_~j~0 3))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1401#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-27 10:17:05,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {1401#(and (<= 5 main_~n~0) (<= main_~j~0 3))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1414#(and (<= 5 main_~n~0) (<= main_~j~0 4))} is VALID [2022-04-27 10:17:05,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {1414#(and (<= 5 main_~n~0) (<= main_~j~0 4))} assume !(~j~0 <= ~n~0); {1322#false} is VALID [2022-04-27 10:17:05,422 INFO L272 TraceCheckUtils]: 24: Hoare triple {1322#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1322#false} is VALID [2022-04-27 10:17:05,422 INFO L290 TraceCheckUtils]: 25: Hoare triple {1322#false} ~cond := #in~cond; {1322#false} is VALID [2022-04-27 10:17:05,422 INFO L290 TraceCheckUtils]: 26: Hoare triple {1322#false} assume !(0 == ~cond); {1322#false} is VALID [2022-04-27 10:17:05,424 INFO L290 TraceCheckUtils]: 27: Hoare triple {1322#false} assume true; {1322#false} is VALID [2022-04-27 10:17:05,424 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1322#false} {1322#false} #210#return; {1322#false} is VALID [2022-04-27 10:17:05,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {1322#false} call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); {1322#false} is VALID [2022-04-27 10:17:05,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {1322#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1322#false} is VALID [2022-04-27 10:17:05,424 INFO L290 TraceCheckUtils]: 31: Hoare triple {1322#false} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1322#false} is VALID [2022-04-27 10:17:05,424 INFO L290 TraceCheckUtils]: 32: Hoare triple {1322#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1322#false} is VALID [2022-04-27 10:17:05,425 INFO L290 TraceCheckUtils]: 33: Hoare triple {1322#false} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1322#false} is VALID [2022-04-27 10:17:05,425 INFO L290 TraceCheckUtils]: 34: Hoare triple {1322#false} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1322#false} is VALID [2022-04-27 10:17:05,426 INFO L290 TraceCheckUtils]: 35: Hoare triple {1322#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1322#false} is VALID [2022-04-27 10:17:05,426 INFO L290 TraceCheckUtils]: 36: Hoare triple {1322#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1322#false} is VALID [2022-04-27 10:17:05,426 INFO L290 TraceCheckUtils]: 37: Hoare triple {1322#false} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1322#false} is VALID [2022-04-27 10:17:05,426 INFO L290 TraceCheckUtils]: 38: Hoare triple {1322#false} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1322#false} is VALID [2022-04-27 10:17:05,426 INFO L290 TraceCheckUtils]: 39: Hoare triple {1322#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1322#false} is VALID [2022-04-27 10:17:05,426 INFO L290 TraceCheckUtils]: 40: Hoare triple {1322#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1322#false} is VALID [2022-04-27 10:17:05,426 INFO L290 TraceCheckUtils]: 41: Hoare triple {1322#false} assume !(~i~0 == ~j~0); {1322#false} is VALID [2022-04-27 10:17:05,426 INFO L290 TraceCheckUtils]: 42: Hoare triple {1322#false} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1322#false} is VALID [2022-04-27 10:17:05,426 INFO L290 TraceCheckUtils]: 43: Hoare triple {1322#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1322#false} is VALID [2022-04-27 10:17:05,426 INFO L290 TraceCheckUtils]: 44: Hoare triple {1322#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1322#false} is VALID [2022-04-27 10:17:05,430 INFO L290 TraceCheckUtils]: 45: Hoare triple {1322#false} assume !(~i~0 == ~j~0); {1322#false} is VALID [2022-04-27 10:17:05,431 INFO L290 TraceCheckUtils]: 46: Hoare triple {1322#false} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1322#false} is VALID [2022-04-27 10:17:05,431 INFO L290 TraceCheckUtils]: 47: Hoare triple {1322#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1322#false} is VALID [2022-04-27 10:17:05,431 INFO L290 TraceCheckUtils]: 48: Hoare triple {1322#false} assume !(~j~0 <= ~n~0); {1322#false} is VALID [2022-04-27 10:17:05,431 INFO L272 TraceCheckUtils]: 49: Hoare triple {1322#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1322#false} is VALID [2022-04-27 10:17:05,432 INFO L290 TraceCheckUtils]: 50: Hoare triple {1322#false} ~cond := #in~cond; {1322#false} is VALID [2022-04-27 10:17:05,432 INFO L290 TraceCheckUtils]: 51: Hoare triple {1322#false} assume !(0 == ~cond); {1322#false} is VALID [2022-04-27 10:17:05,432 INFO L290 TraceCheckUtils]: 52: Hoare triple {1322#false} assume true; {1322#false} is VALID [2022-04-27 10:17:05,432 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {1322#false} {1322#false} #210#return; {1322#false} is VALID [2022-04-27 10:17:05,432 INFO L290 TraceCheckUtils]: 54: Hoare triple {1322#false} call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); {1322#false} is VALID [2022-04-27 10:17:05,432 INFO L290 TraceCheckUtils]: 55: Hoare triple {1322#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1322#false} is VALID [2022-04-27 10:17:05,432 INFO L290 TraceCheckUtils]: 56: Hoare triple {1322#false} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1322#false} is VALID [2022-04-27 10:17:05,432 INFO L290 TraceCheckUtils]: 57: Hoare triple {1322#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1322#false} is VALID [2022-04-27 10:17:05,433 INFO L290 TraceCheckUtils]: 58: Hoare triple {1322#false} assume !(~i~0 == ~j~0); {1322#false} is VALID [2022-04-27 10:17:05,433 INFO L290 TraceCheckUtils]: 59: Hoare triple {1322#false} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1322#false} is VALID [2022-04-27 10:17:05,433 INFO L290 TraceCheckUtils]: 60: Hoare triple {1322#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1322#false} is VALID [2022-04-27 10:17:05,433 INFO L290 TraceCheckUtils]: 61: Hoare triple {1322#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1322#false} is VALID [2022-04-27 10:17:05,433 INFO L290 TraceCheckUtils]: 62: Hoare triple {1322#false} assume !(~i~0 == ~j~0); {1322#false} is VALID [2022-04-27 10:17:05,447 INFO L290 TraceCheckUtils]: 63: Hoare triple {1322#false} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1322#false} is VALID [2022-04-27 10:17:05,447 INFO L290 TraceCheckUtils]: 64: Hoare triple {1322#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1322#false} is VALID [2022-04-27 10:17:05,447 INFO L290 TraceCheckUtils]: 65: Hoare triple {1322#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1322#false} is VALID [2022-04-27 10:17:05,447 INFO L290 TraceCheckUtils]: 66: Hoare triple {1322#false} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1322#false} is VALID [2022-04-27 10:17:05,447 INFO L290 TraceCheckUtils]: 67: Hoare triple {1322#false} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1322#false} is VALID [2022-04-27 10:17:05,447 INFO L290 TraceCheckUtils]: 68: Hoare triple {1322#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1322#false} is VALID [2022-04-27 10:17:05,448 INFO L290 TraceCheckUtils]: 69: Hoare triple {1322#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1322#false} is VALID [2022-04-27 10:17:05,448 INFO L290 TraceCheckUtils]: 70: Hoare triple {1322#false} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1322#false} is VALID [2022-04-27 10:17:05,448 INFO L290 TraceCheckUtils]: 71: Hoare triple {1322#false} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1322#false} is VALID [2022-04-27 10:17:05,448 INFO L290 TraceCheckUtils]: 72: Hoare triple {1322#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1322#false} is VALID [2022-04-27 10:17:05,448 INFO L290 TraceCheckUtils]: 73: Hoare triple {1322#false} assume !(~j~0 <= ~n~0); {1322#false} is VALID [2022-04-27 10:17:05,448 INFO L272 TraceCheckUtils]: 74: Hoare triple {1322#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1322#false} is VALID [2022-04-27 10:17:05,448 INFO L290 TraceCheckUtils]: 75: Hoare triple {1322#false} ~cond := #in~cond; {1322#false} is VALID [2022-04-27 10:17:05,448 INFO L290 TraceCheckUtils]: 76: Hoare triple {1322#false} assume 0 == ~cond; {1322#false} is VALID [2022-04-27 10:17:05,448 INFO L290 TraceCheckUtils]: 77: Hoare triple {1322#false} assume !false; {1322#false} is VALID [2022-04-27 10:17:05,450 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 10:17:05,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:17:05,767 INFO L290 TraceCheckUtils]: 77: Hoare triple {1322#false} assume !false; {1322#false} is VALID [2022-04-27 10:17:05,767 INFO L290 TraceCheckUtils]: 76: Hoare triple {1322#false} assume 0 == ~cond; {1322#false} is VALID [2022-04-27 10:17:05,767 INFO L290 TraceCheckUtils]: 75: Hoare triple {1322#false} ~cond := #in~cond; {1322#false} is VALID [2022-04-27 10:17:05,767 INFO L272 TraceCheckUtils]: 74: Hoare triple {1322#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1322#false} is VALID [2022-04-27 10:17:05,767 INFO L290 TraceCheckUtils]: 73: Hoare triple {1322#false} assume !(~j~0 <= ~n~0); {1322#false} is VALID [2022-04-27 10:17:05,767 INFO L290 TraceCheckUtils]: 72: Hoare triple {1322#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1322#false} is VALID [2022-04-27 10:17:05,767 INFO L290 TraceCheckUtils]: 71: Hoare triple {1322#false} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1322#false} is VALID [2022-04-27 10:17:05,768 INFO L290 TraceCheckUtils]: 70: Hoare triple {1322#false} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1322#false} is VALID [2022-04-27 10:17:05,768 INFO L290 TraceCheckUtils]: 69: Hoare triple {1322#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1322#false} is VALID [2022-04-27 10:17:05,768 INFO L290 TraceCheckUtils]: 68: Hoare triple {1322#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1322#false} is VALID [2022-04-27 10:17:05,768 INFO L290 TraceCheckUtils]: 67: Hoare triple {1322#false} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1322#false} is VALID [2022-04-27 10:17:05,768 INFO L290 TraceCheckUtils]: 66: Hoare triple {1322#false} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1322#false} is VALID [2022-04-27 10:17:05,768 INFO L290 TraceCheckUtils]: 65: Hoare triple {1322#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1322#false} is VALID [2022-04-27 10:17:05,768 INFO L290 TraceCheckUtils]: 64: Hoare triple {1322#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1322#false} is VALID [2022-04-27 10:17:05,768 INFO L290 TraceCheckUtils]: 63: Hoare triple {1322#false} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1322#false} is VALID [2022-04-27 10:17:05,768 INFO L290 TraceCheckUtils]: 62: Hoare triple {1322#false} assume !(~i~0 == ~j~0); {1322#false} is VALID [2022-04-27 10:17:05,768 INFO L290 TraceCheckUtils]: 61: Hoare triple {1322#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1322#false} is VALID [2022-04-27 10:17:05,768 INFO L290 TraceCheckUtils]: 60: Hoare triple {1322#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1322#false} is VALID [2022-04-27 10:17:05,768 INFO L290 TraceCheckUtils]: 59: Hoare triple {1322#false} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1322#false} is VALID [2022-04-27 10:17:05,768 INFO L290 TraceCheckUtils]: 58: Hoare triple {1322#false} assume !(~i~0 == ~j~0); {1322#false} is VALID [2022-04-27 10:17:05,768 INFO L290 TraceCheckUtils]: 57: Hoare triple {1322#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1322#false} is VALID [2022-04-27 10:17:05,769 INFO L290 TraceCheckUtils]: 56: Hoare triple {1322#false} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1322#false} is VALID [2022-04-27 10:17:05,769 INFO L290 TraceCheckUtils]: 55: Hoare triple {1322#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1322#false} is VALID [2022-04-27 10:17:05,769 INFO L290 TraceCheckUtils]: 54: Hoare triple {1322#false} call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); {1322#false} is VALID [2022-04-27 10:17:05,769 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {1321#true} {1322#false} #210#return; {1322#false} is VALID [2022-04-27 10:17:05,769 INFO L290 TraceCheckUtils]: 52: Hoare triple {1321#true} assume true; {1321#true} is VALID [2022-04-27 10:17:05,769 INFO L290 TraceCheckUtils]: 51: Hoare triple {1321#true} assume !(0 == ~cond); {1321#true} is VALID [2022-04-27 10:17:05,769 INFO L290 TraceCheckUtils]: 50: Hoare triple {1321#true} ~cond := #in~cond; {1321#true} is VALID [2022-04-27 10:17:05,769 INFO L272 TraceCheckUtils]: 49: Hoare triple {1322#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1321#true} is VALID [2022-04-27 10:17:05,769 INFO L290 TraceCheckUtils]: 48: Hoare triple {1322#false} assume !(~j~0 <= ~n~0); {1322#false} is VALID [2022-04-27 10:17:05,769 INFO L290 TraceCheckUtils]: 47: Hoare triple {1322#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1322#false} is VALID [2022-04-27 10:17:05,769 INFO L290 TraceCheckUtils]: 46: Hoare triple {1322#false} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1322#false} is VALID [2022-04-27 10:17:05,769 INFO L290 TraceCheckUtils]: 45: Hoare triple {1322#false} assume !(~i~0 == ~j~0); {1322#false} is VALID [2022-04-27 10:17:05,769 INFO L290 TraceCheckUtils]: 44: Hoare triple {1322#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1322#false} is VALID [2022-04-27 10:17:05,769 INFO L290 TraceCheckUtils]: 43: Hoare triple {1322#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1322#false} is VALID [2022-04-27 10:17:05,770 INFO L290 TraceCheckUtils]: 42: Hoare triple {1322#false} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1322#false} is VALID [2022-04-27 10:17:05,770 INFO L290 TraceCheckUtils]: 41: Hoare triple {1322#false} assume !(~i~0 == ~j~0); {1322#false} is VALID [2022-04-27 10:17:05,770 INFO L290 TraceCheckUtils]: 40: Hoare triple {1322#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1322#false} is VALID [2022-04-27 10:17:05,770 INFO L290 TraceCheckUtils]: 39: Hoare triple {1322#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1322#false} is VALID [2022-04-27 10:17:05,770 INFO L290 TraceCheckUtils]: 38: Hoare triple {1322#false} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1322#false} is VALID [2022-04-27 10:17:05,770 INFO L290 TraceCheckUtils]: 37: Hoare triple {1322#false} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1322#false} is VALID [2022-04-27 10:17:05,770 INFO L290 TraceCheckUtils]: 36: Hoare triple {1322#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1322#false} is VALID [2022-04-27 10:17:05,770 INFO L290 TraceCheckUtils]: 35: Hoare triple {1322#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1322#false} is VALID [2022-04-27 10:17:05,770 INFO L290 TraceCheckUtils]: 34: Hoare triple {1322#false} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1322#false} is VALID [2022-04-27 10:17:05,770 INFO L290 TraceCheckUtils]: 33: Hoare triple {1322#false} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1322#false} is VALID [2022-04-27 10:17:05,770 INFO L290 TraceCheckUtils]: 32: Hoare triple {1322#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1322#false} is VALID [2022-04-27 10:17:05,770 INFO L290 TraceCheckUtils]: 31: Hoare triple {1322#false} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1322#false} is VALID [2022-04-27 10:17:05,770 INFO L290 TraceCheckUtils]: 30: Hoare triple {1322#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1322#false} is VALID [2022-04-27 10:17:05,770 INFO L290 TraceCheckUtils]: 29: Hoare triple {1322#false} call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); {1322#false} is VALID [2022-04-27 10:17:05,770 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1321#true} {1322#false} #210#return; {1322#false} is VALID [2022-04-27 10:17:05,771 INFO L290 TraceCheckUtils]: 27: Hoare triple {1321#true} assume true; {1321#true} is VALID [2022-04-27 10:17:05,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {1321#true} assume !(0 == ~cond); {1321#true} is VALID [2022-04-27 10:17:05,771 INFO L290 TraceCheckUtils]: 25: Hoare triple {1321#true} ~cond := #in~cond; {1321#true} is VALID [2022-04-27 10:17:05,771 INFO L272 TraceCheckUtils]: 24: Hoare triple {1322#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1321#true} is VALID [2022-04-27 10:17:05,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {1742#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {1322#false} is VALID [2022-04-27 10:17:05,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {1746#(<= (+ main_~j~0 1) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1742#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 10:17:05,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {1746#(<= (+ main_~j~0 1) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1746#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:17:05,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {1746#(<= (+ main_~j~0 1) main_~n~0)} assume !(~i~0 == ~j~0); {1746#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:17:05,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {1746#(<= (+ main_~j~0 1) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1746#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:17:05,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {1759#(<= (+ main_~j~0 2) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1746#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:17:05,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {1759#(<= (+ main_~j~0 2) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1759#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:17:05,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {1759#(<= (+ main_~j~0 2) main_~n~0)} assume !(~i~0 == ~j~0); {1759#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:17:05,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {1759#(<= (+ main_~j~0 2) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1759#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:17:05,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {1772#(<= (+ main_~j~0 3) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1759#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:17:05,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {1772#(<= (+ main_~j~0 3) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1772#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-27 10:17:05,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {1772#(<= (+ main_~j~0 3) main_~n~0)} assume !(~i~0 == ~j~0); {1772#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-27 10:17:05,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {1772#(<= (+ main_~j~0 3) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1772#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-27 10:17:05,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {1785#(<= (+ main_~j~0 4) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1772#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-27 10:17:05,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {1785#(<= (+ main_~j~0 4) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1785#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-27 10:17:05,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {1785#(<= (+ main_~j~0 4) main_~n~0)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1785#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-27 10:17:05,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {1785#(<= (+ main_~j~0 4) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1785#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-27 10:17:05,780 INFO L290 TraceCheckUtils]: 6: Hoare triple {1798#(<= 4 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1785#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-27 10:17:05,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {1321#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {1798#(<= 4 main_~n~0)} is VALID [2022-04-27 10:17:05,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {1321#true} call #t~ret37 := main(); {1321#true} is VALID [2022-04-27 10:17:05,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1321#true} {1321#true} #214#return; {1321#true} is VALID [2022-04-27 10:17:05,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {1321#true} assume true; {1321#true} is VALID [2022-04-27 10:17:05,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {1321#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1321#true} is VALID [2022-04-27 10:17:05,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {1321#true} call ULTIMATE.init(); {1321#true} is VALID [2022-04-27 10:17:05,781 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 10:17:05,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700319601] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:17:05,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:17:05,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-04-27 10:17:05,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052852781] [2022-04-27 10:17:05,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:17:05,782 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 10:17:05,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:05,784 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 10:17:05,836 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 10:17:05,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 10:17:05,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:05,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 10:17:05,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2022-04-27 10:17:05,837 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 10:17:06,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:06,410 INFO L93 Difference]: Finished difference Result 227 states and 275 transitions. [2022-04-27 10:17:06,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 10:17:06,410 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 10:17:06,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:06,410 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 10:17:06,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 67 transitions. [2022-04-27 10:17:06,412 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 10:17:06,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 67 transitions. [2022-04-27 10:17:06,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 67 transitions. [2022-04-27 10:17:06,461 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 10:17:06,461 INFO L225 Difference]: With dead ends: 227 [2022-04-27 10:17:06,461 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:17:06,462 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 10:17:06,463 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 10:17:06,463 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 10:17:06,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:17:06,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:17:06,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:06,463 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 10:17:06,464 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 10:17:06,464 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 10:17:06,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:06,464 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:17:06,464 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:17:06,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:06,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:06,464 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 10:17:06,464 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 10:17:06,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:06,464 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:17:06,464 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:17:06,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:06,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:06,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:06,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:06,465 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 10:17:06,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:17:06,465 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2022-04-27 10:17:06,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:06,465 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:17:06,465 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 10:17:06,465 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:17:06,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:06,467 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:17:06,494 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 10:17:06,683 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 10:17:06,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:17:06,945 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-27 10:17:06,946 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-27 10:17:06,946 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-27 10:17:06,946 INFO L899 garLoopResultBuilder]: For program point L118-2(lines 118 136) no Hoare annotation was computed. [2022-04-27 10:17:06,946 INFO L902 garLoopResultBuilder]: At program point L118-3(lines 118 136) the Hoare annotation is: true [2022-04-27 10:17:06,946 INFO L899 garLoopResultBuilder]: For program point L118-4(lines 118 136) no Hoare annotation was computed. [2022-04-27 10:17:06,946 INFO L902 garLoopResultBuilder]: At program point L120(line 120) the Hoare annotation is: true [2022-04-27 10:17:06,946 INFO L899 garLoopResultBuilder]: For program point L120-1(line 120) no Hoare annotation was computed. [2022-04-27 10:17:06,946 INFO L899 garLoopResultBuilder]: For program point ludcmpEXIT(lines 111 155) no Hoare annotation was computed. [2022-04-27 10:17:06,946 INFO L895 garLoopResultBuilder]: At program point ludcmpENTRY(lines 111 155) the Hoare annotation is: (= |old(#memory_real)| |#memory_real|) [2022-04-27 10:17:06,946 INFO L899 garLoopResultBuilder]: For program point L129-2(lines 129 135) no Hoare annotation was computed. [2022-04-27 10:17:06,946 INFO L902 garLoopResultBuilder]: At program point L129-3(lines 129 135) the Hoare annotation is: true [2022-04-27 10:17:06,946 INFO L899 garLoopResultBuilder]: For program point L121-2(lines 121 128) no Hoare annotation was computed. [2022-04-27 10:17:06,946 INFO L902 garLoopResultBuilder]: At program point L121-3(lines 121 128) the Hoare annotation is: true [2022-04-27 10:17:06,946 INFO L899 garLoopResultBuilder]: For program point L121-4(lines 121 128) no Hoare annotation was computed. [2022-04-27 10:17:06,946 INFO L899 garLoopResultBuilder]: For program point L146-2(lines 146 152) no Hoare annotation was computed. [2022-04-27 10:17:06,947 INFO L902 garLoopResultBuilder]: At program point L146-3(lines 146 152) the Hoare annotation is: true [2022-04-27 10:17:06,947 INFO L899 garLoopResultBuilder]: For program point L146-4(lines 146 152) no Hoare annotation was computed. [2022-04-27 10:17:06,947 INFO L899 garLoopResultBuilder]: For program point ludcmpFINAL(lines 111 155) no Hoare annotation was computed. [2022-04-27 10:17:06,947 INFO L899 garLoopResultBuilder]: For program point L138-2(lines 138 144) no Hoare annotation was computed. [2022-04-27 10:17:06,947 INFO L902 garLoopResultBuilder]: At program point L138-3(lines 138 144) the Hoare annotation is: true [2022-04-27 10:17:06,947 INFO L899 garLoopResultBuilder]: For program point L138-4(lines 138 144) no Hoare annotation was computed. [2022-04-27 10:17:06,947 INFO L899 garLoopResultBuilder]: For program point L132-2(lines 132 133) no Hoare annotation was computed. [2022-04-27 10:17:06,947 INFO L902 garLoopResultBuilder]: At program point L132-3(lines 132 133) the Hoare annotation is: true [2022-04-27 10:17:06,947 INFO L899 garLoopResultBuilder]: For program point L132-4(lines 132 133) no Hoare annotation was computed. [2022-04-27 10:17:06,947 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 126) no Hoare annotation was computed. [2022-04-27 10:17:06,947 INFO L899 garLoopResultBuilder]: For program point L124-1(lines 124 126) no Hoare annotation was computed. [2022-04-27 10:17:06,948 INFO L899 garLoopResultBuilder]: For program point L149-2(lines 149 150) no Hoare annotation was computed. [2022-04-27 10:17:06,948 INFO L902 garLoopResultBuilder]: At program point L149-3(lines 149 150) the Hoare annotation is: true [2022-04-27 10:17:06,948 INFO L899 garLoopResultBuilder]: For program point L149-4(lines 149 150) no Hoare annotation was computed. [2022-04-27 10:17:06,948 INFO L899 garLoopResultBuilder]: For program point L141-2(lines 141 142) no Hoare annotation was computed. [2022-04-27 10:17:06,948 INFO L902 garLoopResultBuilder]: At program point L141-3(lines 141 142) the Hoare annotation is: true [2022-04-27 10:17:06,948 INFO L899 garLoopResultBuilder]: For program point L141-4(lines 141 142) no Hoare annotation was computed. [2022-04-27 10:17:06,948 INFO L899 garLoopResultBuilder]: For program point L125-2(lines 125 126) no Hoare annotation was computed. [2022-04-27 10:17:06,948 INFO L902 garLoopResultBuilder]: At program point L125-3(lines 125 126) the Hoare annotation is: true [2022-04-27 10:17:06,948 INFO L899 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2022-04-27 10:17:06,948 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 81) no Hoare annotation was computed. [2022-04-27 10:17:06,948 INFO L899 garLoopResultBuilder]: For program point L80-2(lines 80 81) no Hoare annotation was computed. [2022-04-27 10:17:06,948 INFO L899 garLoopResultBuilder]: For program point fabsEXIT(lines 76 83) no Hoare annotation was computed. [2022-04-27 10:17:06,948 INFO L902 garLoopResultBuilder]: At program point fabsENTRY(lines 76 83) the Hoare annotation is: true [2022-04-27 10:17:06,948 INFO L899 garLoopResultBuilder]: For program point fabsFINAL(lines 76 83) no Hoare annotation was computed. [2022-04-27 10:17:06,948 INFO L899 garLoopResultBuilder]: For program point L99-2(line 99) no Hoare annotation was computed. [2022-04-27 10:17:06,948 INFO L899 garLoopResultBuilder]: For program point L93-2(lines 93 104) no Hoare annotation was computed. [2022-04-27 10:17:06,948 INFO L895 garLoopResultBuilder]: At program point L93-3(lines 93 104) the Hoare annotation is: (= 5 main_~n~0) [2022-04-27 10:17:06,948 INFO L902 garLoopResultBuilder]: At program point L93-4(lines 93 104) the Hoare annotation is: true [2022-04-27 10:17:06,948 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 85 109) no Hoare annotation was computed. [2022-04-27 10:17:06,948 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 85 109) no Hoare annotation was computed. [2022-04-27 10:17:06,949 INFO L899 garLoopResultBuilder]: For program point L106(line 106) no Hoare annotation was computed. [2022-04-27 10:17:06,949 INFO L899 garLoopResultBuilder]: For program point L102(line 102) no Hoare annotation was computed. [2022-04-27 10:17:06,949 INFO L899 garLoopResultBuilder]: For program point L96-2(lines 96 101) no Hoare annotation was computed. [2022-04-27 10:17:06,949 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 85 109) the Hoare annotation is: (= |old(#memory_real)| |#memory_real|) [2022-04-27 10:17:06,949 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 10:17:06,949 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 10:17:06,949 INFO L899 garLoopResultBuilder]: For program point L99(line 99) no Hoare annotation was computed. [2022-04-27 10:17:06,949 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:17:06,949 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 10:17:06,949 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:17:06,949 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:17:06,949 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:17:06,949 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:17:06,949 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:17:06,949 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-27 10:17:06,949 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2022-04-27 10:17:06,949 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-27 10:17:06,949 INFO L899 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2022-04-27 10:17:06,949 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2022-04-27 10:17:06,950 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2022-04-27 10:17:06,952 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-27 10:17:06,953 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:17:06,955 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:17:06,955 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-27 10:17:06,955 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:17:06,955 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-04-27 10:17:06,961 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 10:17:06,961 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 10:17:06,961 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-27 10:17:06,961 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-27 10:17:06,961 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:17:06,961 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-04-27 10:17:06,961 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-04-27 10:17:06,961 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:17:06,962 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 10:17:06,962 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 10:17:06,962 WARN L170 areAnnotationChecker]: ludcmpFINAL has no Hoare annotation [2022-04-27 10:17:06,962 WARN L170 areAnnotationChecker]: L118-4 has no Hoare annotation [2022-04-27 10:17:06,962 WARN L170 areAnnotationChecker]: L118-4 has no Hoare annotation [2022-04-27 10:17:06,962 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:17:06,962 WARN L170 areAnnotationChecker]: L80-2 has no Hoare annotation [2022-04-27 10:17:06,962 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:17:06,962 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2022-04-27 10:17:06,964 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-04-27 10:17:06,964 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:17:06,964 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:17:06,964 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-27 10:17:06,964 WARN L170 areAnnotationChecker]: ludcmpEXIT has no Hoare annotation [2022-04-27 10:17:06,964 WARN L170 areAnnotationChecker]: L118-4 has no Hoare annotation [2022-04-27 10:17:06,964 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2022-04-27 10:17:06,964 WARN L170 areAnnotationChecker]: fabsFINAL has no Hoare annotation [2022-04-27 10:17:06,964 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2022-04-27 10:17:06,964 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-04-27 10:17:06,964 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-04-27 10:17:06,964 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-04-27 10:17:06,964 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:17:06,964 WARN L170 areAnnotationChecker]: L138-4 has no Hoare annotation [2022-04-27 10:17:06,964 WARN L170 areAnnotationChecker]: L138-4 has no Hoare annotation [2022-04-27 10:17:06,964 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2022-04-27 10:17:06,964 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2022-04-27 10:17:06,965 WARN L170 areAnnotationChecker]: fabsEXIT has no Hoare annotation [2022-04-27 10:17:06,965 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:17:06,965 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-04-27 10:17:06,965 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-04-27 10:17:06,965 WARN L170 areAnnotationChecker]: L138-4 has no Hoare annotation [2022-04-27 10:17:06,965 WARN L170 areAnnotationChecker]: L141-4 has no Hoare annotation [2022-04-27 10:17:06,965 WARN L170 areAnnotationChecker]: L141-4 has no Hoare annotation [2022-04-27 10:17:06,965 WARN L170 areAnnotationChecker]: L141-2 has no Hoare annotation [2022-04-27 10:17:06,965 WARN L170 areAnnotationChecker]: L121-4 has no Hoare annotation [2022-04-27 10:17:06,965 WARN L170 areAnnotationChecker]: L121-4 has no Hoare annotation [2022-04-27 10:17:06,965 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-04-27 10:17:06,965 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:17:06,965 WARN L170 areAnnotationChecker]: L93-2 has no Hoare annotation [2022-04-27 10:17:06,965 WARN L170 areAnnotationChecker]: L96-2 has no Hoare annotation [2022-04-27 10:17:06,965 WARN L170 areAnnotationChecker]: L146-4 has no Hoare annotation [2022-04-27 10:17:06,965 WARN L170 areAnnotationChecker]: L146-4 has no Hoare annotation [2022-04-27 10:17:06,965 WARN L170 areAnnotationChecker]: L141-4 has no Hoare annotation [2022-04-27 10:17:06,965 WARN L170 areAnnotationChecker]: L141-2 has no Hoare annotation [2022-04-27 10:17:06,965 WARN L170 areAnnotationChecker]: L121-4 has no Hoare annotation [2022-04-27 10:17:06,965 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-04-27 10:17:06,965 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-04-27 10:17:06,965 WARN L170 areAnnotationChecker]: L146-4 has no Hoare annotation [2022-04-27 10:17:06,965 WARN L170 areAnnotationChecker]: L149-4 has no Hoare annotation [2022-04-27 10:17:06,965 WARN L170 areAnnotationChecker]: L149-4 has no Hoare annotation [2022-04-27 10:17:06,965 WARN L170 areAnnotationChecker]: L149-2 has no Hoare annotation [2022-04-27 10:17:06,965 WARN L170 areAnnotationChecker]: L138-2 has no Hoare annotation [2022-04-27 10:17:06,966 WARN L170 areAnnotationChecker]: L118-2 has no Hoare annotation [2022-04-27 10:17:06,966 WARN L170 areAnnotationChecker]: L118-2 has no Hoare annotation [2022-04-27 10:17:06,966 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-04-27 10:17:06,966 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-04-27 10:17:06,966 WARN L170 areAnnotationChecker]: L125-2 has no Hoare annotation [2022-04-27 10:17:06,966 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-04-27 10:17:06,966 WARN L170 areAnnotationChecker]: L149-4 has no Hoare annotation [2022-04-27 10:17:06,966 WARN L170 areAnnotationChecker]: L149-2 has no Hoare annotation [2022-04-27 10:17:06,966 WARN L170 areAnnotationChecker]: L118-2 has no Hoare annotation [2022-04-27 10:17:06,966 WARN L170 areAnnotationChecker]: L132-4 has no Hoare annotation [2022-04-27 10:17:06,966 WARN L170 areAnnotationChecker]: L132-4 has no Hoare annotation [2022-04-27 10:17:06,966 WARN L170 areAnnotationChecker]: L132-2 has no Hoare annotation [2022-04-27 10:17:06,966 WARN L170 areAnnotationChecker]: L125-2 has no Hoare annotation [2022-04-27 10:17:06,966 WARN L170 areAnnotationChecker]: L121-2 has no Hoare annotation [2022-04-27 10:17:06,966 WARN L170 areAnnotationChecker]: L146-2 has no Hoare annotation [2022-04-27 10:17:06,966 WARN L170 areAnnotationChecker]: L132-4 has no Hoare annotation [2022-04-27 10:17:06,966 WARN L170 areAnnotationChecker]: L132-2 has no Hoare annotation [2022-04-27 10:17:06,966 WARN L170 areAnnotationChecker]: L129-2 has no Hoare annotation [2022-04-27 10:17:06,966 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 10:17:06,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:17:06 BoogieIcfgContainer [2022-04-27 10:17:06,973 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:17:06,974 INFO L158 Benchmark]: Toolchain (without parser) took 5927.45ms. Allocated memory was 194.0MB in the beginning and 275.8MB in the end (delta: 81.8MB). Free memory was 142.1MB in the beginning and 233.6MB in the end (delta: -91.5MB). Peak memory consumption was 135.0MB. Max. memory is 8.0GB. [2022-04-27 10:17:06,974 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 194.0MB. Free memory is still 158.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:17:06,974 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.03ms. Allocated memory is still 194.0MB. Free memory was 141.8MB in the beginning and 163.7MB in the end (delta: -21.8MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2022-04-27 10:17:06,974 INFO L158 Benchmark]: Boogie Preprocessor took 63.21ms. Allocated memory is still 194.0MB. Free memory was 163.7MB in the beginning and 161.2MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-27 10:17:06,974 INFO L158 Benchmark]: RCFGBuilder took 425.75ms. Allocated memory is still 194.0MB. Free memory was 161.2MB in the beginning and 141.6MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-04-27 10:17:06,974 INFO L158 Benchmark]: TraceAbstraction took 5110.90ms. Allocated memory was 194.0MB in the beginning and 275.8MB in the end (delta: 81.8MB). Free memory was 140.9MB in the beginning and 233.6MB in the end (delta: -92.8MB). Peak memory consumption was 134.3MB. Max. memory is 8.0GB. [2022-04-27 10:17:06,975 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.09ms. Allocated memory is still 194.0MB. Free memory is still 158.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 324.03ms. Allocated memory is still 194.0MB. Free memory was 141.8MB in the beginning and 163.7MB in the end (delta: -21.8MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 63.21ms. Allocated memory is still 194.0MB. Free memory was 163.7MB in the beginning and 161.2MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 425.75ms. Allocated memory is still 194.0MB. Free memory was 161.2MB in the beginning and 141.6MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 5110.90ms. Allocated memory was 194.0MB in the beginning and 275.8MB in the end (delta: 81.8MB). Free memory was 140.9MB in the beginning and 233.6MB in the end (delta: -92.8MB). Peak memory consumption was 134.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 7 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 5, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 313 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 307 mSDsluCounter, 238 SdHoareTripleChecker+Invalid, 0.5s 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.2s HoareSimplificationTime, 21 FomulaSimplificationsInter, 489 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s 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: 125]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 5 == n - 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: 132]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 149]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-04-27 10:17:06,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...