/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-8fc6572 [2020-07-10 18:44:19,256 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 18:44:19,259 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 18:44:19,278 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 18:44:19,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 18:44:19,281 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 18:44:19,283 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 18:44:19,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 18:44:19,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 18:44:19,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 18:44:19,303 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 18:44:19,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 18:44:19,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 18:44:19,307 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 18:44:19,311 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 18:44:19,313 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 18:44:19,315 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 18:44:19,316 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 18:44:19,317 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 18:44:19,322 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 18:44:19,328 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 18:44:19,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 18:44:19,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 18:44:19,333 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 18:44:19,336 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 18:44:19,336 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 18:44:19,336 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 18:44:19,339 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 18:44:19,340 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 18:44:19,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 18:44:19,342 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 18:44:19,343 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 18:44:19,344 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 18:44:19,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 18:44:19,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 18:44:19,347 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 18:44:19,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 18:44:19,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 18:44:19,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 18:44:19,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 18:44:19,350 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 18:44:19,351 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 18:44:19,383 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 18:44:19,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 18:44:19,388 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 18:44:19,389 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 18:44:19,389 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 18:44:19,389 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 18:44:19,389 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 18:44:19,389 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 18:44:19,390 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 18:44:19,390 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 18:44:19,390 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 18:44:19,392 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 18:44:19,393 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 18:44:19,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 18:44:19,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 18:44:19,393 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 18:44:19,394 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 18:44:19,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 18:44:19,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 18:44:19,394 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 18:44:19,394 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 18:44:19,394 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 18:44:19,395 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 18:44:19,717 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 18:44:19,732 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 18:44:19,736 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 18:44:19,738 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 18:44:19,738 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 18:44:19,739 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-10 18:44:19,819 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ec941c43/ef22f56dc2d14f9b98b463eedd969428/FLAGc3465a397 [2020-07-10 18:44:20,309 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 18:44:20,309 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_20x0-1.c [2020-07-10 18:44:20,315 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ec941c43/ef22f56dc2d14f9b98b463eedd969428/FLAGc3465a397 [2020-07-10 18:44:20,722 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ec941c43/ef22f56dc2d14f9b98b463eedd969428 [2020-07-10 18:44:20,733 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 18:44:20,735 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 18:44:20,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 18:44:20,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 18:44:20,741 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 18:44:20,744 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:44:20" (1/1) ... [2020-07-10 18:44:20,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b09f6d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:44:20, skipping insertion in model container [2020-07-10 18:44:20,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:44:20" (1/1) ... [2020-07-10 18:44:20,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 18:44:20,771 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 18:44:20,951 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:44:20,959 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 18:44:20,976 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:44:20,991 INFO L208 MainTranslator]: Completed translation [2020-07-10 18:44:20,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:44:20 WrapperNode [2020-07-10 18:44:20,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 18:44:20,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 18:44:20,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 18:44:20,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 18:44:21,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:44:20" (1/1) ... [2020-07-10 18:44:21,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:44:20" (1/1) ... [2020-07-10 18:44:21,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:44:20" (1/1) ... [2020-07-10 18:44:21,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:44:20" (1/1) ... [2020-07-10 18:44:21,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:44:20" (1/1) ... [2020-07-10 18:44:21,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:44:20" (1/1) ... [2020-07-10 18:44:21,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:44:20" (1/1) ... [2020-07-10 18:44:21,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 18:44:21,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 18:44:21,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 18:44:21,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 18:44:21,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:44:20" (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-10 18:44:21,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 18:44:21,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 18:44:21,169 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-07-10 18:44:21,169 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 18:44:21,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 18:44:21,169 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-07-10 18:44:21,169 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 18:44:21,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 18:44:21,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 18:44:21,419 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 18:44:21,420 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 18:44:21,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:44:21 BoogieIcfgContainer [2020-07-10 18:44:21,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 18:44:21,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 18:44:21,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 18:44:21,430 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 18:44:21,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 06:44:20" (1/3) ... [2020-07-10 18:44:21,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b73080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:44:21, skipping insertion in model container [2020-07-10 18:44:21,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:44:20" (2/3) ... [2020-07-10 18:44:21,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b73080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:44:21, skipping insertion in model container [2020-07-10 18:44:21,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:44:21" (3/3) ... [2020-07-10 18:44:21,436 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_20x0-1.c [2020-07-10 18:44:21,455 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 18:44:21,467 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 18:44:21,489 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 18:44:21,515 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 18:44:21,516 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 18:44:21,516 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 18:44:21,516 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 18:44:21,516 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 18:44:21,516 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 18:44:21,517 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 18:44:21,517 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 18:44:21,534 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-07-10 18:44:21,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 18:44:21,547 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:44:21,549 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-10 18:44:21,549 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:44:21,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:44:21,556 INFO L82 PathProgramCache]: Analyzing trace with hash 989240825, now seen corresponding path program 1 times [2020-07-10 18:44:21,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:44:21,568 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [188980352] [2020-07-10 18:44:21,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:44:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:44:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:44:21,791 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-10 18:44:21,791 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {30#true} {30#true} #33#return; {30#true} is VALID [2020-07-10 18:44:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:44:21,859 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#true} ~n := #in~n; {41#(= sum_~n |sum_#in~n|)} is VALID [2020-07-10 18:44:21,860 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-10 18:44:21,862 INFO L280 TraceCheckUtils]: 2: Hoare triple {41#(= sum_~n |sum_#in~n|)} assume ~n <= 0; {42#(<= |sum_#in~n| 0)} is VALID [2020-07-10 18:44:21,864 INFO L280 TraceCheckUtils]: 3: Hoare triple {42#(<= |sum_#in~n| 0)} #res := ~m + ~n; {42#(<= |sum_#in~n| 0)} is VALID [2020-07-10 18:44:21,866 INFO L280 TraceCheckUtils]: 4: Hoare triple {42#(<= |sum_#in~n| 0)} assume true; {42#(<= |sum_#in~n| 0)} is VALID [2020-07-10 18:44:21,870 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {42#(<= |sum_#in~n| 0)} {34#(<= 20 main_~a~0)} #39#return; {31#false} is VALID [2020-07-10 18:44:21,871 INFO L263 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2020-07-10 18:44:21,871 INFO L280 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-10 18:44:21,872 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #33#return; {30#true} is VALID [2020-07-10 18:44:21,872 INFO L263 TraceCheckUtils]: 3: Hoare triple {30#true} call #t~ret2 := main(); {30#true} is VALID [2020-07-10 18:44:21,874 INFO L280 TraceCheckUtils]: 4: Hoare triple {30#true} ~a~0 := 20; {34#(<= 20 main_~a~0)} is VALID [2020-07-10 18:44:21,876 INFO L280 TraceCheckUtils]: 5: Hoare triple {34#(<= 20 main_~a~0)} ~b~0 := 0; {34#(<= 20 main_~a~0)} is VALID [2020-07-10 18:44:21,876 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-10 18:44:21,879 INFO L280 TraceCheckUtils]: 7: Hoare triple {30#true} ~n := #in~n; {41#(= sum_~n |sum_#in~n|)} is VALID [2020-07-10 18:44:21,881 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-10 18:44:21,883 INFO L280 TraceCheckUtils]: 9: Hoare triple {41#(= sum_~n |sum_#in~n|)} assume ~n <= 0; {42#(<= |sum_#in~n| 0)} is VALID [2020-07-10 18:44:21,885 INFO L280 TraceCheckUtils]: 10: Hoare triple {42#(<= |sum_#in~n| 0)} #res := ~m + ~n; {42#(<= |sum_#in~n| 0)} is VALID [2020-07-10 18:44:21,887 INFO L280 TraceCheckUtils]: 11: Hoare triple {42#(<= |sum_#in~n| 0)} assume true; {42#(<= |sum_#in~n| 0)} is VALID [2020-07-10 18:44:21,891 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {42#(<= |sum_#in~n| 0)} {34#(<= 20 main_~a~0)} #39#return; {31#false} is VALID [2020-07-10 18:44:21,891 INFO L280 TraceCheckUtils]: 13: Hoare triple {31#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {31#false} is VALID [2020-07-10 18:44:21,892 INFO L280 TraceCheckUtils]: 14: Hoare triple {31#false} ~result~0 := #t~ret1; {31#false} is VALID [2020-07-10 18:44:21,892 INFO L280 TraceCheckUtils]: 15: Hoare triple {31#false} havoc #t~ret1; {31#false} is VALID [2020-07-10 18:44:21,892 INFO L280 TraceCheckUtils]: 16: Hoare triple {31#false} assume ~result~0 == ~a~0 + ~b~0; {31#false} is VALID [2020-07-10 18:44:21,893 INFO L280 TraceCheckUtils]: 17: Hoare triple {31#false} assume !false; {31#false} is VALID [2020-07-10 18:44:21,895 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-10 18:44:21,896 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:44:21,898 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [188980352] [2020-07-10 18:44:21,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:44:21,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 18:44:21,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861363053] [2020-07-10 18:44:21,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-10 18:44:21,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:44:21,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 18:44:21,972 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-10 18:44:21,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 18:44:21,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:44:21,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 18:44:21,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 18:44:21,987 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2020-07-10 18:44:22,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:44:22,280 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2020-07-10 18:44:22,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 18:44:22,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-10 18:44:22,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:44:22,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 18:44:22,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-10 18:44:22,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 18:44:22,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-10 18:44:22,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2020-07-10 18:44:22,388 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-10 18:44:22,402 INFO L225 Difference]: With dead ends: 39 [2020-07-10 18:44:22,403 INFO L226 Difference]: Without dead ends: 25 [2020-07-10 18:44:22,407 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 18:44:22,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-10 18:44:22,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-10 18:44:22,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:44:22,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-10 18:44:22,497 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-10 18:44:22,497 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-10 18:44:22,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:44:22,503 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-10 18:44:22,503 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-10 18:44:22,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:44:22,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:44:22,505 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-10 18:44:22,505 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-10 18:44:22,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:44:22,510 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-10 18:44:22,510 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-10 18:44:22,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:44:22,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:44:22,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:44:22,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:44:22,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 18:44:22,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-07-10 18:44:22,517 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2020-07-10 18:44:22,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:44:22,518 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-07-10 18:44:22,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 18:44:22,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 26 transitions. [2020-07-10 18:44:22,559 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-10 18:44:22,560 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-10 18:44:22,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 18:44:22,561 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:44:22,561 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-10 18:44:22,562 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 18:44:22,562 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:44:22,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:44:22,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1852726759, now seen corresponding path program 1 times [2020-07-10 18:44:22,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:44:22,563 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [618526323] [2020-07-10 18:44:22,564 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-10 18:44:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:44:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:44:22,838 INFO L280 TraceCheckUtils]: 0: Hoare triple {225#true} assume true; {225#true} is VALID [2020-07-10 18:44:22,839 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {225#true} {225#true} #33#return; {225#true} is VALID [2020-07-10 18:44:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:44:22,909 INFO L280 TraceCheckUtils]: 0: Hoare triple {225#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] {225#true} is VALID [2020-07-10 18:44:22,911 INFO L280 TraceCheckUtils]: 1: Hoare triple {225#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] {238#(<= |sum_#in~n| (+ sum_~n 1))} is VALID [2020-07-10 18:44:22,913 INFO L280 TraceCheckUtils]: 2: Hoare triple {238#(<= |sum_#in~n| (+ sum_~n 1))} ~m := #in~m; {238#(<= |sum_#in~n| (+ sum_~n 1))} is VALID [2020-07-10 18:44:22,914 INFO L280 TraceCheckUtils]: 3: Hoare triple {238#(<= |sum_#in~n| (+ sum_~n 1))} assume ~n <= 0; {239#(<= |sum_#in~n| 1)} is VALID [2020-07-10 18:44:22,914 INFO L280 TraceCheckUtils]: 4: Hoare triple {239#(<= |sum_#in~n| 1)} #res := ~m + ~n; {239#(<= |sum_#in~n| 1)} is VALID [2020-07-10 18:44:22,916 INFO L280 TraceCheckUtils]: 5: Hoare triple {239#(<= |sum_#in~n| 1)} [43] sumFINAL-->sumEXIT_primed: Formula: (let ((.cse5 (* 2 |v_oct_sum_#res_out_1|)) (.cse25 (* 2 |v_oct_sum_#res_in_1|))) (let ((.cse6 (<= 0 (+ .cse25 4294967296))) (.cse11 (<= .cse5 4294967294)) (.cse7 (<= 0 (+ .cse5 4294967296))) (.cse8 (<= 0 (+ .cse25 4294967296))) (.cse12 (<= .cse25 4294967294)) (.cse10 (<= .cse5 4294967294)) (.cse9 (<= 0 (+ .cse5 4294967296))) (.cse14 (<= .cse25 4294967294)) (.cse0 (<= |v_oct_sum_#res_in_1| |v_oct_sum_#res_out_1|)) (.cse23 (<= .cse25 4294967294)) (.cse20 (<= .cse5 4294967294)) (.cse16 (<= 0 (+ .cse5 4294967296))) (.cse21 (<= 0 (+ .cse25 4294967296))) (.cse19 (<= .cse25 4294967294)) (.cse17 (<= .cse5 4294967294)) (.cse22 (<= 0 (+ .cse25 4294967296))) (.cse24 (<= |v_oct_sum_#res_out_1| |v_oct_sum_#res_in_1|)) (.cse18 (<= 0 (+ .cse5 4294967296)))) (or (let ((.cse13 (not .cse0)) (.cse15 (not .cse24))) (and .cse0 (let ((.cse1 (<= 0 (+ .cse5 4294967296))) (.cse3 (<= .cse5 4294967294)) (.cse2 (<= 0 (+ .cse5 4294967296)))) (or (and .cse1 (not .cse2) .cse3) (and (let ((.cse4 (<= .cse5 4294967294))) (or (and .cse1 .cse3 (not .cse4)) .cse4)) .cse2))) (or (not .cse6) (not .cse7) (not .cse8) (not .cse9) (not .cse10) (not .cse11) (not .cse12) .cse13 (not .cse14) .cse15) (or (not .cse16) (not .cse17) (not .cse18) (not .cse19) (not .cse20) (not .cse21) (not .cse22) .cse13 (not .cse23) .cse15) .cse24)) (and .cse0 .cse6 .cse11 .cse7 .cse8 .cse12 .cse10 .cse9 .cse24 .cse14) (and .cse0 .cse23 .cse20 .cse16 .cse21 .cse19 .cse17 .cse22 .cse24 .cse18)))) 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] {239#(<= |sum_#in~n| 1)} is VALID [2020-07-10 18:44:22,917 INFO L280 TraceCheckUtils]: 6: Hoare triple {239#(<= |sum_#in~n| 1)} [42] sumEXIT_primed-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#(<= |sum_#in~n| 1)} is VALID [2020-07-10 18:44:22,919 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {239#(<= |sum_#in~n| 1)} {229#(<= 20 main_~a~0)} #39#return; {226#false} is VALID [2020-07-10 18:44:22,919 INFO L263 TraceCheckUtils]: 0: Hoare triple {225#true} call ULTIMATE.init(); {225#true} is VALID [2020-07-10 18:44:22,920 INFO L280 TraceCheckUtils]: 1: Hoare triple {225#true} assume true; {225#true} is VALID [2020-07-10 18:44:22,920 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {225#true} {225#true} #33#return; {225#true} is VALID [2020-07-10 18:44:22,920 INFO L263 TraceCheckUtils]: 3: Hoare triple {225#true} call #t~ret2 := main(); {225#true} is VALID [2020-07-10 18:44:22,921 INFO L280 TraceCheckUtils]: 4: Hoare triple {225#true} ~a~0 := 20; {229#(<= 20 main_~a~0)} is VALID [2020-07-10 18:44:22,922 INFO L280 TraceCheckUtils]: 5: Hoare triple {229#(<= 20 main_~a~0)} ~b~0 := 0; {229#(<= 20 main_~a~0)} is VALID [2020-07-10 18:44:22,923 INFO L263 TraceCheckUtils]: 6: Hoare triple {229#(<= 20 main_~a~0)} call #t~ret1 := sum(~a~0, ~b~0); {225#true} is VALID [2020-07-10 18:44:22,923 INFO L280 TraceCheckUtils]: 7: Hoare triple {225#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] {225#true} is VALID [2020-07-10 18:44:22,924 INFO L280 TraceCheckUtils]: 8: Hoare triple {225#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] {238#(<= |sum_#in~n| (+ sum_~n 1))} is VALID [2020-07-10 18:44:22,925 INFO L280 TraceCheckUtils]: 9: Hoare triple {238#(<= |sum_#in~n| (+ sum_~n 1))} ~m := #in~m; {238#(<= |sum_#in~n| (+ sum_~n 1))} is VALID [2020-07-10 18:44:22,926 INFO L280 TraceCheckUtils]: 10: Hoare triple {238#(<= |sum_#in~n| (+ sum_~n 1))} assume ~n <= 0; {239#(<= |sum_#in~n| 1)} is VALID [2020-07-10 18:44:22,927 INFO L280 TraceCheckUtils]: 11: Hoare triple {239#(<= |sum_#in~n| 1)} #res := ~m + ~n; {239#(<= |sum_#in~n| 1)} is VALID [2020-07-10 18:44:22,930 INFO L280 TraceCheckUtils]: 12: Hoare triple {239#(<= |sum_#in~n| 1)} [43] sumFINAL-->sumEXIT_primed: Formula: (let ((.cse5 (* 2 |v_oct_sum_#res_out_1|)) (.cse25 (* 2 |v_oct_sum_#res_in_1|))) (let ((.cse6 (<= 0 (+ .cse25 4294967296))) (.cse11 (<= .cse5 4294967294)) (.cse7 (<= 0 (+ .cse5 4294967296))) (.cse8 (<= 0 (+ .cse25 4294967296))) (.cse12 (<= .cse25 4294967294)) (.cse10 (<= .cse5 4294967294)) (.cse9 (<= 0 (+ .cse5 4294967296))) (.cse14 (<= .cse25 4294967294)) (.cse0 (<= |v_oct_sum_#res_in_1| |v_oct_sum_#res_out_1|)) (.cse23 (<= .cse25 4294967294)) (.cse20 (<= .cse5 4294967294)) (.cse16 (<= 0 (+ .cse5 4294967296))) (.cse21 (<= 0 (+ .cse25 4294967296))) (.cse19 (<= .cse25 4294967294)) (.cse17 (<= .cse5 4294967294)) (.cse22 (<= 0 (+ .cse25 4294967296))) (.cse24 (<= |v_oct_sum_#res_out_1| |v_oct_sum_#res_in_1|)) (.cse18 (<= 0 (+ .cse5 4294967296)))) (or (let ((.cse13 (not .cse0)) (.cse15 (not .cse24))) (and .cse0 (let ((.cse1 (<= 0 (+ .cse5 4294967296))) (.cse3 (<= .cse5 4294967294)) (.cse2 (<= 0 (+ .cse5 4294967296)))) (or (and .cse1 (not .cse2) .cse3) (and (let ((.cse4 (<= .cse5 4294967294))) (or (and .cse1 .cse3 (not .cse4)) .cse4)) .cse2))) (or (not .cse6) (not .cse7) (not .cse8) (not .cse9) (not .cse10) (not .cse11) (not .cse12) .cse13 (not .cse14) .cse15) (or (not .cse16) (not .cse17) (not .cse18) (not .cse19) (not .cse20) (not .cse21) (not .cse22) .cse13 (not .cse23) .cse15) .cse24)) (and .cse0 .cse6 .cse11 .cse7 .cse8 .cse12 .cse10 .cse9 .cse24 .cse14) (and .cse0 .cse23 .cse20 .cse16 .cse21 .cse19 .cse17 .cse22 .cse24 .cse18)))) 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] {239#(<= |sum_#in~n| 1)} is VALID [2020-07-10 18:44:22,931 INFO L280 TraceCheckUtils]: 13: Hoare triple {239#(<= |sum_#in~n| 1)} [42] sumEXIT_primed-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#(<= |sum_#in~n| 1)} is VALID [2020-07-10 18:44:22,933 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {239#(<= |sum_#in~n| 1)} {229#(<= 20 main_~a~0)} #39#return; {226#false} is VALID [2020-07-10 18:44:22,933 INFO L280 TraceCheckUtils]: 15: Hoare triple {226#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {226#false} is VALID [2020-07-10 18:44:22,934 INFO L280 TraceCheckUtils]: 16: Hoare triple {226#false} ~result~0 := #t~ret1; {226#false} is VALID [2020-07-10 18:44:22,934 INFO L280 TraceCheckUtils]: 17: Hoare triple {226#false} havoc #t~ret1; {226#false} is VALID [2020-07-10 18:44:22,934 INFO L280 TraceCheckUtils]: 18: Hoare triple {226#false} assume ~result~0 == ~a~0 + ~b~0; {226#false} is VALID [2020-07-10 18:44:22,935 INFO L280 TraceCheckUtils]: 19: Hoare triple {226#false} assume !false; {226#false} is VALID [2020-07-10 18:44:22,936 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-10 18:44:23,215 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:44:23,215 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [618526323] [2020-07-10 18:44:23,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:44:23,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-10 18:44:23,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212513127] [2020-07-10 18:44:23,217 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-07-10 18:44:23,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:44:23,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-10 18:44:23,250 WARN L140 InductivityCheck]: Transition 239#(<= |sum_#in~n| 1) ( _ , 242#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (< 0 sum_~n)) , #37#return; , 239#(<= |sum_#in~n| 1) ) not inductive [2020-07-10 18:44:23,251 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 18:44:23,252 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-10 18:44:23,259 INFO L168 Benchmark]: Toolchain (without parser) took 2523.35 ms. Allocated memory was 141.0 MB in the beginning and 231.7 MB in the end (delta: 90.7 MB). Free memory was 105.1 MB in the beginning and 106.7 MB in the end (delta: -1.6 MB). Peak memory consumption was 89.1 MB. Max. memory is 7.1 GB. [2020-07-10 18:44:23,260 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory was 124.5 MB in the beginning and 124.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 18:44:23,262 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.68 ms. Allocated memory is still 141.0 MB. Free memory was 104.9 MB in the beginning and 95.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-10 18:44:23,263 INFO L168 Benchmark]: Boogie Preprocessor took 111.47 ms. Allocated memory was 141.0 MB in the beginning and 203.4 MB in the end (delta: 62.4 MB). Free memory was 95.4 MB in the beginning and 182.8 MB in the end (delta: -87.4 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2020-07-10 18:44:23,264 INFO L168 Benchmark]: RCFGBuilder took 320.21 ms. Allocated memory is still 203.4 MB. Free memory was 182.2 MB in the beginning and 166.3 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2020-07-10 18:44:23,265 INFO L168 Benchmark]: TraceAbstraction took 1829.13 ms. Allocated memory was 203.4 MB in the beginning and 231.7 MB in the end (delta: 28.3 MB). Free memory was 165.7 MB in the beginning and 106.7 MB in the end (delta: 59.0 MB). Peak memory consumption was 87.3 MB. Max. memory is 7.1 GB. [2020-07-10 18:44:23,269 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.21 ms. Allocated memory is still 141.0 MB. Free memory was 124.5 MB in the beginning and 124.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 256.68 ms. Allocated memory is still 141.0 MB. Free memory was 104.9 MB in the beginning and 95.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 111.47 ms. Allocated memory was 141.0 MB in the beginning and 203.4 MB in the end (delta: 62.4 MB). Free memory was 95.4 MB in the beginning and 182.8 MB in the end (delta: -87.4 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 320.21 ms. Allocated memory is still 203.4 MB. Free memory was 182.2 MB in the beginning and 166.3 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1829.13 ms. Allocated memory was 203.4 MB in the beginning and 231.7 MB in the end (delta: 28.3 MB). Free memory was 165.7 MB in the beginning and 106.7 MB in the end (delta: 59.0 MB). Peak memory consumption was 87.3 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...