./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/lu.cmp.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/lu.cmp.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9f7b9e2e2452a973cdb1a73a9c368f26d19387c763b2be4ad10c01e7a31f6598 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:59:21,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:59:22,000 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:59:22,035 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:59:22,036 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:59:22,038 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:59:22,039 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:59:22,041 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:59:22,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:59:22,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:59:22,047 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:59:22,048 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:59:22,048 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:59:22,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:59:22,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:59:22,053 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:59:22,054 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:59:22,055 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:59:22,056 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:59:22,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:59:22,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:59:22,062 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:59:22,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:59:22,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:59:22,069 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:59:22,070 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:59:22,070 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:59:22,071 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:59:22,072 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:59:22,072 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:59:22,072 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:59:22,073 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:59:22,075 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:59:22,075 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:59:22,076 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:59:22,077 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:59:22,078 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:59:22,078 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:59:22,078 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:59:22,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:59:22,079 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:59:22,080 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:59:22,108 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:59:22,108 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:59:22,109 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:59:22,109 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:59:22,109 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:59:22,110 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:59:22,110 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:59:22,110 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:59:22,110 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:59:22,111 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:59:22,111 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:59:22,111 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:59:22,112 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:59:22,112 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:59:22,112 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:59:22,112 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:59:22,112 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:59:22,112 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:59:22,112 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:59:22,113 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:59:22,113 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:59:22,113 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:59:22,113 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:59:22,113 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:59:22,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:59:22,114 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:59:22,114 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:59:22,115 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:59:22,115 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:59:22,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:59:22,115 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:59:22,115 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:59:22,116 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:59:22,116 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9f7b9e2e2452a973cdb1a73a9c368f26d19387c763b2be4ad10c01e7a31f6598 [2022-02-20 16:59:22,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:59:22,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:59:22,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:59:22,358 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:59:22,359 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:59:22,360 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/lu.cmp.c [2022-02-20 16:59:22,403 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0077fe5f1/1ae9154507de412da53a942a1c451f69/FLAG69ee5160b [2022-02-20 16:59:22,773 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:59:22,779 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/lu.cmp.c [2022-02-20 16:59:22,784 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0077fe5f1/1ae9154507de412da53a942a1c451f69/FLAG69ee5160b [2022-02-20 16:59:23,194 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0077fe5f1/1ae9154507de412da53a942a1c451f69 [2022-02-20 16:59:23,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:59:23,197 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:59:23,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:59:23,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:59:23,210 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:59:23,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:59:23" (1/1) ... [2022-02-20 16:59:23,213 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b29f718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:23, skipping insertion in model container [2022-02-20 16:59:23,213 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:59:23" (1/1) ... [2022-02-20 16:59:23,217 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:59:23,238 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:59:23,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/lu.cmp.c[318,331] [2022-02-20 16:59:23,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:59:23,438 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:59:23,447 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/lu.cmp.c[318,331] [2022-02-20 16:59:23,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:59:23,492 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:59:23,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:23 WrapperNode [2022-02-20 16:59:23,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:59:23,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:59:23,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:59:23,494 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:59:23,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:23" (1/1) ... [2022-02-20 16:59:23,513 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:23" (1/1) ... [2022-02-20 16:59:23,546 INFO L137 Inliner]: procedures = 17, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 224 [2022-02-20 16:59:23,547 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:59:23,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:59:23,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:59:23,548 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:59:23,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:23" (1/1) ... [2022-02-20 16:59:23,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:23" (1/1) ... [2022-02-20 16:59:23,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:23" (1/1) ... [2022-02-20 16:59:23,568 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:23" (1/1) ... [2022-02-20 16:59:23,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:23" (1/1) ... [2022-02-20 16:59:23,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:23" (1/1) ... [2022-02-20 16:59:23,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:23" (1/1) ... [2022-02-20 16:59:23,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:59:23,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:59:23,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:59:23,604 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:59:23,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:23" (1/1) ... [2022-02-20 16:59:23,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:59:23,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:59:23,661 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-02-20 16:59:23,694 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-02-20 16:59:23,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:59:23,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:59:23,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:59:23,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:59:23,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:59:23,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:59:23,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:59:23,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:59:23,798 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:59:23,799 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:59:24,120 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:59:24,124 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:59:24,125 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-02-20 16:59:24,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:59:24 BoogieIcfgContainer [2022-02-20 16:59:24,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:59:24,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:59:24,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:59:24,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:59:24,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:59:23" (1/3) ... [2022-02-20 16:59:24,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7a3cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:59:24, skipping insertion in model container [2022-02-20 16:59:24,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:23" (2/3) ... [2022-02-20 16:59:24,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7a3cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:59:24, skipping insertion in model container [2022-02-20 16:59:24,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:59:24" (3/3) ... [2022-02-20 16:59:24,136 INFO L111 eAbstractionObserver]: Analyzing ICFG lu.cmp.c [2022-02-20 16:59:24,149 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:59:24,150 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:59:24,182 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:59:24,195 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:59:24,195 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:59:24,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 49 states have internal predecessors, (77), 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-02-20 16:59:24,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 16:59:24,210 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:24,211 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:24,211 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:24,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:24,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1809811384, now seen corresponding path program 1 times [2022-02-20 16:59:24,227 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:24,227 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779578469] [2022-02-20 16:59:24,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:24,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:24,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {53#true} assume { :begin_inline_ULTIMATE.init } 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); {53#true} is VALID [2022-02-20 16:59:24,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {53#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~post4#1, main_#t~ret8#1, main_~i~0#1, main_~j~0#1, main_~nmax~0#1, main_~n~0#1, main_~chkerr~0#1, main_~eps~0#1, main_~w~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~nmax~0#1 := 50;main_~n~0#1 := 5;havoc main_~chkerr~0#1;havoc main_~eps~0#1;havoc main_~w~0#1;main_~eps~0#1 := 1.0E-6;main_~i~0#1 := 0; {55#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:24,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {55#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume !!(main_~i~0#1 <= main_~n~0#1);main_~w~0#1 := 0.0;main_~j~0#1 := 0; {56#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:24,355 INFO L290 TraceCheckUtils]: 3: Hoare triple {56#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_~j~0#1 <= main_~n~0#1); {54#false} is VALID [2022-02-20 16:59:24,355 INFO L290 TraceCheckUtils]: 4: Hoare triple {54#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 < 50 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {54#false} is VALID [2022-02-20 16:59:24,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {54#false} assume 0 == __VERIFIER_assert_~cond#1; {54#false} is VALID [2022-02-20 16:59:24,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {54#false} assume !false; {54#false} is VALID [2022-02-20 16:59:24,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:59:24,357 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:24,357 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779578469] [2022-02-20 16:59:24,357 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779578469] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:59:24,358 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:59:24,358 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:59:24,359 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185422508] [2022-02-20 16:59:24,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:59:24,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 16:59:24,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:24,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-02-20 16:59:24,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:24,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:59:24,374 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:24,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:59:24,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:59:24,391 INFO L87 Difference]: Start difference. First operand has 50 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 49 states have internal predecessors, (77), 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 has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-02-20 16:59:24,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:24,567 INFO L93 Difference]: Finished difference Result 102 states and 159 transitions. [2022-02-20 16:59:24,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:59:24,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 16:59:24,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:24,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-02-20 16:59:24,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-02-20 16:59:24,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-02-20 16:59:24,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-02-20 16:59:24,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-02-20 16:59:24,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:24,716 INFO L225 Difference]: With dead ends: 102 [2022-02-20 16:59:24,716 INFO L226 Difference]: Without dead ends: 17 [2022-02-20 16:59:24,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:59:24,722 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 67 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:24,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 114 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:59:24,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-20 16:59:24,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2022-02-20 16:59:24,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:24,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:24,746 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:24,747 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:24,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:24,748 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-20 16:59:24,748 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 16:59:24,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:24,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:24,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states. [2022-02-20 16:59:24,751 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states. [2022-02-20 16:59:24,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:24,752 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-20 16:59:24,752 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 16:59:24,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:24,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:24,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:24,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:24,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:24,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-02-20 16:59:24,756 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2022-02-20 16:59:24,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:24,756 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-02-20 16:59:24,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-02-20 16:59:24,757 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-20 16:59:24,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:59:24,757 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:24,758 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:24,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:59:24,759 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:24,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:24,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1948892579, now seen corresponding path program 1 times [2022-02-20 16:59:24,764 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:24,764 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474148964] [2022-02-20 16:59:24,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:24,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:24,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {244#true} assume { :begin_inline_ULTIMATE.init } 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); {244#true} is VALID [2022-02-20 16:59:24,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~post4#1, main_#t~ret8#1, main_~i~0#1, main_~j~0#1, main_~nmax~0#1, main_~n~0#1, main_~chkerr~0#1, main_~eps~0#1, main_~w~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~nmax~0#1 := 50;main_~n~0#1 := 5;havoc main_~chkerr~0#1;havoc main_~eps~0#1;havoc main_~w~0#1;main_~eps~0#1 := 1.0E-6;main_~i~0#1 := 0; {246#(< |ULTIMATE.start_main_~i~0#1| 50)} is VALID [2022-02-20 16:59:24,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#(< |ULTIMATE.start_main_~i~0#1| 50)} assume !!(main_~i~0#1 <= main_~n~0#1);main_~w~0#1 := 0.0;main_~j~0#1 := 0; {246#(< |ULTIMATE.start_main_~i~0#1| 50)} is VALID [2022-02-20 16:59:24,878 INFO L290 TraceCheckUtils]: 3: Hoare triple {246#(< |ULTIMATE.start_main_~i~0#1| 50)} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {246#(< |ULTIMATE.start_main_~i~0#1| 50)} is VALID [2022-02-20 16:59:24,879 INFO L290 TraceCheckUtils]: 4: Hoare triple {246#(< |ULTIMATE.start_main_~i~0#1| 50)} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {246#(< |ULTIMATE.start_main_~i~0#1| 50)} is VALID [2022-02-20 16:59:24,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {246#(< |ULTIMATE.start_main_~i~0#1| 50)} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {246#(< |ULTIMATE.start_main_~i~0#1| 50)} is VALID [2022-02-20 16:59:24,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {246#(< |ULTIMATE.start_main_~i~0#1| 50)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {246#(< |ULTIMATE.start_main_~i~0#1| 50)} is VALID [2022-02-20 16:59:24,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#(< |ULTIMATE.start_main_~i~0#1| 50)} assume !(main_~j~0#1 <= main_~n~0#1); {246#(< |ULTIMATE.start_main_~i~0#1| 50)} is VALID [2022-02-20 16:59:24,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#(< |ULTIMATE.start_main_~i~0#1| 50)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 < 50 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {247#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 16:59:24,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {247#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {245#false} is VALID [2022-02-20 16:59:24,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {245#false} assume !false; {245#false} is VALID [2022-02-20 16:59:24,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 16:59:24,886 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:24,886 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474148964] [2022-02-20 16:59:24,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474148964] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:59:24,886 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:59:24,887 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:59:24,887 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992628913] [2022-02-20 16:59:24,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:59:24,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:59:24,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:24,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:24,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:24,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:59:24,897 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:24,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:59:24,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:59:24,899 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:24,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:24,980 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-02-20 16:59:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:59:24,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:59:24,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:24,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:24,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-02-20 16:59:24,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:24,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-02-20 16:59:24,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-02-20 16:59:25,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:25,004 INFO L225 Difference]: With dead ends: 26 [2022-02-20 16:59:25,005 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 16:59:25,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:59:25,006 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:25,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 28 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:59:25,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 16:59:25,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-02-20 16:59:25,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:25,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:25,012 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:25,012 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:25,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:25,013 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-02-20 16:59:25,014 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-02-20 16:59:25,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:25,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:25,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 24 states. [2022-02-20 16:59:25,014 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 24 states. [2022-02-20 16:59:25,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:25,015 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-02-20 16:59:25,015 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-02-20 16:59:25,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:25,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:25,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:25,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:25,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:25,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-02-20 16:59:25,017 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 11 [2022-02-20 16:59:25,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:25,017 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-02-20 16:59:25,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:25,018 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 16:59:25,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 16:59:25,018 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:25,018 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:25,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:59:25,019 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:25,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:25,019 INFO L85 PathProgramCache]: Analyzing trace with hash -2121905774, now seen corresponding path program 1 times [2022-02-20 16:59:25,019 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:25,020 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443037737] [2022-02-20 16:59:25,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:25,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:25,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {363#true} assume { :begin_inline_ULTIMATE.init } 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); {363#true} is VALID [2022-02-20 16:59:25,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {363#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~post4#1, main_#t~ret8#1, main_~i~0#1, main_~j~0#1, main_~nmax~0#1, main_~n~0#1, main_~chkerr~0#1, main_~eps~0#1, main_~w~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~nmax~0#1 := 50;main_~n~0#1 := 5;havoc main_~chkerr~0#1;havoc main_~eps~0#1;havoc main_~w~0#1;main_~eps~0#1 := 1.0E-6;main_~i~0#1 := 0; {365#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:59:25,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {365#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 <= main_~n~0#1);main_~w~0#1 := 0.0;main_~j~0#1 := 0; {365#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:59:25,079 INFO L290 TraceCheckUtils]: 3: Hoare triple {365#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {365#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:59:25,080 INFO L290 TraceCheckUtils]: 4: Hoare triple {365#(= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {365#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:59:25,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {365#(= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {365#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:59:25,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {365#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {365#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:59:25,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {365#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~j~0#1 <= main_~n~0#1); {365#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:59:25,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {365#(= |ULTIMATE.start_main_~i~0#1| 0)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 < 50 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {365#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:59:25,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {365#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(0 == __VERIFIER_assert_~cond#1); {365#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:59:25,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {365#(= |ULTIMATE.start_main_~i~0#1| 0)} assume { :end_inline___VERIFIER_assert } true;call write~real(main_~w~0#1, ~#b~0.base, ~#b~0.offset + 8 * main_~i~0#1, 8); {365#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:59:25,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {365#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {366#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 16:59:25,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {366#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 <= main_~n~0#1);main_~w~0#1 := 0.0;main_~j~0#1 := 0; {366#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 16:59:25,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {366#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {366#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 16:59:25,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {366#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {366#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 16:59:25,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {366#(<= |ULTIMATE.start_main_~i~0#1| 1)} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {366#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 16:59:25,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {366#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {366#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 16:59:25,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {366#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~j~0#1 <= main_~n~0#1); {366#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 16:59:25,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {366#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 < 50 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {367#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 16:59:25,086 INFO L290 TraceCheckUtils]: 19: Hoare triple {367#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {364#false} is VALID [2022-02-20 16:59:25,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {364#false} assume !false; {364#false} is VALID [2022-02-20 16:59:25,086 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 16:59:25,087 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:25,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443037737] [2022-02-20 16:59:25,087 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443037737] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:59:25,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637715406] [2022-02-20 16:59:25,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:25,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:59:25,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:59:25,089 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-02-20 16:59:25,090 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-02-20 16:59:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:25,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:59:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:25,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:59:25,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {363#true} assume { :begin_inline_ULTIMATE.init } 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); {363#true} is VALID [2022-02-20 16:59:25,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {363#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~post4#1, main_#t~ret8#1, main_~i~0#1, main_~j~0#1, main_~nmax~0#1, main_~n~0#1, main_~chkerr~0#1, main_~eps~0#1, main_~w~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~nmax~0#1 := 50;main_~n~0#1 := 5;havoc main_~chkerr~0#1;havoc main_~eps~0#1;havoc main_~w~0#1;main_~eps~0#1 := 1.0E-6;main_~i~0#1 := 0; {374#(<= 5 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:25,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {374#(<= 5 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 <= main_~n~0#1);main_~w~0#1 := 0.0;main_~j~0#1 := 0; {378#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:25,304 INFO L290 TraceCheckUtils]: 3: Hoare triple {378#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {378#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:25,304 INFO L290 TraceCheckUtils]: 4: Hoare triple {378#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {378#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:25,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {378#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {378#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:25,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {378#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {391#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:25,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {391#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 5 |ULTIMATE.start_main_~n~0#1|))} assume !(main_~j~0#1 <= main_~n~0#1); {364#false} is VALID [2022-02-20 16:59:25,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {364#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 < 50 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {364#false} is VALID [2022-02-20 16:59:25,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {364#false} assume !(0 == __VERIFIER_assert_~cond#1); {364#false} is VALID [2022-02-20 16:59:25,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {364#false} assume { :end_inline___VERIFIER_assert } true;call write~real(main_~w~0#1, ~#b~0.base, ~#b~0.offset + 8 * main_~i~0#1, 8); {364#false} is VALID [2022-02-20 16:59:25,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {364#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {364#false} is VALID [2022-02-20 16:59:25,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {364#false} assume !!(main_~i~0#1 <= main_~n~0#1);main_~w~0#1 := 0.0;main_~j~0#1 := 0; {364#false} is VALID [2022-02-20 16:59:25,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {364#false} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {364#false} is VALID [2022-02-20 16:59:25,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {364#false} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {364#false} is VALID [2022-02-20 16:59:25,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {364#false} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {364#false} is VALID [2022-02-20 16:59:25,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {364#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {364#false} is VALID [2022-02-20 16:59:25,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {364#false} assume !(main_~j~0#1 <= main_~n~0#1); {364#false} is VALID [2022-02-20 16:59:25,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {364#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 < 50 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {364#false} is VALID [2022-02-20 16:59:25,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {364#false} assume 0 == __VERIFIER_assert_~cond#1; {364#false} is VALID [2022-02-20 16:59:25,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {364#false} assume !false; {364#false} is VALID [2022-02-20 16:59:25,309 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 16:59:25,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:59:25,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {364#false} assume !false; {364#false} is VALID [2022-02-20 16:59:25,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {364#false} assume 0 == __VERIFIER_assert_~cond#1; {364#false} is VALID [2022-02-20 16:59:25,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {364#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 < 50 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {364#false} is VALID [2022-02-20 16:59:25,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {364#false} assume !(main_~j~0#1 <= main_~n~0#1); {364#false} is VALID [2022-02-20 16:59:25,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {364#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {364#false} is VALID [2022-02-20 16:59:25,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {364#false} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {364#false} is VALID [2022-02-20 16:59:25,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {364#false} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {364#false} is VALID [2022-02-20 16:59:25,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {364#false} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {364#false} is VALID [2022-02-20 16:59:25,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {364#false} assume !!(main_~i~0#1 <= main_~n~0#1);main_~w~0#1 := 0.0;main_~j~0#1 := 0; {364#false} is VALID [2022-02-20 16:59:25,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {364#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {364#false} is VALID [2022-02-20 16:59:25,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {364#false} assume { :end_inline___VERIFIER_assert } true;call write~real(main_~w~0#1, ~#b~0.base, ~#b~0.offset + 8 * main_~i~0#1, 8); {364#false} is VALID [2022-02-20 16:59:25,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {364#false} assume !(0 == __VERIFIER_assert_~cond#1); {364#false} is VALID [2022-02-20 16:59:25,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {364#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 < 50 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {364#false} is VALID [2022-02-20 16:59:25,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {473#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)} assume !(main_~j~0#1 <= main_~n~0#1); {364#false} is VALID [2022-02-20 16:59:25,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {477#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {473#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:25,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {477#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {477#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:25,405 INFO L290 TraceCheckUtils]: 4: Hoare triple {477#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {477#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:25,406 INFO L290 TraceCheckUtils]: 3: Hoare triple {477#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {477#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:25,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {490#(<= 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 <= main_~n~0#1);main_~w~0#1 := 0.0;main_~j~0#1 := 0; {477#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:25,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {363#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~post4#1, main_#t~ret8#1, main_~i~0#1, main_~j~0#1, main_~nmax~0#1, main_~n~0#1, main_~chkerr~0#1, main_~eps~0#1, main_~w~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~nmax~0#1 := 50;main_~n~0#1 := 5;havoc main_~chkerr~0#1;havoc main_~eps~0#1;havoc main_~w~0#1;main_~eps~0#1 := 1.0E-6;main_~i~0#1 := 0; {490#(<= 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:25,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {363#true} assume { :begin_inline_ULTIMATE.init } 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); {363#true} is VALID [2022-02-20 16:59:25,407 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 16:59:25,408 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637715406] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:59:25,408 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:59:25,408 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-02-20 16:59:25,408 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436894787] [2022-02-20 16:59:25,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:59:25,409 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 16:59:25,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:25,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 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-02-20 16:59:25,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:25,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 16:59:25,452 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:25,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 16:59:25,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:59:25,453 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 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-02-20 16:59:25,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:25,932 INFO L93 Difference]: Finished difference Result 84 states and 111 transitions. [2022-02-20 16:59:25,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 16:59:25,932 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 16:59:25,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:25,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 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-02-20 16:59:25,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 108 transitions. [2022-02-20 16:59:25,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 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-02-20 16:59:25,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 108 transitions. [2022-02-20 16:59:25,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 108 transitions. [2022-02-20 16:59:26,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:26,021 INFO L225 Difference]: With dead ends: 84 [2022-02-20 16:59:26,021 INFO L226 Difference]: Without dead ends: 70 [2022-02-20 16:59:26,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=201, Invalid=501, Unknown=0, NotChecked=0, Total=702 [2022-02-20 16:59:26,023 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 177 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:26,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 35 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:59:26,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-02-20 16:59:26,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2022-02-20 16:59:26,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:26,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 68 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 67 states have internal predecessors, (83), 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-02-20 16:59:26,053 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 68 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 67 states have internal predecessors, (83), 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-02-20 16:59:26,054 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 68 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 67 states have internal predecessors, (83), 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-02-20 16:59:26,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:26,055 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2022-02-20 16:59:26,056 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-02-20 16:59:26,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:26,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:26,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 67 states have internal predecessors, (83), 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 70 states. [2022-02-20 16:59:26,057 INFO L87 Difference]: Start difference. First operand has 68 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 67 states have internal predecessors, (83), 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 70 states. [2022-02-20 16:59:26,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:26,059 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2022-02-20 16:59:26,059 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-02-20 16:59:26,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:26,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:26,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:26,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:26,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 67 states have internal predecessors, (83), 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-02-20 16:59:26,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2022-02-20 16:59:26,061 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 21 [2022-02-20 16:59:26,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:26,061 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2022-02-20 16:59:26,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 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-02-20 16:59:26,062 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2022-02-20 16:59:26,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 16:59:26,063 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:26,063 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 7, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2022-02-20 16:59:26,113 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-02-20 16:59:26,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:59:26,314 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:26,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:26,314 INFO L85 PathProgramCache]: Analyzing trace with hash -139112542, now seen corresponding path program 1 times [2022-02-20 16:59:26,314 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:26,314 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648256961] [2022-02-20 16:59:26,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:26,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:26,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {865#true} assume { :begin_inline_ULTIMATE.init } 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); {865#true} is VALID [2022-02-20 16:59:26,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {865#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~post4#1, main_#t~ret8#1, main_~i~0#1, main_~j~0#1, main_~nmax~0#1, main_~n~0#1, main_~chkerr~0#1, main_~eps~0#1, main_~w~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~nmax~0#1 := 50;main_~n~0#1 := 5;havoc main_~chkerr~0#1;havoc main_~eps~0#1;havoc main_~w~0#1;main_~eps~0#1 := 1.0E-6;main_~i~0#1 := 0; {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume !!(main_~i~0#1 <= main_~n~0#1);main_~w~0#1 := 0.0;main_~j~0#1 := 0; {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,479 INFO L290 TraceCheckUtils]: 3: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,479 INFO L290 TraceCheckUtils]: 4: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,480 INFO L290 TraceCheckUtils]: 6: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume !(main_~i~0#1 == main_~j~0#1); {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume !(main_~i~0#1 == main_~j~0#1); {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,483 INFO L290 TraceCheckUtils]: 16: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume !(main_~i~0#1 == main_~j~0#1); {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume !(main_~j~0#1 <= main_~n~0#1); {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 < 50 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,485 INFO L290 TraceCheckUtils]: 21: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume !(0 == __VERIFIER_assert_~cond#1); {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,485 INFO L290 TraceCheckUtils]: 22: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume { :end_inline___VERIFIER_assert } true;call write~real(main_~w~0#1, ~#b~0.base, ~#b~0.offset + 8 * main_~i~0#1, 8); {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,485 INFO L290 TraceCheckUtils]: 23: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,486 INFO L290 TraceCheckUtils]: 24: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume !!(main_~i~0#1 <= main_~n~0#1);main_~w~0#1 := 0.0;main_~j~0#1 := 0; {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,486 INFO L290 TraceCheckUtils]: 25: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,486 INFO L290 TraceCheckUtils]: 26: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,487 INFO L290 TraceCheckUtils]: 27: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,487 INFO L290 TraceCheckUtils]: 28: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,488 INFO L290 TraceCheckUtils]: 29: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,488 INFO L290 TraceCheckUtils]: 30: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,488 INFO L290 TraceCheckUtils]: 31: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,489 INFO L290 TraceCheckUtils]: 32: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,489 INFO L290 TraceCheckUtils]: 33: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,489 INFO L290 TraceCheckUtils]: 34: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume !(main_~i~0#1 == main_~j~0#1); {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,496 INFO L290 TraceCheckUtils]: 36: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,497 INFO L290 TraceCheckUtils]: 37: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,497 INFO L290 TraceCheckUtils]: 38: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume !(main_~i~0#1 == main_~j~0#1); {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,498 INFO L290 TraceCheckUtils]: 39: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,498 INFO L290 TraceCheckUtils]: 40: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,498 INFO L290 TraceCheckUtils]: 41: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume !(main_~j~0#1 <= main_~n~0#1); {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,499 INFO L290 TraceCheckUtils]: 42: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 < 50 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,499 INFO L290 TraceCheckUtils]: 43: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume !(0 == __VERIFIER_assert_~cond#1); {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,499 INFO L290 TraceCheckUtils]: 44: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume { :end_inline___VERIFIER_assert } true;call write~real(main_~w~0#1, ~#b~0.base, ~#b~0.offset + 8 * main_~i~0#1, 8); {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,500 INFO L290 TraceCheckUtils]: 45: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:26,500 INFO L290 TraceCheckUtils]: 46: Hoare triple {867#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume !!(main_~i~0#1 <= main_~n~0#1);main_~w~0#1 := 0.0;main_~j~0#1 := 0; {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:26,501 INFO L290 TraceCheckUtils]: 47: Hoare triple {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:26,501 INFO L290 TraceCheckUtils]: 48: Hoare triple {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} assume !(main_~i~0#1 == main_~j~0#1); {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:26,501 INFO L290 TraceCheckUtils]: 49: Hoare triple {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:26,502 INFO L290 TraceCheckUtils]: 50: Hoare triple {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:26,502 INFO L290 TraceCheckUtils]: 51: Hoare triple {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:26,503 INFO L290 TraceCheckUtils]: 52: Hoare triple {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} assume !(main_~i~0#1 == main_~j~0#1); {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:26,503 INFO L290 TraceCheckUtils]: 53: Hoare triple {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:26,504 INFO L290 TraceCheckUtils]: 54: Hoare triple {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:26,504 INFO L290 TraceCheckUtils]: 55: Hoare triple {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:26,505 INFO L290 TraceCheckUtils]: 56: Hoare triple {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:26,505 INFO L290 TraceCheckUtils]: 57: Hoare triple {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:26,506 INFO L290 TraceCheckUtils]: 58: Hoare triple {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:26,506 INFO L290 TraceCheckUtils]: 59: Hoare triple {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:26,507 INFO L290 TraceCheckUtils]: 60: Hoare triple {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:26,507 INFO L290 TraceCheckUtils]: 61: Hoare triple {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:26,508 INFO L290 TraceCheckUtils]: 62: Hoare triple {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:26,508 INFO L290 TraceCheckUtils]: 63: Hoare triple {868#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} assume !(main_~j~0#1 <= main_~n~0#1); {869#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 16:59:26,508 INFO L290 TraceCheckUtils]: 64: Hoare triple {869#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 < 50 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {870#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 16:59:26,509 INFO L290 TraceCheckUtils]: 65: Hoare triple {870#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {866#false} is VALID [2022-02-20 16:59:26,509 INFO L290 TraceCheckUtils]: 66: Hoare triple {866#false} assume !false; {866#false} is VALID [2022-02-20 16:59:26,509 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 146 proven. 4 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2022-02-20 16:59:26,510 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:26,510 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648256961] [2022-02-20 16:59:26,510 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648256961] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:59:26,510 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490381389] [2022-02-20 16:59:26,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:26,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:59:26,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:59:26,512 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-02-20 16:59:26,513 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-02-20 16:59:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:26,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 16:59:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:26,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:59:26,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {865#true} assume { :begin_inline_ULTIMATE.init } 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); {865#true} is VALID [2022-02-20 16:59:26,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {865#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~post4#1, main_#t~ret8#1, main_~i~0#1, main_~j~0#1, main_~nmax~0#1, main_~n~0#1, main_~chkerr~0#1, main_~eps~0#1, main_~w~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~nmax~0#1 := 50;main_~n~0#1 := 5;havoc main_~chkerr~0#1;havoc main_~eps~0#1;havoc main_~w~0#1;main_~eps~0#1 := 1.0E-6;main_~i~0#1 := 0; {877#(<= 5 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:26,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {877#(<= 5 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 <= main_~n~0#1);main_~w~0#1 := 0.0;main_~j~0#1 := 0; {881#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:26,959 INFO L290 TraceCheckUtils]: 3: Hoare triple {881#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {881#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:26,960 INFO L290 TraceCheckUtils]: 4: Hoare triple {881#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {881#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:26,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {881#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {881#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:26,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {881#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {894#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:26,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {894#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 5 |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {894#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:26,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {894#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 5 |ULTIMATE.start_main_~n~0#1|))} assume !(main_~i~0#1 == main_~j~0#1); {894#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:26,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {894#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 5 |ULTIMATE.start_main_~n~0#1|))} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {894#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:26,962 INFO L290 TraceCheckUtils]: 10: Hoare triple {894#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 5 |ULTIMATE.start_main_~n~0#1|))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {907#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-20 16:59:26,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {907#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {907#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-20 16:59:26,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {907#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume !(main_~i~0#1 == main_~j~0#1); {907#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-20 16:59:26,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {907#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {907#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-20 16:59:26,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {907#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {920#(and (<= |ULTIMATE.start_main_~j~0#1| 3) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:26,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {920#(and (<= |ULTIMATE.start_main_~j~0#1| 3) (<= 5 |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {920#(and (<= |ULTIMATE.start_main_~j~0#1| 3) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:26,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {920#(and (<= |ULTIMATE.start_main_~j~0#1| 3) (<= 5 |ULTIMATE.start_main_~n~0#1|))} assume !(main_~i~0#1 == main_~j~0#1); {920#(and (<= |ULTIMATE.start_main_~j~0#1| 3) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:26,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {920#(and (<= |ULTIMATE.start_main_~j~0#1| 3) (<= 5 |ULTIMATE.start_main_~n~0#1|))} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {920#(and (<= |ULTIMATE.start_main_~j~0#1| 3) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:26,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {920#(and (<= |ULTIMATE.start_main_~j~0#1| 3) (<= 5 |ULTIMATE.start_main_~n~0#1|))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {933#(and (<= |ULTIMATE.start_main_~j~0#1| 4) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:26,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {933#(and (<= |ULTIMATE.start_main_~j~0#1| 4) (<= 5 |ULTIMATE.start_main_~n~0#1|))} assume !(main_~j~0#1 <= main_~n~0#1); {866#false} is VALID [2022-02-20 16:59:26,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {866#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 < 50 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {866#false} is VALID [2022-02-20 16:59:26,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {866#false} assume !(0 == __VERIFIER_assert_~cond#1); {866#false} is VALID [2022-02-20 16:59:26,967 INFO L290 TraceCheckUtils]: 22: Hoare triple {866#false} assume { :end_inline___VERIFIER_assert } true;call write~real(main_~w~0#1, ~#b~0.base, ~#b~0.offset + 8 * main_~i~0#1, 8); {866#false} is VALID [2022-02-20 16:59:26,967 INFO L290 TraceCheckUtils]: 23: Hoare triple {866#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {866#false} is VALID [2022-02-20 16:59:26,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {866#false} assume !!(main_~i~0#1 <= main_~n~0#1);main_~w~0#1 := 0.0;main_~j~0#1 := 0; {866#false} is VALID [2022-02-20 16:59:26,967 INFO L290 TraceCheckUtils]: 25: Hoare triple {866#false} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {866#false} is VALID [2022-02-20 16:59:26,967 INFO L290 TraceCheckUtils]: 26: Hoare triple {866#false} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {866#false} is VALID [2022-02-20 16:59:26,967 INFO L290 TraceCheckUtils]: 27: Hoare triple {866#false} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {866#false} is VALID [2022-02-20 16:59:26,968 INFO L290 TraceCheckUtils]: 28: Hoare triple {866#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {866#false} is VALID [2022-02-20 16:59:26,968 INFO L290 TraceCheckUtils]: 29: Hoare triple {866#false} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {866#false} is VALID [2022-02-20 16:59:26,968 INFO L290 TraceCheckUtils]: 30: Hoare triple {866#false} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {866#false} is VALID [2022-02-20 16:59:26,968 INFO L290 TraceCheckUtils]: 31: Hoare triple {866#false} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {866#false} is VALID [2022-02-20 16:59:26,968 INFO L290 TraceCheckUtils]: 32: Hoare triple {866#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {866#false} is VALID [2022-02-20 16:59:26,968 INFO L290 TraceCheckUtils]: 33: Hoare triple {866#false} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {866#false} is VALID [2022-02-20 16:59:26,968 INFO L290 TraceCheckUtils]: 34: Hoare triple {866#false} assume !(main_~i~0#1 == main_~j~0#1); {866#false} is VALID [2022-02-20 16:59:26,969 INFO L290 TraceCheckUtils]: 35: Hoare triple {866#false} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {866#false} is VALID [2022-02-20 16:59:26,969 INFO L290 TraceCheckUtils]: 36: Hoare triple {866#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {866#false} is VALID [2022-02-20 16:59:26,969 INFO L290 TraceCheckUtils]: 37: Hoare triple {866#false} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {866#false} is VALID [2022-02-20 16:59:26,969 INFO L290 TraceCheckUtils]: 38: Hoare triple {866#false} assume !(main_~i~0#1 == main_~j~0#1); {866#false} is VALID [2022-02-20 16:59:26,969 INFO L290 TraceCheckUtils]: 39: Hoare triple {866#false} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {866#false} is VALID [2022-02-20 16:59:26,969 INFO L290 TraceCheckUtils]: 40: Hoare triple {866#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {866#false} is VALID [2022-02-20 16:59:26,969 INFO L290 TraceCheckUtils]: 41: Hoare triple {866#false} assume !(main_~j~0#1 <= main_~n~0#1); {866#false} is VALID [2022-02-20 16:59:26,970 INFO L290 TraceCheckUtils]: 42: Hoare triple {866#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 < 50 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {866#false} is VALID [2022-02-20 16:59:26,970 INFO L290 TraceCheckUtils]: 43: Hoare triple {866#false} assume !(0 == __VERIFIER_assert_~cond#1); {866#false} is VALID [2022-02-20 16:59:26,970 INFO L290 TraceCheckUtils]: 44: Hoare triple {866#false} assume { :end_inline___VERIFIER_assert } true;call write~real(main_~w~0#1, ~#b~0.base, ~#b~0.offset + 8 * main_~i~0#1, 8); {866#false} is VALID [2022-02-20 16:59:26,970 INFO L290 TraceCheckUtils]: 45: Hoare triple {866#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {866#false} is VALID [2022-02-20 16:59:26,970 INFO L290 TraceCheckUtils]: 46: Hoare triple {866#false} assume !!(main_~i~0#1 <= main_~n~0#1);main_~w~0#1 := 0.0;main_~j~0#1 := 0; {866#false} is VALID [2022-02-20 16:59:26,970 INFO L290 TraceCheckUtils]: 47: Hoare triple {866#false} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {866#false} is VALID [2022-02-20 16:59:26,970 INFO L290 TraceCheckUtils]: 48: Hoare triple {866#false} assume !(main_~i~0#1 == main_~j~0#1); {866#false} is VALID [2022-02-20 16:59:26,971 INFO L290 TraceCheckUtils]: 49: Hoare triple {866#false} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {866#false} is VALID [2022-02-20 16:59:26,971 INFO L290 TraceCheckUtils]: 50: Hoare triple {866#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {866#false} is VALID [2022-02-20 16:59:26,971 INFO L290 TraceCheckUtils]: 51: Hoare triple {866#false} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {866#false} is VALID [2022-02-20 16:59:26,971 INFO L290 TraceCheckUtils]: 52: Hoare triple {866#false} assume !(main_~i~0#1 == main_~j~0#1); {866#false} is VALID [2022-02-20 16:59:26,971 INFO L290 TraceCheckUtils]: 53: Hoare triple {866#false} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {866#false} is VALID [2022-02-20 16:59:26,971 INFO L290 TraceCheckUtils]: 54: Hoare triple {866#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {866#false} is VALID [2022-02-20 16:59:26,972 INFO L290 TraceCheckUtils]: 55: Hoare triple {866#false} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {866#false} is VALID [2022-02-20 16:59:26,972 INFO L290 TraceCheckUtils]: 56: Hoare triple {866#false} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {866#false} is VALID [2022-02-20 16:59:26,972 INFO L290 TraceCheckUtils]: 57: Hoare triple {866#false} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {866#false} is VALID [2022-02-20 16:59:26,972 INFO L290 TraceCheckUtils]: 58: Hoare triple {866#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {866#false} is VALID [2022-02-20 16:59:26,972 INFO L290 TraceCheckUtils]: 59: Hoare triple {866#false} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {866#false} is VALID [2022-02-20 16:59:26,972 INFO L290 TraceCheckUtils]: 60: Hoare triple {866#false} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {866#false} is VALID [2022-02-20 16:59:26,972 INFO L290 TraceCheckUtils]: 61: Hoare triple {866#false} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {866#false} is VALID [2022-02-20 16:59:26,973 INFO L290 TraceCheckUtils]: 62: Hoare triple {866#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {866#false} is VALID [2022-02-20 16:59:26,973 INFO L290 TraceCheckUtils]: 63: Hoare triple {866#false} assume !(main_~j~0#1 <= main_~n~0#1); {866#false} is VALID [2022-02-20 16:59:26,973 INFO L290 TraceCheckUtils]: 64: Hoare triple {866#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 < 50 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {866#false} is VALID [2022-02-20 16:59:26,973 INFO L290 TraceCheckUtils]: 65: Hoare triple {866#false} assume 0 == __VERIFIER_assert_~cond#1; {866#false} is VALID [2022-02-20 16:59:26,973 INFO L290 TraceCheckUtils]: 66: Hoare triple {866#false} assume !false; {866#false} is VALID [2022-02-20 16:59:26,974 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 148 proven. 28 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2022-02-20 16:59:26,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:59:27,208 INFO L290 TraceCheckUtils]: 66: Hoare triple {866#false} assume !false; {866#false} is VALID [2022-02-20 16:59:27,208 INFO L290 TraceCheckUtils]: 65: Hoare triple {866#false} assume 0 == __VERIFIER_assert_~cond#1; {866#false} is VALID [2022-02-20 16:59:27,208 INFO L290 TraceCheckUtils]: 64: Hoare triple {866#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 < 50 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {866#false} is VALID [2022-02-20 16:59:27,208 INFO L290 TraceCheckUtils]: 63: Hoare triple {866#false} assume !(main_~j~0#1 <= main_~n~0#1); {866#false} is VALID [2022-02-20 16:59:27,209 INFO L290 TraceCheckUtils]: 62: Hoare triple {866#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {866#false} is VALID [2022-02-20 16:59:27,209 INFO L290 TraceCheckUtils]: 61: Hoare triple {866#false} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {866#false} is VALID [2022-02-20 16:59:27,209 INFO L290 TraceCheckUtils]: 60: Hoare triple {866#false} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {866#false} is VALID [2022-02-20 16:59:27,209 INFO L290 TraceCheckUtils]: 59: Hoare triple {866#false} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {866#false} is VALID [2022-02-20 16:59:27,209 INFO L290 TraceCheckUtils]: 58: Hoare triple {866#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {866#false} is VALID [2022-02-20 16:59:27,209 INFO L290 TraceCheckUtils]: 57: Hoare triple {866#false} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {866#false} is VALID [2022-02-20 16:59:27,209 INFO L290 TraceCheckUtils]: 56: Hoare triple {866#false} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {866#false} is VALID [2022-02-20 16:59:27,210 INFO L290 TraceCheckUtils]: 55: Hoare triple {866#false} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {866#false} is VALID [2022-02-20 16:59:27,210 INFO L290 TraceCheckUtils]: 54: Hoare triple {866#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {866#false} is VALID [2022-02-20 16:59:27,210 INFO L290 TraceCheckUtils]: 53: Hoare triple {866#false} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {866#false} is VALID [2022-02-20 16:59:27,210 INFO L290 TraceCheckUtils]: 52: Hoare triple {866#false} assume !(main_~i~0#1 == main_~j~0#1); {866#false} is VALID [2022-02-20 16:59:27,210 INFO L290 TraceCheckUtils]: 51: Hoare triple {866#false} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {866#false} is VALID [2022-02-20 16:59:27,210 INFO L290 TraceCheckUtils]: 50: Hoare triple {866#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {866#false} is VALID [2022-02-20 16:59:27,211 INFO L290 TraceCheckUtils]: 49: Hoare triple {866#false} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {866#false} is VALID [2022-02-20 16:59:27,211 INFO L290 TraceCheckUtils]: 48: Hoare triple {866#false} assume !(main_~i~0#1 == main_~j~0#1); {866#false} is VALID [2022-02-20 16:59:27,211 INFO L290 TraceCheckUtils]: 47: Hoare triple {866#false} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {866#false} is VALID [2022-02-20 16:59:27,211 INFO L290 TraceCheckUtils]: 46: Hoare triple {866#false} assume !!(main_~i~0#1 <= main_~n~0#1);main_~w~0#1 := 0.0;main_~j~0#1 := 0; {866#false} is VALID [2022-02-20 16:59:27,211 INFO L290 TraceCheckUtils]: 45: Hoare triple {866#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {866#false} is VALID [2022-02-20 16:59:27,211 INFO L290 TraceCheckUtils]: 44: Hoare triple {866#false} assume { :end_inline___VERIFIER_assert } true;call write~real(main_~w~0#1, ~#b~0.base, ~#b~0.offset + 8 * main_~i~0#1, 8); {866#false} is VALID [2022-02-20 16:59:27,211 INFO L290 TraceCheckUtils]: 43: Hoare triple {866#false} assume !(0 == __VERIFIER_assert_~cond#1); {866#false} is VALID [2022-02-20 16:59:27,212 INFO L290 TraceCheckUtils]: 42: Hoare triple {866#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 < 50 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {866#false} is VALID [2022-02-20 16:59:27,212 INFO L290 TraceCheckUtils]: 41: Hoare triple {866#false} assume !(main_~j~0#1 <= main_~n~0#1); {866#false} is VALID [2022-02-20 16:59:27,212 INFO L290 TraceCheckUtils]: 40: Hoare triple {866#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {866#false} is VALID [2022-02-20 16:59:27,212 INFO L290 TraceCheckUtils]: 39: Hoare triple {866#false} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {866#false} is VALID [2022-02-20 16:59:27,212 INFO L290 TraceCheckUtils]: 38: Hoare triple {866#false} assume !(main_~i~0#1 == main_~j~0#1); {866#false} is VALID [2022-02-20 16:59:27,212 INFO L290 TraceCheckUtils]: 37: Hoare triple {866#false} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {866#false} is VALID [2022-02-20 16:59:27,212 INFO L290 TraceCheckUtils]: 36: Hoare triple {866#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {866#false} is VALID [2022-02-20 16:59:27,213 INFO L290 TraceCheckUtils]: 35: Hoare triple {866#false} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {866#false} is VALID [2022-02-20 16:59:27,213 INFO L290 TraceCheckUtils]: 34: Hoare triple {866#false} assume !(main_~i~0#1 == main_~j~0#1); {866#false} is VALID [2022-02-20 16:59:27,213 INFO L290 TraceCheckUtils]: 33: Hoare triple {866#false} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {866#false} is VALID [2022-02-20 16:59:27,213 INFO L290 TraceCheckUtils]: 32: Hoare triple {866#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {866#false} is VALID [2022-02-20 16:59:27,213 INFO L290 TraceCheckUtils]: 31: Hoare triple {866#false} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {866#false} is VALID [2022-02-20 16:59:27,213 INFO L290 TraceCheckUtils]: 30: Hoare triple {866#false} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {866#false} is VALID [2022-02-20 16:59:27,213 INFO L290 TraceCheckUtils]: 29: Hoare triple {866#false} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {866#false} is VALID [2022-02-20 16:59:27,214 INFO L290 TraceCheckUtils]: 28: Hoare triple {866#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {866#false} is VALID [2022-02-20 16:59:27,214 INFO L290 TraceCheckUtils]: 27: Hoare triple {866#false} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {866#false} is VALID [2022-02-20 16:59:27,214 INFO L290 TraceCheckUtils]: 26: Hoare triple {866#false} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {866#false} is VALID [2022-02-20 16:59:27,214 INFO L290 TraceCheckUtils]: 25: Hoare triple {866#false} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {866#false} is VALID [2022-02-20 16:59:27,214 INFO L290 TraceCheckUtils]: 24: Hoare triple {866#false} assume !!(main_~i~0#1 <= main_~n~0#1);main_~w~0#1 := 0.0;main_~j~0#1 := 0; {866#false} is VALID [2022-02-20 16:59:27,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {866#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {866#false} is VALID [2022-02-20 16:59:27,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {866#false} assume { :end_inline___VERIFIER_assert } true;call write~real(main_~w~0#1, ~#b~0.base, ~#b~0.offset + 8 * main_~i~0#1, 8); {866#false} is VALID [2022-02-20 16:59:27,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {866#false} assume !(0 == __VERIFIER_assert_~cond#1); {866#false} is VALID [2022-02-20 16:59:27,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {866#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 < 50 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {866#false} is VALID [2022-02-20 16:59:27,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {1219#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)} assume !(main_~j~0#1 <= main_~n~0#1); {866#false} is VALID [2022-02-20 16:59:27,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {1223#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1219#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:27,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {1223#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {1223#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:27,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {1223#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !(main_~i~0#1 == main_~j~0#1); {1223#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:27,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {1223#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {1223#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:27,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {1236#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1223#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:27,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {1236#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {1236#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:27,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {1236#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !(main_~i~0#1 == main_~j~0#1); {1236#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:27,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {1236#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {1236#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:27,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {1249#(<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1236#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:27,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {1249#(<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {1249#(<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:27,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {1249#(<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !(main_~i~0#1 == main_~j~0#1); {1249#(<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:27,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {1249#(<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {1249#(<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:27,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {1262#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1249#(<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:27,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {1262#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {1262#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:27,223 INFO L290 TraceCheckUtils]: 4: Hoare triple {1262#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {1262#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:27,223 INFO L290 TraceCheckUtils]: 3: Hoare triple {1262#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {1262#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:27,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {1275#(<= 4 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 <= main_~n~0#1);main_~w~0#1 := 0.0;main_~j~0#1 := 0; {1262#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:27,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {865#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~post4#1, main_#t~ret8#1, main_~i~0#1, main_~j~0#1, main_~nmax~0#1, main_~n~0#1, main_~chkerr~0#1, main_~eps~0#1, main_~w~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~nmax~0#1 := 50;main_~n~0#1 := 5;havoc main_~chkerr~0#1;havoc main_~eps~0#1;havoc main_~w~0#1;main_~eps~0#1 := 1.0E-6;main_~i~0#1 := 0; {1275#(<= 4 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:27,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {865#true} assume { :begin_inline_ULTIMATE.init } 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); {865#true} is VALID [2022-02-20 16:59:27,225 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 148 proven. 28 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2022-02-20 16:59:27,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490381389] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:59:27,225 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:59:27,226 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2022-02-20 16:59:27,226 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345315239] [2022-02-20 16:59:27,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:59:27,226 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-02-20 16:59:27,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:27,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 states have internal predecessors, (73), 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-02-20 16:59:27,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:27,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 16:59:27,270 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:27,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 16:59:27,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-02-20 16:59:27,271 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 states have internal predecessors, (73), 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-02-20 16:59:27,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:27,841 INFO L93 Difference]: Finished difference Result 205 states and 253 transitions. [2022-02-20 16:59:27,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 16:59:27,841 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-02-20 16:59:27,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:27,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 states have internal predecessors, (73), 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-02-20 16:59:27,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 91 transitions. [2022-02-20 16:59:27,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 states have internal predecessors, (73), 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-02-20 16:59:27,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 91 transitions. [2022-02-20 16:59:27,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 91 transitions. [2022-02-20 16:59:27,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:27,914 INFO L225 Difference]: With dead ends: 205 [2022-02-20 16:59:27,914 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:59:27,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=327, Invalid=665, Unknown=0, NotChecked=0, Total=992 [2022-02-20 16:59:27,916 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 156 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:27,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 22 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:59:27,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:59:27,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:59:27,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:27,917 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-02-20 16:59:27,917 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-02-20 16:59:27,917 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-02-20 16:59:27,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:27,917 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:59:27,917 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:59:27,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:27,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:27,918 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-02-20 16:59:27,918 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-02-20 16:59:27,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:27,918 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:59:27,918 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:59:27,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:27,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:27,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:27,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:27,919 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-02-20 16:59:27,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:59:27,919 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2022-02-20 16:59:27,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:27,919 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:59:27,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 states have internal predecessors, (73), 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-02-20 16:59:27,920 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:59:27,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:27,922 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:59:27,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 16:59:28,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-20 16:59:28,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:59:28,367 INFO L858 garLoopResultBuilder]: For program point L93-2(lines 93 104) no Hoare annotation was computed. [2022-02-20 16:59:28,367 INFO L854 garLoopResultBuilder]: At program point L93-3(lines 93 104) the Hoare annotation is: (let ((.cse0 (= 5 |ULTIMATE.start_main_~n~0#1|))) (or (and .cse0 (not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 0)))) [2022-02-20 16:59:28,368 INFO L858 garLoopResultBuilder]: For program point L93-4(lines 93 104) no Hoare annotation was computed. [2022-02-20 16:59:28,368 INFO L858 garLoopResultBuilder]: For program point L118-2(lines 118 136) no Hoare annotation was computed. [2022-02-20 16:59:28,368 INFO L854 garLoopResultBuilder]: At program point L118-3(lines 118 136) the Hoare annotation is: (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) [2022-02-20 16:59:28,368 INFO L858 garLoopResultBuilder]: For program point L118-4(lines 118 136) no Hoare annotation was computed. [2022-02-20 16:59:28,368 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:59:28,368 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:59:28,368 INFO L854 garLoopResultBuilder]: At program point L153(lines 111 155) the Hoare annotation is: (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) [2022-02-20 16:59:28,368 INFO L858 garLoopResultBuilder]: For program point L120(line 120) no Hoare annotation was computed. [2022-02-20 16:59:28,368 INFO L858 garLoopResultBuilder]: For program point L129-2(lines 129 135) no Hoare annotation was computed. [2022-02-20 16:59:28,368 INFO L858 garLoopResultBuilder]: For program point L96-2(lines 96 101) no Hoare annotation was computed. [2022-02-20 16:59:28,368 INFO L854 garLoopResultBuilder]: At program point L129-3(lines 129 135) the Hoare annotation is: (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) [2022-02-20 16:59:28,369 INFO L854 garLoopResultBuilder]: At program point L96-3(lines 96 101) the Hoare annotation is: (let ((.cse0 (= 5 |ULTIMATE.start_main_~n~0#1|))) (or (and .cse0 (not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|)) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 0)))) [2022-02-20 16:59:28,369 INFO L858 garLoopResultBuilder]: For program point L96-4(lines 96 101) no Hoare annotation was computed. [2022-02-20 16:59:28,369 INFO L858 garLoopResultBuilder]: For program point L121-2(lines 121 128) no Hoare annotation was computed. [2022-02-20 16:59:28,369 INFO L854 garLoopResultBuilder]: At program point L121-3(lines 121 128) the Hoare annotation is: (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) [2022-02-20 16:59:28,369 INFO L858 garLoopResultBuilder]: For program point L121-4(lines 121 128) no Hoare annotation was computed. [2022-02-20 16:59:28,369 INFO L858 garLoopResultBuilder]: For program point L80(lines 80 81) no Hoare annotation was computed. [2022-02-20 16:59:28,369 INFO L858 garLoopResultBuilder]: For program point L146-2(lines 146 152) no Hoare annotation was computed. [2022-02-20 16:59:28,369 INFO L854 garLoopResultBuilder]: At program point L146-3(lines 146 152) the Hoare annotation is: (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) [2022-02-20 16:59:28,369 INFO L858 garLoopResultBuilder]: For program point L80-2(lines 80 81) no Hoare annotation was computed. [2022-02-20 16:59:28,369 INFO L858 garLoopResultBuilder]: For program point L146-4(lines 146 152) no Hoare annotation was computed. [2022-02-20 16:59:28,369 INFO L858 garLoopResultBuilder]: For program point L138-2(lines 138 144) no Hoare annotation was computed. [2022-02-20 16:59:28,370 INFO L854 garLoopResultBuilder]: At program point L138-3(lines 138 144) the Hoare annotation is: (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) [2022-02-20 16:59:28,370 INFO L858 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2022-02-20 16:59:28,370 INFO L858 garLoopResultBuilder]: For program point L138-4(lines 138 144) no Hoare annotation was computed. [2022-02-20 16:59:28,370 INFO L854 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: (and (= 5 |ULTIMATE.start_main_~n~0#1|) (not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|)) [2022-02-20 16:59:28,370 INFO L858 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-02-20 16:59:28,370 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:59:28,370 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2022-02-20 16:59:28,370 INFO L854 garLoopResultBuilder]: At program point L82(lines 76 83) the Hoare annotation is: (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) [2022-02-20 16:59:28,370 INFO L858 garLoopResultBuilder]: For program point L99(line 99) no Hoare annotation was computed. [2022-02-20 16:59:28,370 INFO L858 garLoopResultBuilder]: For program point L132-2(lines 132 133) no Hoare annotation was computed. [2022-02-20 16:59:28,371 INFO L858 garLoopResultBuilder]: For program point L99-2(line 99) no Hoare annotation was computed. [2022-02-20 16:59:28,371 INFO L854 garLoopResultBuilder]: At program point L132-3(lines 132 133) the Hoare annotation is: (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) [2022-02-20 16:59:28,371 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:59:28,371 INFO L858 garLoopResultBuilder]: For program point L132-4(lines 132 133) no Hoare annotation was computed. [2022-02-20 16:59:28,371 INFO L858 garLoopResultBuilder]: For program point L124(lines 124 126) no Hoare annotation was computed. [2022-02-20 16:59:28,371 INFO L858 garLoopResultBuilder]: For program point L124-1(lines 124 126) no Hoare annotation was computed. [2022-02-20 16:59:28,371 INFO L858 garLoopResultBuilder]: For program point L149-2(lines 149 150) no Hoare annotation was computed. [2022-02-20 16:59:28,371 INFO L854 garLoopResultBuilder]: At program point L149-3(lines 149 150) the Hoare annotation is: (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) [2022-02-20 16:59:28,371 INFO L858 garLoopResultBuilder]: For program point L149-4(lines 149 150) no Hoare annotation was computed. [2022-02-20 16:59:28,371 INFO L854 garLoopResultBuilder]: At program point L108(lines 85 109) the Hoare annotation is: (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) [2022-02-20 16:59:28,371 INFO L858 garLoopResultBuilder]: For program point L141-2(lines 141 142) no Hoare annotation was computed. [2022-02-20 16:59:28,371 INFO L854 garLoopResultBuilder]: At program point L141-3(lines 141 142) the Hoare annotation is: (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) [2022-02-20 16:59:28,371 INFO L858 garLoopResultBuilder]: For program point L141-4(lines 141 142) no Hoare annotation was computed. [2022-02-20 16:59:28,371 INFO L858 garLoopResultBuilder]: For program point L125-2(lines 125 126) no Hoare annotation was computed. [2022-02-20 16:59:28,371 INFO L854 garLoopResultBuilder]: At program point L125-3(lines 125 126) the Hoare annotation is: (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) [2022-02-20 16:59:28,372 INFO L858 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2022-02-20 16:59:28,374 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 16:59:28,374 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:59:28,391 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:59:28,391 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:59:28,391 WARN L170 areAnnotationChecker]: L93-4 has no Hoare annotation [2022-02-20 16:59:28,391 WARN L170 areAnnotationChecker]: L93-4 has no Hoare annotation [2022-02-20 16:59:28,393 WARN L170 areAnnotationChecker]: L93-4 has no Hoare annotation [2022-02-20 16:59:28,393 WARN L170 areAnnotationChecker]: L96-4 has no Hoare annotation [2022-02-20 16:59:28,393 WARN L170 areAnnotationChecker]: L96-4 has no Hoare annotation [2022-02-20 16:59:28,393 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-02-20 16:59:28,393 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-02-20 16:59:28,393 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-02-20 16:59:28,393 WARN L170 areAnnotationChecker]: L96-4 has no Hoare annotation [2022-02-20 16:59:28,393 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-02-20 16:59:28,393 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-02-20 16:59:28,393 WARN L170 areAnnotationChecker]: L118-4 has no Hoare annotation [2022-02-20 16:59:28,394 WARN L170 areAnnotationChecker]: L118-4 has no Hoare annotation [2022-02-20 16:59:28,394 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:59:28,394 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-02-20 16:59:28,394 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-02-20 16:59:28,394 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-02-20 16:59:28,394 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:59:28,394 WARN L170 areAnnotationChecker]: L118-4 has no Hoare annotation [2022-02-20 16:59:28,394 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:59:28,394 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:59:28,394 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-02-20 16:59:28,394 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-02-20 16:59:28,394 WARN L170 areAnnotationChecker]: L93-2 has no Hoare annotation [2022-02-20 16:59:28,394 WARN L170 areAnnotationChecker]: L96-2 has no Hoare annotation [2022-02-20 16:59:28,394 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:59:28,394 WARN L170 areAnnotationChecker]: L138-4 has no Hoare annotation [2022-02-20 16:59:28,394 WARN L170 areAnnotationChecker]: L138-4 has no Hoare annotation [2022-02-20 16:59:28,394 WARN L170 areAnnotationChecker]: L80-2 has no Hoare annotation [2022-02-20 16:59:28,394 WARN L170 areAnnotationChecker]: L93-2 has no Hoare annotation [2022-02-20 16:59:28,394 WARN L170 areAnnotationChecker]: L138-4 has no Hoare annotation [2022-02-20 16:59:28,394 WARN L170 areAnnotationChecker]: L141-4 has no Hoare annotation [2022-02-20 16:59:28,394 WARN L170 areAnnotationChecker]: L141-4 has no Hoare annotation [2022-02-20 16:59:28,394 WARN L170 areAnnotationChecker]: L141-2 has no Hoare annotation [2022-02-20 16:59:28,395 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2022-02-20 16:59:28,395 WARN L170 areAnnotationChecker]: L146-4 has no Hoare annotation [2022-02-20 16:59:28,395 WARN L170 areAnnotationChecker]: L146-4 has no Hoare annotation [2022-02-20 16:59:28,395 WARN L170 areAnnotationChecker]: L141-4 has no Hoare annotation [2022-02-20 16:59:28,395 WARN L170 areAnnotationChecker]: L141-2 has no Hoare annotation [2022-02-20 16:59:28,395 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2022-02-20 16:59:28,395 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2022-02-20 16:59:28,395 WARN L170 areAnnotationChecker]: L146-4 has no Hoare annotation [2022-02-20 16:59:28,395 WARN L170 areAnnotationChecker]: L149-4 has no Hoare annotation [2022-02-20 16:59:28,395 WARN L170 areAnnotationChecker]: L149-4 has no Hoare annotation [2022-02-20 16:59:28,395 WARN L170 areAnnotationChecker]: L149-2 has no Hoare annotation [2022-02-20 16:59:28,395 WARN L170 areAnnotationChecker]: L138-2 has no Hoare annotation [2022-02-20 16:59:28,395 WARN L170 areAnnotationChecker]: L121-4 has no Hoare annotation [2022-02-20 16:59:28,395 WARN L170 areAnnotationChecker]: L121-4 has no Hoare annotation [2022-02-20 16:59:28,395 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:59:28,395 WARN L170 areAnnotationChecker]: L149-4 has no Hoare annotation [2022-02-20 16:59:28,395 WARN L170 areAnnotationChecker]: L149-2 has no Hoare annotation [2022-02-20 16:59:28,395 WARN L170 areAnnotationChecker]: L121-4 has no Hoare annotation [2022-02-20 16:59:28,395 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:59:28,395 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:59:28,395 WARN L170 areAnnotationChecker]: L146-2 has no Hoare annotation [2022-02-20 16:59:28,395 WARN L170 areAnnotationChecker]: L118-2 has no Hoare annotation [2022-02-20 16:59:28,396 WARN L170 areAnnotationChecker]: L118-2 has no Hoare annotation [2022-02-20 16:59:28,396 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-02-20 16:59:28,396 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-02-20 16:59:28,396 WARN L170 areAnnotationChecker]: L125-2 has no Hoare annotation [2022-02-20 16:59:28,396 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-02-20 16:59:28,396 WARN L170 areAnnotationChecker]: L118-2 has no Hoare annotation [2022-02-20 16:59:28,396 WARN L170 areAnnotationChecker]: L132-4 has no Hoare annotation [2022-02-20 16:59:28,396 WARN L170 areAnnotationChecker]: L132-4 has no Hoare annotation [2022-02-20 16:59:28,396 WARN L170 areAnnotationChecker]: L132-2 has no Hoare annotation [2022-02-20 16:59:28,396 WARN L170 areAnnotationChecker]: L125-2 has no Hoare annotation [2022-02-20 16:59:28,396 WARN L170 areAnnotationChecker]: L121-2 has no Hoare annotation [2022-02-20 16:59:28,396 WARN L170 areAnnotationChecker]: L132-4 has no Hoare annotation [2022-02-20 16:59:28,396 WARN L170 areAnnotationChecker]: L132-2 has no Hoare annotation [2022-02-20 16:59:28,396 WARN L170 areAnnotationChecker]: L129-2 has no Hoare annotation [2022-02-20 16:59:28,396 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:59:28,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:59:28 BoogieIcfgContainer [2022-02-20 16:59:28,413 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:59:28,414 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:59:28,414 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:59:28,414 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:59:28,414 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:59:24" (3/4) ... [2022-02-20 16:59:28,416 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:59:28,426 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-02-20 16:59:28,427 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-02-20 16:59:28,427 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:59:28,427 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:59:28,475 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:59:28,476 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:59:28,477 INFO L158 Benchmark]: Toolchain (without parser) took 5279.98ms. Allocated memory was 117.4MB in the beginning and 148.9MB in the end (delta: 31.5MB). Free memory was 88.4MB in the beginning and 99.8MB in the end (delta: -11.4MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2022-02-20 16:59:28,477 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:59:28,477 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.72ms. Allocated memory is still 117.4MB. Free memory was 88.2MB in the beginning and 88.3MB in the end (delta: -178.9kB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2022-02-20 16:59:28,477 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.15ms. Allocated memory is still 117.4MB. Free memory was 88.3MB in the beginning and 85.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:59:28,479 INFO L158 Benchmark]: Boogie Preprocessor took 55.90ms. Allocated memory is still 117.4MB. Free memory was 85.4MB in the beginning and 83.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:59:28,479 INFO L158 Benchmark]: RCFGBuilder took 521.97ms. Allocated memory is still 117.4MB. Free memory was 83.1MB in the beginning and 63.9MB in the end (delta: 19.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-02-20 16:59:28,479 INFO L158 Benchmark]: TraceAbstraction took 4285.43ms. Allocated memory was 117.4MB in the beginning and 148.9MB in the end (delta: 31.5MB). Free memory was 63.3MB in the beginning and 104.0MB in the end (delta: -40.7MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2022-02-20 16:59:28,480 INFO L158 Benchmark]: Witness Printer took 62.21ms. Allocated memory is still 148.9MB. Free memory was 104.0MB in the beginning and 99.8MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:59:28,481 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.15ms. Allocated memory is still 117.4MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.72ms. Allocated memory is still 117.4MB. Free memory was 88.2MB in the beginning and 88.3MB in the end (delta: -178.9kB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.15ms. Allocated memory is still 117.4MB. Free memory was 88.3MB in the beginning and 85.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.90ms. Allocated memory is still 117.4MB. Free memory was 85.4MB in the beginning and 83.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 521.97ms. Allocated memory is still 117.4MB. Free memory was 83.1MB in the beginning and 63.9MB in the end (delta: 19.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4285.43ms. Allocated memory was 117.4MB in the beginning and 148.9MB in the end (delta: 31.5MB). Free memory was 63.3MB in the beginning and 104.0MB in the end (delta: -40.7MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * Witness Printer took 62.21ms. Allocated memory is still 148.9MB. Free memory was 104.0MB in the beginning and 99.8MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * 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 1 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 415 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 415 mSDsluCounter, 199 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 117 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 218 IncrementalHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 82 mSDtfsCounter, 218 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=3, InterpolantAutomatonStates: 45, 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, 4 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 68 NumberOfFragments, 106 HoareAnnotationTreeSize, 15 FomulaSimplifications, 450 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 15 FomulaSimplificationsInter, 580 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 274 ConstructedInterpolants, 0 QuantifiedInterpolants, 885 SizeOfPredicates, 4 NumberOfNonLiveVariables, 456 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 907/979 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: 5]: Loop Invariant Derived loop invariant: (5 == n && !(cond == 0)) && i <= n - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: (5 == n && !(cond == 0)) || (5 == n && i == 0) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: n + -5 == 0 - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: n + -5 == 0 - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: n + -5 == 0 - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: n + -5 == 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: n + -5 == 0 - InvariantResult [Line: 149]: Loop Invariant Derived loop invariant: n + -5 == 0 - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: n + -5 == 0 - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: n + -5 == 0 - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: ((5 == n && !(cond == 0)) && i <= n) || (5 == n && i == 0) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: n + -5 == 0 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: n + -5 == 0 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: n + -5 == 0 - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: n + -5 == 0 RESULT: Ultimate proved your program to be correct! [2022-02-20 16:59:28,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE