/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 -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/sum_20x0-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 16:08:58,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 16:08:58,675 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 16:08:58,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 16:08:58,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 16:08:58,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 16:08:58,700 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 16:08:58,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 16:08:58,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 16:08:58,718 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 16:08:58,721 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 16:08:58,724 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 16:08:58,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 16:08:58,725 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 16:08:58,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 16:08:58,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 16:08:58,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 16:08:58,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 16:08:58,738 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 16:08:58,742 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 16:08:58,748 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 16:08:58,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 16:08:58,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 16:08:58,752 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 16:08:58,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 16:08:58,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 16:08:58,755 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 16:08:58,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 16:08:58,760 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 16:08:58,762 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 16:08:58,762 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 16:08:58,763 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 16:08:58,765 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 16:08:58,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 16:08:58,768 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 16:08:58,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 16:08:58,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 16:08:58,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 16:08:58,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 16:08:58,773 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 16:08:58,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 16:08:58,776 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 16:08:58,790 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 16:08:58,790 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 16:08:58,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 16:08:58,793 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 16:08:58,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 16:08:58,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 16:08:58,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 16:08:58,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 16:08:58,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 16:08:58,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 16:08:58,795 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 16:08:58,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 16:08:58,796 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 16:08:58,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 16:08:58,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 16:08:58,797 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 16:08:58,797 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 16:08:58,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 16:08:58,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 16:08:58,797 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 16:08:58,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 16:08:58,798 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 16:08:58,798 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 16:08:59,067 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 16:08:59,081 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 16:08:59,084 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 16:08:59,086 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 16:08:59,086 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 16:08:59,087 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_20x0-1.c [2020-07-08 16:08:59,155 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da7f6530c/daa29f0b255b4ec3b9abbe66295d445b/FLAG9ae1fe4ef [2020-07-08 16:08:59,628 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 16:08:59,629 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_20x0-1.c [2020-07-08 16:08:59,634 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da7f6530c/daa29f0b255b4ec3b9abbe66295d445b/FLAG9ae1fe4ef [2020-07-08 16:08:59,984 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da7f6530c/daa29f0b255b4ec3b9abbe66295d445b [2020-07-08 16:08:59,995 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 16:08:59,997 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 16:08:59,998 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 16:08:59,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 16:09:00,002 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 16:09:00,004 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 04:08:59" (1/1) ... [2020-07-08 16:09:00,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e722900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:09:00, skipping insertion in model container [2020-07-08 16:09:00,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 04:08:59" (1/1) ... [2020-07-08 16:09:00,016 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 16:09:00,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 16:09:00,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 16:09:00,296 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 16:09:00,319 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 16:09:00,333 INFO L208 MainTranslator]: Completed translation [2020-07-08 16:09:00,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:09:00 WrapperNode [2020-07-08 16:09:00,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 16:09:00,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 16:09:00,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 16:09:00,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 16:09:00,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:09:00" (1/1) ... [2020-07-08 16:09:00,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:09:00" (1/1) ... [2020-07-08 16:09:00,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:09:00" (1/1) ... [2020-07-08 16:09:00,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:09:00" (1/1) ... [2020-07-08 16:09:00,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:09:00" (1/1) ... [2020-07-08 16:09:00,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:09:00" (1/1) ... [2020-07-08 16:09:00,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:09:00" (1/1) ... [2020-07-08 16:09:00,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 16:09:00,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 16:09:00,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 16:09:00,360 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 16:09:00,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:09:00" (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-08 16:09:00,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 16:09:00,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 16:09:00,503 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-07-08 16:09:00,504 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 16:09:00,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 16:09:00,504 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-07-08 16:09:00,504 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 16:09:00,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 16:09:00,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 16:09:00,748 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 16:09:00,749 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 16:09:00,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 04:09:00 BoogieIcfgContainer [2020-07-08 16:09:00,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 16:09:00,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 16:09:00,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 16:09:00,762 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 16:09:00,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 04:08:59" (1/3) ... [2020-07-08 16:09:00,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e185737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 04:09:00, skipping insertion in model container [2020-07-08 16:09:00,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:09:00" (2/3) ... [2020-07-08 16:09:00,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e185737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 04:09:00, skipping insertion in model container [2020-07-08 16:09:00,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 04:09:00" (3/3) ... [2020-07-08 16:09:00,771 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_20x0-1.c [2020-07-08 16:09:00,796 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 16:09:00,805 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 16:09:00,840 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 16:09:00,881 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 16:09:00,881 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 16:09:00,881 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 16:09:00,881 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 16:09:00,882 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 16:09:00,882 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 16:09:00,882 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 16:09:00,882 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 16:09:00,903 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-07-08 16:09:00,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-08 16:09:00,912 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:09:00,913 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-08 16:09:00,914 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:09:00,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:09:00,919 INFO L82 PathProgramCache]: Analyzing trace with hash 989240825, now seen corresponding path program 1 times [2020-07-08 16:09:00,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:09:00,928 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [947579497] [2020-07-08 16:09:00,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:09:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:09:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:09:01,137 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-08 16:09:01,138 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {30#true} {30#true} #33#return; {30#true} is VALID [2020-07-08 16:09:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:09:01,242 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#true} ~n := #in~n; {41#(= sum_~n |sum_#in~n|)} is VALID [2020-07-08 16:09:01,245 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#(= sum_~n |sum_#in~n|)} ~m := #in~m; {41#(= sum_~n |sum_#in~n|)} is VALID [2020-07-08 16:09:01,246 INFO L280 TraceCheckUtils]: 2: Hoare triple {41#(= sum_~n |sum_#in~n|)} assume ~n <= 0; {42#(and (= sum_~n |sum_#in~n|) (<= sum_~n 0))} is VALID [2020-07-08 16:09:01,248 INFO L280 TraceCheckUtils]: 3: Hoare triple {42#(and (= sum_~n |sum_#in~n|) (<= sum_~n 0))} #res := ~m + ~n; {43#(<= |sum_#in~n| 0)} is VALID [2020-07-08 16:09:01,249 INFO L280 TraceCheckUtils]: 4: Hoare triple {43#(<= |sum_#in~n| 0)} assume true; {43#(<= |sum_#in~n| 0)} is VALID [2020-07-08 16:09:01,253 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {43#(<= |sum_#in~n| 0)} {34#(<= 20 main_~a~0)} #39#return; {31#false} is VALID [2020-07-08 16:09:01,254 INFO L263 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2020-07-08 16:09:01,254 INFO L280 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-08 16:09:01,255 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #33#return; {30#true} is VALID [2020-07-08 16:09:01,255 INFO L263 TraceCheckUtils]: 3: Hoare triple {30#true} call #t~ret2 := main(); {30#true} is VALID [2020-07-08 16:09:01,257 INFO L280 TraceCheckUtils]: 4: Hoare triple {30#true} ~a~0 := 20; {34#(<= 20 main_~a~0)} is VALID [2020-07-08 16:09:01,258 INFO L280 TraceCheckUtils]: 5: Hoare triple {34#(<= 20 main_~a~0)} ~b~0 := 0; {34#(<= 20 main_~a~0)} is VALID [2020-07-08 16:09:01,259 INFO L263 TraceCheckUtils]: 6: Hoare triple {34#(<= 20 main_~a~0)} call #t~ret1 := sum(~a~0, ~b~0); {30#true} is VALID [2020-07-08 16:09:01,260 INFO L280 TraceCheckUtils]: 7: Hoare triple {30#true} ~n := #in~n; {41#(= sum_~n |sum_#in~n|)} is VALID [2020-07-08 16:09:01,262 INFO L280 TraceCheckUtils]: 8: Hoare triple {41#(= sum_~n |sum_#in~n|)} ~m := #in~m; {41#(= sum_~n |sum_#in~n|)} is VALID [2020-07-08 16:09:01,263 INFO L280 TraceCheckUtils]: 9: Hoare triple {41#(= sum_~n |sum_#in~n|)} assume ~n <= 0; {42#(and (= sum_~n |sum_#in~n|) (<= sum_~n 0))} is VALID [2020-07-08 16:09:01,265 INFO L280 TraceCheckUtils]: 10: Hoare triple {42#(and (= sum_~n |sum_#in~n|) (<= sum_~n 0))} #res := ~m + ~n; {43#(<= |sum_#in~n| 0)} is VALID [2020-07-08 16:09:01,268 INFO L280 TraceCheckUtils]: 11: Hoare triple {43#(<= |sum_#in~n| 0)} assume true; {43#(<= |sum_#in~n| 0)} is VALID [2020-07-08 16:09:01,270 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {43#(<= |sum_#in~n| 0)} {34#(<= 20 main_~a~0)} #39#return; {31#false} is VALID [2020-07-08 16:09:01,271 INFO L280 TraceCheckUtils]: 13: Hoare triple {31#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {31#false} is VALID [2020-07-08 16:09:01,272 INFO L280 TraceCheckUtils]: 14: Hoare triple {31#false} ~result~0 := #t~ret1; {31#false} is VALID [2020-07-08 16:09:01,272 INFO L280 TraceCheckUtils]: 15: Hoare triple {31#false} havoc #t~ret1; {31#false} is VALID [2020-07-08 16:09:01,273 INFO L280 TraceCheckUtils]: 16: Hoare triple {31#false} assume ~result~0 == ~a~0 + ~b~0; {31#false} is VALID [2020-07-08 16:09:01,273 INFO L280 TraceCheckUtils]: 17: Hoare triple {31#false} assume !false; {31#false} is VALID [2020-07-08 16:09:01,276 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-08 16:09:01,276 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:09:01,279 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [947579497] [2020-07-08 16:09:01,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:09:01,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 16:09:01,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279754320] [2020-07-08 16:09:01,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-08 16:09:01,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:09:01,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 16:09:01,341 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-08 16:09:01,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 16:09:01,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:09:01,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 16:09:01,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 16:09:01,355 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 6 states. [2020-07-08 16:09:01,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:09:01,649 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2020-07-08 16:09:01,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 16:09:01,649 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-08 16:09:01,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:09:01,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 16:09:01,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-08 16:09:01,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 16:09:01,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-08 16:09:01,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2020-07-08 16:09:01,746 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-08 16:09:01,770 INFO L225 Difference]: With dead ends: 39 [2020-07-08 16:09:01,771 INFO L226 Difference]: Without dead ends: 25 [2020-07-08 16:09:01,783 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 16:09:01,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-08 16:09:01,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-08 16:09:01,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:09:01,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-08 16:09:01,900 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-08 16:09:01,900 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-08 16:09:01,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:09:01,906 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-08 16:09:01,906 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-08 16:09:01,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:09:01,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:09:01,907 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-08 16:09:01,908 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-08 16:09:01,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:09:01,912 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-08 16:09:01,912 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-08 16:09:01,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:09:01,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:09:01,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:09:01,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:09:01,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-08 16:09:01,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-07-08 16:09:01,919 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2020-07-08 16:09:01,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:09:01,919 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-07-08 16:09:01,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 16:09:01,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 26 transitions. [2020-07-08 16:09:01,953 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-08 16:09:01,954 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-08 16:09:01,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 16:09:01,955 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:09:01,956 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] [2020-07-08 16:09:01,956 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 16:09:01,956 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:09:01,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:09:01,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1852726759, now seen corresponding path program 1 times [2020-07-08 16:09:01,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:09:01,958 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1060663703] [2020-07-08 16:09:01,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 11 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 11 to 19 Garbage collection #2: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #3: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #1: 11 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 11 to 19 Garbage collection #2: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 [2020-07-08 16:09:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:09:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:09:02,288 INFO L280 TraceCheckUtils]: 0: Hoare triple {224#true} assume true; {224#true} is VALID [2020-07-08 16:09:02,289 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {224#true} {224#true} #33#return; {224#true} is VALID [2020-07-08 16:09:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:09:02,374 INFO L280 TraceCheckUtils]: 0: Hoare triple {224#true} [41] sumENTRY-->L3_primed: Formula: (let ((.cse1 (+ v_oct_sum_~m_out_1 1)) (.cse0 (+ |v_oct_sum_#in~n_out_1| 1))) (and (<= |v_oct_sum_#in~m_in_1| v_oct_sum_~m_out_1) (<= v_oct_sum_~n_out_1 .cse0) (<= 2 (* 2 v_oct_sum_~n_out_1)) (<= .cse1 |v_oct_sum_#in~m_out_1|) (<= v_oct_sum_~m_out_1 |v_oct_sum_#in~m_in_1|) (<= |v_oct_sum_#in~n_in_1| v_oct_sum_~n_out_1) (<= |v_oct_sum_#in~m_out_1| .cse1) (<= .cse0 v_oct_sum_~n_out_1) (<= v_oct_sum_~n_out_1 |v_oct_sum_#in~n_in_1|))) InVars {sum_#in~m=|v_oct_sum_#in~m_in_1|, sum_#in~n=|v_oct_sum_#in~n_in_1|} OutVars{sum_~n=v_oct_sum_~n_out_1, sum_~m=v_oct_sum_~m_out_1, sum_#in~m=|v_oct_sum_#in~m_out_1|, sum_#in~n=|v_oct_sum_#in~n_out_1|} AuxVars[] AssignedVars[sum_~n, sum_~m, sum_#in~m, sum_#in~n] {224#true} is VALID [2020-07-08 16:09:02,376 INFO L280 TraceCheckUtils]: 1: Hoare triple {224#true} [40] L3_primed-->L3: Formula: (= v_sum_~n_1 |v_sum_#in~n_1|) InVars {sum_#in~n=|v_sum_#in~n_1|} OutVars{sum_~n=v_sum_~n_1, sum_#in~n=|v_sum_#in~n_1|} AuxVars[] AssignedVars[sum_~n] {237#(<= |sum_#in~n| (+ sum_~n 1))} is VALID [2020-07-08 16:09:02,377 INFO L280 TraceCheckUtils]: 2: Hoare triple {237#(<= |sum_#in~n| (+ sum_~n 1))} ~m := #in~m; {237#(<= |sum_#in~n| (+ sum_~n 1))} is VALID [2020-07-08 16:09:02,378 INFO L280 TraceCheckUtils]: 3: Hoare triple {237#(<= |sum_#in~n| (+ sum_~n 1))} assume ~n <= 0; {238#(<= |sum_#in~n| 1)} is VALID [2020-07-08 16:09:02,379 INFO L280 TraceCheckUtils]: 4: Hoare triple {238#(<= |sum_#in~n| 1)} #res := ~m + ~n; {238#(<= |sum_#in~n| 1)} is VALID [2020-07-08 16:09:02,380 INFO L280 TraceCheckUtils]: 5: Hoare triple {238#(<= |sum_#in~n| 1)} [43] sumFINAL-->sumEXIT_primed: Formula: (let ((.cse21 (* 2 |v_oct_sum_#res_out_1|)) (.cse25 (* 2 |v_oct_sum_#res_in_1|))) (let ((.cse3 (<= .cse25 4294967294)) (.cse5 (<= .cse21 4294967294)) (.cse9 (<= 0 (+ .cse21 4294967296))) (.cse1 (<= 0 (+ .cse25 4294967296))) (.cse6 (<= .cse25 4294967294)) (.cse2 (<= 0 (+ .cse25 4294967296))) (.cse7 (<= 0 (+ .cse21 4294967296))) (.cse4 (<= .cse21 4294967294)) (.cse16 (<= .cse25 4294967294)) (.cse14 (<= 0 (+ .cse25 4294967296))) (.cse17 (<= 0 (+ .cse21 4294967296))) (.cse15 (<= .cse21 4294967294)) (.cse10 (<= 0 (+ .cse25 4294967296))) (.cse11 (<= .cse21 4294967294)) (.cse12 (<= 0 (+ .cse21 4294967296))) (.cse13 (<= .cse25 4294967294)) (.cse8 (<= |v_oct_sum_#res_out_1| |v_oct_sum_#res_in_1|)) (.cse0 (<= |v_oct_sum_#res_in_1| |v_oct_sum_#res_out_1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse8 .cse17) (let ((.cse23 (not .cse0)) (.cse24 (not .cse8))) (and (let ((.cse19 (<= 0 (+ .cse21 4294967296))) (.cse20 (<= .cse21 4294967294)) (.cse22 (<= 0 (+ .cse21 4294967296)))) (or (and .cse0 (let ((.cse18 (<= .cse21 4294967294))) (or .cse18 (and (not .cse18) .cse19 .cse20))) .cse22) (and .cse0 .cse19 .cse20 (not .cse22)))) (or (not .cse3) (not .cse5) (not .cse9) (not .cse1) (not .cse6) (not .cse2) (not .cse7) .cse23 (not .cse4) .cse24) .cse8 (or (not .cse16) (not .cse14) (not .cse17) (not .cse15) (not .cse10) (not .cse11) (not .cse12) .cse23 (not .cse13) .cse24)))))) InVars {sum_#res=|v_oct_sum_#res_in_1|} OutVars{sum_#res=|v_oct_sum_#res_out_1|, sum_#t~ret0=|v_oct_sum_#t~ret0_out_1|} AuxVars[] AssignedVars[sum_#res, sum_#t~ret0] {238#(<= |sum_#in~n| 1)} is VALID [2020-07-08 16:09:02,382 INFO L280 TraceCheckUtils]: 6: Hoare triple {238#(<= |sum_#in~n| 1)} [42] sumEXIT_primed-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {238#(<= |sum_#in~n| 1)} is VALID [2020-07-08 16:09:02,383 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {238#(<= |sum_#in~n| 1)} {228#(<= 20 main_~a~0)} #39#return; {225#false} is VALID [2020-07-08 16:09:02,384 INFO L263 TraceCheckUtils]: 0: Hoare triple {224#true} call ULTIMATE.init(); {224#true} is VALID [2020-07-08 16:09:02,385 INFO L280 TraceCheckUtils]: 1: Hoare triple {224#true} assume true; {224#true} is VALID [2020-07-08 16:09:02,385 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {224#true} {224#true} #33#return; {224#true} is VALID [2020-07-08 16:09:02,385 INFO L263 TraceCheckUtils]: 3: Hoare triple {224#true} call #t~ret2 := main(); {224#true} is VALID [2020-07-08 16:09:02,386 INFO L280 TraceCheckUtils]: 4: Hoare triple {224#true} ~a~0 := 20; {228#(<= 20 main_~a~0)} is VALID [2020-07-08 16:09:02,387 INFO L280 TraceCheckUtils]: 5: Hoare triple {228#(<= 20 main_~a~0)} ~b~0 := 0; {228#(<= 20 main_~a~0)} is VALID [2020-07-08 16:09:02,388 INFO L263 TraceCheckUtils]: 6: Hoare triple {228#(<= 20 main_~a~0)} call #t~ret1 := sum(~a~0, ~b~0); {224#true} is VALID [2020-07-08 16:09:02,388 INFO L280 TraceCheckUtils]: 7: Hoare triple {224#true} [41] sumENTRY-->L3_primed: Formula: (let ((.cse1 (+ v_oct_sum_~m_out_1 1)) (.cse0 (+ |v_oct_sum_#in~n_out_1| 1))) (and (<= |v_oct_sum_#in~m_in_1| v_oct_sum_~m_out_1) (<= v_oct_sum_~n_out_1 .cse0) (<= 2 (* 2 v_oct_sum_~n_out_1)) (<= .cse1 |v_oct_sum_#in~m_out_1|) (<= v_oct_sum_~m_out_1 |v_oct_sum_#in~m_in_1|) (<= |v_oct_sum_#in~n_in_1| v_oct_sum_~n_out_1) (<= |v_oct_sum_#in~m_out_1| .cse1) (<= .cse0 v_oct_sum_~n_out_1) (<= v_oct_sum_~n_out_1 |v_oct_sum_#in~n_in_1|))) InVars {sum_#in~m=|v_oct_sum_#in~m_in_1|, sum_#in~n=|v_oct_sum_#in~n_in_1|} OutVars{sum_~n=v_oct_sum_~n_out_1, sum_~m=v_oct_sum_~m_out_1, sum_#in~m=|v_oct_sum_#in~m_out_1|, sum_#in~n=|v_oct_sum_#in~n_out_1|} AuxVars[] AssignedVars[sum_~n, sum_~m, sum_#in~m, sum_#in~n] {224#true} is VALID [2020-07-08 16:09:02,389 INFO L280 TraceCheckUtils]: 8: Hoare triple {224#true} [40] L3_primed-->L3: Formula: (= v_sum_~n_1 |v_sum_#in~n_1|) InVars {sum_#in~n=|v_sum_#in~n_1|} OutVars{sum_~n=v_sum_~n_1, sum_#in~n=|v_sum_#in~n_1|} AuxVars[] AssignedVars[sum_~n] {237#(<= |sum_#in~n| (+ sum_~n 1))} is VALID [2020-07-08 16:09:02,390 INFO L280 TraceCheckUtils]: 9: Hoare triple {237#(<= |sum_#in~n| (+ sum_~n 1))} ~m := #in~m; {237#(<= |sum_#in~n| (+ sum_~n 1))} is VALID [2020-07-08 16:09:02,391 INFO L280 TraceCheckUtils]: 10: Hoare triple {237#(<= |sum_#in~n| (+ sum_~n 1))} assume ~n <= 0; {238#(<= |sum_#in~n| 1)} is VALID [2020-07-08 16:09:02,392 INFO L280 TraceCheckUtils]: 11: Hoare triple {238#(<= |sum_#in~n| 1)} #res := ~m + ~n; {238#(<= |sum_#in~n| 1)} is VALID [2020-07-08 16:09:02,393 INFO L280 TraceCheckUtils]: 12: Hoare triple {238#(<= |sum_#in~n| 1)} [43] sumFINAL-->sumEXIT_primed: Formula: (let ((.cse21 (* 2 |v_oct_sum_#res_out_1|)) (.cse25 (* 2 |v_oct_sum_#res_in_1|))) (let ((.cse3 (<= .cse25 4294967294)) (.cse5 (<= .cse21 4294967294)) (.cse9 (<= 0 (+ .cse21 4294967296))) (.cse1 (<= 0 (+ .cse25 4294967296))) (.cse6 (<= .cse25 4294967294)) (.cse2 (<= 0 (+ .cse25 4294967296))) (.cse7 (<= 0 (+ .cse21 4294967296))) (.cse4 (<= .cse21 4294967294)) (.cse16 (<= .cse25 4294967294)) (.cse14 (<= 0 (+ .cse25 4294967296))) (.cse17 (<= 0 (+ .cse21 4294967296))) (.cse15 (<= .cse21 4294967294)) (.cse10 (<= 0 (+ .cse25 4294967296))) (.cse11 (<= .cse21 4294967294)) (.cse12 (<= 0 (+ .cse21 4294967296))) (.cse13 (<= .cse25 4294967294)) (.cse8 (<= |v_oct_sum_#res_out_1| |v_oct_sum_#res_in_1|)) (.cse0 (<= |v_oct_sum_#res_in_1| |v_oct_sum_#res_out_1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse8 .cse17) (let ((.cse23 (not .cse0)) (.cse24 (not .cse8))) (and (let ((.cse19 (<= 0 (+ .cse21 4294967296))) (.cse20 (<= .cse21 4294967294)) (.cse22 (<= 0 (+ .cse21 4294967296)))) (or (and .cse0 (let ((.cse18 (<= .cse21 4294967294))) (or .cse18 (and (not .cse18) .cse19 .cse20))) .cse22) (and .cse0 .cse19 .cse20 (not .cse22)))) (or (not .cse3) (not .cse5) (not .cse9) (not .cse1) (not .cse6) (not .cse2) (not .cse7) .cse23 (not .cse4) .cse24) .cse8 (or (not .cse16) (not .cse14) (not .cse17) (not .cse15) (not .cse10) (not .cse11) (not .cse12) .cse23 (not .cse13) .cse24)))))) InVars {sum_#res=|v_oct_sum_#res_in_1|} OutVars{sum_#res=|v_oct_sum_#res_out_1|, sum_#t~ret0=|v_oct_sum_#t~ret0_out_1|} AuxVars[] AssignedVars[sum_#res, sum_#t~ret0] {238#(<= |sum_#in~n| 1)} is VALID [2020-07-08 16:09:02,394 INFO L280 TraceCheckUtils]: 13: Hoare triple {238#(<= |sum_#in~n| 1)} [42] sumEXIT_primed-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {238#(<= |sum_#in~n| 1)} is VALID [2020-07-08 16:09:02,395 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {238#(<= |sum_#in~n| 1)} {228#(<= 20 main_~a~0)} #39#return; {225#false} is VALID [2020-07-08 16:09:02,396 INFO L280 TraceCheckUtils]: 15: Hoare triple {225#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {225#false} is VALID [2020-07-08 16:09:02,396 INFO L280 TraceCheckUtils]: 16: Hoare triple {225#false} ~result~0 := #t~ret1; {225#false} is VALID [2020-07-08 16:09:02,397 INFO L280 TraceCheckUtils]: 17: Hoare triple {225#false} havoc #t~ret1; {225#false} is VALID [2020-07-08 16:09:02,397 INFO L280 TraceCheckUtils]: 18: Hoare triple {225#false} assume ~result~0 == ~a~0 + ~b~0; {225#false} is VALID [2020-07-08 16:09:02,397 INFO L280 TraceCheckUtils]: 19: Hoare triple {225#false} assume !false; {225#false} is VALID [2020-07-08 16:09:02,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 16:09:02,702 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:09:02,702 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1060663703] [2020-07-08 16:09:02,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:09:02,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-08 16:09:02,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790567055] [2020-07-08 16:09:02,704 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-07-08 16:09:02,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:09:02,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-08 16:09:02,727 WARN L140 InductivityCheck]: Transition 238#(<= |sum_#in~n| 1) ( _ , 241#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (< 0 sum_~n)) , #37#return; , 238#(<= |sum_#in~n| 1) ) not inductive [2020-07-08 16:09:02,727 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 16:09:02,728 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:583) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:455) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-08 16:09:02,734 INFO L168 Benchmark]: Toolchain (without parser) took 2736.93 ms. Allocated memory was 138.9 MB in the beginning and 235.4 MB in the end (delta: 96.5 MB). Free memory was 104.6 MB in the beginning and 112.6 MB in the end (delta: -8.0 MB). Peak memory consumption was 88.5 MB. Max. memory is 7.1 GB. [2020-07-08 16:09:02,736 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 16:09:02,737 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.72 ms. Allocated memory is still 138.9 MB. Free memory was 104.4 MB in the beginning and 94.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-08 16:09:02,738 INFO L168 Benchmark]: Boogie Preprocessor took 24.58 ms. Allocated memory is still 138.9 MB. Free memory was 94.7 MB in the beginning and 93.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-08 16:09:02,739 INFO L168 Benchmark]: RCFGBuilder took 395.80 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 93.3 MB in the beginning and 167.3 MB in the end (delta: -74.0 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-07-08 16:09:02,740 INFO L168 Benchmark]: TraceAbstraction took 1974.45 ms. Allocated memory was 203.4 MB in the beginning and 235.4 MB in the end (delta: 32.0 MB). Free memory was 166.7 MB in the beginning and 114.0 MB in the end (delta: 52.7 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2020-07-08 16:09:02,745 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.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 335.72 ms. Allocated memory is still 138.9 MB. Free memory was 104.4 MB in the beginning and 94.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.58 ms. Allocated memory is still 138.9 MB. Free memory was 94.7 MB in the beginning and 93.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 395.80 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 93.3 MB in the beginning and 167.3 MB in the end (delta: -74.0 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1974.45 ms. Allocated memory was 203.4 MB in the beginning and 235.4 MB in the end (delta: 32.0 MB). Free memory was 166.7 MB in the beginning and 114.0 MB in the end (delta: 52.7 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:142) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...