/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-lit/cggmp2005_variant.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 06:38:26,705 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 06:38:26,708 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 06:38:26,726 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 06:38:26,726 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 06:38:26,728 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 06:38:26,730 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 06:38:26,740 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 06:38:26,743 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 06:38:26,746 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 06:38:26,749 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 06:38:26,751 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 06:38:26,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 06:38:26,754 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 06:38:26,757 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 06:38:26,758 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 06:38:26,759 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 06:38:26,760 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 06:38:26,762 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 06:38:26,767 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 06:38:26,772 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 06:38:26,776 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 06:38:26,777 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 06:38:26,778 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 06:38:26,780 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 06:38:26,780 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 06:38:26,781 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 06:38:26,783 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 06:38:26,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 06:38:26,786 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 06:38:26,786 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 06:38:26,787 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 06:38:26,788 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 06:38:26,788 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 06:38:26,789 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 06:38:26,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 06:38:26,790 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 06:38:26,790 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 06:38:26,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 06:38:26,791 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 06:38:26,793 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 06:38:26,794 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 06:38:26,818 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 06:38:26,818 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 06:38:26,823 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 06:38:26,823 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 06:38:26,823 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 06:38:26,824 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 06:38:26,824 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 06:38:26,824 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 06:38:26,826 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 06:38:26,826 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 06:38:26,826 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 06:38:26,826 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 06:38:26,826 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 06:38:26,827 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 06:38:26,827 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 06:38:26,827 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 06:38:26,828 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 06:38:26,829 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 06:38:26,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 06:38:26,829 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 06:38:26,829 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 06:38:26,829 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 06:38:26,830 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-18 06:38:27,138 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 06:38:27,158 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 06:38:27,162 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 06:38:27,164 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 06:38:27,164 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 06:38:27,165 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/cggmp2005_variant.i [2020-07-18 06:38:27,239 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81d61fda5/ab8e889bd5bc423588460fa90e367bb5/FLAGcde2579a6 [2020-07-18 06:38:27,673 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 06:38:27,674 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005_variant.i [2020-07-18 06:38:27,680 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81d61fda5/ab8e889bd5bc423588460fa90e367bb5/FLAGcde2579a6 [2020-07-18 06:38:28,067 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81d61fda5/ab8e889bd5bc423588460fa90e367bb5 [2020-07-18 06:38:28,076 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 06:38:28,079 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 06:38:28,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 06:38:28,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 06:38:28,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 06:38:28,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 06:38:28" (1/1) ... [2020-07-18 06:38:28,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1faf8f14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:28, skipping insertion in model container [2020-07-18 06:38:28,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 06:38:28" (1/1) ... [2020-07-18 06:38:28,096 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 06:38:28,111 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 06:38:28,271 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 06:38:28,275 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 06:38:28,294 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 06:38:28,310 INFO L208 MainTranslator]: Completed translation [2020-07-18 06:38:28,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:28 WrapperNode [2020-07-18 06:38:28,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 06:38:28,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 06:38:28,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 06:38:28,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 06:38:28,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:28" (1/1) ... [2020-07-18 06:38:28,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:28" (1/1) ... [2020-07-18 06:38:28,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:28" (1/1) ... [2020-07-18 06:38:28,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:28" (1/1) ... [2020-07-18 06:38:28,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:28" (1/1) ... [2020-07-18 06:38:28,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:28" (1/1) ... [2020-07-18 06:38:28,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:28" (1/1) ... [2020-07-18 06:38:28,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 06:38:28,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 06:38:28,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 06:38:28,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 06:38:28,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:28" (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-18 06:38:28,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 06:38:28,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 06:38:28,486 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 06:38:28,486 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 06:38:28,486 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 06:38:28,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 06:38:28,487 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 06:38:28,487 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 06:38:28,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 06:38:28,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 06:38:28,487 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 06:38:28,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 06:38:28,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 06:38:28,753 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 06:38:28,753 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-18 06:38:28,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 06:38:28 BoogieIcfgContainer [2020-07-18 06:38:28,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 06:38:28,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 06:38:28,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 06:38:28,764 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 06:38:28,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 06:38:28" (1/3) ... [2020-07-18 06:38:28,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d76681c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 06:38:28, skipping insertion in model container [2020-07-18 06:38:28,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:28" (2/3) ... [2020-07-18 06:38:28,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d76681c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 06:38:28, skipping insertion in model container [2020-07-18 06:38:28,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 06:38:28" (3/3) ... [2020-07-18 06:38:28,769 INFO L109 eAbstractionObserver]: Analyzing ICFG cggmp2005_variant.i [2020-07-18 06:38:28,782 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 06:38:28,792 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 06:38:28,810 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 06:38:28,833 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 06:38:28,834 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 06:38:28,834 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 06:38:28,834 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 06:38:28,834 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 06:38:28,834 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 06:38:28,835 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 06:38:28,835 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 06:38:28,850 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-07-18 06:38:28,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-18 06:38:28,864 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:28,865 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:38:28,866 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:28,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:28,876 INFO L82 PathProgramCache]: Analyzing trace with hash 627729613, now seen corresponding path program 1 times [2020-07-18 06:38:28,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:28,887 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [521676818] [2020-07-18 06:38:28,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:29,063 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-18 06:38:29,063 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {33#true} {33#true} #56#return; {33#true} is VALID [2020-07-18 06:38:29,065 INFO L263 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2020-07-18 06:38:29,065 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-18 06:38:29,066 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #56#return; {33#true} is VALID [2020-07-18 06:38:29,066 INFO L263 TraceCheckUtils]: 3: Hoare triple {33#true} call #t~ret1 := main(); {33#true} is VALID [2020-07-18 06:38:29,066 INFO L280 TraceCheckUtils]: 4: Hoare triple {33#true} havoc ~lo~0; {33#true} is VALID [2020-07-18 06:38:29,067 INFO L280 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~mid~0; {33#true} is VALID [2020-07-18 06:38:29,067 INFO L280 TraceCheckUtils]: 6: Hoare triple {33#true} havoc ~hi~0; {33#true} is VALID [2020-07-18 06:38:29,068 INFO L280 TraceCheckUtils]: 7: Hoare triple {33#true} ~lo~0 := 0; {33#true} is VALID [2020-07-18 06:38:29,068 INFO L280 TraceCheckUtils]: 8: Hoare triple {33#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {33#true} is VALID [2020-07-18 06:38:29,068 INFO L280 TraceCheckUtils]: 9: Hoare triple {33#true} ~mid~0 := #t~nondet0; {33#true} is VALID [2020-07-18 06:38:29,069 INFO L280 TraceCheckUtils]: 10: Hoare triple {33#true} havoc #t~nondet0; {33#true} is VALID [2020-07-18 06:38:29,074 INFO L280 TraceCheckUtils]: 11: Hoare triple {33#true} assume !!(~mid~0 > 0 && ~mid~0 <= 1000000); {37#(< 0 main_~mid~0)} is VALID [2020-07-18 06:38:29,075 INFO L280 TraceCheckUtils]: 12: Hoare triple {37#(< 0 main_~mid~0)} ~hi~0 := 2 * ~mid~0; {37#(< 0 main_~mid~0)} is VALID [2020-07-18 06:38:29,078 INFO L280 TraceCheckUtils]: 13: Hoare triple {37#(< 0 main_~mid~0)} assume !(~mid~0 > 0); {34#false} is VALID [2020-07-18 06:38:29,079 INFO L263 TraceCheckUtils]: 14: Hoare triple {34#false} call __VERIFIER_assert((if ~lo~0 == ~hi~0 then 1 else 0)); {34#false} is VALID [2020-07-18 06:38:29,079 INFO L280 TraceCheckUtils]: 15: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2020-07-18 06:38:29,080 INFO L280 TraceCheckUtils]: 16: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2020-07-18 06:38:29,080 INFO L280 TraceCheckUtils]: 17: Hoare triple {34#false} assume !false; {34#false} is VALID [2020-07-18 06:38:29,082 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-18 06:38:29,083 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [521676818] [2020-07-18 06:38:29,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:38:29,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 06:38:29,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717581780] [2020-07-18 06:38:29,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-18 06:38:29,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:29,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 06:38:29,148 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:29,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 06:38:29,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:29,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 06:38:29,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 06:38:29,162 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2020-07-18 06:38:29,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:29,353 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2020-07-18 06:38:29,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 06:38:29,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-18 06:38:29,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:29,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 06:38:29,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2020-07-18 06:38:29,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 06:38:29,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2020-07-18 06:38:29,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 49 transitions. [2020-07-18 06:38:29,452 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:29,464 INFO L225 Difference]: With dead ends: 43 [2020-07-18 06:38:29,464 INFO L226 Difference]: Without dead ends: 23 [2020-07-18 06:38:29,468 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 06:38:29,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-18 06:38:29,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-18 06:38:29,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:29,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-18 06:38:29,531 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-18 06:38:29,531 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-18 06:38:29,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:29,536 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2020-07-18 06:38:29,536 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2020-07-18 06:38:29,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:29,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:29,537 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-18 06:38:29,537 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-18 06:38:29,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:29,541 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2020-07-18 06:38:29,541 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2020-07-18 06:38:29,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:29,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:29,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:29,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:29,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-18 06:38:29,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2020-07-18 06:38:29,547 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 18 [2020-07-18 06:38:29,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:29,548 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2020-07-18 06:38:29,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 06:38:29,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2020-07-18 06:38:29,583 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:29,584 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2020-07-18 06:38:29,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-18 06:38:29,585 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:29,585 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:38:29,585 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 06:38:29,586 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:29,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:29,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1623753589, now seen corresponding path program 1 times [2020-07-18 06:38:29,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:29,587 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1435305203] [2020-07-18 06:38:29,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:29,992 INFO L280 TraceCheckUtils]: 0: Hoare triple {218#true} assume true; {218#true} is VALID [2020-07-18 06:38:29,992 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {218#true} {218#true} #56#return; {218#true} is VALID [2020-07-18 06:38:29,992 INFO L263 TraceCheckUtils]: 0: Hoare triple {218#true} call ULTIMATE.init(); {218#true} is VALID [2020-07-18 06:38:29,993 INFO L280 TraceCheckUtils]: 1: Hoare triple {218#true} assume true; {218#true} is VALID [2020-07-18 06:38:29,993 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {218#true} {218#true} #56#return; {218#true} is VALID [2020-07-18 06:38:29,993 INFO L263 TraceCheckUtils]: 3: Hoare triple {218#true} call #t~ret1 := main(); {218#true} is VALID [2020-07-18 06:38:29,994 INFO L280 TraceCheckUtils]: 4: Hoare triple {218#true} havoc ~lo~0; {218#true} is VALID [2020-07-18 06:38:29,994 INFO L280 TraceCheckUtils]: 5: Hoare triple {218#true} havoc ~mid~0; {218#true} is VALID [2020-07-18 06:38:29,994 INFO L280 TraceCheckUtils]: 6: Hoare triple {218#true} havoc ~hi~0; {218#true} is VALID [2020-07-18 06:38:29,995 INFO L280 TraceCheckUtils]: 7: Hoare triple {218#true} ~lo~0 := 0; {222#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} is VALID [2020-07-18 06:38:29,996 INFO L280 TraceCheckUtils]: 8: Hoare triple {222#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {222#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} is VALID [2020-07-18 06:38:29,997 INFO L280 TraceCheckUtils]: 9: Hoare triple {222#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} ~mid~0 := #t~nondet0; {222#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} is VALID [2020-07-18 06:38:29,998 INFO L280 TraceCheckUtils]: 10: Hoare triple {222#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} havoc #t~nondet0; {222#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} is VALID [2020-07-18 06:38:29,999 INFO L280 TraceCheckUtils]: 11: Hoare triple {222#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} assume !!(~mid~0 > 0 && ~mid~0 <= 1000000); {223#(and (<= (+ main_~lo~0 2) (* 2 main_~mid~0)) (<= 0 main_~lo~0))} is VALID [2020-07-18 06:38:30,002 INFO L280 TraceCheckUtils]: 12: Hoare triple {223#(and (<= (+ main_~lo~0 2) (* 2 main_~mid~0)) (<= 0 main_~lo~0))} ~hi~0 := 2 * ~mid~0; {224#(and (<= (+ main_~lo~0 2) main_~hi~0) (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0)))} is VALID [2020-07-18 06:38:30,003 INFO L280 TraceCheckUtils]: 13: Hoare triple {224#(and (<= (+ main_~lo~0 2) main_~hi~0) (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0)))} assume !!(~mid~0 > 0); {224#(and (<= (+ main_~lo~0 2) main_~hi~0) (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0)))} is VALID [2020-07-18 06:38:30,005 INFO L280 TraceCheckUtils]: 14: Hoare triple {224#(and (<= (+ main_~lo~0 2) main_~hi~0) (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0)))} ~lo~0 := 1 + ~lo~0; {225#(and (<= (+ main_~hi~0 1) (+ (* 2 main_~mid~0) main_~lo~0)) (<= (+ main_~lo~0 1) main_~hi~0))} is VALID [2020-07-18 06:38:30,006 INFO L280 TraceCheckUtils]: 15: Hoare triple {225#(and (<= (+ main_~hi~0 1) (+ (* 2 main_~mid~0) main_~lo~0)) (<= (+ main_~lo~0 1) main_~hi~0))} ~hi~0 := ~hi~0 - 1; {226#(and (or (< main_~hi~0 (+ main_~lo~0 1)) (<= (+ main_~hi~0 2) (+ (* 2 main_~mid~0) main_~lo~0))) (<= main_~lo~0 main_~hi~0))} is VALID [2020-07-18 06:38:30,008 INFO L280 TraceCheckUtils]: 16: Hoare triple {226#(and (or (< main_~hi~0 (+ main_~lo~0 1)) (<= (+ main_~hi~0 2) (+ (* 2 main_~mid~0) main_~lo~0))) (<= main_~lo~0 main_~hi~0))} ~mid~0 := ~mid~0 - 1; {227#(and (or (< main_~hi~0 (+ main_~lo~0 1)) (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0))) (<= main_~lo~0 main_~hi~0))} is VALID [2020-07-18 06:38:30,009 INFO L280 TraceCheckUtils]: 17: Hoare triple {227#(and (or (< main_~hi~0 (+ main_~lo~0 1)) (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0))) (<= main_~lo~0 main_~hi~0))} assume !(~mid~0 > 0); {228#(and (<= main_~hi~0 main_~lo~0) (<= main_~lo~0 main_~hi~0))} is VALID [2020-07-18 06:38:30,011 INFO L263 TraceCheckUtils]: 18: Hoare triple {228#(and (<= main_~hi~0 main_~lo~0) (<= main_~lo~0 main_~hi~0))} call __VERIFIER_assert((if ~lo~0 == ~hi~0 then 1 else 0)); {229#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 06:38:30,011 INFO L280 TraceCheckUtils]: 19: Hoare triple {229#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {230#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 06:38:30,012 INFO L280 TraceCheckUtils]: 20: Hoare triple {230#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {219#false} is VALID [2020-07-18 06:38:30,013 INFO L280 TraceCheckUtils]: 21: Hoare triple {219#false} assume !false; {219#false} is VALID [2020-07-18 06:38:30,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:38:30,016 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1435305203] [2020-07-18 06:38:30,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:38:30,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-18 06:38:30,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651724861] [2020-07-18 06:38:30,018 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-07-18 06:38:30,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:30,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-18 06:38:30,047 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:30,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-18 06:38:30,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:30,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-18 06:38:30,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-18 06:38:30,048 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 11 states. [2020-07-18 06:38:30,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:30,472 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2020-07-18 06:38:30,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-18 06:38:30,472 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-07-18 06:38:30,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:30,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 06:38:30,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2020-07-18 06:38:30,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 06:38:30,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2020-07-18 06:38:30,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 33 transitions. [2020-07-18 06:38:30,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:30,525 INFO L225 Difference]: With dead ends: 33 [2020-07-18 06:38:30,525 INFO L226 Difference]: Without dead ends: 28 [2020-07-18 06:38:30,526 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2020-07-18 06:38:30,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-18 06:38:30,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-07-18 06:38:30,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:30,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2020-07-18 06:38:30,571 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2020-07-18 06:38:30,571 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2020-07-18 06:38:30,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:30,574 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-18 06:38:30,574 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-18 06:38:30,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:30,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:30,575 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2020-07-18 06:38:30,576 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2020-07-18 06:38:30,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:30,579 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-18 06:38:30,579 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-18 06:38:30,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:30,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:30,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:30,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:30,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-18 06:38:30,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2020-07-18 06:38:30,583 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 22 [2020-07-18 06:38:30,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:30,583 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2020-07-18 06:38:30,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-18 06:38:30,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2020-07-18 06:38:30,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:30,622 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-18 06:38:30,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-18 06:38:30,623 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:30,624 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:38:30,624 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 06:38:30,624 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:30,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:30,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1189706423, now seen corresponding path program 2 times [2020-07-18 06:38:30,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:30,625 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [361407887] [2020-07-18 06:38:30,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:31,017 INFO L280 TraceCheckUtils]: 0: Hoare triple {415#true} assume true; {415#true} is VALID [2020-07-18 06:38:31,018 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {415#true} {415#true} #56#return; {415#true} is VALID [2020-07-18 06:38:31,018 INFO L263 TraceCheckUtils]: 0: Hoare triple {415#true} call ULTIMATE.init(); {415#true} is VALID [2020-07-18 06:38:31,018 INFO L280 TraceCheckUtils]: 1: Hoare triple {415#true} assume true; {415#true} is VALID [2020-07-18 06:38:31,019 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {415#true} {415#true} #56#return; {415#true} is VALID [2020-07-18 06:38:31,019 INFO L263 TraceCheckUtils]: 3: Hoare triple {415#true} call #t~ret1 := main(); {415#true} is VALID [2020-07-18 06:38:31,019 INFO L280 TraceCheckUtils]: 4: Hoare triple {415#true} havoc ~lo~0; {415#true} is VALID [2020-07-18 06:38:31,020 INFO L280 TraceCheckUtils]: 5: Hoare triple {415#true} havoc ~mid~0; {415#true} is VALID [2020-07-18 06:38:31,020 INFO L280 TraceCheckUtils]: 6: Hoare triple {415#true} havoc ~hi~0; {415#true} is VALID [2020-07-18 06:38:31,021 INFO L280 TraceCheckUtils]: 7: Hoare triple {415#true} ~lo~0 := 0; {419#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} is VALID [2020-07-18 06:38:31,022 INFO L280 TraceCheckUtils]: 8: Hoare triple {419#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {419#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} is VALID [2020-07-18 06:38:31,023 INFO L280 TraceCheckUtils]: 9: Hoare triple {419#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} ~mid~0 := #t~nondet0; {419#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} is VALID [2020-07-18 06:38:31,023 INFO L280 TraceCheckUtils]: 10: Hoare triple {419#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} havoc #t~nondet0; {419#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} is VALID [2020-07-18 06:38:31,024 INFO L280 TraceCheckUtils]: 11: Hoare triple {419#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} assume !!(~mid~0 > 0 && ~mid~0 <= 1000000); {419#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} is VALID [2020-07-18 06:38:31,025 INFO L280 TraceCheckUtils]: 12: Hoare triple {419#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} ~hi~0 := 2 * ~mid~0; {420#(and (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0)) (<= (+ (* 2 main_~mid~0) main_~lo~0) main_~hi~0))} is VALID [2020-07-18 06:38:31,026 INFO L280 TraceCheckUtils]: 13: Hoare triple {420#(and (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0)) (<= (+ (* 2 main_~mid~0) main_~lo~0) main_~hi~0))} assume !!(~mid~0 > 0); {420#(and (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0)) (<= (+ (* 2 main_~mid~0) main_~lo~0) main_~hi~0))} is VALID [2020-07-18 06:38:31,028 INFO L280 TraceCheckUtils]: 14: Hoare triple {420#(and (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0)) (<= (+ (* 2 main_~mid~0) main_~lo~0) main_~hi~0))} ~lo~0 := 1 + ~lo~0; {421#(and (<= (+ main_~hi~0 1) (+ (* 2 main_~mid~0) main_~lo~0)) (<= (+ (* 2 main_~mid~0) main_~lo~0) (+ main_~hi~0 1)))} is VALID [2020-07-18 06:38:31,029 INFO L280 TraceCheckUtils]: 15: Hoare triple {421#(and (<= (+ main_~hi~0 1) (+ (* 2 main_~mid~0) main_~lo~0)) (<= (+ (* 2 main_~mid~0) main_~lo~0) (+ main_~hi~0 1)))} ~hi~0 := ~hi~0 - 1; {422#(and (<= (+ (* 2 main_~mid~0) main_~lo~0) (+ main_~hi~0 2)) (<= (+ main_~hi~0 2) (+ (* 2 main_~mid~0) main_~lo~0)))} is VALID [2020-07-18 06:38:31,030 INFO L280 TraceCheckUtils]: 16: Hoare triple {422#(and (<= (+ (* 2 main_~mid~0) main_~lo~0) (+ main_~hi~0 2)) (<= (+ main_~hi~0 2) (+ (* 2 main_~mid~0) main_~lo~0)))} ~mid~0 := ~mid~0 - 1; {420#(and (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0)) (<= (+ (* 2 main_~mid~0) main_~lo~0) main_~hi~0))} is VALID [2020-07-18 06:38:31,031 INFO L280 TraceCheckUtils]: 17: Hoare triple {420#(and (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0)) (<= (+ (* 2 main_~mid~0) main_~lo~0) main_~hi~0))} assume !!(~mid~0 > 0); {423#(and (<= (+ main_~lo~0 2) main_~hi~0) (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0)))} is VALID [2020-07-18 06:38:31,032 INFO L280 TraceCheckUtils]: 18: Hoare triple {423#(and (<= (+ main_~lo~0 2) main_~hi~0) (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0)))} ~lo~0 := 1 + ~lo~0; {424#(and (<= (+ main_~hi~0 1) (+ (* 2 main_~mid~0) main_~lo~0)) (<= (+ main_~lo~0 1) main_~hi~0))} is VALID [2020-07-18 06:38:31,034 INFO L280 TraceCheckUtils]: 19: Hoare triple {424#(and (<= (+ main_~hi~0 1) (+ (* 2 main_~mid~0) main_~lo~0)) (<= (+ main_~lo~0 1) main_~hi~0))} ~hi~0 := ~hi~0 - 1; {425#(and (or (< main_~hi~0 (+ main_~lo~0 1)) (<= (+ main_~hi~0 2) (+ (* 2 main_~mid~0) main_~lo~0))) (<= main_~lo~0 main_~hi~0))} is VALID [2020-07-18 06:38:31,035 INFO L280 TraceCheckUtils]: 20: Hoare triple {425#(and (or (< main_~hi~0 (+ main_~lo~0 1)) (<= (+ main_~hi~0 2) (+ (* 2 main_~mid~0) main_~lo~0))) (<= main_~lo~0 main_~hi~0))} ~mid~0 := ~mid~0 - 1; {426#(and (or (< main_~hi~0 (+ main_~lo~0 1)) (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0))) (<= main_~lo~0 main_~hi~0))} is VALID [2020-07-18 06:38:31,036 INFO L280 TraceCheckUtils]: 21: Hoare triple {426#(and (or (< main_~hi~0 (+ main_~lo~0 1)) (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0))) (<= main_~lo~0 main_~hi~0))} assume !(~mid~0 > 0); {427#(and (<= main_~hi~0 main_~lo~0) (<= main_~lo~0 main_~hi~0))} is VALID [2020-07-18 06:38:31,037 INFO L263 TraceCheckUtils]: 22: Hoare triple {427#(and (<= main_~hi~0 main_~lo~0) (<= main_~lo~0 main_~hi~0))} call __VERIFIER_assert((if ~lo~0 == ~hi~0 then 1 else 0)); {428#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 06:38:31,038 INFO L280 TraceCheckUtils]: 23: Hoare triple {428#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {429#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 06:38:31,039 INFO L280 TraceCheckUtils]: 24: Hoare triple {429#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {416#false} is VALID [2020-07-18 06:38:31,039 INFO L280 TraceCheckUtils]: 25: Hoare triple {416#false} assume !false; {416#false} is VALID [2020-07-18 06:38:31,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-18 06:38:31,042 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [361407887] [2020-07-18 06:38:31,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:38:31,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-18 06:38:31,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970560692] [2020-07-18 06:38:31,043 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2020-07-18 06:38:31,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:31,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-18 06:38:31,075 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-18 06:38:31,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-18 06:38:31,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:31,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-18 06:38:31,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-18 06:38:31,077 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 13 states. [2020-07-18 06:38:31,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:31,676 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-18 06:38:31,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-18 06:38:31,677 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2020-07-18 06:38:31,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:31,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 06:38:31,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2020-07-18 06:38:31,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 06:38:31,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2020-07-18 06:38:31,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 24 transitions. [2020-07-18 06:38:31,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:31,737 INFO L225 Difference]: With dead ends: 27 [2020-07-18 06:38:31,738 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 06:38:31,739 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2020-07-18 06:38:31,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 06:38:31,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 06:38:31,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:31,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 06:38:31,741 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 06:38:31,741 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 06:38:31,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:31,742 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 06:38:31,742 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 06:38:31,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:31,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:31,743 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 06:38:31,743 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 06:38:31,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:31,744 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 06:38:31,744 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 06:38:31,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:31,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:31,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:31,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:31,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 06:38:31,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 06:38:31,745 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2020-07-18 06:38:31,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:31,746 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 06:38:31,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-18 06:38:31,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 06:38:31,747 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:31,747 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 06:38:31,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:31,747 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 06:38:31,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 06:38:32,046 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 06:38:32,046 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 06:38:32,046 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 06:38:32,046 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 06:38:32,046 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 06:38:32,047 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 06:38:32,047 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-18 06:38:32,047 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-18 06:38:32,047 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-18 06:38:32,047 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-18 06:38:32,047 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-18 06:38:32,047 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 26) the Hoare annotation is: true [2020-07-18 06:38:32,048 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (let ((.cse1 (+ (* 2 main_~mid~0) main_~lo~0)) (.cse0 (+ main_~hi~0 1))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (<= (+ main_~lo~0 1) main_~hi~0))) [2020-07-18 06:38:32,048 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (<= main_~lo~0 0) (<= 0 main_~lo~0)) [2020-07-18 06:38:32,048 INFO L264 CegarLoopResult]: At program point L19-2(lines 19 23) the Hoare annotation is: (let ((.cse0 (+ (* 2 main_~mid~0) main_~lo~0))) (and (<= main_~hi~0 .cse0) (<= .cse0 main_~hi~0) (<= main_~lo~0 main_~hi~0))) [2020-07-18 06:38:32,048 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-07-18 06:38:32,048 INFO L264 CegarLoopResult]: At program point L19-3(lines 19 23) the Hoare annotation is: (and (<= main_~hi~0 main_~lo~0) (<= main_~lo~0 main_~hi~0)) [2020-07-18 06:38:32,049 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-18 06:38:32,049 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 26) the Hoare annotation is: true [2020-07-18 06:38:32,049 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 26) the Hoare annotation is: true [2020-07-18 06:38:32,049 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-07-18 06:38:32,049 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (let ((.cse1 (+ main_~hi~0 2)) (.cse0 (+ (* 2 main_~mid~0) main_~lo~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (<= main_~lo~0 main_~hi~0))) [2020-07-18 06:38:32,050 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (let ((.cse0 (+ (* 2 main_~mid~0) main_~lo~0))) (and (<= (+ main_~lo~0 2) main_~hi~0) (<= main_~hi~0 .cse0) (<= .cse0 main_~hi~0))) [2020-07-18 06:38:32,050 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (<= main_~lo~0 0) (<= (+ main_~lo~0 2) (* 2 main_~mid~0)) (<= 0 main_~lo~0)) [2020-07-18 06:38:32,050 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (<= main_~lo~0 0) (<= 0 main_~lo~0)) [2020-07-18 06:38:32,050 INFO L264 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (and (<= main_~lo~0 0) (<= 0 main_~lo~0)) [2020-07-18 06:38:32,050 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-18 06:38:32,050 INFO L264 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (and (<= main_~lo~0 0) (<= 0 main_~lo~0)) [2020-07-18 06:38:32,050 INFO L271 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-07-18 06:38:32,051 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-18 06:38:32,051 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: true [2020-07-18 06:38:32,051 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 06:38:32,051 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-18 06:38:32,051 INFO L271 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: true [2020-07-18 06:38:32,051 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 06:38:32,055 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-18 06:38:32,056 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 06:38:32,056 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 06:38:32,056 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-18 06:38:32,056 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-18 06:38:32,072 INFO L163 areAnnotationChecker]: CFG has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 06:38:32,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 06:38:32 BoogieIcfgContainer [2020-07-18 06:38:32,085 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 06:38:32,091 INFO L168 Benchmark]: Toolchain (without parser) took 4010.69 ms. Allocated memory was 137.9 MB in the beginning and 248.5 MB in the end (delta: 110.6 MB). Free memory was 102.8 MB in the beginning and 177.8 MB in the end (delta: -75.0 MB). Peak memory consumption was 35.6 MB. Max. memory is 7.1 GB. [2020-07-18 06:38:32,092 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-18 06:38:32,093 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.74 ms. Allocated memory is still 137.9 MB. Free memory was 102.4 MB in the beginning and 92.8 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-18 06:38:32,094 INFO L168 Benchmark]: Boogie Preprocessor took 110.59 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 92.8 MB in the beginning and 181.5 MB in the end (delta: -88.7 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. [2020-07-18 06:38:32,095 INFO L168 Benchmark]: RCFGBuilder took 336.68 ms. Allocated memory is still 201.3 MB. Free memory was 181.5 MB in the beginning and 162.6 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2020-07-18 06:38:32,096 INFO L168 Benchmark]: TraceAbstraction took 3325.62 ms. Allocated memory was 201.3 MB in the beginning and 248.5 MB in the end (delta: 47.2 MB). Free memory was 162.0 MB in the beginning and 177.8 MB in the end (delta: -15.8 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. [2020-07-18 06:38:32,100 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.17 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 230.74 ms. Allocated memory is still 137.9 MB. Free memory was 102.4 MB in the beginning and 92.8 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.59 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 92.8 MB in the beginning and 181.5 MB in the end (delta: -88.7 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 336.68 ms. Allocated memory is still 201.3 MB. Free memory was 181.5 MB in the beginning and 162.6 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3325.62 ms. Allocated memory was 201.3 MB in the beginning and 248.5 MB in the end (delta: 47.2 MB). Free memory was 162.0 MB in the beginning and 177.8 MB in the end (delta: -15.8 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: 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: 19]: Loop Invariant Derived loop invariant: (hi <= 2 * mid + lo && 2 * mid + lo <= hi) && lo <= hi - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.9s, OverallIterations: 3, TraceHistogramMax: 2, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 57 SDtfs, 16 SDslu, 187 SDs, 0 SdLazy, 206 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred 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, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 30 LocationsWithAnnotation, 42 PreInvPairs, 57 NumberOfFragments, 164 HoareAnnotationTreeSize, 42 FomulaSimplifications, 145 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 30 FomulaSimplificationsInter, 47 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 8401 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 1/7 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...