/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/sum_2x3-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:23:26,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:23:26,427 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:23:26,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:23:26,443 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:23:26,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:23:26,447 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:23:26,459 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:23:26,460 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:23:26,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:23:26,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:23:26,465 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:23:26,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:23:26,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:23:26,469 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:23:26,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:23:26,473 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:23:26,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:23:26,478 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:23:26,481 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:23:26,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:23:26,486 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:23:26,489 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:23:26,489 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:23:26,494 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:23:26,494 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:23:26,494 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:23:26,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:23:26,498 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:23:26,499 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:23:26,499 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:23:26,500 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:23:26,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:23:26,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:23:26,503 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:23:26,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:23:26,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:23:26,506 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:23:26,506 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:23:26,507 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:23:26,508 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:23:26,509 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:23:26,533 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:23:26,533 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:23:26,535 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:23:26,535 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:23:26,536 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:23:26,536 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:23:26,536 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:23:26,536 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:23:26,536 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:23:26,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:23:26,538 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:23:26,538 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:23:26,538 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:23:26,539 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:23:26,539 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:23:26,539 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:23:26,539 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:23:26,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:23:26,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:23:26,540 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:23:26,540 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:23:26,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:23:26,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:23:26,541 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:23:26,541 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:23:26,542 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:23:26,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:23:26,542 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:23:26,542 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:23:26,542 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:23:26,855 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:23:26,872 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:23:26,875 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:23:26,877 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:23:26,877 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:23:26,878 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-17 22:23:26,943 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/025dc074e/99bfd1b8a7a8456182bb5215ea680d06/FLAG041f6edd8 [2020-07-17 22:23:27,386 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:23:27,387 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_2x3-1.c [2020-07-17 22:23:27,391 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/025dc074e/99bfd1b8a7a8456182bb5215ea680d06/FLAG041f6edd8 [2020-07-17 22:23:27,767 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/025dc074e/99bfd1b8a7a8456182bb5215ea680d06 [2020-07-17 22:23:27,774 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:23:27,777 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:23:27,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:23:27,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:23:27,781 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:23:27,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:23:27" (1/1) ... [2020-07-17 22:23:27,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1da2d2aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:27, skipping insertion in model container [2020-07-17 22:23:27,787 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:23:27" (1/1) ... [2020-07-17 22:23:27,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:23:27,809 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:23:27,982 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:23:27,986 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:23:28,002 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:23:28,016 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:23:28,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:28 WrapperNode [2020-07-17 22:23:28,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:23:28,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:23:28,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:23:28,018 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:23:28,031 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:28" (1/1) ... [2020-07-17 22:23:28,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:28" (1/1) ... [2020-07-17 22:23:28,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:28" (1/1) ... [2020-07-17 22:23:28,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:28" (1/1) ... [2020-07-17 22:23:28,041 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:28" (1/1) ... [2020-07-17 22:23:28,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:28" (1/1) ... [2020-07-17 22:23:28,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:28" (1/1) ... [2020-07-17 22:23:28,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:23:28,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:23:28,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:23:28,045 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:23:28,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:28" (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-17 22:23:28,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:23:28,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:23:28,189 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-07-17 22:23:28,190 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:23:28,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:23:28,190 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-07-17 22:23:28,190 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:23:28,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:23:28,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:23:28,396 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:23:28,396 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 22:23:28,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:23:28 BoogieIcfgContainer [2020-07-17 22:23:28,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:23:28,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:23:28,402 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:23:28,405 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:23:28,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:23:27" (1/3) ... [2020-07-17 22:23:28,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4373462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:23:28, skipping insertion in model container [2020-07-17 22:23:28,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:28" (2/3) ... [2020-07-17 22:23:28,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4373462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:23:28, skipping insertion in model container [2020-07-17 22:23:28,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:23:28" (3/3) ... [2020-07-17 22:23:28,408 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_2x3-1.c [2020-07-17 22:23:28,420 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:23:28,434 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:23:28,457 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:23:28,514 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:23:28,514 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:23:28,514 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:23:28,517 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:23:28,517 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:23:28,518 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:23:28,518 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:23:28,518 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:23:28,547 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-17 22:23:28,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-17 22:23:28,552 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:23:28,553 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:23:28,554 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:23:28,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:23:28,559 INFO L82 PathProgramCache]: Analyzing trace with hash 2001781660, now seen corresponding path program 1 times [2020-07-17 22:23:28,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:23:28,566 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759444049] [2020-07-17 22:23:28,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:23:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:28,749 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-17 22:23:28,750 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {23#true} {23#true} #26#return; {23#true} is VALID [2020-07-17 22:23:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:28,810 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} ~n := #in~n;~m := #in~m; {32#(= sum_~n |sum_#in~n|)} is VALID [2020-07-17 22:23:28,811 INFO L280 TraceCheckUtils]: 1: Hoare triple {32#(= sum_~n |sum_#in~n|)} assume ~n <= 0;#res := ~m + ~n; {33#(<= |sum_#in~n| 0)} is VALID [2020-07-17 22:23:28,812 INFO L280 TraceCheckUtils]: 2: Hoare triple {33#(<= |sum_#in~n| 0)} assume true; {33#(<= |sum_#in~n| 0)} is VALID [2020-07-17 22:23:28,815 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {33#(<= |sum_#in~n| 0)} {27#(<= 2 main_~a~0)} #32#return; {24#false} is VALID [2020-07-17 22:23:28,815 INFO L263 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2020-07-17 22:23:28,815 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-17 22:23:28,816 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #26#return; {23#true} is VALID [2020-07-17 22:23:28,816 INFO L263 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2020-07-17 22:23:28,817 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#true} ~a~0 := 2;~b~0 := 3; {27#(<= 2 main_~a~0)} is VALID [2020-07-17 22:23:28,818 INFO L263 TraceCheckUtils]: 5: Hoare triple {27#(<= 2 main_~a~0)} call #t~ret1 := sum(~a~0, ~b~0); {23#true} is VALID [2020-07-17 22:23:28,819 INFO L280 TraceCheckUtils]: 6: Hoare triple {23#true} ~n := #in~n;~m := #in~m; {32#(= sum_~n |sum_#in~n|)} is VALID [2020-07-17 22:23:28,820 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#(= sum_~n |sum_#in~n|)} assume ~n <= 0;#res := ~m + ~n; {33#(<= |sum_#in~n| 0)} is VALID [2020-07-17 22:23:28,821 INFO L280 TraceCheckUtils]: 8: Hoare triple {33#(<= |sum_#in~n| 0)} assume true; {33#(<= |sum_#in~n| 0)} is VALID [2020-07-17 22:23:28,823 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {33#(<= |sum_#in~n| 0)} {27#(<= 2 main_~a~0)} #32#return; {24#false} is VALID [2020-07-17 22:23:28,823 INFO L280 TraceCheckUtils]: 10: Hoare triple {24#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {24#false} is VALID [2020-07-17 22:23:28,823 INFO L280 TraceCheckUtils]: 11: Hoare triple {24#false} assume ~result~0 == ~a~0 + ~b~0; {24#false} is VALID [2020-07-17 22:23:28,824 INFO L280 TraceCheckUtils]: 12: Hoare triple {24#false} assume !false; {24#false} is VALID [2020-07-17 22:23:28,825 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-17 22:23:28,826 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759444049] [2020-07-17 22:23:28,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:23:28,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:23:28,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754030092] [2020-07-17 22:23:28,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:23:28,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:23:28,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:23:28,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:23:28,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:23:28,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:23:28,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:23:28,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:23:28,880 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-07-17 22:23:29,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:29,089 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-17 22:23:29,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:23:29,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:23:29,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:23:29,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:23:29,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-17 22:23:29,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:23:29,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-17 22:23:29,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2020-07-17 22:23:29,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:23:29,172 INFO L225 Difference]: With dead ends: 30 [2020-07-17 22:23:29,172 INFO L226 Difference]: Without dead ends: 18 [2020-07-17 22:23:29,176 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-17 22:23:29,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-17 22:23:29,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-17 22:23:29,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:23:29,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-17 22:23:29,220 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-17 22:23:29,220 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-17 22:23:29,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:29,225 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-17 22:23:29,226 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-17 22:23:29,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:23:29,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:23:29,227 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-17 22:23:29,227 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-17 22:23:29,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:29,231 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-17 22:23:29,232 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-17 22:23:29,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:23:29,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:23:29,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:23:29,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:23:29,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-17 22:23:29,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-07-17 22:23:29,238 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-07-17 22:23:29,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:23:29,239 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-07-17 22:23:29,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:23:29,239 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-17 22:23:29,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:23:29,241 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:23:29,241 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:23:29,241 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:23:29,242 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:23:29,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:23:29,242 INFO L82 PathProgramCache]: Analyzing trace with hash -118151420, now seen corresponding path program 1 times [2020-07-17 22:23:29,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:23:29,243 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062780864] [2020-07-17 22:23:29,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:23:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:29,340 INFO L280 TraceCheckUtils]: 0: Hoare triple {136#true} assume true; {136#true} is VALID [2020-07-17 22:23:29,341 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {136#true} {136#true} #26#return; {136#true} is VALID [2020-07-17 22:23:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:29,468 INFO L280 TraceCheckUtils]: 0: Hoare triple {136#true} ~n := #in~n;~m := #in~m; {151#(= sum_~n |sum_#in~n|)} is VALID [2020-07-17 22:23:29,470 INFO L280 TraceCheckUtils]: 1: Hoare triple {151#(= sum_~n |sum_#in~n|)} assume ~n <= 0;#res := ~m + ~n; {157#(<= |sum_#in~n| 0)} is VALID [2020-07-17 22:23:29,471 INFO L280 TraceCheckUtils]: 2: Hoare triple {157#(<= |sum_#in~n| 0)} assume true; {157#(<= |sum_#in~n| 0)} is VALID [2020-07-17 22:23:29,475 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {157#(<= |sum_#in~n| 0)} {151#(= sum_~n |sum_#in~n|)} #30#return; {156#(<= |sum_#in~n| 1)} is VALID [2020-07-17 22:23:29,476 INFO L280 TraceCheckUtils]: 0: Hoare triple {136#true} ~n := #in~n;~m := #in~m; {151#(= sum_~n |sum_#in~n|)} is VALID [2020-07-17 22:23:29,476 INFO L280 TraceCheckUtils]: 1: Hoare triple {151#(= sum_~n |sum_#in~n|)} assume !(~n <= 0); {151#(= sum_~n |sum_#in~n|)} is VALID [2020-07-17 22:23:29,477 INFO L263 TraceCheckUtils]: 2: Hoare triple {151#(= sum_~n |sum_#in~n|)} call #t~ret0 := sum(~n - 1, 1 + ~m); {136#true} is VALID [2020-07-17 22:23:29,478 INFO L280 TraceCheckUtils]: 3: Hoare triple {136#true} ~n := #in~n;~m := #in~m; {151#(= sum_~n |sum_#in~n|)} is VALID [2020-07-17 22:23:29,480 INFO L280 TraceCheckUtils]: 4: Hoare triple {151#(= sum_~n |sum_#in~n|)} assume ~n <= 0;#res := ~m + ~n; {157#(<= |sum_#in~n| 0)} is VALID [2020-07-17 22:23:29,480 INFO L280 TraceCheckUtils]: 5: Hoare triple {157#(<= |sum_#in~n| 0)} assume true; {157#(<= |sum_#in~n| 0)} is VALID [2020-07-17 22:23:29,482 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {157#(<= |sum_#in~n| 0)} {151#(= sum_~n |sum_#in~n|)} #30#return; {156#(<= |sum_#in~n| 1)} is VALID [2020-07-17 22:23:29,484 INFO L280 TraceCheckUtils]: 7: Hoare triple {156#(<= |sum_#in~n| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {156#(<= |sum_#in~n| 1)} is VALID [2020-07-17 22:23:29,485 INFO L280 TraceCheckUtils]: 8: Hoare triple {156#(<= |sum_#in~n| 1)} assume true; {156#(<= |sum_#in~n| 1)} is VALID [2020-07-17 22:23:29,488 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {156#(<= |sum_#in~n| 1)} {140#(<= 2 main_~a~0)} #32#return; {137#false} is VALID [2020-07-17 22:23:29,489 INFO L263 TraceCheckUtils]: 0: Hoare triple {136#true} call ULTIMATE.init(); {136#true} is VALID [2020-07-17 22:23:29,489 INFO L280 TraceCheckUtils]: 1: Hoare triple {136#true} assume true; {136#true} is VALID [2020-07-17 22:23:29,489 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {136#true} {136#true} #26#return; {136#true} is VALID [2020-07-17 22:23:29,490 INFO L263 TraceCheckUtils]: 3: Hoare triple {136#true} call #t~ret2 := main(); {136#true} is VALID [2020-07-17 22:23:29,491 INFO L280 TraceCheckUtils]: 4: Hoare triple {136#true} ~a~0 := 2;~b~0 := 3; {140#(<= 2 main_~a~0)} is VALID [2020-07-17 22:23:29,491 INFO L263 TraceCheckUtils]: 5: Hoare triple {140#(<= 2 main_~a~0)} call #t~ret1 := sum(~a~0, ~b~0); {136#true} is VALID [2020-07-17 22:23:29,492 INFO L280 TraceCheckUtils]: 6: Hoare triple {136#true} ~n := #in~n;~m := #in~m; {151#(= sum_~n |sum_#in~n|)} is VALID [2020-07-17 22:23:29,493 INFO L280 TraceCheckUtils]: 7: Hoare triple {151#(= sum_~n |sum_#in~n|)} assume !(~n <= 0); {151#(= sum_~n |sum_#in~n|)} is VALID [2020-07-17 22:23:29,493 INFO L263 TraceCheckUtils]: 8: Hoare triple {151#(= sum_~n |sum_#in~n|)} call #t~ret0 := sum(~n - 1, 1 + ~m); {136#true} is VALID [2020-07-17 22:23:29,495 INFO L280 TraceCheckUtils]: 9: Hoare triple {136#true} ~n := #in~n;~m := #in~m; {151#(= sum_~n |sum_#in~n|)} is VALID [2020-07-17 22:23:29,496 INFO L280 TraceCheckUtils]: 10: Hoare triple {151#(= sum_~n |sum_#in~n|)} assume ~n <= 0;#res := ~m + ~n; {157#(<= |sum_#in~n| 0)} is VALID [2020-07-17 22:23:29,497 INFO L280 TraceCheckUtils]: 11: Hoare triple {157#(<= |sum_#in~n| 0)} assume true; {157#(<= |sum_#in~n| 0)} is VALID [2020-07-17 22:23:29,512 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {157#(<= |sum_#in~n| 0)} {151#(= sum_~n |sum_#in~n|)} #30#return; {156#(<= |sum_#in~n| 1)} is VALID [2020-07-17 22:23:29,514 INFO L280 TraceCheckUtils]: 13: Hoare triple {156#(<= |sum_#in~n| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {156#(<= |sum_#in~n| 1)} is VALID [2020-07-17 22:23:29,516 INFO L280 TraceCheckUtils]: 14: Hoare triple {156#(<= |sum_#in~n| 1)} assume true; {156#(<= |sum_#in~n| 1)} is VALID [2020-07-17 22:23:29,518 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {156#(<= |sum_#in~n| 1)} {140#(<= 2 main_~a~0)} #32#return; {137#false} is VALID [2020-07-17 22:23:29,519 INFO L280 TraceCheckUtils]: 16: Hoare triple {137#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {137#false} is VALID [2020-07-17 22:23:29,519 INFO L280 TraceCheckUtils]: 17: Hoare triple {137#false} assume ~result~0 == ~a~0 + ~b~0; {137#false} is VALID [2020-07-17 22:23:29,519 INFO L280 TraceCheckUtils]: 18: Hoare triple {137#false} assume !false; {137#false} is VALID [2020-07-17 22:23:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 22:23:29,521 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062780864] [2020-07-17 22:23:29,522 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727290400] [2020-07-17 22:23:29,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:23:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:29,562 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:23:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:29,575 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:23:29,686 INFO L263 TraceCheckUtils]: 0: Hoare triple {136#true} call ULTIMATE.init(); {136#true} is VALID [2020-07-17 22:23:29,687 INFO L280 TraceCheckUtils]: 1: Hoare triple {136#true} assume true; {136#true} is VALID [2020-07-17 22:23:29,687 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {136#true} {136#true} #26#return; {136#true} is VALID [2020-07-17 22:23:29,687 INFO L263 TraceCheckUtils]: 3: Hoare triple {136#true} call #t~ret2 := main(); {136#true} is VALID [2020-07-17 22:23:29,688 INFO L280 TraceCheckUtils]: 4: Hoare triple {136#true} ~a~0 := 2;~b~0 := 3; {140#(<= 2 main_~a~0)} is VALID [2020-07-17 22:23:29,689 INFO L263 TraceCheckUtils]: 5: Hoare triple {140#(<= 2 main_~a~0)} call #t~ret1 := sum(~a~0, ~b~0); {136#true} is VALID [2020-07-17 22:23:29,689 INFO L280 TraceCheckUtils]: 6: Hoare triple {136#true} ~n := #in~n;~m := #in~m; {179#(<= |sum_#in~n| sum_~n)} is VALID [2020-07-17 22:23:29,690 INFO L280 TraceCheckUtils]: 7: Hoare triple {179#(<= |sum_#in~n| sum_~n)} assume !(~n <= 0); {179#(<= |sum_#in~n| sum_~n)} is VALID [2020-07-17 22:23:29,690 INFO L263 TraceCheckUtils]: 8: Hoare triple {179#(<= |sum_#in~n| sum_~n)} call #t~ret0 := sum(~n - 1, 1 + ~m); {136#true} is VALID [2020-07-17 22:23:29,691 INFO L280 TraceCheckUtils]: 9: Hoare triple {136#true} ~n := #in~n;~m := #in~m; {179#(<= |sum_#in~n| sum_~n)} is VALID [2020-07-17 22:23:29,692 INFO L280 TraceCheckUtils]: 10: Hoare triple {179#(<= |sum_#in~n| sum_~n)} assume ~n <= 0;#res := ~m + ~n; {157#(<= |sum_#in~n| 0)} is VALID [2020-07-17 22:23:29,693 INFO L280 TraceCheckUtils]: 11: Hoare triple {157#(<= |sum_#in~n| 0)} assume true; {157#(<= |sum_#in~n| 0)} is VALID [2020-07-17 22:23:29,695 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {157#(<= |sum_#in~n| 0)} {179#(<= |sum_#in~n| sum_~n)} #30#return; {156#(<= |sum_#in~n| 1)} is VALID [2020-07-17 22:23:29,696 INFO L280 TraceCheckUtils]: 13: Hoare triple {156#(<= |sum_#in~n| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {156#(<= |sum_#in~n| 1)} is VALID [2020-07-17 22:23:29,697 INFO L280 TraceCheckUtils]: 14: Hoare triple {156#(<= |sum_#in~n| 1)} assume true; {156#(<= |sum_#in~n| 1)} is VALID [2020-07-17 22:23:29,698 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {156#(<= |sum_#in~n| 1)} {140#(<= 2 main_~a~0)} #32#return; {137#false} is VALID [2020-07-17 22:23:29,699 INFO L280 TraceCheckUtils]: 16: Hoare triple {137#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {137#false} is VALID [2020-07-17 22:23:29,699 INFO L280 TraceCheckUtils]: 17: Hoare triple {137#false} assume ~result~0 == ~a~0 + ~b~0; {137#false} is VALID [2020-07-17 22:23:29,699 INFO L280 TraceCheckUtils]: 18: Hoare triple {137#false} assume !false; {137#false} is VALID [2020-07-17 22:23:29,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 22:23:29,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:23:29,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-07-17 22:23:29,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226277298] [2020-07-17 22:23:29,703 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-17 22:23:29,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:23:29,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:23:29,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:23:29,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:23:29,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:23:29,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:23:29,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:23:29,738 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 7 states. [2020-07-17 22:23:29,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:29,882 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-17 22:23:29,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:23:29,882 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-17 22:23:29,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:23:29,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:23:29,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-17 22:23:29,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:23:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-17 22:23:29,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2020-07-17 22:23:29,925 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-17 22:23:29,927 INFO L225 Difference]: With dead ends: 25 [2020-07-17 22:23:29,927 INFO L226 Difference]: Without dead ends: 21 [2020-07-17 22:23:29,928 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:23:29,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-17 22:23:29,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-17 22:23:29,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:23:29,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-17 22:23:29,937 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-17 22:23:29,938 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-17 22:23:29,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:29,940 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-17 22:23:29,941 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-17 22:23:29,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:23:29,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:23:29,942 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-17 22:23:29,942 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-17 22:23:29,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:29,945 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-17 22:23:29,945 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-17 22:23:29,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:23:29,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:23:29,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:23:29,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:23:29,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:23:29,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-07-17 22:23:29,949 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2020-07-17 22:23:29,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:23:29,949 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-07-17 22:23:29,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:23:29,949 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-17 22:23:29,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:23:29,950 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:23:29,951 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:23:30,166 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-17 22:23:30,167 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:23:30,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:23:30,168 INFO L82 PathProgramCache]: Analyzing trace with hash 764931548, now seen corresponding path program 2 times [2020-07-17 22:23:30,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:23:30,169 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607837968] [2020-07-17 22:23:30,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:23:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:23:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:23:30,222 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:23:30,222 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:23:30,222 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:23:30,247 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:23:30,247 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:23:30,247 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:23:30,248 WARN L170 areAnnotationChecker]: sumENTRY has no Hoare annotation [2020-07-17 22:23:30,248 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:23:30,248 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:23:30,248 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:23:30,248 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:23:30,248 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:23:30,248 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:23:30,249 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-17 22:23:30,249 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-17 22:23:30,249 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:23:30,249 WARN L170 areAnnotationChecker]: sumFINAL has no Hoare annotation [2020-07-17 22:23:30,249 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:23:30,249 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:23:30,249 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-17 22:23:30,249 WARN L170 areAnnotationChecker]: sumEXIT has no Hoare annotation [2020-07-17 22:23:30,250 WARN L170 areAnnotationChecker]: sumEXIT has no Hoare annotation [2020-07-17 22:23:30,250 WARN L170 areAnnotationChecker]: L7-1 has no Hoare annotation [2020-07-17 22:23:30,250 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-17 22:23:30,250 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-17 22:23:30,250 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-17 22:23:30,250 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-17 22:23:30,250 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2020-07-17 22:23:30,250 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:23:30,251 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:23:30,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:23:30 BoogieIcfgContainer [2020-07-17 22:23:30,253 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:23:30,257 INFO L168 Benchmark]: Toolchain (without parser) took 2479.92 ms. Allocated memory was 145.8 MB in the beginning and 234.9 MB in the end (delta: 89.1 MB). Free memory was 103.7 MB in the beginning and 139.2 MB in the end (delta: -35.5 MB). Peak memory consumption was 53.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:23:30,258 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:23:30,259 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.80 ms. Allocated memory is still 145.8 MB. Free memory was 103.3 MB in the beginning and 93.8 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:23:30,259 INFO L168 Benchmark]: Boogie Preprocessor took 27.28 ms. Allocated memory is still 145.8 MB. Free memory was 93.8 MB in the beginning and 92.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:23:30,260 INFO L168 Benchmark]: RCFGBuilder took 355.33 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 92.3 MB in the beginning and 167.5 MB in the end (delta: -75.2 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:23:30,261 INFO L168 Benchmark]: TraceAbstraction took 1851.70 ms. Allocated memory was 202.4 MB in the beginning and 234.9 MB in the end (delta: 32.5 MB). Free memory was 166.8 MB in the beginning and 139.2 MB in the end (delta: 27.6 MB). Peak memory consumption was 60.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:23:30,265 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.18 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 239.80 ms. Allocated memory is still 145.8 MB. Free memory was 103.3 MB in the beginning and 93.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 27.28 ms. Allocated memory is still 145.8 MB. Free memory was 93.8 MB in the beginning and 92.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 355.33 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 92.3 MB in the beginning and 167.5 MB in the end (delta: -75.2 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1851.70 ms. Allocated memory was 202.4 MB in the beginning and 234.9 MB in the end (delta: 32.5 MB). Free memory was 166.8 MB in the beginning and 139.2 MB in the end (delta: 27.6 MB). Peak memory consumption was 60.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 2; [L13] int b = 3; VAL [a=2, b=3] [L14] CALL, EXPR sum(a, b) VAL [\old(m)=3, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=2, m=3, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=1, m=4, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=5, \old(n)=0, \result=5, m=5, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=1, m=4, n=1, sum(n - 1, m + 1)=5] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=2, m=3, n=2, sum(n - 1, m + 1)=5] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) VAL [a=2, b=3, sum(a, b)=5] [L14] int result = sum(a, b); [L15] COND TRUE result == a + b VAL [a=2, b=3, result=5] [L16] __VERIFIER_error() VAL [a=2, b=3, result=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 3, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 27 SDtfs, 25 SDslu, 58 SDs, 0 SdLazy, 44 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 1536 SizeOfPredicates, 3 NumberOfNonLiveVariables, 55 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 4/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...