./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 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b8422fc1deba967a7db5fbdac44a5d9acb26e171 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 18:11:04,632 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:11:04,635 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:11:04,653 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:11:04,654 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:11:04,656 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:11:04,658 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:11:04,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:11:04,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:11:04,676 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:11:04,677 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:11:04,679 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:11:04,679 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:11:04,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:11:04,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:11:04,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:11:04,687 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:11:04,689 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:11:04,691 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:11:04,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:11:04,699 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:11:04,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:11:04,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:11:04,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:11:04,709 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:11:04,710 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:11:04,711 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:11:04,712 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:11:04,713 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:11:04,714 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:11:04,714 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:11:04,716 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:11:04,716 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:11:04,717 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:11:04,719 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:11:04,719 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:11:04,720 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:11:04,721 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:11:04,721 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:11:04,722 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:11:04,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:11:04,724 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 18:11:04,749 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:11:04,749 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:11:04,751 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:11:04,752 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:11:04,752 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:11:04,752 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:11:04,753 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:11:04,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 18:11:04,753 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:11:04,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:11:04,755 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:11:04,755 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:11:04,755 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:11:04,756 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:11:04,756 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:11:04,757 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:11:04,757 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:11:04,757 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:11:04,757 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:11:04,758 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:11:04,758 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:11:04,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:11:04,759 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:11:04,759 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:11:04,759 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:11:04,759 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 18:11:04,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 18:11:04,760 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:11:04,760 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:11:04,761 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> b8422fc1deba967a7db5fbdac44a5d9acb26e171 [2020-07-28 18:11:05,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:11:05,094 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:11:05,097 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:11:05,099 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:11:05,107 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:11:05,108 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/lu.cmp.c [2020-07-28 18:11:05,178 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8784cb014/87cff8a5c10a43dda5f68816daa0c0d0/FLAG37f6634c2 [2020-07-28 18:11:05,633 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:11:05,635 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/lu.cmp.c [2020-07-28 18:11:05,643 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8784cb014/87cff8a5c10a43dda5f68816daa0c0d0/FLAG37f6634c2 [2020-07-28 18:11:06,012 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8784cb014/87cff8a5c10a43dda5f68816daa0c0d0 [2020-07-28 18:11:06,017 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:11:06,021 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:11:06,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:11:06,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:11:06,027 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:11:06,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:11:06" (1/1) ... [2020-07-28 18:11:06,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b622eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:06, skipping insertion in model container [2020-07-28 18:11:06,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:11:06" (1/1) ... [2020-07-28 18:11:06,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:11:06,079 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:11:06,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:11:06,335 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:11:06,463 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:11:06,488 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:11:06,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:06 WrapperNode [2020-07-28 18:11:06,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:11:06,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:11:06,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:11:06,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:11:06,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:06" (1/1) ... [2020-07-28 18:11:06,508 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:06" (1/1) ... [2020-07-28 18:11:06,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:11:06,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:11:06,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:11:06,555 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:11:06,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:06" (1/1) ... [2020-07-28 18:11:06,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:06" (1/1) ... [2020-07-28 18:11:06,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:06" (1/1) ... [2020-07-28 18:11:06,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:06" (1/1) ... [2020-07-28 18:11:06,586 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:06" (1/1) ... [2020-07-28 18:11:06,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:06" (1/1) ... [2020-07-28 18:11:06,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:06" (1/1) ... [2020-07-28 18:11:06,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:11:06,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:11:06,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:11:06,600 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:11:06,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:11:06,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-28 18:11:06,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-28 18:11:06,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:11:06,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:11:06,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 18:11:06,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 18:11:07,233 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:11:07,233 INFO L295 CfgBuilder]: Removed 21 assume(true) statements. [2020-07-28 18:11:07,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:11:07 BoogieIcfgContainer [2020-07-28 18:11:07,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:11:07,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:11:07,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:11:07,245 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:11:07,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:11:06" (1/3) ... [2020-07-28 18:11:07,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66afe884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:11:07, skipping insertion in model container [2020-07-28 18:11:07,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:06" (2/3) ... [2020-07-28 18:11:07,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66afe884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:11:07, skipping insertion in model container [2020-07-28 18:11:07,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:11:07" (3/3) ... [2020-07-28 18:11:07,255 INFO L109 eAbstractionObserver]: Analyzing ICFG lu.cmp.c [2020-07-28 18:11:07,273 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:11:07,281 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:11:07,293 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:11:07,312 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:11:07,312 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:11:07,313 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:11:07,313 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:11:07,313 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:11:07,313 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:11:07,313 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:11:07,314 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:11:07,328 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2020-07-28 18:11:07,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-28 18:11:07,333 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:11:07,334 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:11:07,334 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:11:07,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:11:07,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1809811384, now seen corresponding path program 1 times [2020-07-28 18:11:07,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:11:07,347 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122241205] [2020-07-28 18:11:07,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:11:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:11:07,559 INFO L280 TraceCheckUtils]: 0: Hoare triple {53#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {53#true} is VALID [2020-07-28 18:11:07,561 INFO L280 TraceCheckUtils]: 1: Hoare triple {53#true} havoc main_#res;havoc main_#t~mem2, main_#t~mem3, main_#t~post1, main_#t~post0, main_#t~ret4, main_~i~0, main_~j~0, main_~nmax~0, main_~n~0, main_~chkerr~0, main_~eps~0, main_~w~0;havoc main_~i~0;havoc main_~j~0;main_~nmax~0 := 50;main_~n~0 := 5;havoc main_~chkerr~0;havoc main_~eps~0;havoc main_~w~0;main_~eps~0 := 1.0E-6;main_~i~0 := 0; {55#(<= 5 ULTIMATE.start_main_~n~0)} is VALID [2020-07-28 18:11:07,563 INFO L280 TraceCheckUtils]: 2: Hoare triple {55#(<= 5 ULTIMATE.start_main_~n~0)} assume !!(main_~i~0 <= main_~n~0);main_~w~0 := 0.0;main_~j~0 := 0; {56#(and (= 0 ULTIMATE.start_main_~j~0) (<= 5 ULTIMATE.start_main_~n~0))} is VALID [2020-07-28 18:11:07,564 INFO L280 TraceCheckUtils]: 3: Hoare triple {56#(and (= 0 ULTIMATE.start_main_~j~0) (<= 5 ULTIMATE.start_main_~n~0))} assume !(main_~j~0 <= main_~n~0); {54#false} is VALID [2020-07-28 18:11:07,565 INFO L280 TraceCheckUtils]: 4: Hoare triple {54#false} __VERIFIER_assert_#in~cond := (if main_~i~0 < 50 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {54#false} is VALID [2020-07-28 18:11:07,565 INFO L280 TraceCheckUtils]: 5: Hoare triple {54#false} assume 0 == __VERIFIER_assert_~cond; {54#false} is VALID [2020-07-28 18:11:07,566 INFO L280 TraceCheckUtils]: 6: Hoare triple {54#false} assume !false; {54#false} is VALID [2020-07-28 18:11:07,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:11:07,569 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122241205] [2020-07-28 18:11:07,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:11:07,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 18:11:07,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552798450] [2020-07-28 18:11:07,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-28 18:11:07,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:11:07,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:11:07,600 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:11:07,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:11:07,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:11:07,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:11:07,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:11:07,613 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 4 states. [2020-07-28 18:11:07,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:11:07,887 INFO L93 Difference]: Finished difference Result 102 states and 159 transitions. [2020-07-28 18:11:07,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:11:07,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-28 18:11:07,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:11:07,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:11:07,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2020-07-28 18:11:07,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:11:07,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2020-07-28 18:11:07,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2020-07-28 18:11:08,130 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:11:08,142 INFO L225 Difference]: With dead ends: 102 [2020-07-28 18:11:08,142 INFO L226 Difference]: Without dead ends: 17 [2020-07-28 18:11:08,146 INFO L675 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 [2020-07-28 18:11:08,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-28 18:11:08,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2020-07-28 18:11:08,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:11:08,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 14 states. [2020-07-28 18:11:08,184 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 14 states. [2020-07-28 18:11:08,184 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 14 states. [2020-07-28 18:11:08,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:11:08,187 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-07-28 18:11:08,187 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2020-07-28 18:11:08,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:11:08,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:11:08,188 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 17 states. [2020-07-28 18:11:08,189 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 17 states. [2020-07-28 18:11:08,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:11:08,191 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-07-28 18:11:08,191 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2020-07-28 18:11:08,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:11:08,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:11:08,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:11:08,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:11:08,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-28 18:11:08,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2020-07-28 18:11:08,196 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2020-07-28 18:11:08,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:11:08,196 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-07-28 18:11:08,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:11:08,197 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2020-07-28 18:11:08,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 18:11:08,198 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:11:08,198 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:11:08,199 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 18:11:08,199 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:11:08,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:11:08,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1948892579, now seen corresponding path program 1 times [2020-07-28 18:11:08,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:11:08,201 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289612297] [2020-07-28 18:11:08,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:11:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:11:08,335 INFO L280 TraceCheckUtils]: 0: Hoare triple {244#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {244#true} is VALID [2020-07-28 18:11:08,336 INFO L280 TraceCheckUtils]: 1: Hoare triple {244#true} havoc main_#res;havoc main_#t~mem2, main_#t~mem3, main_#t~post1, main_#t~post0, main_#t~ret4, main_~i~0, main_~j~0, main_~nmax~0, main_~n~0, main_~chkerr~0, main_~eps~0, main_~w~0;havoc main_~i~0;havoc main_~j~0;main_~nmax~0 := 50;main_~n~0 := 5;havoc main_~chkerr~0;havoc main_~eps~0;havoc main_~w~0;main_~eps~0 := 1.0E-6;main_~i~0 := 0; {246#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:11:08,337 INFO L280 TraceCheckUtils]: 2: Hoare triple {246#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 <= main_~n~0);main_~w~0 := 0.0;main_~j~0 := 0; {246#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:11:08,338 INFO L280 TraceCheckUtils]: 3: Hoare triple {246#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~j~0 <= main_~n~0);call write~real(~convertINTToDOUBLE(1 + main_~i~0 + (1 + main_~j~0)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8); {246#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:11:08,339 INFO L280 TraceCheckUtils]: 4: Hoare triple {246#(= 0 ULTIMATE.start_main_~i~0)} assume main_~i~0 == main_~j~0;call main_#t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);havoc main_#t~mem2; {246#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:11:08,340 INFO L280 TraceCheckUtils]: 5: Hoare triple {246#(= 0 ULTIMATE.start_main_~i~0)} call main_#t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);main_~w~0 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0, main_#t~mem3);havoc main_#t~mem3; {246#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:11:08,341 INFO L280 TraceCheckUtils]: 6: Hoare triple {246#(= 0 ULTIMATE.start_main_~i~0)} main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; {246#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:11:08,342 INFO L280 TraceCheckUtils]: 7: Hoare triple {246#(= 0 ULTIMATE.start_main_~i~0)} assume !(main_~j~0 <= main_~n~0); {246#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:11:08,343 INFO L280 TraceCheckUtils]: 8: Hoare triple {246#(= 0 ULTIMATE.start_main_~i~0)} __VERIFIER_assert_#in~cond := (if main_~i~0 < 50 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {247#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:11:08,344 INFO L280 TraceCheckUtils]: 9: Hoare triple {247#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {245#false} is VALID [2020-07-28 18:11:08,344 INFO L280 TraceCheckUtils]: 10: Hoare triple {245#false} assume !false; {245#false} is VALID [2020-07-28 18:11:08,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 18:11:08,346 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289612297] [2020-07-28 18:11:08,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:11:08,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 18:11:08,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146490091] [2020-07-28 18:11:08,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-28 18:11:08,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:11:08,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:11:08,367 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:11:08,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:11:08,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:11:08,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:11:08,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:11:08,369 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 4 states. [2020-07-28 18:11:08,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:11:08,493 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2020-07-28 18:11:08,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:11:08,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-28 18:11:08,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:11:08,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:11:08,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2020-07-28 18:11:08,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:11:08,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2020-07-28 18:11:08,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2020-07-28 18:11:08,539 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:11:08,541 INFO L225 Difference]: With dead ends: 26 [2020-07-28 18:11:08,541 INFO L226 Difference]: Without dead ends: 24 [2020-07-28 18:11:08,542 INFO L675 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 [2020-07-28 18:11:08,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-28 18:11:08,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2020-07-28 18:11:08,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:11:08,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 22 states. [2020-07-28 18:11:08,562 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 22 states. [2020-07-28 18:11:08,562 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 22 states. [2020-07-28 18:11:08,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:11:08,565 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-28 18:11:08,565 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-28 18:11:08,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:11:08,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:11:08,566 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 24 states. [2020-07-28 18:11:08,567 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 24 states. [2020-07-28 18:11:08,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:11:08,569 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-28 18:11:08,569 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-28 18:11:08,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:11:08,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:11:08,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:11:08,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:11:08,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-28 18:11:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2020-07-28 18:11:08,573 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 11 [2020-07-28 18:11:08,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:11:08,573 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-07-28 18:11:08,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:11:08,574 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-28 18:11:08,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-28 18:11:08,575 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:11:08,575 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:11:08,576 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 18:11:08,576 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:11:08,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:11:08,577 INFO L82 PathProgramCache]: Analyzing trace with hash -2121905774, now seen corresponding path program 1 times [2020-07-28 18:11:08,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:11:08,577 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832830060] [2020-07-28 18:11:08,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:11:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:11:08,670 INFO L280 TraceCheckUtils]: 0: Hoare triple {363#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {363#true} is VALID [2020-07-28 18:11:08,672 INFO L280 TraceCheckUtils]: 1: Hoare triple {363#true} havoc main_#res;havoc main_#t~mem2, main_#t~mem3, main_#t~post1, main_#t~post0, main_#t~ret4, main_~i~0, main_~j~0, main_~nmax~0, main_~n~0, main_~chkerr~0, main_~eps~0, main_~w~0;havoc main_~i~0;havoc main_~j~0;main_~nmax~0 := 50;main_~n~0 := 5;havoc main_~chkerr~0;havoc main_~eps~0;havoc main_~w~0;main_~eps~0 := 1.0E-6;main_~i~0 := 0; {365#(<= 5 ULTIMATE.start_main_~n~0)} is VALID [2020-07-28 18:11:08,673 INFO L280 TraceCheckUtils]: 2: Hoare triple {365#(<= 5 ULTIMATE.start_main_~n~0)} assume !!(main_~i~0 <= main_~n~0);main_~w~0 := 0.0;main_~j~0 := 0; {366#(and (= 0 ULTIMATE.start_main_~j~0) (<= 5 ULTIMATE.start_main_~n~0))} is VALID [2020-07-28 18:11:08,674 INFO L280 TraceCheckUtils]: 3: Hoare triple {366#(and (= 0 ULTIMATE.start_main_~j~0) (<= 5 ULTIMATE.start_main_~n~0))} assume !!(main_~j~0 <= main_~n~0);call write~real(~convertINTToDOUBLE(1 + main_~i~0 + (1 + main_~j~0)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8); {366#(and (= 0 ULTIMATE.start_main_~j~0) (<= 5 ULTIMATE.start_main_~n~0))} is VALID [2020-07-28 18:11:08,675 INFO L280 TraceCheckUtils]: 4: Hoare triple {366#(and (= 0 ULTIMATE.start_main_~j~0) (<= 5 ULTIMATE.start_main_~n~0))} assume main_~i~0 == main_~j~0;call main_#t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);havoc main_#t~mem2; {366#(and (= 0 ULTIMATE.start_main_~j~0) (<= 5 ULTIMATE.start_main_~n~0))} is VALID [2020-07-28 18:11:08,676 INFO L280 TraceCheckUtils]: 5: Hoare triple {366#(and (= 0 ULTIMATE.start_main_~j~0) (<= 5 ULTIMATE.start_main_~n~0))} call main_#t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);main_~w~0 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0, main_#t~mem3);havoc main_#t~mem3; {366#(and (= 0 ULTIMATE.start_main_~j~0) (<= 5 ULTIMATE.start_main_~n~0))} is VALID [2020-07-28 18:11:08,677 INFO L280 TraceCheckUtils]: 6: Hoare triple {366#(and (= 0 ULTIMATE.start_main_~j~0) (<= 5 ULTIMATE.start_main_~n~0))} main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; {367#(<= (+ ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~n~0)} is VALID [2020-07-28 18:11:08,678 INFO L280 TraceCheckUtils]: 7: Hoare triple {367#(<= (+ ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~n~0)} assume !(main_~j~0 <= main_~n~0); {364#false} is VALID [2020-07-28 18:11:08,679 INFO L280 TraceCheckUtils]: 8: Hoare triple {364#false} __VERIFIER_assert_#in~cond := (if main_~i~0 < 50 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {364#false} is VALID [2020-07-28 18:11:08,679 INFO L280 TraceCheckUtils]: 9: Hoare triple {364#false} assume !(0 == __VERIFIER_assert_~cond); {364#false} is VALID [2020-07-28 18:11:08,679 INFO L280 TraceCheckUtils]: 10: Hoare triple {364#false} call write~real(main_~w~0, ~#b~0.base, ~#b~0.offset + 8 * main_~i~0, 8); {364#false} is VALID [2020-07-28 18:11:08,680 INFO L280 TraceCheckUtils]: 11: Hoare triple {364#false} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {364#false} is VALID [2020-07-28 18:11:08,682 INFO L280 TraceCheckUtils]: 12: Hoare triple {364#false} assume !!(main_~i~0 <= main_~n~0);main_~w~0 := 0.0;main_~j~0 := 0; {364#false} is VALID [2020-07-28 18:11:08,683 INFO L280 TraceCheckUtils]: 13: Hoare triple {364#false} assume !!(main_~j~0 <= main_~n~0);call write~real(~convertINTToDOUBLE(1 + main_~i~0 + (1 + main_~j~0)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8); {364#false} is VALID [2020-07-28 18:11:08,683 INFO L280 TraceCheckUtils]: 14: Hoare triple {364#false} assume main_~i~0 == main_~j~0;call main_#t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);havoc main_#t~mem2; {364#false} is VALID [2020-07-28 18:11:08,683 INFO L280 TraceCheckUtils]: 15: Hoare triple {364#false} call main_#t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);main_~w~0 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0, main_#t~mem3);havoc main_#t~mem3; {364#false} is VALID [2020-07-28 18:11:08,684 INFO L280 TraceCheckUtils]: 16: Hoare triple {364#false} main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; {364#false} is VALID [2020-07-28 18:11:08,684 INFO L280 TraceCheckUtils]: 17: Hoare triple {364#false} assume !(main_~j~0 <= main_~n~0); {364#false} is VALID [2020-07-28 18:11:08,684 INFO L280 TraceCheckUtils]: 18: Hoare triple {364#false} __VERIFIER_assert_#in~cond := (if main_~i~0 < 50 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {364#false} is VALID [2020-07-28 18:11:08,685 INFO L280 TraceCheckUtils]: 19: Hoare triple {364#false} assume 0 == __VERIFIER_assert_~cond; {364#false} is VALID [2020-07-28 18:11:08,685 INFO L280 TraceCheckUtils]: 20: Hoare triple {364#false} assume !false; {364#false} is VALID [2020-07-28 18:11:08,690 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-28 18:11:08,693 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832830060] [2020-07-28 18:11:08,694 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276735051] [2020-07-28 18:11:08,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:11:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:11:08,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-28 18:11:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:11:08,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:11:08,957 INFO L280 TraceCheckUtils]: 0: Hoare triple {363#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {363#true} is VALID [2020-07-28 18:11:08,958 INFO L280 TraceCheckUtils]: 1: Hoare triple {363#true} havoc main_#res;havoc main_#t~mem2, main_#t~mem3, main_#t~post1, main_#t~post0, main_#t~ret4, main_~i~0, main_~j~0, main_~nmax~0, main_~n~0, main_~chkerr~0, main_~eps~0, main_~w~0;havoc main_~i~0;havoc main_~j~0;main_~nmax~0 := 50;main_~n~0 := 5;havoc main_~chkerr~0;havoc main_~eps~0;havoc main_~w~0;main_~eps~0 := 1.0E-6;main_~i~0 := 0; {365#(<= 5 ULTIMATE.start_main_~n~0)} is VALID [2020-07-28 18:11:08,960 INFO L280 TraceCheckUtils]: 2: Hoare triple {365#(<= 5 ULTIMATE.start_main_~n~0)} assume !!(main_~i~0 <= main_~n~0);main_~w~0 := 0.0;main_~j~0 := 0; {377#(and (<= 5 ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~j~0 0))} is VALID [2020-07-28 18:11:08,961 INFO L280 TraceCheckUtils]: 3: Hoare triple {377#(and (<= 5 ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~j~0 0))} assume !!(main_~j~0 <= main_~n~0);call write~real(~convertINTToDOUBLE(1 + main_~i~0 + (1 + main_~j~0)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8); {377#(and (<= 5 ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~j~0 0))} is VALID [2020-07-28 18:11:08,963 INFO L280 TraceCheckUtils]: 4: Hoare triple {377#(and (<= 5 ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~j~0 0))} assume main_~i~0 == main_~j~0;call main_#t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);havoc main_#t~mem2; {377#(and (<= 5 ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~j~0 0))} is VALID [2020-07-28 18:11:08,964 INFO L280 TraceCheckUtils]: 5: Hoare triple {377#(and (<= 5 ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~j~0 0))} call main_#t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);main_~w~0 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0, main_#t~mem3);havoc main_#t~mem3; {377#(and (<= 5 ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~j~0 0))} is VALID [2020-07-28 18:11:08,965 INFO L280 TraceCheckUtils]: 6: Hoare triple {377#(and (<= 5 ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~j~0 0))} main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; {390#(and (<= ULTIMATE.start_main_~j~0 1) (<= 5 ULTIMATE.start_main_~n~0))} is VALID [2020-07-28 18:11:08,965 INFO L280 TraceCheckUtils]: 7: Hoare triple {390#(and (<= ULTIMATE.start_main_~j~0 1) (<= 5 ULTIMATE.start_main_~n~0))} assume !(main_~j~0 <= main_~n~0); {364#false} is VALID [2020-07-28 18:11:08,966 INFO L280 TraceCheckUtils]: 8: Hoare triple {364#false} __VERIFIER_assert_#in~cond := (if main_~i~0 < 50 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {364#false} is VALID [2020-07-28 18:11:08,966 INFO L280 TraceCheckUtils]: 9: Hoare triple {364#false} assume !(0 == __VERIFIER_assert_~cond); {364#false} is VALID [2020-07-28 18:11:08,966 INFO L280 TraceCheckUtils]: 10: Hoare triple {364#false} call write~real(main_~w~0, ~#b~0.base, ~#b~0.offset + 8 * main_~i~0, 8); {364#false} is VALID [2020-07-28 18:11:08,967 INFO L280 TraceCheckUtils]: 11: Hoare triple {364#false} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {364#false} is VALID [2020-07-28 18:11:08,967 INFO L280 TraceCheckUtils]: 12: Hoare triple {364#false} assume !!(main_~i~0 <= main_~n~0);main_~w~0 := 0.0;main_~j~0 := 0; {364#false} is VALID [2020-07-28 18:11:08,967 INFO L280 TraceCheckUtils]: 13: Hoare triple {364#false} assume !!(main_~j~0 <= main_~n~0);call write~real(~convertINTToDOUBLE(1 + main_~i~0 + (1 + main_~j~0)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8); {364#false} is VALID [2020-07-28 18:11:08,968 INFO L280 TraceCheckUtils]: 14: Hoare triple {364#false} assume main_~i~0 == main_~j~0;call main_#t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);havoc main_#t~mem2; {364#false} is VALID [2020-07-28 18:11:08,968 INFO L280 TraceCheckUtils]: 15: Hoare triple {364#false} call main_#t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);main_~w~0 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0, main_#t~mem3);havoc main_#t~mem3; {364#false} is VALID [2020-07-28 18:11:08,968 INFO L280 TraceCheckUtils]: 16: Hoare triple {364#false} main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; {364#false} is VALID [2020-07-28 18:11:08,969 INFO L280 TraceCheckUtils]: 17: Hoare triple {364#false} assume !(main_~j~0 <= main_~n~0); {364#false} is VALID [2020-07-28 18:11:08,969 INFO L280 TraceCheckUtils]: 18: Hoare triple {364#false} __VERIFIER_assert_#in~cond := (if main_~i~0 < 50 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {364#false} is VALID [2020-07-28 18:11:08,969 INFO L280 TraceCheckUtils]: 19: Hoare triple {364#false} assume 0 == __VERIFIER_assert_~cond; {364#false} is VALID [2020-07-28 18:11:08,970 INFO L280 TraceCheckUtils]: 20: Hoare triple {364#false} assume !false; {364#false} is VALID [2020-07-28 18:11:08,971 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-28 18:11:08,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:11:08,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-07-28 18:11:08,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799445609] [2020-07-28 18:11:08,973 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-07-28 18:11:08,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:11:08,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-28 18:11:09,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:11:09,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-28 18:11:09,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:11:09,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-28 18:11:09,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-07-28 18:11:09,016 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 7 states. [2020-07-28 18:11:09,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:11:09,138 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2020-07-28 18:11:09,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:11:09,139 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-07-28 18:11:09,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:11:09,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 18:11:09,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2020-07-28 18:11:09,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 18:11:09,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2020-07-28 18:11:09,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2020-07-28 18:11:09,189 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:11:09,191 INFO L225 Difference]: With dead ends: 50 [2020-07-28 18:11:09,191 INFO L226 Difference]: Without dead ends: 36 [2020-07-28 18:11:09,192 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-07-28 18:11:09,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-28 18:11:09,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2020-07-28 18:11:09,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:11:09,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 30 states. [2020-07-28 18:11:09,216 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 30 states. [2020-07-28 18:11:09,216 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 30 states. [2020-07-28 18:11:09,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:11:09,218 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-07-28 18:11:09,219 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2020-07-28 18:11:09,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:11:09,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:11:09,219 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 36 states. [2020-07-28 18:11:09,220 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 36 states. [2020-07-28 18:11:09,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:11:09,222 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-07-28 18:11:09,222 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2020-07-28 18:11:09,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:11:09,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:11:09,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:11:09,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:11:09,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-28 18:11:09,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2020-07-28 18:11:09,225 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 21 [2020-07-28 18:11:09,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:11:09,226 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2020-07-28 18:11:09,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-28 18:11:09,226 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2020-07-28 18:11:09,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-28 18:11:09,227 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:11:09,227 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:11:09,440 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-28 18:11:09,441 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:11:09,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:11:09,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1300118884, now seen corresponding path program 2 times [2020-07-28 18:11:09,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:11:09,442 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958513101] [2020-07-28 18:11:09,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:11:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:11:09,519 INFO L280 TraceCheckUtils]: 0: Hoare triple {606#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {606#true} is VALID [2020-07-28 18:11:09,520 INFO L280 TraceCheckUtils]: 1: Hoare triple {606#true} havoc main_#res;havoc main_#t~mem2, main_#t~mem3, main_#t~post1, main_#t~post0, main_#t~ret4, main_~i~0, main_~j~0, main_~nmax~0, main_~n~0, main_~chkerr~0, main_~eps~0, main_~w~0;havoc main_~i~0;havoc main_~j~0;main_~nmax~0 := 50;main_~n~0 := 5;havoc main_~chkerr~0;havoc main_~eps~0;havoc main_~w~0;main_~eps~0 := 1.0E-6;main_~i~0 := 0; {608#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:11:09,521 INFO L280 TraceCheckUtils]: 2: Hoare triple {608#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 <= main_~n~0);main_~w~0 := 0.0;main_~j~0 := 0; {609#(and (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:11:09,522 INFO L280 TraceCheckUtils]: 3: Hoare triple {609#(and (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~j~0))} assume !!(main_~j~0 <= main_~n~0);call write~real(~convertINTToDOUBLE(1 + main_~i~0 + (1 + main_~j~0)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8); {609#(and (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:11:09,523 INFO L280 TraceCheckUtils]: 4: Hoare triple {609#(and (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~j~0))} assume main_~i~0 == main_~j~0;call main_#t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);havoc main_#t~mem2; {609#(and (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:11:09,524 INFO L280 TraceCheckUtils]: 5: Hoare triple {609#(and (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~j~0))} call main_#t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);main_~w~0 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0, main_#t~mem3);havoc main_#t~mem3; {609#(and (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:11:09,525 INFO L280 TraceCheckUtils]: 6: Hoare triple {609#(and (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~j~0))} main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; {610#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:11:09,526 INFO L280 TraceCheckUtils]: 7: Hoare triple {610#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~j~0))} assume !!(main_~j~0 <= main_~n~0);call write~real(~convertINTToDOUBLE(1 + main_~i~0 + (1 + main_~j~0)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8); {610#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:11:09,527 INFO L280 TraceCheckUtils]: 8: Hoare triple {610#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~j~0))} assume main_~i~0 == main_~j~0;call main_#t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);havoc main_#t~mem2; {607#false} is VALID [2020-07-28 18:11:09,527 INFO L280 TraceCheckUtils]: 9: Hoare triple {607#false} call main_#t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);main_~w~0 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0, main_#t~mem3);havoc main_#t~mem3; {607#false} is VALID [2020-07-28 18:11:09,528 INFO L280 TraceCheckUtils]: 10: Hoare triple {607#false} main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; {607#false} is VALID [2020-07-28 18:11:09,528 INFO L280 TraceCheckUtils]: 11: Hoare triple {607#false} assume !(main_~j~0 <= main_~n~0); {607#false} is VALID [2020-07-28 18:11:09,528 INFO L280 TraceCheckUtils]: 12: Hoare triple {607#false} __VERIFIER_assert_#in~cond := (if main_~i~0 < 50 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {607#false} is VALID [2020-07-28 18:11:09,529 INFO L280 TraceCheckUtils]: 13: Hoare triple {607#false} assume !(0 == __VERIFIER_assert_~cond); {607#false} is VALID [2020-07-28 18:11:09,529 INFO L280 TraceCheckUtils]: 14: Hoare triple {607#false} call write~real(main_~w~0, ~#b~0.base, ~#b~0.offset + 8 * main_~i~0, 8); {607#false} is VALID [2020-07-28 18:11:09,529 INFO L280 TraceCheckUtils]: 15: Hoare triple {607#false} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {607#false} is VALID [2020-07-28 18:11:09,530 INFO L280 TraceCheckUtils]: 16: Hoare triple {607#false} assume !!(main_~i~0 <= main_~n~0);main_~w~0 := 0.0;main_~j~0 := 0; {607#false} is VALID [2020-07-28 18:11:09,530 INFO L280 TraceCheckUtils]: 17: Hoare triple {607#false} assume !!(main_~j~0 <= main_~n~0);call write~real(~convertINTToDOUBLE(1 + main_~i~0 + (1 + main_~j~0)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8); {607#false} is VALID [2020-07-28 18:11:09,530 INFO L280 TraceCheckUtils]: 18: Hoare triple {607#false} assume main_~i~0 == main_~j~0;call main_#t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);havoc main_#t~mem2; {607#false} is VALID [2020-07-28 18:11:09,530 INFO L280 TraceCheckUtils]: 19: Hoare triple {607#false} call main_#t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);main_~w~0 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0, main_#t~mem3);havoc main_#t~mem3; {607#false} is VALID [2020-07-28 18:11:09,531 INFO L280 TraceCheckUtils]: 20: Hoare triple {607#false} main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; {607#false} is VALID [2020-07-28 18:11:09,531 INFO L280 TraceCheckUtils]: 21: Hoare triple {607#false} assume !!(main_~j~0 <= main_~n~0);call write~real(~convertINTToDOUBLE(1 + main_~i~0 + (1 + main_~j~0)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8); {607#false} is VALID [2020-07-28 18:11:09,531 INFO L280 TraceCheckUtils]: 22: Hoare triple {607#false} assume main_~i~0 == main_~j~0;call main_#t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);havoc main_#t~mem2; {607#false} is VALID [2020-07-28 18:11:09,532 INFO L280 TraceCheckUtils]: 23: Hoare triple {607#false} call main_#t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);main_~w~0 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0, main_#t~mem3);havoc main_#t~mem3; {607#false} is VALID [2020-07-28 18:11:09,532 INFO L280 TraceCheckUtils]: 24: Hoare triple {607#false} main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; {607#false} is VALID [2020-07-28 18:11:09,532 INFO L280 TraceCheckUtils]: 25: Hoare triple {607#false} assume !(main_~j~0 <= main_~n~0); {607#false} is VALID [2020-07-28 18:11:09,533 INFO L280 TraceCheckUtils]: 26: Hoare triple {607#false} __VERIFIER_assert_#in~cond := (if main_~i~0 < 50 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {607#false} is VALID [2020-07-28 18:11:09,533 INFO L280 TraceCheckUtils]: 27: Hoare triple {607#false} assume 0 == __VERIFIER_assert_~cond; {607#false} is VALID [2020-07-28 18:11:09,533 INFO L280 TraceCheckUtils]: 28: Hoare triple {607#false} assume !false; {607#false} is VALID [2020-07-28 18:11:09,535 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-28 18:11:09,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958513101] [2020-07-28 18:11:09,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558138112] [2020-07-28 18:11:09,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:11:09,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-28 18:11:09,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:11:09,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-28 18:11:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:11:09,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:11:09,709 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:11:09,737 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:11:09,816 INFO L280 TraceCheckUtils]: 0: Hoare triple {606#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {606#true} is VALID [2020-07-28 18:11:09,817 INFO L280 TraceCheckUtils]: 1: Hoare triple {606#true} havoc main_#res;havoc main_#t~mem2, main_#t~mem3, main_#t~post1, main_#t~post0, main_#t~ret4, main_~i~0, main_~j~0, main_~nmax~0, main_~n~0, main_~chkerr~0, main_~eps~0, main_~w~0;havoc main_~i~0;havoc main_~j~0;main_~nmax~0 := 50;main_~n~0 := 5;havoc main_~chkerr~0;havoc main_~eps~0;havoc main_~w~0;main_~eps~0 := 1.0E-6;main_~i~0 := 0; {617#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-28 18:11:09,817 INFO L280 TraceCheckUtils]: 2: Hoare triple {617#(<= ULTIMATE.start_main_~n~0 5)} assume !!(main_~i~0 <= main_~n~0);main_~w~0 := 0.0;main_~j~0 := 0; {617#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-28 18:11:09,818 INFO L280 TraceCheckUtils]: 3: Hoare triple {617#(<= ULTIMATE.start_main_~n~0 5)} assume !!(main_~j~0 <= main_~n~0);call write~real(~convertINTToDOUBLE(1 + main_~i~0 + (1 + main_~j~0)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8); {617#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-28 18:11:09,819 INFO L280 TraceCheckUtils]: 4: Hoare triple {617#(<= ULTIMATE.start_main_~n~0 5)} assume main_~i~0 == main_~j~0;call main_#t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);havoc main_#t~mem2; {617#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-28 18:11:09,819 INFO L280 TraceCheckUtils]: 5: Hoare triple {617#(<= ULTIMATE.start_main_~n~0 5)} call main_#t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);main_~w~0 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0, main_#t~mem3);havoc main_#t~mem3; {617#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-28 18:11:09,820 INFO L280 TraceCheckUtils]: 6: Hoare triple {617#(<= ULTIMATE.start_main_~n~0 5)} main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; {617#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-28 18:11:09,821 INFO L280 TraceCheckUtils]: 7: Hoare triple {617#(<= ULTIMATE.start_main_~n~0 5)} assume !!(main_~j~0 <= main_~n~0);call write~real(~convertINTToDOUBLE(1 + main_~i~0 + (1 + main_~j~0)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8); {617#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-28 18:11:09,821 INFO L280 TraceCheckUtils]: 8: Hoare triple {617#(<= ULTIMATE.start_main_~n~0 5)} assume main_~i~0 == main_~j~0;call main_#t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);havoc main_#t~mem2; {617#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-28 18:11:09,822 INFO L280 TraceCheckUtils]: 9: Hoare triple {617#(<= ULTIMATE.start_main_~n~0 5)} call main_#t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);main_~w~0 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0, main_#t~mem3);havoc main_#t~mem3; {617#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-28 18:11:09,823 INFO L280 TraceCheckUtils]: 10: Hoare triple {617#(<= ULTIMATE.start_main_~n~0 5)} main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; {617#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-28 18:11:09,825 INFO L280 TraceCheckUtils]: 11: Hoare triple {617#(<= ULTIMATE.start_main_~n~0 5)} assume !(main_~j~0 <= main_~n~0); {617#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-28 18:11:09,826 INFO L280 TraceCheckUtils]: 12: Hoare triple {617#(<= ULTIMATE.start_main_~n~0 5)} __VERIFIER_assert_#in~cond := (if main_~i~0 < 50 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {617#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-28 18:11:09,827 INFO L280 TraceCheckUtils]: 13: Hoare triple {617#(<= ULTIMATE.start_main_~n~0 5)} assume !(0 == __VERIFIER_assert_~cond); {617#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-28 18:11:09,827 INFO L280 TraceCheckUtils]: 14: Hoare triple {617#(<= ULTIMATE.start_main_~n~0 5)} call write~real(main_~w~0, ~#b~0.base, ~#b~0.offset + 8 * main_~i~0, 8); {617#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-28 18:11:09,828 INFO L280 TraceCheckUtils]: 15: Hoare triple {617#(<= ULTIMATE.start_main_~n~0 5)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {617#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-28 18:11:09,829 INFO L280 TraceCheckUtils]: 16: Hoare triple {617#(<= ULTIMATE.start_main_~n~0 5)} assume !!(main_~i~0 <= main_~n~0);main_~w~0 := 0.0;main_~j~0 := 0; {663#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:11:09,830 INFO L280 TraceCheckUtils]: 17: Hoare triple {663#(<= ULTIMATE.start_main_~i~0 5)} assume !!(main_~j~0 <= main_~n~0);call write~real(~convertINTToDOUBLE(1 + main_~i~0 + (1 + main_~j~0)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8); {663#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:11:09,831 INFO L280 TraceCheckUtils]: 18: Hoare triple {663#(<= ULTIMATE.start_main_~i~0 5)} assume main_~i~0 == main_~j~0;call main_#t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);havoc main_#t~mem2; {663#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:11:09,831 INFO L280 TraceCheckUtils]: 19: Hoare triple {663#(<= ULTIMATE.start_main_~i~0 5)} call main_#t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);main_~w~0 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0, main_#t~mem3);havoc main_#t~mem3; {663#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:11:09,832 INFO L280 TraceCheckUtils]: 20: Hoare triple {663#(<= ULTIMATE.start_main_~i~0 5)} main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; {663#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:11:09,833 INFO L280 TraceCheckUtils]: 21: Hoare triple {663#(<= ULTIMATE.start_main_~i~0 5)} assume !!(main_~j~0 <= main_~n~0);call write~real(~convertINTToDOUBLE(1 + main_~i~0 + (1 + main_~j~0)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8); {663#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:11:09,833 INFO L280 TraceCheckUtils]: 22: Hoare triple {663#(<= ULTIMATE.start_main_~i~0 5)} assume main_~i~0 == main_~j~0;call main_#t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);havoc main_#t~mem2; {663#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:11:09,834 INFO L280 TraceCheckUtils]: 23: Hoare triple {663#(<= ULTIMATE.start_main_~i~0 5)} call main_#t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0 + 8 * main_~j~0, 8);main_~w~0 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0, main_#t~mem3);havoc main_#t~mem3; {663#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:11:09,836 INFO L280 TraceCheckUtils]: 24: Hoare triple {663#(<= ULTIMATE.start_main_~i~0 5)} main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; {663#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:11:09,837 INFO L280 TraceCheckUtils]: 25: Hoare triple {663#(<= ULTIMATE.start_main_~i~0 5)} assume !(main_~j~0 <= main_~n~0); {663#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:11:09,838 INFO L280 TraceCheckUtils]: 26: Hoare triple {663#(<= ULTIMATE.start_main_~i~0 5)} __VERIFIER_assert_#in~cond := (if main_~i~0 < 50 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {694#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-28 18:11:09,839 INFO L280 TraceCheckUtils]: 27: Hoare triple {694#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {607#false} is VALID [2020-07-28 18:11:09,839 INFO L280 TraceCheckUtils]: 28: Hoare triple {607#false} assume !false; {607#false} is VALID [2020-07-28 18:11:09,841 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-28 18:11:09,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:11:09,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-07-28 18:11:09,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899807266] [2020-07-28 18:11:09,843 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-07-28 18:11:09,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:11:09,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-28 18:11:09,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:11:09,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-28 18:11:09,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:11:09,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-28 18:11:09,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-07-28 18:11:09,890 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 8 states. [2020-07-28 18:11:10,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:11:10,137 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2020-07-28 18:11:10,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-28 18:11:10,139 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-07-28 18:11:10,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:11:10,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:11:10,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2020-07-28 18:11:10,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:11:10,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2020-07-28 18:11:10,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2020-07-28 18:11:10,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:11:10,194 INFO L225 Difference]: With dead ends: 56 [2020-07-28 18:11:10,195 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 18:11:10,195 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2020-07-28 18:11:10,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 18:11:10,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 18:11:10,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:11:10,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 18:11:10,197 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:11:10,197 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:11:10,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:11:10,197 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:11:10,197 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:11:10,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:11:10,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:11:10,198 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:11:10,198 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:11:10,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:11:10,198 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:11:10,198 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:11:10,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:11:10,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:11:10,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:11:10,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:11:10,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 18:11:10,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 18:11:10,199 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2020-07-28 18:11:10,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:11:10,200 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 18:11:10,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-28 18:11:10,200 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:11:10,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:11:10,407 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:11:10,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 18:11:10,643 INFO L264 CegarLoopResult]: At program point L151(lines 109 153) the Hoare annotation is: (<= 5 ULTIMATE.start_main_~n~0) [2020-07-28 18:11:10,643 INFO L268 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2020-07-28 18:11:10,644 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 18:11:10,644 INFO L268 CegarLoopResult]: For program point L127-2(lines 127 133) no Hoare annotation was computed. [2020-07-28 18:11:10,644 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 18:11:10,644 INFO L268 CegarLoopResult]: For program point L94-2(lines 94 99) no Hoare annotation was computed. [2020-07-28 18:11:10,644 INFO L264 CegarLoopResult]: At program point L127-3(lines 127 133) the Hoare annotation is: (<= 5 ULTIMATE.start_main_~n~0) [2020-07-28 18:11:10,644 INFO L264 CegarLoopResult]: At program point L94-3(lines 94 99) the Hoare annotation is: (let ((.cse2 (= 0 ULTIMATE.start_main_~i~0)) (.cse0 (<= ULTIMATE.start_main_~n~0 5)) (.cse1 (<= 5 ULTIMATE.start_main_~n~0))) (or (and (<= ULTIMATE.start_main_~i~0 5) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse0 .cse1) (and .cse2 (= 0 ULTIMATE.start_main_~j~0) .cse0 .cse1) (and .cse2 .cse0 .cse1 (<= 1 ULTIMATE.start_main_~j~0)))) [2020-07-28 18:11:10,644 INFO L268 CegarLoopResult]: For program point L94-4(lines 94 99) no Hoare annotation was computed. [2020-07-28 18:11:10,644 INFO L268 CegarLoopResult]: For program point L119-2(lines 119 126) no Hoare annotation was computed. [2020-07-28 18:11:10,644 INFO L264 CegarLoopResult]: At program point L119-3(lines 119 126) the Hoare annotation is: (<= 5 ULTIMATE.start_main_~n~0) [2020-07-28 18:11:10,644 INFO L268 CegarLoopResult]: For program point L119-4(lines 119 126) no Hoare annotation was computed. [2020-07-28 18:11:10,645 INFO L268 CegarLoopResult]: For program point L78(lines 78 79) no Hoare annotation was computed. [2020-07-28 18:11:10,645 INFO L268 CegarLoopResult]: For program point L144-2(lines 144 150) no Hoare annotation was computed. [2020-07-28 18:11:10,645 INFO L264 CegarLoopResult]: At program point L144-3(lines 144 150) the Hoare annotation is: (<= 5 ULTIMATE.start_main_~n~0) [2020-07-28 18:11:10,645 INFO L268 CegarLoopResult]: For program point L78-2(lines 78 79) no Hoare annotation was computed. [2020-07-28 18:11:10,645 INFO L268 CegarLoopResult]: For program point L144-4(lines 144 150) no Hoare annotation was computed. [2020-07-28 18:11:10,645 INFO L268 CegarLoopResult]: For program point L136-2(lines 136 142) no Hoare annotation was computed. [2020-07-28 18:11:10,645 INFO L264 CegarLoopResult]: At program point L136-3(lines 136 142) the Hoare annotation is: (<= 5 ULTIMATE.start_main_~n~0) [2020-07-28 18:11:10,645 INFO L268 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2020-07-28 18:11:10,645 INFO L268 CegarLoopResult]: For program point L136-4(lines 136 142) no Hoare annotation was computed. [2020-07-28 18:11:10,646 INFO L264 CegarLoopResult]: At program point L4-2(lines 3 8) the Hoare annotation is: (and (<= ULTIMATE.start_main_~i~0 5) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= ULTIMATE.start_main_~n~0 5) (<= 5 ULTIMATE.start_main_~n~0)) [2020-07-28 18:11:10,646 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-28 18:11:10,646 INFO L264 CegarLoopResult]: At program point L80(lines 74 81) the Hoare annotation is: (<= 5 ULTIMATE.start_main_~n~0) [2020-07-28 18:11:10,646 INFO L268 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2020-07-28 18:11:10,646 INFO L268 CegarLoopResult]: For program point L130-2(lines 130 131) no Hoare annotation was computed. [2020-07-28 18:11:10,646 INFO L268 CegarLoopResult]: For program point L97-2(line 97) no Hoare annotation was computed. [2020-07-28 18:11:10,647 INFO L264 CegarLoopResult]: At program point L130-3(lines 130 131) the Hoare annotation is: (<= 5 ULTIMATE.start_main_~n~0) [2020-07-28 18:11:10,648 INFO L268 CegarLoopResult]: For program point L130-4(lines 130 131) no Hoare annotation was computed. [2020-07-28 18:11:10,648 INFO L268 CegarLoopResult]: For program point L122(lines 122 124) no Hoare annotation was computed. [2020-07-28 18:11:10,648 INFO L268 CegarLoopResult]: For program point L122-1(lines 122 124) no Hoare annotation was computed. [2020-07-28 18:11:10,648 INFO L268 CegarLoopResult]: For program point L147-2(lines 147 148) no Hoare annotation was computed. [2020-07-28 18:11:10,648 INFO L264 CegarLoopResult]: At program point L147-3(lines 147 148) the Hoare annotation is: (<= 5 ULTIMATE.start_main_~n~0) [2020-07-28 18:11:10,649 INFO L268 CegarLoopResult]: For program point L147-4(lines 147 148) no Hoare annotation was computed. [2020-07-28 18:11:10,650 INFO L264 CegarLoopResult]: At program point L106(lines 83 107) the Hoare annotation is: (<= 5 ULTIMATE.start_main_~n~0) [2020-07-28 18:11:10,650 INFO L268 CegarLoopResult]: For program point L139-2(lines 139 140) no Hoare annotation was computed. [2020-07-28 18:11:10,650 INFO L264 CegarLoopResult]: At program point L139-3(lines 139 140) the Hoare annotation is: (<= 5 ULTIMATE.start_main_~n~0) [2020-07-28 18:11:10,650 INFO L268 CegarLoopResult]: For program point L139-4(lines 139 140) no Hoare annotation was computed. [2020-07-28 18:11:10,650 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-28 18:11:10,651 INFO L268 CegarLoopResult]: For program point L123-2(lines 123 124) no Hoare annotation was computed. [2020-07-28 18:11:10,651 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2020-07-28 18:11:10,651 INFO L264 CegarLoopResult]: At program point L123-3(lines 123 124) the Hoare annotation is: (<= 5 ULTIMATE.start_main_~n~0) [2020-07-28 18:11:10,651 INFO L268 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2020-07-28 18:11:10,652 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 18:11:10,652 INFO L268 CegarLoopResult]: For program point L91-2(lines 91 102) no Hoare annotation was computed. [2020-07-28 18:11:10,652 INFO L264 CegarLoopResult]: At program point L91-3(lines 91 102) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~n~0 5)) (.cse1 (<= 5 ULTIMATE.start_main_~n~0))) (or (and (= 0 ULTIMATE.start_main_~i~0) .cse0 .cse1) (and (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse0 .cse1))) [2020-07-28 18:11:10,652 INFO L268 CegarLoopResult]: For program point L91-4(lines 91 102) no Hoare annotation was computed. [2020-07-28 18:11:10,652 INFO L268 CegarLoopResult]: For program point L116-2(lines 116 134) no Hoare annotation was computed. [2020-07-28 18:11:10,653 INFO L264 CegarLoopResult]: At program point L116-3(lines 116 134) the Hoare annotation is: (<= 5 ULTIMATE.start_main_~n~0) [2020-07-28 18:11:10,653 INFO L268 CegarLoopResult]: For program point L116-4(lines 116 134) no Hoare annotation was computed. [2020-07-28 18:11:10,657 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:11:10,657 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 18:11:10,658 WARN L170 areAnnotationChecker]: L91-4 has no Hoare annotation [2020-07-28 18:11:10,658 WARN L170 areAnnotationChecker]: L91-4 has no Hoare annotation [2020-07-28 18:11:10,659 WARN L170 areAnnotationChecker]: L91-4 has no Hoare annotation [2020-07-28 18:11:10,659 WARN L170 areAnnotationChecker]: L94-4 has no Hoare annotation [2020-07-28 18:11:10,660 WARN L170 areAnnotationChecker]: L94-4 has no Hoare annotation [2020-07-28 18:11:10,660 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2020-07-28 18:11:10,660 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2020-07-28 18:11:10,660 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2020-07-28 18:11:10,660 WARN L170 areAnnotationChecker]: L94-4 has no Hoare annotation [2020-07-28 18:11:10,660 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2020-07-28 18:11:10,660 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2020-07-28 18:11:10,662 WARN L170 areAnnotationChecker]: L116-4 has no Hoare annotation [2020-07-28 18:11:10,662 WARN L170 areAnnotationChecker]: L116-4 has no Hoare annotation [2020-07-28 18:11:10,662 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2020-07-28 18:11:10,662 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 18:11:10,662 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 18:11:10,662 WARN L170 areAnnotationChecker]: L97-2 has no Hoare annotation [2020-07-28 18:11:10,663 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:11:10,663 WARN L170 areAnnotationChecker]: L116-4 has no Hoare annotation [2020-07-28 18:11:10,663 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2020-07-28 18:11:10,663 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2020-07-28 18:11:10,663 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 18:11:10,663 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 18:11:10,663 WARN L170 areAnnotationChecker]: L91-2 has no Hoare annotation [2020-07-28 18:11:10,663 WARN L170 areAnnotationChecker]: L94-2 has no Hoare annotation [2020-07-28 18:11:10,663 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:11:10,663 WARN L170 areAnnotationChecker]: L136-4 has no Hoare annotation [2020-07-28 18:11:10,663 WARN L170 areAnnotationChecker]: L136-4 has no Hoare annotation [2020-07-28 18:11:10,665 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2020-07-28 18:11:10,665 WARN L170 areAnnotationChecker]: L91-2 has no Hoare annotation [2020-07-28 18:11:10,665 WARN L170 areAnnotationChecker]: L136-4 has no Hoare annotation [2020-07-28 18:11:10,665 WARN L170 areAnnotationChecker]: L139-4 has no Hoare annotation [2020-07-28 18:11:10,665 WARN L170 areAnnotationChecker]: L139-4 has no Hoare annotation [2020-07-28 18:11:10,665 WARN L170 areAnnotationChecker]: L139-2 has no Hoare annotation [2020-07-28 18:11:10,665 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2020-07-28 18:11:10,665 WARN L170 areAnnotationChecker]: L144-4 has no Hoare annotation [2020-07-28 18:11:10,665 WARN L170 areAnnotationChecker]: L144-4 has no Hoare annotation [2020-07-28 18:11:10,666 WARN L170 areAnnotationChecker]: L139-4 has no Hoare annotation [2020-07-28 18:11:10,666 WARN L170 areAnnotationChecker]: L139-2 has no Hoare annotation [2020-07-28 18:11:10,666 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2020-07-28 18:11:10,666 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2020-07-28 18:11:10,666 WARN L170 areAnnotationChecker]: L144-4 has no Hoare annotation [2020-07-28 18:11:10,667 WARN L170 areAnnotationChecker]: L147-4 has no Hoare annotation [2020-07-28 18:11:10,667 WARN L170 areAnnotationChecker]: L147-4 has no Hoare annotation [2020-07-28 18:11:10,667 WARN L170 areAnnotationChecker]: L147-2 has no Hoare annotation [2020-07-28 18:11:10,667 WARN L170 areAnnotationChecker]: L136-2 has no Hoare annotation [2020-07-28 18:11:10,667 WARN L170 areAnnotationChecker]: L119-4 has no Hoare annotation [2020-07-28 18:11:10,667 WARN L170 areAnnotationChecker]: L119-4 has no Hoare annotation [2020-07-28 18:11:10,667 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2020-07-28 18:11:10,667 WARN L170 areAnnotationChecker]: L147-4 has no Hoare annotation [2020-07-28 18:11:10,667 WARN L170 areAnnotationChecker]: L147-2 has no Hoare annotation [2020-07-28 18:11:10,667 WARN L170 areAnnotationChecker]: L119-4 has no Hoare annotation [2020-07-28 18:11:10,667 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2020-07-28 18:11:10,668 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2020-07-28 18:11:10,668 WARN L170 areAnnotationChecker]: L144-2 has no Hoare annotation [2020-07-28 18:11:10,668 WARN L170 areAnnotationChecker]: L116-2 has no Hoare annotation [2020-07-28 18:11:10,668 WARN L170 areAnnotationChecker]: L116-2 has no Hoare annotation [2020-07-28 18:11:10,669 WARN L170 areAnnotationChecker]: L122-1 has no Hoare annotation [2020-07-28 18:11:10,670 WARN L170 areAnnotationChecker]: L122-1 has no Hoare annotation [2020-07-28 18:11:10,670 WARN L170 areAnnotationChecker]: L123-2 has no Hoare annotation [2020-07-28 18:11:10,670 WARN L170 areAnnotationChecker]: L122-1 has no Hoare annotation [2020-07-28 18:11:10,670 WARN L170 areAnnotationChecker]: L116-2 has no Hoare annotation [2020-07-28 18:11:10,670 WARN L170 areAnnotationChecker]: L130-4 has no Hoare annotation [2020-07-28 18:11:10,670 WARN L170 areAnnotationChecker]: L130-4 has no Hoare annotation [2020-07-28 18:11:10,670 WARN L170 areAnnotationChecker]: L130-2 has no Hoare annotation [2020-07-28 18:11:10,670 WARN L170 areAnnotationChecker]: L123-2 has no Hoare annotation [2020-07-28 18:11:10,671 WARN L170 areAnnotationChecker]: L119-2 has no Hoare annotation [2020-07-28 18:11:10,671 WARN L170 areAnnotationChecker]: L130-4 has no Hoare annotation [2020-07-28 18:11:10,671 WARN L170 areAnnotationChecker]: L130-2 has no Hoare annotation [2020-07-28 18:11:10,671 WARN L170 areAnnotationChecker]: L127-2 has no Hoare annotation [2020-07-28 18:11:10,671 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. [2020-07-28 18:11:10,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 06:11:10 BoogieIcfgContainer [2020-07-28 18:11:10,703 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 18:11:10,704 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 18:11:10,704 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 18:11:10,704 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 18:11:10,705 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:11:07" (3/4) ... [2020-07-28 18:11:10,708 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 18:11:10,724 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2020-07-28 18:11:10,724 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-07-28 18:11:10,725 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-28 18:11:10,811 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 18:11:10,811 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 18:11:10,816 INFO L168 Benchmark]: Toolchain (without parser) took 4794.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.1 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -97.4 MB). Peak memory consumption was 87.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:11:10,817 INFO L168 Benchmark]: CDTParser took 0.77 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:11:10,817 INFO L168 Benchmark]: CACSL2BoogieTranslator took 465.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.7 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -119.6 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2020-07-28 18:11:10,818 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.70 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:11:10,818 INFO L168 Benchmark]: Boogie Preprocessor took 44.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2020-07-28 18:11:10,821 INFO L168 Benchmark]: RCFGBuilder took 637.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.8 MB). Peak memory consumption was 47.8 MB. Max. memory is 11.5 GB. [2020-07-28 18:11:10,822 INFO L168 Benchmark]: TraceAbstraction took 3464.61 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 94.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -41.0 MB). Peak memory consumption was 53.4 MB. Max. memory is 11.5 GB. [2020-07-28 18:11:10,822 INFO L168 Benchmark]: Witness Printer took 107.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2020-07-28 18:11:10,825 INFO L336 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.77 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 465.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.7 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -119.6 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.70 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 637.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.8 MB). Peak memory consumption was 47.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3464.61 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 94.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -41.0 MB). Peak memory consumption was 53.4 MB. Max. memory is 11.5 GB. * Witness Printer took 107.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: 5 <= n - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: 5 <= n - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: 5 <= n - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: ((((i <= 5 && 1 <= cond) && n <= 5) && 5 <= n) || (((0 == i && 0 == j) && n <= 5) && 5 <= n)) || (((0 == i && n <= 5) && 5 <= n) && 1 <= j) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: 5 <= n - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: 5 <= n - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: 5 <= n - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: 5 <= n - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: 5 <= n - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: 5 <= n - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 5 <= n - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((i <= 5 && 1 <= cond) && n <= 5) && 5 <= n - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: 5 <= n - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((0 == i && n <= 5) && 5 <= n) || ((1 <= cond && n <= 5) && 5 <= n) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: 5 <= n - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.0s, OverallIterations: 4, TraceHistogramMax: 4, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 87 SDtfs, 142 SDslu, 98 SDs, 0 SdLazy, 108 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, 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, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 38 NumberOfFragments, 110 HoareAnnotationTreeSize, 15 FomulaSimplifications, 105 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 33 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 118 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 6482 SizeOfPredicates, 6 NumberOfNonLiveVariables, 128 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 70/97 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...