/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_10x0-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 18:44:09,023 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 18:44:09,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 18:44:09,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 18:44:09,043 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 18:44:09,044 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 18:44:09,045 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 18:44:09,047 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 18:44:09,049 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 18:44:09,049 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 18:44:09,050 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 18:44:09,051 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 18:44:09,052 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 18:44:09,053 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 18:44:09,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 18:44:09,055 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 18:44:09,056 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 18:44:09,057 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 18:44:09,058 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 18:44:09,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 18:44:09,065 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 18:44:09,066 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 18:44:09,067 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 18:44:09,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 18:44:09,070 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 18:44:09,071 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 18:44:09,071 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 18:44:09,072 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 18:44:09,072 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 18:44:09,073 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 18:44:09,073 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 18:44:09,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 18:44:09,075 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 18:44:09,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 18:44:09,077 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 18:44:09,077 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 18:44:09,077 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 18:44:09,078 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 18:44:09,078 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 18:44:09,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 18:44:09,079 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 18:44:09,080 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:09,090 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 18:44:09,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 18:44:09,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 18:44:09,091 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 18:44:09,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 18:44:09,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 18:44:09,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 18:44:09,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 18:44:09,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 18:44:09,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 18:44:09,093 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 18:44:09,093 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 18:44:09,093 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 18:44:09,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 18:44:09,094 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 18:44:09,094 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 18:44:09,094 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 18:44:09,094 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 18:44:09,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 18:44:09,095 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 18:44:09,095 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 18:44:09,095 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 18:44:09,095 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 18:44:09,365 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 18:44:09,379 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 18:44:09,383 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 18:44:09,385 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 18:44:09,386 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 18:44:09,387 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_10x0-2.c [2020-07-10 18:44:09,467 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f468ada4c/8d0ae572fa0e427c94d427a81355df3e/FLAG55097dc17 [2020-07-10 18:44:09,960 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 18:44:09,961 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_10x0-2.c [2020-07-10 18:44:09,965 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f468ada4c/8d0ae572fa0e427c94d427a81355df3e/FLAG55097dc17 [2020-07-10 18:44:10,324 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f468ada4c/8d0ae572fa0e427c94d427a81355df3e [2020-07-10 18:44:10,335 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 18:44:10,338 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 18:44:10,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 18:44:10,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 18:44:10,342 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 18:44:10,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:44:10" (1/1) ... [2020-07-10 18:44:10,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63745e6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:44:10, skipping insertion in model container [2020-07-10 18:44:10,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:44:10" (1/1) ... [2020-07-10 18:44:10,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 18:44:10,371 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 18:44:10,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:44:10,550 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 18:44:10,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:44:10,582 INFO L208 MainTranslator]: Completed translation [2020-07-10 18:44:10,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:44:10 WrapperNode [2020-07-10 18:44:10,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 18:44:10,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 18:44:10,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 18:44:10,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 18:44:10,599 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:10" (1/1) ... [2020-07-10 18:44:10,599 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:10" (1/1) ... [2020-07-10 18:44:10,604 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:10" (1/1) ... [2020-07-10 18:44:10,605 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:10" (1/1) ... [2020-07-10 18:44:10,609 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:10" (1/1) ... [2020-07-10 18:44:10,612 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:10" (1/1) ... [2020-07-10 18:44:10,613 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:10" (1/1) ... [2020-07-10 18:44:10,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 18:44:10,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 18:44:10,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 18:44:10,615 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 18:44:10,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:44:10" (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:10,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 18:44:10,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 18:44:10,770 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-07-10 18:44:10,770 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 18:44:10,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 18:44:10,770 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-07-10 18:44:10,770 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 18:44:10,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 18:44:10,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 18:44:11,015 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 18:44:11,016 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 18:44:11,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:44:11 BoogieIcfgContainer [2020-07-10 18:44:11,020 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 18:44:11,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 18:44:11,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 18:44:11,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 18:44:11,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 06:44:10" (1/3) ... [2020-07-10 18:44:11,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392c9070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:44:11, skipping insertion in model container [2020-07-10 18:44:11,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:44:10" (2/3) ... [2020-07-10 18:44:11,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392c9070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:44:11, skipping insertion in model container [2020-07-10 18:44:11,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:44:11" (3/3) ... [2020-07-10 18:44:11,030 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_10x0-2.c [2020-07-10 18:44:11,045 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 18:44:11,057 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 18:44:11,077 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 18:44:11,105 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 18:44:11,105 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 18:44:11,106 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 18:44:11,106 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 18:44:11,106 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 18:44:11,106 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 18:44:11,106 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 18:44:11,106 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 18:44:11,122 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-07-10 18:44:11,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 18:44:11,142 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:44:11,143 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:11,144 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:44:11,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:44:11,151 INFO L82 PathProgramCache]: Analyzing trace with hash 989240825, now seen corresponding path program 1 times [2020-07-10 18:44:11,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:44:11,161 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [21890213] [2020-07-10 18:44:11,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:44:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:44:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:44:11,370 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-10 18:44:11,370 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {30#true} {30#true} #33#return; {30#true} is VALID [2020-07-10 18:44:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:44:11,444 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#true} ~n := #in~n; {41#(= sum_~n |sum_#in~n|)} is VALID [2020-07-10 18:44:11,445 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:11,446 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:11,447 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:11,448 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:11,451 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {42#(<= |sum_#in~n| 0)} {34#(<= 10 main_~a~0)} #39#return; {31#false} is VALID [2020-07-10 18:44:11,453 INFO L263 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2020-07-10 18:44:11,453 INFO L280 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-10 18:44:11,454 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #33#return; {30#true} is VALID [2020-07-10 18:44:11,454 INFO L263 TraceCheckUtils]: 3: Hoare triple {30#true} call #t~ret2 := main(); {30#true} is VALID [2020-07-10 18:44:11,456 INFO L280 TraceCheckUtils]: 4: Hoare triple {30#true} ~a~0 := 10; {34#(<= 10 main_~a~0)} is VALID [2020-07-10 18:44:11,458 INFO L280 TraceCheckUtils]: 5: Hoare triple {34#(<= 10 main_~a~0)} ~b~0 := 0; {34#(<= 10 main_~a~0)} is VALID [2020-07-10 18:44:11,459 INFO L263 TraceCheckUtils]: 6: Hoare triple {34#(<= 10 main_~a~0)} call #t~ret1 := sum(~a~0, ~b~0); {30#true} is VALID [2020-07-10 18:44:11,460 INFO L280 TraceCheckUtils]: 7: Hoare triple {30#true} ~n := #in~n; {41#(= sum_~n |sum_#in~n|)} is VALID [2020-07-10 18:44:11,462 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:11,464 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:11,472 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:11,473 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:11,476 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {42#(<= |sum_#in~n| 0)} {34#(<= 10 main_~a~0)} #39#return; {31#false} is VALID [2020-07-10 18:44:11,476 INFO L280 TraceCheckUtils]: 13: Hoare triple {31#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {31#false} is VALID [2020-07-10 18:44:11,477 INFO L280 TraceCheckUtils]: 14: Hoare triple {31#false} ~result~0 := #t~ret1; {31#false} is VALID [2020-07-10 18:44:11,477 INFO L280 TraceCheckUtils]: 15: Hoare triple {31#false} havoc #t~ret1; {31#false} is VALID [2020-07-10 18:44:11,477 INFO L280 TraceCheckUtils]: 16: Hoare triple {31#false} assume ~result~0 == ~a~0 + ~b~0; {31#false} is VALID [2020-07-10 18:44:11,478 INFO L280 TraceCheckUtils]: 17: Hoare triple {31#false} assume !false; {31#false} is VALID [2020-07-10 18:44:11,480 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:11,481 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:44:11,483 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [21890213] [2020-07-10 18:44:11,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:44:11,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 18:44:11,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75745457] [2020-07-10 18:44:11,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-10 18:44:11,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:44:11,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 18:44:11,558 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:11,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 18:44:11,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:44:11,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 18:44:11,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 18:44:11,573 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2020-07-10 18:44:11,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:44:11,853 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2020-07-10 18:44:11,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 18:44:11,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-10 18:44:11,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:44:11,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 18:44:11,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-10 18:44:11,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 18:44:11,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-10 18:44:11,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2020-07-10 18:44:11,937 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:11,950 INFO L225 Difference]: With dead ends: 39 [2020-07-10 18:44:11,950 INFO L226 Difference]: Without dead ends: 25 [2020-07-10 18:44:11,954 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:11,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-10 18:44:12,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-10 18:44:12,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:44:12,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-10 18:44:12,036 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-10 18:44:12,036 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-10 18:44:12,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:44:12,042 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-10 18:44:12,042 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-10 18:44:12,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:44:12,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:44:12,044 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-10 18:44:12,044 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-10 18:44:12,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:44:12,049 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-10 18:44:12,049 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-10 18:44:12,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:44:12,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:44:12,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:44:12,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:44:12,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 18:44:12,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-07-10 18:44:12,056 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2020-07-10 18:44:12,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:44:12,057 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-07-10 18:44:12,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 18:44:12,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 26 transitions. [2020-07-10 18:44:12,106 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:12,107 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-10 18:44:12,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 18:44:12,108 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:44:12,108 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:12,109 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 18:44:12,109 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:44:12,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:44:12,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1852726759, now seen corresponding path program 1 times [2020-07-10 18:44:12,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:44:12,110 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1600952045] [2020-07-10 18:44:12,110 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:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:44:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:44:12,387 INFO L280 TraceCheckUtils]: 0: Hoare triple {225#true} assume true; {225#true} is VALID [2020-07-10 18:44:12,387 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {225#true} {225#true} #33#return; {225#true} is VALID [2020-07-10 18:44:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:44:12,456 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:12,458 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:12,459 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:12,460 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:12,460 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:12,462 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 ((.cse24 (<= .cse25 4294967294)) (.cse20 (<= .cse5 4294967294)) (.cse18 (<= .cse5 4294967294)) (.cse19 (<= 0 (+ .cse5 4294967296))) (.cse17 (<= 0 (+ .cse5 4294967296))) (.cse21 (<= 0 (+ .cse25 4294967296))) (.cse23 (<= .cse25 4294967294)) (.cse22 (<= 0 (+ .cse25 4294967296))) (.cse0 (<= |v_oct_sum_#res_in_1| |v_oct_sum_#res_out_1|)) (.cse10 (<= .cse25 4294967294)) (.cse12 (<= 0 (+ .cse25 4294967296))) (.cse11 (<= .cse5 4294967294)) (.cse8 (<= 0 (+ .cse5 4294967296))) (.cse7 (<= 0 (+ .cse5 4294967296))) (.cse16 (<= |v_oct_sum_#res_out_1| |v_oct_sum_#res_in_1|)) (.cse15 (<= .cse25 4294967294)) (.cse9 (<= 0 (+ .cse25 4294967296))) (.cse6 (<= .cse5 4294967294))) (or (let ((.cse13 (not .cse0)) (.cse14 (not .cse16))) (and .cse0 (let ((.cse1 (<= 0 (+ .cse5 4294967296))) (.cse2 (<= 0 (+ .cse5 4294967296))) (.cse3 (<= .cse5 4294967294))) (or (and (not .cse1) .cse2 .cse3) (and .cse1 (let ((.cse4 (<= .cse5 4294967294))) (or (and (not .cse4) .cse2 .cse3) .cse4))))) (or (not .cse6) (not .cse7) (not .cse8) (not .cse9) (not .cse10) (not .cse11) (not .cse12) .cse13 .cse14 (not .cse15)) .cse16 (or (not .cse17) (not .cse18) (not .cse19) (not .cse20) (not .cse21) (not .cse22) (not .cse23) .cse13 (not .cse24) .cse14))) (and .cse0 .cse24 .cse20 .cse18 .cse19 .cse17 .cse21 .cse23 .cse16 .cse22) (and .cse0 .cse10 .cse12 .cse11 .cse8 .cse7 .cse16 .cse15 .cse9 .cse6)))) 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:12,462 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:12,464 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {239#(<= |sum_#in~n| 1)} {229#(<= 10 main_~a~0)} #39#return; {226#false} is VALID [2020-07-10 18:44:12,465 INFO L263 TraceCheckUtils]: 0: Hoare triple {225#true} call ULTIMATE.init(); {225#true} is VALID [2020-07-10 18:44:12,465 INFO L280 TraceCheckUtils]: 1: Hoare triple {225#true} assume true; {225#true} is VALID [2020-07-10 18:44:12,465 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {225#true} {225#true} #33#return; {225#true} is VALID [2020-07-10 18:44:12,466 INFO L263 TraceCheckUtils]: 3: Hoare triple {225#true} call #t~ret2 := main(); {225#true} is VALID [2020-07-10 18:44:12,467 INFO L280 TraceCheckUtils]: 4: Hoare triple {225#true} ~a~0 := 10; {229#(<= 10 main_~a~0)} is VALID [2020-07-10 18:44:12,467 INFO L280 TraceCheckUtils]: 5: Hoare triple {229#(<= 10 main_~a~0)} ~b~0 := 0; {229#(<= 10 main_~a~0)} is VALID [2020-07-10 18:44:12,468 INFO L263 TraceCheckUtils]: 6: Hoare triple {229#(<= 10 main_~a~0)} call #t~ret1 := sum(~a~0, ~b~0); {225#true} is VALID [2020-07-10 18:44:12,468 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:12,469 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:12,470 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:12,471 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:12,471 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:12,473 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 ((.cse24 (<= .cse25 4294967294)) (.cse20 (<= .cse5 4294967294)) (.cse18 (<= .cse5 4294967294)) (.cse19 (<= 0 (+ .cse5 4294967296))) (.cse17 (<= 0 (+ .cse5 4294967296))) (.cse21 (<= 0 (+ .cse25 4294967296))) (.cse23 (<= .cse25 4294967294)) (.cse22 (<= 0 (+ .cse25 4294967296))) (.cse0 (<= |v_oct_sum_#res_in_1| |v_oct_sum_#res_out_1|)) (.cse10 (<= .cse25 4294967294)) (.cse12 (<= 0 (+ .cse25 4294967296))) (.cse11 (<= .cse5 4294967294)) (.cse8 (<= 0 (+ .cse5 4294967296))) (.cse7 (<= 0 (+ .cse5 4294967296))) (.cse16 (<= |v_oct_sum_#res_out_1| |v_oct_sum_#res_in_1|)) (.cse15 (<= .cse25 4294967294)) (.cse9 (<= 0 (+ .cse25 4294967296))) (.cse6 (<= .cse5 4294967294))) (or (let ((.cse13 (not .cse0)) (.cse14 (not .cse16))) (and .cse0 (let ((.cse1 (<= 0 (+ .cse5 4294967296))) (.cse2 (<= 0 (+ .cse5 4294967296))) (.cse3 (<= .cse5 4294967294))) (or (and (not .cse1) .cse2 .cse3) (and .cse1 (let ((.cse4 (<= .cse5 4294967294))) (or (and (not .cse4) .cse2 .cse3) .cse4))))) (or (not .cse6) (not .cse7) (not .cse8) (not .cse9) (not .cse10) (not .cse11) (not .cse12) .cse13 .cse14 (not .cse15)) .cse16 (or (not .cse17) (not .cse18) (not .cse19) (not .cse20) (not .cse21) (not .cse22) (not .cse23) .cse13 (not .cse24) .cse14))) (and .cse0 .cse24 .cse20 .cse18 .cse19 .cse17 .cse21 .cse23 .cse16 .cse22) (and .cse0 .cse10 .cse12 .cse11 .cse8 .cse7 .cse16 .cse15 .cse9 .cse6)))) 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:12,474 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:12,475 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {239#(<= |sum_#in~n| 1)} {229#(<= 10 main_~a~0)} #39#return; {226#false} is VALID [2020-07-10 18:44:12,476 INFO L280 TraceCheckUtils]: 15: Hoare triple {226#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {226#false} is VALID [2020-07-10 18:44:12,476 INFO L280 TraceCheckUtils]: 16: Hoare triple {226#false} ~result~0 := #t~ret1; {226#false} is VALID [2020-07-10 18:44:12,476 INFO L280 TraceCheckUtils]: 17: Hoare triple {226#false} havoc #t~ret1; {226#false} is VALID [2020-07-10 18:44:12,476 INFO L280 TraceCheckUtils]: 18: Hoare triple {226#false} assume ~result~0 == ~a~0 + ~b~0; {226#false} is VALID [2020-07-10 18:44:12,477 INFO L280 TraceCheckUtils]: 19: Hoare triple {226#false} assume !false; {226#false} is VALID [2020-07-10 18:44:12,478 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:12,774 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:44:12,774 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1600952045] [2020-07-10 18:44:12,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:44:12,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-10 18:44:12,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592396390] [2020-07-10 18:44:12,776 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-07-10 18:44:12,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:44:12,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-10 18:44:12,798 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:12,799 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 18:44:12,799 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:12,807 INFO L168 Benchmark]: Toolchain (without parser) took 2467.77 ms. Allocated memory was 145.2 MB in the beginning and 235.4 MB in the end (delta: 90.2 MB). Free memory was 102.6 MB in the beginning and 116.8 MB in the end (delta: -14.2 MB). Peak memory consumption was 76.0 MB. Max. memory is 7.1 GB. [2020-07-10 18:44:12,809 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 145.2 MB. Free memory was 120.6 MB in the beginning and 120.4 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:12,811 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.26 ms. Allocated memory is still 145.2 MB. Free memory was 102.3 MB in the beginning and 92.8 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:12,812 INFO L168 Benchmark]: Boogie Preprocessor took 31.21 ms. Allocated memory is still 145.2 MB. Free memory was 92.8 MB in the beginning and 91.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-10 18:44:12,815 INFO L168 Benchmark]: RCFGBuilder took 405.07 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 91.4 MB in the beginning and 166.3 MB in the end (delta: -74.9 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-10 18:44:12,817 INFO L168 Benchmark]: TraceAbstraction took 1781.23 ms. Allocated memory was 202.4 MB in the beginning and 235.4 MB in the end (delta: 33.0 MB). Free memory was 165.7 MB in the beginning and 116.8 MB in the end (delta: 48.9 MB). Peak memory consumption was 81.9 MB. Max. memory is 7.1 GB. [2020-07-10 18:44:12,829 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.29 ms. Allocated memory is still 145.2 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 244.26 ms. Allocated memory is still 145.2 MB. Free memory was 102.3 MB in the beginning and 92.8 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.21 ms. Allocated memory is still 145.2 MB. Free memory was 92.8 MB in the beginning and 91.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 405.07 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 91.4 MB in the beginning and 166.3 MB in the end (delta: -74.9 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1781.23 ms. Allocated memory was 202.4 MB in the beginning and 235.4 MB in the end (delta: 33.0 MB). Free memory was 165.7 MB in the beginning and 116.8 MB in the end (delta: 48.9 MB). Peak memory consumption was 81.9 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...