/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_2x3-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 18:44:31,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 18:44:31,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 18:44:31,956 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 18:44:31,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 18:44:31,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 18:44:31,961 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 18:44:31,972 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 18:44:31,975 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 18:44:31,978 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 18:44:31,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 18:44:31,985 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 18:44:31,985 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 18:44:31,987 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 18:44:31,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 18:44:31,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 18:44:31,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 18:44:31,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 18:44:31,995 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 18:44:32,001 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 18:44:32,007 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 18:44:32,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 18:44:32,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 18:44:32,014 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 18:44:32,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 18:44:32,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 18:44:32,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 18:44:32,020 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 18:44:32,022 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 18:44:32,023 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 18:44:32,024 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 18:44:32,024 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 18:44:32,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 18:44:32,026 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 18:44:32,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 18:44:32,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 18:44:32,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 18:44:32,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 18:44:32,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 18:44:32,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 18:44:32,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 18:44:32,032 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:32,057 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 18:44:32,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 18:44:32,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 18:44:32,062 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 18:44:32,062 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 18:44:32,062 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 18:44:32,062 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 18:44:32,063 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 18:44:32,063 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 18:44:32,063 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 18:44:32,063 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 18:44:32,063 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 18:44:32,064 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 18:44:32,064 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 18:44:32,064 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 18:44:32,068 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 18:44:32,068 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 18:44:32,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 18:44:32,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 18:44:32,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 18:44:32,070 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 18:44:32,070 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 18:44:32,070 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 18:44:32,373 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 18:44:32,388 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 18:44:32,394 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 18:44:32,396 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 18:44:32,396 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 18:44:32,397 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_2x3-1.c [2020-07-10 18:44:32,466 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ee55959/0999aecf397f4f6087e12247b5df0993/FLAG6d7607e63 [2020-07-10 18:44:32,945 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 18:44:32,946 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_2x3-1.c [2020-07-10 18:44:32,953 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ee55959/0999aecf397f4f6087e12247b5df0993/FLAG6d7607e63 [2020-07-10 18:44:33,287 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ee55959/0999aecf397f4f6087e12247b5df0993 [2020-07-10 18:44:33,297 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 18:44:33,299 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 18:44:33,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 18:44:33,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 18:44:33,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 18:44:33,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:44:33" (1/1) ... [2020-07-10 18:44:33,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@582fec3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:44:33, skipping insertion in model container [2020-07-10 18:44:33,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:44:33" (1/1) ... [2020-07-10 18:44:33,319 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 18:44:33,336 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 18:44:33,514 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:44:33,522 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 18:44:33,539 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:44:33,554 INFO L208 MainTranslator]: Completed translation [2020-07-10 18:44:33,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:44:33 WrapperNode [2020-07-10 18:44:33,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 18:44:33,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 18:44:33,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 18:44:33,555 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 18:44:33,566 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:33" (1/1) ... [2020-07-10 18:44:33,567 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:33" (1/1) ... [2020-07-10 18:44:33,571 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:33" (1/1) ... [2020-07-10 18:44:33,571 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:33" (1/1) ... [2020-07-10 18:44:33,576 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:33" (1/1) ... [2020-07-10 18:44:33,578 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:33" (1/1) ... [2020-07-10 18:44:33,579 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:33" (1/1) ... [2020-07-10 18:44:33,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 18:44:33,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 18:44:33,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 18:44:33,582 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 18:44:33,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:44:33" (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:33,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 18:44:33,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 18:44:33,739 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-07-10 18:44:33,739 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 18:44:33,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 18:44:33,739 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-07-10 18:44:33,739 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 18:44:33,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 18:44:33,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 18:44:33,997 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 18:44:33,997 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 18:44:34,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:44:34 BoogieIcfgContainer [2020-07-10 18:44:34,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 18:44:34,005 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 18:44:34,005 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 18:44:34,009 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 18:44:34,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 06:44:33" (1/3) ... [2020-07-10 18:44:34,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385fcf98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:44:34, skipping insertion in model container [2020-07-10 18:44:34,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:44:33" (2/3) ... [2020-07-10 18:44:34,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385fcf98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:44:34, skipping insertion in model container [2020-07-10 18:44:34,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:44:34" (3/3) ... [2020-07-10 18:44:34,013 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_2x3-1.c [2020-07-10 18:44:34,027 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 18:44:34,036 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 18:44:34,054 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 18:44:34,079 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 18:44:34,080 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 18:44:34,080 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 18:44:34,080 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 18:44:34,080 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 18:44:34,080 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 18:44:34,080 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 18:44:34,081 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 18:44:34,099 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-07-10 18:44:34,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 18:44:34,112 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:44:34,113 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:34,114 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:44:34,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:44:34,121 INFO L82 PathProgramCache]: Analyzing trace with hash 989240825, now seen corresponding path program 1 times [2020-07-10 18:44:34,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:44:34,132 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [55228319] [2020-07-10 18:44:34,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:44:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:44:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:44:34,341 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-10 18:44:34,341 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {30#true} {30#true} #33#return; {30#true} is VALID [2020-07-10 18:44:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:44:34,412 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#true} ~n := #in~n; {41#(= sum_~n |sum_#in~n|)} is VALID [2020-07-10 18:44:34,413 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:34,414 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:34,415 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:34,416 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:34,419 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {42#(<= |sum_#in~n| 0)} {34#(<= 2 main_~a~0)} #39#return; {31#false} is VALID [2020-07-10 18:44:34,420 INFO L263 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2020-07-10 18:44:34,420 INFO L280 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-10 18:44:34,421 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #33#return; {30#true} is VALID [2020-07-10 18:44:34,421 INFO L263 TraceCheckUtils]: 3: Hoare triple {30#true} call #t~ret2 := main(); {30#true} is VALID [2020-07-10 18:44:34,428 INFO L280 TraceCheckUtils]: 4: Hoare triple {30#true} ~a~0 := 2; {34#(<= 2 main_~a~0)} is VALID [2020-07-10 18:44:34,429 INFO L280 TraceCheckUtils]: 5: Hoare triple {34#(<= 2 main_~a~0)} ~b~0 := 3; {34#(<= 2 main_~a~0)} is VALID [2020-07-10 18:44:34,430 INFO L263 TraceCheckUtils]: 6: Hoare triple {34#(<= 2 main_~a~0)} call #t~ret1 := sum(~a~0, ~b~0); {30#true} is VALID [2020-07-10 18:44:34,431 INFO L280 TraceCheckUtils]: 7: Hoare triple {30#true} ~n := #in~n; {41#(= sum_~n |sum_#in~n|)} is VALID [2020-07-10 18:44:34,432 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:34,434 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:34,442 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:34,443 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:34,446 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {42#(<= |sum_#in~n| 0)} {34#(<= 2 main_~a~0)} #39#return; {31#false} is VALID [2020-07-10 18:44:34,447 INFO L280 TraceCheckUtils]: 13: Hoare triple {31#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {31#false} is VALID [2020-07-10 18:44:34,447 INFO L280 TraceCheckUtils]: 14: Hoare triple {31#false} ~result~0 := #t~ret1; {31#false} is VALID [2020-07-10 18:44:34,448 INFO L280 TraceCheckUtils]: 15: Hoare triple {31#false} havoc #t~ret1; {31#false} is VALID [2020-07-10 18:44:34,448 INFO L280 TraceCheckUtils]: 16: Hoare triple {31#false} assume ~result~0 == ~a~0 + ~b~0; {31#false} is VALID [2020-07-10 18:44:34,449 INFO L280 TraceCheckUtils]: 17: Hoare triple {31#false} assume !false; {31#false} is VALID [2020-07-10 18:44:34,451 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:34,452 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:44:34,455 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [55228319] [2020-07-10 18:44:34,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:44:34,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 18:44:34,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555604882] [2020-07-10 18:44:34,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-10 18:44:34,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:44:34,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 18:44:34,514 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:34,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 18:44:34,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:44:34,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 18:44:34,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 18:44:34,528 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2020-07-10 18:44:34,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:44:34,915 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2020-07-10 18:44:34,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 18:44:34,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-10 18:44:34,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:44:34,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 18:44:34,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-10 18:44:34,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 18:44:34,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-10 18:44:34,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2020-07-10 18:44:35,009 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:35,023 INFO L225 Difference]: With dead ends: 39 [2020-07-10 18:44:35,023 INFO L226 Difference]: Without dead ends: 25 [2020-07-10 18:44:35,028 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:35,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-10 18:44:35,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-10 18:44:35,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:44:35,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-10 18:44:35,109 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-10 18:44:35,109 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-10 18:44:35,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:44:35,116 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-10 18:44:35,116 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-10 18:44:35,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:44:35,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:44:35,118 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-10 18:44:35,118 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-10 18:44:35,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:44:35,123 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-10 18:44:35,123 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-10 18:44:35,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:44:35,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:44:35,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:44:35,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:44:35,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 18:44:35,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-07-10 18:44:35,143 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2020-07-10 18:44:35,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:44:35,144 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-07-10 18:44:35,144 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 18:44:35,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 26 transitions. [2020-07-10 18:44:35,191 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:35,192 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-10 18:44:35,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 18:44:35,193 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:44:35,193 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:35,194 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 18:44:35,194 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:44:35,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:44:35,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1852726759, now seen corresponding path program 1 times [2020-07-10 18:44:35,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:44:35,195 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1536519770] [2020-07-10 18:44:35,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 11 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 11 to 19 Garbage collection #2: 19 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 19 to 37 Garbage collection #3: 37 nodes / 0 free / 0.0s / 0.001s 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:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:44:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:44:35,501 INFO L280 TraceCheckUtils]: 0: Hoare triple {225#true} assume true; {225#true} is VALID [2020-07-10 18:44:35,502 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {225#true} {225#true} #33#return; {225#true} is VALID [2020-07-10 18:44:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:44:35,564 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:35,565 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:35,566 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:35,567 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:35,568 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:35,570 INFO L280 TraceCheckUtils]: 5: Hoare triple {239#(<= |sum_#in~n| 1)} [43] sumFINAL-->sumEXIT_primed: Formula: (let ((.cse24 (* 2 |v_oct_sum_#res_out_1|)) (.cse25 (* 2 |v_oct_sum_#res_in_1|))) (let ((.cse4 (<= .cse25 4294967294)) (.cse5 (<= .cse24 4294967294)) (.cse8 (<= 0 (+ .cse25 4294967296))) (.cse6 (<= 0 (+ .cse24 4294967296))) (.cse3 (<= 0 (+ .cse24 4294967296))) (.cse7 (<= .cse24 4294967294)) (.cse1 (<= 0 (+ .cse25 4294967296))) (.cse2 (<= .cse25 4294967294)) (.cse0 (<= |v_oct_sum_#res_in_1| |v_oct_sum_#res_out_1|)) (.cse12 (<= 0 (+ .cse25 4294967296))) (.cse14 (<= .cse25 4294967294)) (.cse11 (<= 0 (+ .cse24 4294967296))) (.cse13 (<= .cse25 4294967294)) (.cse16 (<= 0 (+ .cse25 4294967296))) (.cse15 (<= .cse24 4294967294)) (.cse9 (<= |v_oct_sum_#res_out_1| |v_oct_sum_#res_in_1|)) (.cse19 (<= .cse24 4294967294)) (.cse10 (<= 0 (+ .cse24 4294967296)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse17 (not .cse0)) (.cse18 (not .cse9))) (and .cse0 (or (not .cse10) (not .cse11) (not .cse12) (not .cse13) (not .cse14) (not .cse15) (not .cse16) .cse17 .cse18 (not .cse19)) (let ((.cse20 (<= 0 (+ .cse24 4294967296))) (.cse22 (<= 0 (+ .cse24 4294967296))) (.cse23 (<= .cse24 4294967294))) (or (and .cse20 (let ((.cse21 (<= .cse24 4294967294))) (or (and (not .cse21) .cse22 .cse23) .cse21))) (and (not .cse20) .cse22 .cse23))) (or (not .cse4) (not .cse5) (not .cse8) (not .cse6) (not .cse3) (not .cse7) (not .cse1) .cse17 (not .cse2) .cse18) .cse9)) (and .cse0 .cse12 .cse14 .cse11 .cse13 .cse16 .cse15 .cse9 .cse19 .cse10)))) 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:35,571 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:35,572 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {239#(<= |sum_#in~n| 1)} {229#(<= 2 main_~a~0)} #39#return; {226#false} is VALID [2020-07-10 18:44:35,573 INFO L263 TraceCheckUtils]: 0: Hoare triple {225#true} call ULTIMATE.init(); {225#true} is VALID [2020-07-10 18:44:35,574 INFO L280 TraceCheckUtils]: 1: Hoare triple {225#true} assume true; {225#true} is VALID [2020-07-10 18:44:35,574 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {225#true} {225#true} #33#return; {225#true} is VALID [2020-07-10 18:44:35,574 INFO L263 TraceCheckUtils]: 3: Hoare triple {225#true} call #t~ret2 := main(); {225#true} is VALID [2020-07-10 18:44:35,575 INFO L280 TraceCheckUtils]: 4: Hoare triple {225#true} ~a~0 := 2; {229#(<= 2 main_~a~0)} is VALID [2020-07-10 18:44:35,576 INFO L280 TraceCheckUtils]: 5: Hoare triple {229#(<= 2 main_~a~0)} ~b~0 := 3; {229#(<= 2 main_~a~0)} is VALID [2020-07-10 18:44:35,576 INFO L263 TraceCheckUtils]: 6: Hoare triple {229#(<= 2 main_~a~0)} call #t~ret1 := sum(~a~0, ~b~0); {225#true} is VALID [2020-07-10 18:44:35,577 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:35,578 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:35,579 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:35,580 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:35,580 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:35,582 INFO L280 TraceCheckUtils]: 12: Hoare triple {239#(<= |sum_#in~n| 1)} [43] sumFINAL-->sumEXIT_primed: Formula: (let ((.cse24 (* 2 |v_oct_sum_#res_out_1|)) (.cse25 (* 2 |v_oct_sum_#res_in_1|))) (let ((.cse4 (<= .cse25 4294967294)) (.cse5 (<= .cse24 4294967294)) (.cse8 (<= 0 (+ .cse25 4294967296))) (.cse6 (<= 0 (+ .cse24 4294967296))) (.cse3 (<= 0 (+ .cse24 4294967296))) (.cse7 (<= .cse24 4294967294)) (.cse1 (<= 0 (+ .cse25 4294967296))) (.cse2 (<= .cse25 4294967294)) (.cse0 (<= |v_oct_sum_#res_in_1| |v_oct_sum_#res_out_1|)) (.cse12 (<= 0 (+ .cse25 4294967296))) (.cse14 (<= .cse25 4294967294)) (.cse11 (<= 0 (+ .cse24 4294967296))) (.cse13 (<= .cse25 4294967294)) (.cse16 (<= 0 (+ .cse25 4294967296))) (.cse15 (<= .cse24 4294967294)) (.cse9 (<= |v_oct_sum_#res_out_1| |v_oct_sum_#res_in_1|)) (.cse19 (<= .cse24 4294967294)) (.cse10 (<= 0 (+ .cse24 4294967296)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse17 (not .cse0)) (.cse18 (not .cse9))) (and .cse0 (or (not .cse10) (not .cse11) (not .cse12) (not .cse13) (not .cse14) (not .cse15) (not .cse16) .cse17 .cse18 (not .cse19)) (let ((.cse20 (<= 0 (+ .cse24 4294967296))) (.cse22 (<= 0 (+ .cse24 4294967296))) (.cse23 (<= .cse24 4294967294))) (or (and .cse20 (let ((.cse21 (<= .cse24 4294967294))) (or (and (not .cse21) .cse22 .cse23) .cse21))) (and (not .cse20) .cse22 .cse23))) (or (not .cse4) (not .cse5) (not .cse8) (not .cse6) (not .cse3) (not .cse7) (not .cse1) .cse17 (not .cse2) .cse18) .cse9)) (and .cse0 .cse12 .cse14 .cse11 .cse13 .cse16 .cse15 .cse9 .cse19 .cse10)))) 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:35,583 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:35,584 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {239#(<= |sum_#in~n| 1)} {229#(<= 2 main_~a~0)} #39#return; {226#false} is VALID [2020-07-10 18:44:35,585 INFO L280 TraceCheckUtils]: 15: Hoare triple {226#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {226#false} is VALID [2020-07-10 18:44:35,585 INFO L280 TraceCheckUtils]: 16: Hoare triple {226#false} ~result~0 := #t~ret1; {226#false} is VALID [2020-07-10 18:44:35,586 INFO L280 TraceCheckUtils]: 17: Hoare triple {226#false} havoc #t~ret1; {226#false} is VALID [2020-07-10 18:44:35,586 INFO L280 TraceCheckUtils]: 18: Hoare triple {226#false} assume ~result~0 == ~a~0 + ~b~0; {226#false} is VALID [2020-07-10 18:44:35,586 INFO L280 TraceCheckUtils]: 19: Hoare triple {226#false} assume !false; {226#false} is VALID [2020-07-10 18:44:35,588 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:35,897 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:44:35,898 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1536519770] [2020-07-10 18:44:35,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:44:35,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-10 18:44:35,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598495361] [2020-07-10 18:44:35,900 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-07-10 18:44:35,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:44:35,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-10 18:44:35,922 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:35,923 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 18:44:35,924 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:35,930 INFO L168 Benchmark]: Toolchain (without parser) took 2630.50 ms. Allocated memory was 145.8 MB in the beginning and 235.4 MB in the end (delta: 89.7 MB). Free memory was 104.1 MB in the beginning and 115.6 MB in the end (delta: -11.5 MB). Peak memory consumption was 78.1 MB. Max. memory is 7.1 GB. [2020-07-10 18:44:35,931 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 145.8 MB. Free memory was 122.3 MB in the beginning and 122.1 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:35,932 INFO L168 Benchmark]: CACSL2BoogieTranslator took 254.42 ms. Allocated memory is still 145.8 MB. Free memory was 103.9 MB in the beginning and 94.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-07-10 18:44:35,933 INFO L168 Benchmark]: Boogie Preprocessor took 25.80 ms. Allocated memory is still 145.8 MB. Free memory was 94.4 MB in the beginning and 93.0 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:35,934 INFO L168 Benchmark]: RCFGBuilder took 422.05 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 93.0 MB in the beginning and 167.3 MB in the end (delta: -74.3 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-10 18:44:35,935 INFO L168 Benchmark]: TraceAbstraction took 1921.91 ms. Allocated memory was 203.4 MB in the beginning and 235.4 MB in the end (delta: 32.0 MB). Free memory was 166.6 MB in the beginning and 117.0 MB in the end (delta: 49.6 MB). Peak memory consumption was 81.6 MB. Max. memory is 7.1 GB. [2020-07-10 18:44:35,939 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.15 ms. Allocated memory is still 145.8 MB. Free memory was 122.3 MB in the beginning and 122.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 254.42 ms. Allocated memory is still 145.8 MB. Free memory was 103.9 MB in the beginning and 94.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.80 ms. Allocated memory is still 145.8 MB. Free memory was 94.4 MB in the beginning and 93.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 422.05 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 93.0 MB in the beginning and 167.3 MB in the end (delta: -74.3 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1921.91 ms. Allocated memory was 203.4 MB in the beginning and 235.4 MB in the end (delta: 32.0 MB). Free memory was 166.6 MB in the beginning and 117.0 MB in the end (delta: 49.6 MB). Peak memory consumption was 81.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:142) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...