/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/recursive/Addition01-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 00:33:46,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:33:46,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:33:46,928 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:33:46,929 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:33:46,930 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:33:46,932 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:33:46,942 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:33:46,946 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:33:46,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:33:46,950 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:33:46,952 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:33:46,953 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:33:46,954 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:33:46,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:33:46,957 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:33:46,959 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:33:46,960 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:33:46,961 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:33:46,966 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:33:46,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:33:46,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:33:46,976 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:33:46,977 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:33:46,979 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:33:46,979 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:33:46,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:33:46,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:33:46,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:33:46,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:33:46,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:33:46,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:33:46,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:33:46,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:33:46,988 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:33:46,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:33:46,989 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:33:46,989 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:33:46,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:33:46,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:33:46,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:33:46,992 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 00:33:47,019 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:33:47,019 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:33:47,024 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:33:47,025 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:33:47,025 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:33:47,025 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:33:47,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:33:47,025 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:33:47,025 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:33:47,026 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:33:47,026 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:33:47,026 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:33:47,026 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:33:47,026 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:33:47,027 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:33:47,027 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:33:47,027 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:33:47,028 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:33:47,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:33:47,028 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:33:47,029 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:33:47,029 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:33:47,029 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-11 00:33:47,315 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:33:47,334 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:33:47,337 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:33:47,338 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:33:47,339 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:33:47,339 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Addition01-2.c [2020-07-11 00:33:47,400 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfa599d3d/9c4e2a46e2d34534b66831b680568b80/FLAG4932887d7 [2020-07-11 00:33:47,804 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:33:47,804 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Addition01-2.c [2020-07-11 00:33:47,810 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfa599d3d/9c4e2a46e2d34534b66831b680568b80/FLAG4932887d7 [2020-07-11 00:33:48,236 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfa599d3d/9c4e2a46e2d34534b66831b680568b80 [2020-07-11 00:33:48,246 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:33:48,248 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:33:48,249 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:33:48,249 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:33:48,254 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:33:48,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:33:48" (1/1) ... [2020-07-11 00:33:48,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bbc0375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:48, skipping insertion in model container [2020-07-11 00:33:48,260 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:33:48" (1/1) ... [2020-07-11 00:33:48,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:33:48,286 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:33:48,486 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:33:48,491 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:33:48,509 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:33:48,527 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:33:48,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:48 WrapperNode [2020-07-11 00:33:48,528 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:33:48,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:33:48,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:33:48,529 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:33:48,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:48" (1/1) ... [2020-07-11 00:33:48,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:48" (1/1) ... [2020-07-11 00:33:48,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:48" (1/1) ... [2020-07-11 00:33:48,549 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:48" (1/1) ... [2020-07-11 00:33:48,555 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:48" (1/1) ... [2020-07-11 00:33:48,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:48" (1/1) ... [2020-07-11 00:33:48,558 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:48" (1/1) ... [2020-07-11 00:33:48,560 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:33:48,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:33:48,561 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:33:48,561 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:33:48,562 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:48" (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-11 00:33:48,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:33:48,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:33:48,754 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2020-07-11 00:33:48,754 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:33:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:33:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 00:33:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2020-07-11 00:33:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:33:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:33:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:33:49,099 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:33:49,099 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-11 00:33:49,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:33:49 BoogieIcfgContainer [2020-07-11 00:33:49,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:33:49,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:33:49,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:33:49,107 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:33:49,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:33:48" (1/3) ... [2020-07-11 00:33:49,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101850fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:33:49, skipping insertion in model container [2020-07-11 00:33:49,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:48" (2/3) ... [2020-07-11 00:33:49,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101850fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:33:49, skipping insertion in model container [2020-07-11 00:33:49,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:33:49" (3/3) ... [2020-07-11 00:33:49,111 INFO L109 eAbstractionObserver]: Analyzing ICFG Addition01-2.c [2020-07-11 00:33:49,121 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:33:49,128 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:33:49,141 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:33:49,162 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:33:49,162 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:33:49,162 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:33:49,162 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:33:49,162 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:33:49,163 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:33:49,163 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:33:49,163 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:33:49,178 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2020-07-11 00:33:49,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-11 00:33:49,189 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:49,190 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, 1, 1] [2020-07-11 00:33:49,190 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:49,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:49,197 INFO L82 PathProgramCache]: Analyzing trace with hash 935018920, now seen corresponding path program 1 times [2020-07-11 00:33:49,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:49,206 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1987411585] [2020-07-11 00:33:49,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:49,498 INFO L280 TraceCheckUtils]: 0: Hoare triple {45#true} assume true; {45#true} is VALID [2020-07-11 00:33:49,498 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {45#true} {45#true} #58#return; {45#true} is VALID [2020-07-11 00:33:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:49,613 INFO L280 TraceCheckUtils]: 0: Hoare triple {45#true} ~m := #in~m; {57#(= |addition_#in~m| addition_~m)} is VALID [2020-07-11 00:33:49,614 INFO L280 TraceCheckUtils]: 1: Hoare triple {57#(= |addition_#in~m| addition_~m)} ~n := #in~n; {58#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-11 00:33:49,615 INFO L280 TraceCheckUtils]: 2: Hoare triple {58#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume 0 == ~n; {59#(and (= 0 |addition_#in~n|) (= |addition_#in~m| addition_~m))} is VALID [2020-07-11 00:33:49,616 INFO L280 TraceCheckUtils]: 3: Hoare triple {59#(and (= 0 |addition_#in~n|) (= |addition_#in~m| addition_~m))} #res := ~m; {60#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-11 00:33:49,618 INFO L280 TraceCheckUtils]: 4: Hoare triple {60#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} assume true; {60#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-11 00:33:49,620 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {60#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} {45#true} #62#return; {55#(and (<= (+ main_~m~0 main_~n~0) |main_#t~ret4|) (<= |main_#t~ret4| (+ main_~m~0 main_~n~0)))} is VALID [2020-07-11 00:33:49,621 INFO L263 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2020-07-11 00:33:49,622 INFO L280 TraceCheckUtils]: 1: Hoare triple {45#true} assume true; {45#true} is VALID [2020-07-11 00:33:49,622 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {45#true} {45#true} #58#return; {45#true} is VALID [2020-07-11 00:33:49,622 INFO L263 TraceCheckUtils]: 3: Hoare triple {45#true} call #t~ret5 := main(); {45#true} is VALID [2020-07-11 00:33:49,623 INFO L280 TraceCheckUtils]: 4: Hoare triple {45#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {45#true} is VALID [2020-07-11 00:33:49,623 INFO L280 TraceCheckUtils]: 5: Hoare triple {45#true} ~m~0 := #t~nondet2; {45#true} is VALID [2020-07-11 00:33:49,624 INFO L280 TraceCheckUtils]: 6: Hoare triple {45#true} havoc #t~nondet2; {45#true} is VALID [2020-07-11 00:33:49,624 INFO L280 TraceCheckUtils]: 7: Hoare triple {45#true} assume !(~m~0 < 0 || ~m~0 > 1073741823); {45#true} is VALID [2020-07-11 00:33:49,625 INFO L280 TraceCheckUtils]: 8: Hoare triple {45#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {45#true} is VALID [2020-07-11 00:33:49,625 INFO L280 TraceCheckUtils]: 9: Hoare triple {45#true} ~n~0 := #t~nondet3; {45#true} is VALID [2020-07-11 00:33:49,627 INFO L280 TraceCheckUtils]: 10: Hoare triple {45#true} havoc #t~nondet3; {45#true} is VALID [2020-07-11 00:33:49,627 INFO L280 TraceCheckUtils]: 11: Hoare triple {45#true} assume !(~n~0 < 0 || ~n~0 > 1073741823); {45#true} is VALID [2020-07-11 00:33:49,627 INFO L263 TraceCheckUtils]: 12: Hoare triple {45#true} call #t~ret4 := addition(~m~0, ~n~0); {45#true} is VALID [2020-07-11 00:33:49,629 INFO L280 TraceCheckUtils]: 13: Hoare triple {45#true} ~m := #in~m; {57#(= |addition_#in~m| addition_~m)} is VALID [2020-07-11 00:33:49,630 INFO L280 TraceCheckUtils]: 14: Hoare triple {57#(= |addition_#in~m| addition_~m)} ~n := #in~n; {58#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-11 00:33:49,631 INFO L280 TraceCheckUtils]: 15: Hoare triple {58#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume 0 == ~n; {59#(and (= 0 |addition_#in~n|) (= |addition_#in~m| addition_~m))} is VALID [2020-07-11 00:33:49,632 INFO L280 TraceCheckUtils]: 16: Hoare triple {59#(and (= 0 |addition_#in~n|) (= |addition_#in~m| addition_~m))} #res := ~m; {60#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-11 00:33:49,633 INFO L280 TraceCheckUtils]: 17: Hoare triple {60#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} assume true; {60#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-11 00:33:49,635 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {60#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} {45#true} #62#return; {55#(and (<= (+ main_~m~0 main_~n~0) |main_#t~ret4|) (<= |main_#t~ret4| (+ main_~m~0 main_~n~0)))} is VALID [2020-07-11 00:33:49,637 INFO L280 TraceCheckUtils]: 19: Hoare triple {55#(and (<= (+ main_~m~0 main_~n~0) |main_#t~ret4|) (<= |main_#t~ret4| (+ main_~m~0 main_~n~0)))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {55#(and (<= (+ main_~m~0 main_~n~0) |main_#t~ret4|) (<= |main_#t~ret4| (+ main_~m~0 main_~n~0)))} is VALID [2020-07-11 00:33:49,638 INFO L280 TraceCheckUtils]: 20: Hoare triple {55#(and (<= (+ main_~m~0 main_~n~0) |main_#t~ret4|) (<= |main_#t~ret4| (+ main_~m~0 main_~n~0)))} ~result~0 := #t~ret4; {56#(and (<= (+ main_~m~0 main_~n~0) main_~result~0) (<= main_~result~0 (+ main_~m~0 main_~n~0)))} is VALID [2020-07-11 00:33:49,639 INFO L280 TraceCheckUtils]: 21: Hoare triple {56#(and (<= (+ main_~m~0 main_~n~0) main_~result~0) (<= main_~result~0 (+ main_~m~0 main_~n~0)))} havoc #t~ret4; {56#(and (<= (+ main_~m~0 main_~n~0) main_~result~0) (<= main_~result~0 (+ main_~m~0 main_~n~0)))} is VALID [2020-07-11 00:33:49,640 INFO L280 TraceCheckUtils]: 22: Hoare triple {56#(and (<= (+ main_~m~0 main_~n~0) main_~result~0) (<= main_~result~0 (+ main_~m~0 main_~n~0)))} assume !(~result~0 == ~m~0 + ~n~0); {46#false} is VALID [2020-07-11 00:33:49,641 INFO L280 TraceCheckUtils]: 23: Hoare triple {46#false} assume !false; {46#false} is VALID [2020-07-11 00:33:49,645 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-11 00:33:49,645 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1987411585] [2020-07-11 00:33:49,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:33:49,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-11 00:33:49,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709834348] [2020-07-11 00:33:49,655 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-07-11 00:33:49,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:49,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 00:33:49,701 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-11 00:33:49,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 00:33:49,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:49,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 00:33:49,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-11 00:33:49,714 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 8 states. [2020-07-11 00:33:50,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:50,341 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2020-07-11 00:33:50,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 00:33:50,343 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-07-11 00:33:50,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:50,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:33:50,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2020-07-11 00:33:50,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:33:50,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2020-07-11 00:33:50,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 65 transitions. [2020-07-11 00:33:50,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:50,470 INFO L225 Difference]: With dead ends: 56 [2020-07-11 00:33:50,470 INFO L226 Difference]: Without dead ends: 37 [2020-07-11 00:33:50,473 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-07-11 00:33:50,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-11 00:33:50,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-11 00:33:50,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:50,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2020-07-11 00:33:50,549 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-11 00:33:50,549 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-11 00:33:50,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:50,555 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2020-07-11 00:33:50,556 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2020-07-11 00:33:50,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:50,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:50,557 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-11 00:33:50,557 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-11 00:33:50,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:50,563 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2020-07-11 00:33:50,563 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2020-07-11 00:33:50,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:50,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:50,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:50,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:50,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-11 00:33:50,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2020-07-11 00:33:50,570 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 24 [2020-07-11 00:33:50,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:50,571 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2020-07-11 00:33:50,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 00:33:50,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 42 transitions. [2020-07-11 00:33:50,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:50,623 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2020-07-11 00:33:50,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-11 00:33:50,624 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:50,625 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, 1, 1, 1] [2020-07-11 00:33:50,625 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:33:50,625 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:50,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:50,626 INFO L82 PathProgramCache]: Analyzing trace with hash 2135506668, now seen corresponding path program 1 times [2020-07-11 00:33:50,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:50,627 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [178618002] [2020-07-11 00:33:50,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:50,673 INFO L280 TraceCheckUtils]: 0: Hoare triple {329#true} assume true; {329#true} is VALID [2020-07-11 00:33:50,674 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {329#true} {329#true} #58#return; {329#true} is VALID [2020-07-11 00:33:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:50,730 INFO L280 TraceCheckUtils]: 0: Hoare triple {329#true} ~m := #in~m; {329#true} is VALID [2020-07-11 00:33:50,731 INFO L280 TraceCheckUtils]: 1: Hoare triple {329#true} ~n := #in~n; {341#(= |addition_#in~n| addition_~n)} is VALID [2020-07-11 00:33:50,732 INFO L280 TraceCheckUtils]: 2: Hoare triple {341#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {342#(and (= |addition_#in~n| addition_~n) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-11 00:33:50,733 INFO L280 TraceCheckUtils]: 3: Hoare triple {342#(and (= |addition_#in~n| addition_~n) (not (= 0 |addition_#in~n|)))} assume !(~n > 0); {343#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-11 00:33:50,734 INFO L280 TraceCheckUtils]: 4: Hoare triple {343#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} assume !(~n < 0); {343#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-11 00:33:50,735 INFO L280 TraceCheckUtils]: 5: Hoare triple {343#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} assume true; {343#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-11 00:33:50,737 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {343#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} {333#(<= 0 main_~n~0)} #62#return; {330#false} is VALID [2020-07-11 00:33:50,738 INFO L263 TraceCheckUtils]: 0: Hoare triple {329#true} call ULTIMATE.init(); {329#true} is VALID [2020-07-11 00:33:50,738 INFO L280 TraceCheckUtils]: 1: Hoare triple {329#true} assume true; {329#true} is VALID [2020-07-11 00:33:50,739 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {329#true} {329#true} #58#return; {329#true} is VALID [2020-07-11 00:33:50,739 INFO L263 TraceCheckUtils]: 3: Hoare triple {329#true} call #t~ret5 := main(); {329#true} is VALID [2020-07-11 00:33:50,740 INFO L280 TraceCheckUtils]: 4: Hoare triple {329#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {329#true} is VALID [2020-07-11 00:33:50,740 INFO L280 TraceCheckUtils]: 5: Hoare triple {329#true} ~m~0 := #t~nondet2; {329#true} is VALID [2020-07-11 00:33:50,740 INFO L280 TraceCheckUtils]: 6: Hoare triple {329#true} havoc #t~nondet2; {329#true} is VALID [2020-07-11 00:33:50,741 INFO L280 TraceCheckUtils]: 7: Hoare triple {329#true} assume !(~m~0 < 0 || ~m~0 > 1073741823); {329#true} is VALID [2020-07-11 00:33:50,741 INFO L280 TraceCheckUtils]: 8: Hoare triple {329#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {329#true} is VALID [2020-07-11 00:33:50,741 INFO L280 TraceCheckUtils]: 9: Hoare triple {329#true} ~n~0 := #t~nondet3; {329#true} is VALID [2020-07-11 00:33:50,742 INFO L280 TraceCheckUtils]: 10: Hoare triple {329#true} havoc #t~nondet3; {329#true} is VALID [2020-07-11 00:33:50,743 INFO L280 TraceCheckUtils]: 11: Hoare triple {329#true} assume !(~n~0 < 0 || ~n~0 > 1073741823); {333#(<= 0 main_~n~0)} is VALID [2020-07-11 00:33:50,743 INFO L263 TraceCheckUtils]: 12: Hoare triple {333#(<= 0 main_~n~0)} call #t~ret4 := addition(~m~0, ~n~0); {329#true} is VALID [2020-07-11 00:33:50,744 INFO L280 TraceCheckUtils]: 13: Hoare triple {329#true} ~m := #in~m; {329#true} is VALID [2020-07-11 00:33:50,744 INFO L280 TraceCheckUtils]: 14: Hoare triple {329#true} ~n := #in~n; {341#(= |addition_#in~n| addition_~n)} is VALID [2020-07-11 00:33:50,745 INFO L280 TraceCheckUtils]: 15: Hoare triple {341#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {342#(and (= |addition_#in~n| addition_~n) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-11 00:33:50,747 INFO L280 TraceCheckUtils]: 16: Hoare triple {342#(and (= |addition_#in~n| addition_~n) (not (= 0 |addition_#in~n|)))} assume !(~n > 0); {343#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-11 00:33:50,748 INFO L280 TraceCheckUtils]: 17: Hoare triple {343#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} assume !(~n < 0); {343#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-11 00:33:50,749 INFO L280 TraceCheckUtils]: 18: Hoare triple {343#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} assume true; {343#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-11 00:33:50,750 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {343#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} {333#(<= 0 main_~n~0)} #62#return; {330#false} is VALID [2020-07-11 00:33:50,751 INFO L280 TraceCheckUtils]: 20: Hoare triple {330#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {330#false} is VALID [2020-07-11 00:33:50,751 INFO L280 TraceCheckUtils]: 21: Hoare triple {330#false} ~result~0 := #t~ret4; {330#false} is VALID [2020-07-11 00:33:50,751 INFO L280 TraceCheckUtils]: 22: Hoare triple {330#false} havoc #t~ret4; {330#false} is VALID [2020-07-11 00:33:50,752 INFO L280 TraceCheckUtils]: 23: Hoare triple {330#false} assume !(~result~0 == ~m~0 + ~n~0); {330#false} is VALID [2020-07-11 00:33:50,752 INFO L280 TraceCheckUtils]: 24: Hoare triple {330#false} assume !false; {330#false} is VALID [2020-07-11 00:33:50,754 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-11 00:33:50,754 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [178618002] [2020-07-11 00:33:50,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:33:50,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 00:33:50,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795596349] [2020-07-11 00:33:50,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-07-11 00:33:50,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:50,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 00:33:50,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:50,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 00:33:50,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:50,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 00:33:50,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:33:50,789 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 6 states. [2020-07-11 00:33:51,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:51,120 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2020-07-11 00:33:51,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 00:33:51,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-07-11 00:33:51,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:51,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:33:51,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2020-07-11 00:33:51,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:33:51,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2020-07-11 00:33:51,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 64 transitions. [2020-07-11 00:33:51,206 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:51,209 INFO L225 Difference]: With dead ends: 56 [2020-07-11 00:33:51,209 INFO L226 Difference]: Without dead ends: 32 [2020-07-11 00:33:51,210 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-11 00:33:51,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-11 00:33:51,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-11 00:33:51,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:51,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-11 00:33:51,248 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-11 00:33:51,249 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-11 00:33:51,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:51,252 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-11 00:33:51,252 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-11 00:33:51,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:51,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:51,253 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-11 00:33:51,253 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-11 00:33:51,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:51,256 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-11 00:33:51,256 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-11 00:33:51,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:51,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:51,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:51,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:51,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-11 00:33:51,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-07-11 00:33:51,260 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 25 [2020-07-11 00:33:51,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:51,261 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-07-11 00:33:51,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 00:33:51,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 33 transitions. [2020-07-11 00:33:51,300 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-11 00:33:51,300 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-11 00:33:51,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-11 00:33:51,301 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:51,302 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:33:51,302 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:33:51,302 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:51,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:51,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1044754306, now seen corresponding path program 1 times [2020-07-11 00:33:51,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:51,303 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1493353140] [2020-07-11 00:33:51,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:51,397 INFO L280 TraceCheckUtils]: 0: Hoare triple {588#true} assume true; {588#true} is VALID [2020-07-11 00:33:51,397 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {588#true} {588#true} #58#return; {588#true} is VALID [2020-07-11 00:33:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:51,552 INFO L280 TraceCheckUtils]: 0: Hoare triple {588#true} ~m := #in~m; {610#(= |addition_#in~m| addition_~m)} is VALID [2020-07-11 00:33:51,553 INFO L280 TraceCheckUtils]: 1: Hoare triple {610#(= |addition_#in~m| addition_~m)} ~n := #in~n; {611#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-11 00:33:51,554 INFO L280 TraceCheckUtils]: 2: Hoare triple {611#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume 0 == ~n; {620#(and (= 0 |addition_#in~n|) (= |addition_#in~m| addition_~m))} is VALID [2020-07-11 00:33:51,555 INFO L280 TraceCheckUtils]: 3: Hoare triple {620#(and (= 0 |addition_#in~n|) (= |addition_#in~m| addition_~m))} #res := ~m; {621#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-11 00:33:51,556 INFO L280 TraceCheckUtils]: 4: Hoare triple {621#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} assume true; {621#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-11 00:33:51,557 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {621#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} {611#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} #64#return; {618#(and (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#t~ret0|) (<= |addition_#t~ret0| (+ |addition_#in~n| |addition_#in~m|)))} is VALID [2020-07-11 00:33:51,558 INFO L280 TraceCheckUtils]: 0: Hoare triple {588#true} ~m := #in~m; {610#(= |addition_#in~m| addition_~m)} is VALID [2020-07-11 00:33:51,559 INFO L280 TraceCheckUtils]: 1: Hoare triple {610#(= |addition_#in~m| addition_~m)} ~n := #in~n; {611#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-11 00:33:51,560 INFO L280 TraceCheckUtils]: 2: Hoare triple {611#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume !(0 == ~n); {611#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-11 00:33:51,560 INFO L280 TraceCheckUtils]: 3: Hoare triple {611#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume ~n > 0; {611#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-11 00:33:51,561 INFO L263 TraceCheckUtils]: 4: Hoare triple {611#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} call #t~ret0 := addition(1 + ~m, ~n - 1); {588#true} is VALID [2020-07-11 00:33:51,561 INFO L280 TraceCheckUtils]: 5: Hoare triple {588#true} ~m := #in~m; {610#(= |addition_#in~m| addition_~m)} is VALID [2020-07-11 00:33:51,562 INFO L280 TraceCheckUtils]: 6: Hoare triple {610#(= |addition_#in~m| addition_~m)} ~n := #in~n; {611#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-11 00:33:51,563 INFO L280 TraceCheckUtils]: 7: Hoare triple {611#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume 0 == ~n; {620#(and (= 0 |addition_#in~n|) (= |addition_#in~m| addition_~m))} is VALID [2020-07-11 00:33:51,564 INFO L280 TraceCheckUtils]: 8: Hoare triple {620#(and (= 0 |addition_#in~n|) (= |addition_#in~m| addition_~m))} #res := ~m; {621#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-11 00:33:51,565 INFO L280 TraceCheckUtils]: 9: Hoare triple {621#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} assume true; {621#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-11 00:33:51,566 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {621#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} {611#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} #64#return; {618#(and (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#t~ret0|) (<= |addition_#t~ret0| (+ |addition_#in~n| |addition_#in~m|)))} is VALID [2020-07-11 00:33:51,567 INFO L280 TraceCheckUtils]: 11: Hoare triple {618#(and (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#t~ret0|) (<= |addition_#t~ret0| (+ |addition_#in~n| |addition_#in~m|)))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {618#(and (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#t~ret0|) (<= |addition_#t~ret0| (+ |addition_#in~n| |addition_#in~m|)))} is VALID [2020-07-11 00:33:51,568 INFO L280 TraceCheckUtils]: 12: Hoare triple {618#(and (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#t~ret0|) (<= |addition_#t~ret0| (+ |addition_#in~n| |addition_#in~m|)))} #res := #t~ret0; {619#(and (<= |addition_#res| (+ |addition_#in~n| |addition_#in~m|)) (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#res|))} is VALID [2020-07-11 00:33:51,569 INFO L280 TraceCheckUtils]: 13: Hoare triple {619#(and (<= |addition_#res| (+ |addition_#in~n| |addition_#in~m|)) (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#res|))} havoc #t~ret0; {619#(and (<= |addition_#res| (+ |addition_#in~n| |addition_#in~m|)) (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#res|))} is VALID [2020-07-11 00:33:51,570 INFO L280 TraceCheckUtils]: 14: Hoare triple {619#(and (<= |addition_#res| (+ |addition_#in~n| |addition_#in~m|)) (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#res|))} assume true; {619#(and (<= |addition_#res| (+ |addition_#in~n| |addition_#in~m|)) (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#res|))} is VALID [2020-07-11 00:33:51,571 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {619#(and (<= |addition_#res| (+ |addition_#in~n| |addition_#in~m|)) (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#res|))} {588#true} #62#return; {608#(and (<= (+ main_~m~0 main_~n~0) |main_#t~ret4|) (<= |main_#t~ret4| (+ main_~m~0 main_~n~0)))} is VALID [2020-07-11 00:33:51,572 INFO L263 TraceCheckUtils]: 0: Hoare triple {588#true} call ULTIMATE.init(); {588#true} is VALID [2020-07-11 00:33:51,573 INFO L280 TraceCheckUtils]: 1: Hoare triple {588#true} assume true; {588#true} is VALID [2020-07-11 00:33:51,573 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {588#true} {588#true} #58#return; {588#true} is VALID [2020-07-11 00:33:51,573 INFO L263 TraceCheckUtils]: 3: Hoare triple {588#true} call #t~ret5 := main(); {588#true} is VALID [2020-07-11 00:33:51,573 INFO L280 TraceCheckUtils]: 4: Hoare triple {588#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {588#true} is VALID [2020-07-11 00:33:51,574 INFO L280 TraceCheckUtils]: 5: Hoare triple {588#true} ~m~0 := #t~nondet2; {588#true} is VALID [2020-07-11 00:33:51,574 INFO L280 TraceCheckUtils]: 6: Hoare triple {588#true} havoc #t~nondet2; {588#true} is VALID [2020-07-11 00:33:51,574 INFO L280 TraceCheckUtils]: 7: Hoare triple {588#true} assume !(~m~0 < 0 || ~m~0 > 1073741823); {588#true} is VALID [2020-07-11 00:33:51,574 INFO L280 TraceCheckUtils]: 8: Hoare triple {588#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {588#true} is VALID [2020-07-11 00:33:51,575 INFO L280 TraceCheckUtils]: 9: Hoare triple {588#true} ~n~0 := #t~nondet3; {588#true} is VALID [2020-07-11 00:33:51,575 INFO L280 TraceCheckUtils]: 10: Hoare triple {588#true} havoc #t~nondet3; {588#true} is VALID [2020-07-11 00:33:51,575 INFO L280 TraceCheckUtils]: 11: Hoare triple {588#true} assume !(~n~0 < 0 || ~n~0 > 1073741823); {588#true} is VALID [2020-07-11 00:33:51,576 INFO L263 TraceCheckUtils]: 12: Hoare triple {588#true} call #t~ret4 := addition(~m~0, ~n~0); {588#true} is VALID [2020-07-11 00:33:51,576 INFO L280 TraceCheckUtils]: 13: Hoare triple {588#true} ~m := #in~m; {610#(= |addition_#in~m| addition_~m)} is VALID [2020-07-11 00:33:51,577 INFO L280 TraceCheckUtils]: 14: Hoare triple {610#(= |addition_#in~m| addition_~m)} ~n := #in~n; {611#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-11 00:33:51,578 INFO L280 TraceCheckUtils]: 15: Hoare triple {611#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume !(0 == ~n); {611#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-11 00:33:51,579 INFO L280 TraceCheckUtils]: 16: Hoare triple {611#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume ~n > 0; {611#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-11 00:33:51,579 INFO L263 TraceCheckUtils]: 17: Hoare triple {611#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} call #t~ret0 := addition(1 + ~m, ~n - 1); {588#true} is VALID [2020-07-11 00:33:51,580 INFO L280 TraceCheckUtils]: 18: Hoare triple {588#true} ~m := #in~m; {610#(= |addition_#in~m| addition_~m)} is VALID [2020-07-11 00:33:51,580 INFO L280 TraceCheckUtils]: 19: Hoare triple {610#(= |addition_#in~m| addition_~m)} ~n := #in~n; {611#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-11 00:33:51,581 INFO L280 TraceCheckUtils]: 20: Hoare triple {611#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume 0 == ~n; {620#(and (= 0 |addition_#in~n|) (= |addition_#in~m| addition_~m))} is VALID [2020-07-11 00:33:51,582 INFO L280 TraceCheckUtils]: 21: Hoare triple {620#(and (= 0 |addition_#in~n|) (= |addition_#in~m| addition_~m))} #res := ~m; {621#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-11 00:33:51,583 INFO L280 TraceCheckUtils]: 22: Hoare triple {621#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} assume true; {621#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-11 00:33:51,584 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {621#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} {611#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} #64#return; {618#(and (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#t~ret0|) (<= |addition_#t~ret0| (+ |addition_#in~n| |addition_#in~m|)))} is VALID [2020-07-11 00:33:51,585 INFO L280 TraceCheckUtils]: 24: Hoare triple {618#(and (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#t~ret0|) (<= |addition_#t~ret0| (+ |addition_#in~n| |addition_#in~m|)))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {618#(and (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#t~ret0|) (<= |addition_#t~ret0| (+ |addition_#in~n| |addition_#in~m|)))} is VALID [2020-07-11 00:33:51,586 INFO L280 TraceCheckUtils]: 25: Hoare triple {618#(and (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#t~ret0|) (<= |addition_#t~ret0| (+ |addition_#in~n| |addition_#in~m|)))} #res := #t~ret0; {619#(and (<= |addition_#res| (+ |addition_#in~n| |addition_#in~m|)) (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#res|))} is VALID [2020-07-11 00:33:51,586 INFO L280 TraceCheckUtils]: 26: Hoare triple {619#(and (<= |addition_#res| (+ |addition_#in~n| |addition_#in~m|)) (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#res|))} havoc #t~ret0; {619#(and (<= |addition_#res| (+ |addition_#in~n| |addition_#in~m|)) (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#res|))} is VALID [2020-07-11 00:33:51,587 INFO L280 TraceCheckUtils]: 27: Hoare triple {619#(and (<= |addition_#res| (+ |addition_#in~n| |addition_#in~m|)) (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#res|))} assume true; {619#(and (<= |addition_#res| (+ |addition_#in~n| |addition_#in~m|)) (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#res|))} is VALID [2020-07-11 00:33:51,589 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {619#(and (<= |addition_#res| (+ |addition_#in~n| |addition_#in~m|)) (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#res|))} {588#true} #62#return; {608#(and (<= (+ main_~m~0 main_~n~0) |main_#t~ret4|) (<= |main_#t~ret4| (+ main_~m~0 main_~n~0)))} is VALID [2020-07-11 00:33:51,589 INFO L280 TraceCheckUtils]: 29: Hoare triple {608#(and (<= (+ main_~m~0 main_~n~0) |main_#t~ret4|) (<= |main_#t~ret4| (+ main_~m~0 main_~n~0)))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {608#(and (<= (+ main_~m~0 main_~n~0) |main_#t~ret4|) (<= |main_#t~ret4| (+ main_~m~0 main_~n~0)))} is VALID [2020-07-11 00:33:51,590 INFO L280 TraceCheckUtils]: 30: Hoare triple {608#(and (<= (+ main_~m~0 main_~n~0) |main_#t~ret4|) (<= |main_#t~ret4| (+ main_~m~0 main_~n~0)))} ~result~0 := #t~ret4; {609#(and (<= (+ main_~m~0 main_~n~0) main_~result~0) (<= main_~result~0 (+ main_~m~0 main_~n~0)))} is VALID [2020-07-11 00:33:51,591 INFO L280 TraceCheckUtils]: 31: Hoare triple {609#(and (<= (+ main_~m~0 main_~n~0) main_~result~0) (<= main_~result~0 (+ main_~m~0 main_~n~0)))} havoc #t~ret4; {609#(and (<= (+ main_~m~0 main_~n~0) main_~result~0) (<= main_~result~0 (+ main_~m~0 main_~n~0)))} is VALID [2020-07-11 00:33:51,592 INFO L280 TraceCheckUtils]: 32: Hoare triple {609#(and (<= (+ main_~m~0 main_~n~0) main_~result~0) (<= main_~result~0 (+ main_~m~0 main_~n~0)))} assume !(~result~0 == ~m~0 + ~n~0); {589#false} is VALID [2020-07-11 00:33:51,592 INFO L280 TraceCheckUtils]: 33: Hoare triple {589#false} assume !false; {589#false} is VALID [2020-07-11 00:33:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-11 00:33:51,595 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1493353140] [2020-07-11 00:33:51,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:33:51,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-11 00:33:51,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421424869] [2020-07-11 00:33:51,597 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2020-07-11 00:33:51,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:51,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-11 00:33:51,636 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:51,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-11 00:33:51,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:51,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-11 00:33:51,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-11 00:33:51,638 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 10 states. [2020-07-11 00:33:52,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:52,048 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-11 00:33:52,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-11 00:33:52,049 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2020-07-11 00:33:52,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:52,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 00:33:52,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 33 transitions. [2020-07-11 00:33:52,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 00:33:52,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 33 transitions. [2020-07-11 00:33:52,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 33 transitions. [2020-07-11 00:33:52,093 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-11 00:33:52,093 INFO L225 Difference]: With dead ends: 32 [2020-07-11 00:33:52,093 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 00:33:52,095 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2020-07-11 00:33:52,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 00:33:52,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 00:33:52,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:52,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 00:33:52,095 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 00:33:52,096 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 00:33:52,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:52,096 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 00:33:52,096 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:33:52,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:52,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:52,097 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 00:33:52,097 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 00:33:52,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:52,098 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 00:33:52,098 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:33:52,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:52,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:52,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:52,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:52,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 00:33:52,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 00:33:52,099 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2020-07-11 00:33:52,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:52,099 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 00:33:52,099 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-11 00:33:52,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 00:33:52,100 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-11 00:33:52,100 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:33:52,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:52,100 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 00:33:52,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 00:33:52,758 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 00:33:52,758 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 00:33:52,758 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 00:33:52,758 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 00:33:52,758 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 00:33:52,759 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 00:33:52,759 INFO L271 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-07-11 00:33:52,759 INFO L271 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: true [2020-07-11 00:33:52,759 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-07-11 00:33:52,759 INFO L271 CegarLoopResult]: At program point L33-2(line 33) the Hoare annotation is: true [2020-07-11 00:33:52,759 INFO L271 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-07-11 00:33:52,759 INFO L271 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: true [2020-07-11 00:33:52,760 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 26 45) the Hoare annotation is: true [2020-07-11 00:33:52,760 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 26 45) the Hoare annotation is: true [2020-07-11 00:33:52,760 INFO L264 CegarLoopResult]: At program point L40(lines 40 44) the Hoare annotation is: (let ((.cse0 (+ main_~m~0 main_~n~0))) (and (<= .cse0 main_~result~0) (<= main_~result~0 .cse0))) [2020-07-11 00:33:52,760 INFO L271 CegarLoopResult]: At program point L34(lines 34 38) the Hoare annotation is: true [2020-07-11 00:33:52,760 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 43) the Hoare annotation is: false [2020-07-11 00:33:52,760 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 26 45) the Hoare annotation is: true [2020-07-11 00:33:52,761 INFO L271 CegarLoopResult]: At program point L28(lines 28 32) the Hoare annotation is: true [2020-07-11 00:33:52,761 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: false [2020-07-11 00:33:52,761 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (let ((.cse0 (+ main_~m~0 main_~n~0))) (and (<= .cse0 main_~result~0) (<= main_~result~0 .cse0))) [2020-07-11 00:33:52,761 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (<= 0 main_~n~0) [2020-07-11 00:33:52,761 INFO L264 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (let ((.cse0 (+ main_~m~0 main_~n~0))) (and (<= .cse0 |main_#t~ret4|) (<= |main_#t~ret4| .cse0))) [2020-07-11 00:33:52,761 INFO L271 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: true [2020-07-11 00:33:52,762 INFO L264 CegarLoopResult]: At program point L39-2(line 39) the Hoare annotation is: (let ((.cse0 (+ main_~m~0 main_~n~0))) (and (<= .cse0 |main_#t~ret4|) (<= |main_#t~ret4| .cse0))) [2020-07-11 00:33:52,762 INFO L264 CegarLoopResult]: At program point L39-3(line 39) the Hoare annotation is: (let ((.cse0 (+ main_~m~0 main_~n~0))) (and (<= .cse0 main_~result~0) (<= main_~result~0 .cse0) (<= .cse0 |main_#t~ret4|) (<= |main_#t~ret4| .cse0))) [2020-07-11 00:33:52,762 INFO L264 CegarLoopResult]: At program point additionFINAL(lines 13 23) the Hoare annotation is: (let ((.cse0 (= |addition_#in~n| addition_~n)) (.cse2 (= |addition_#in~m| addition_~m))) (or (let ((.cse1 (+ |addition_#in~n| |addition_#in~m|))) (and .cse0 (<= |addition_#res| .cse1) .cse2 (<= .cse1 |addition_#res|))) (and .cse0 .cse2 (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|))))) [2020-07-11 00:33:52,762 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m) (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|))) [2020-07-11 00:33:52,762 INFO L264 CegarLoopResult]: At program point L20(lines 20 22) the Hoare annotation is: (and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m) (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|))) [2020-07-11 00:33:52,763 INFO L264 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: (and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m) (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|))) [2020-07-11 00:33:52,763 INFO L264 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: (and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m) (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|))) [2020-07-11 00:33:52,763 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m) (not (= 0 |addition_#in~n|))) [2020-07-11 00:33:52,763 INFO L264 CegarLoopResult]: At program point L21-3(line 21) the Hoare annotation is: (and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m) (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|))) [2020-07-11 00:33:52,763 INFO L264 CegarLoopResult]: At program point L17(lines 17 19) the Hoare annotation is: (and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m) (not (= 0 |addition_#in~n|))) [2020-07-11 00:33:52,764 INFO L264 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (and (let ((.cse0 (= |addition_#in~n| addition_~n)) (.cse2 (= |addition_#in~m| addition_~m))) (or (let ((.cse1 (+ |addition_#in~n| |addition_#in~m|))) (and .cse0 (<= .cse1 |addition_#t~ret0|) .cse2 (<= |addition_#t~ret0| .cse1))) (and .cse0 .cse2 (<= |addition_#in~n| 0)))) (not (= 0 |addition_#in~n|))) [2020-07-11 00:33:52,764 INFO L264 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: (and (let ((.cse0 (= |addition_#in~n| addition_~n)) (.cse2 (= |addition_#in~m| addition_~m))) (or (let ((.cse1 (+ |addition_#in~n| |addition_#in~m|))) (and .cse0 (<= .cse1 |addition_#t~ret0|) .cse2 (<= |addition_#t~ret0| .cse1))) (and .cse0 .cse2 (<= |addition_#in~n| 0)))) (not (= 0 |addition_#in~n|))) [2020-07-11 00:33:52,764 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (= |addition_#in~n| addition_~n) (= 0 |addition_#in~n|) (= |addition_#in~m| addition_~m)) [2020-07-11 00:33:52,764 INFO L264 CegarLoopResult]: At program point L18-3(line 18) the Hoare annotation is: (and (= |addition_#in~m| addition_~m) (let ((.cse0 (= |addition_#in~n| addition_~n))) (or (and .cse0 (<= |addition_#in~n| 0)) (let ((.cse1 (+ |addition_#in~n| |addition_#in~m|))) (and .cse0 (<= .cse1 |addition_#t~ret0|) (<= |addition_#res| .cse1) (<= .cse1 |addition_#res|) (<= |addition_#t~ret0| .cse1))))) (not (= 0 |addition_#in~n|))) [2020-07-11 00:33:52,764 INFO L271 CegarLoopResult]: At program point additionENTRY(lines 13 23) the Hoare annotation is: true [2020-07-11 00:33:52,765 INFO L264 CegarLoopResult]: At program point L14(lines 14 16) the Hoare annotation is: (and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m)) [2020-07-11 00:33:52,765 INFO L264 CegarLoopResult]: At program point L13(lines 13 23) the Hoare annotation is: (= |addition_#in~m| addition_~m) [2020-07-11 00:33:52,765 INFO L264 CegarLoopResult]: At program point additionEXIT(lines 13 23) the Hoare annotation is: (let ((.cse0 (= |addition_#in~n| addition_~n)) (.cse2 (= |addition_#in~m| addition_~m))) (or (let ((.cse1 (+ |addition_#in~n| |addition_#in~m|))) (and .cse0 (<= |addition_#res| .cse1) .cse2 (<= .cse1 |addition_#res|))) (and .cse0 .cse2 (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|))))) [2020-07-11 00:33:52,790 INFO L163 areAnnotationChecker]: CFG has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 00:33:52,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 12:33:52 BoogieIcfgContainer [2020-07-11 00:33:52,803 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 00:33:52,806 INFO L168 Benchmark]: Toolchain (without parser) took 4557.46 ms. Allocated memory was 137.4 MB in the beginning and 272.6 MB in the end (delta: 135.3 MB). Free memory was 102.8 MB in the beginning and 192.0 MB in the end (delta: -89.2 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:52,807 INFO L168 Benchmark]: CDTParser took 0.81 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-11 00:33:52,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.25 ms. Allocated memory is still 137.4 MB. Free memory was 102.4 MB in the beginning and 92.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:52,809 INFO L168 Benchmark]: Boogie Preprocessor took 31.77 ms. Allocated memory is still 137.4 MB. Free memory was 92.6 MB in the beginning and 91.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:52,810 INFO L168 Benchmark]: RCFGBuilder took 542.59 ms. Allocated memory was 137.4 MB in the beginning and 204.5 MB in the end (delta: 67.1 MB). Free memory was 91.2 MB in the beginning and 162.1 MB in the end (delta: -70.9 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:52,811 INFO L168 Benchmark]: TraceAbstraction took 3698.46 ms. Allocated memory was 204.5 MB in the beginning and 272.6 MB in the end (delta: 68.2 MB). Free memory was 162.1 MB in the beginning and 192.0 MB in the end (delta: -29.9 MB). Peak memory consumption was 38.3 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:52,814 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.81 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 279.25 ms. Allocated memory is still 137.4 MB. Free memory was 102.4 MB in the beginning and 92.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.77 ms. Allocated memory is still 137.4 MB. Free memory was 92.6 MB in the beginning and 91.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 542.59 ms. Allocated memory was 137.4 MB in the beginning and 204.5 MB in the end (delta: 67.1 MB). Free memory was 91.2 MB in the beginning and 162.1 MB in the end (delta: -70.9 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3698.46 ms. Allocated memory was 204.5 MB in the beginning and 272.6 MB in the end (delta: 68.2 MB). Free memory was 162.1 MB in the beginning and 192.0 MB in the end (delta: -29.9 MB). Peak memory consumption was 38.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: 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 - ProcedureContractResult [Line: 26]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 13]: Procedure Contract for addition Derived contract for procedure addition: (((\old(n) == n && \result <= \old(n) + \old(m)) && \old(m) == m) && \old(n) + \old(m) <= \result) || (((\old(n) == n && \old(m) == m) && \old(n) <= 0) && !(0 == \old(n))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.9s, OverallIterations: 3, TraceHistogramMax: 2, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 89 SDtfs, 94 SDslu, 252 SDs, 0 SdLazy, 209 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 42 LocationsWithAnnotation, 74 PreInvPairs, 133 NumberOfFragments, 371 HoareAnnotationTreeSize, 74 FomulaSimplifications, 149 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 42 FomulaSimplificationsInter, 125 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 83 NumberOfCodeBlocks, 83 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 8968 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 3/5 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...