/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-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:23:26,463 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:23:26,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:23:26,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:23:26,483 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:23:26,484 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:23:26,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:23:26,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:23:26,501 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:23:26,503 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:23:26,505 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:23:26,506 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:23:26,506 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:23:26,508 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:23:26,510 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:23:26,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:23:26,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:23:26,516 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:23:26,518 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:23:26,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:23:26,526 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:23:26,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:23:26,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:23:26,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:23:26,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:23:26,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:23:26,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:23:26,535 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:23:26,535 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:23:26,537 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:23:26,537 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:23:26,538 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:23:26,539 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:23:26,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:23:26,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:23:26,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:23:26,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:23:26,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:23:26,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:23:26,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:23:26,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:23:26,549 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,572 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:23:26,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:23:26,574 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:23:26,574 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:23:26,575 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:23:26,575 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:23:26,575 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:23:26,575 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:23:26,575 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:23:26,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:23:26,577 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:23:26,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:23:26,577 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:23:26,578 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:23:26,578 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:23:26,578 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:23:26,578 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:23:26,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:23:26,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:23:26,579 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:23:26,579 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:23:26,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:23:26,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:23:26,580 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:23:26,580 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:23:26,580 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:23:26,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:23:26,581 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:23:26,581 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:23:26,581 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:23:26,885 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:23:26,897 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:23:26,900 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:23:26,901 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:23:26,901 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:23:26,902 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_2x3-2.c [2020-07-17 22:23:26,967 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92281c300/2c64b2555e0647fdb7f135a7f94f9b64/FLAGd83954e51 [2020-07-17 22:23:27,407 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:23:27,408 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_2x3-2.c [2020-07-17 22:23:27,412 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92281c300/2c64b2555e0647fdb7f135a7f94f9b64/FLAGd83954e51 [2020-07-17 22:23:27,799 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92281c300/2c64b2555e0647fdb7f135a7f94f9b64 [2020-07-17 22:23:27,808 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:23:27,811 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:23:27,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:23:27,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:23:27,816 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:23:27,818 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,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e5708e5 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,821 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,828 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:23:27,845 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:23:27,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:23:27,997 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:23:28,013 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:23:28,027 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:23:28,028 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,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:23:28,029 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:23:28,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:23:28,029 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:23:28,042 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,042 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,046 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,047 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,050 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,052 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,053 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,054 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:23:28,054 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:23:28,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:23:28,055 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:23:28,055 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,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:23:28,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:23:28,181 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-07-17 22:23:28,181 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:23:28,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:23:28,181 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-07-17 22:23:28,181 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:23:28,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:23:28,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:23:28,394 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:23:28,395 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 22:23:28,399 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,399 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:23:28,400 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:23:28,400 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:23:28,404 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:23:28,404 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,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53371c55 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,405 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,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53371c55 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.rcfgbuilder CFG 17.07 10:23:28" (3/3) ... [2020-07-17 22:23:28,407 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_2x3-2.c [2020-07-17 22:23:28,419 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:23:28,428 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:23:28,447 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:23:28,474 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:23:28,474 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:23:28,474 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:23:28,474 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:23:28,474 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:23:28,475 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:23:28,475 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:23:28,475 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:23:28,495 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-17 22:23:28,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-17 22:23:28,502 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:23:28,504 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:23:28,504 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:23:28,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:23:28,511 INFO L82 PathProgramCache]: Analyzing trace with hash 2001781660, now seen corresponding path program 1 times [2020-07-17 22:23:28,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:23:28,523 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962673514] [2020-07-17 22:23:28,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:23:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:28,713 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-17 22:23:28,714 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {23#true} {23#true} #26#return; {23#true} is VALID [2020-07-17 22:23:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:28,777 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,778 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,779 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,781 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,782 INFO L263 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2020-07-17 22:23:28,782 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-17 22:23:28,783 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #26#return; {23#true} is VALID [2020-07-17 22:23:28,783 INFO L263 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2020-07-17 22:23:28,784 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,785 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,790 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,792 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,792 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,795 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,795 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,795 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,796 INFO L280 TraceCheckUtils]: 12: Hoare triple {24#false} assume !false; {24#false} is VALID [2020-07-17 22:23:28,797 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,798 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962673514] [2020-07-17 22:23:28,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:23:28,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:23:28,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272848155] [2020-07-17 22:23:28,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:23:28,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:23:28,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:23:28,845 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,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:23:28,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:23:28,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:23:28,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:23:28,857 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-07-17 22:23:29,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:29,078 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-17 22:23:29,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:23:29,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:23:29,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:23:29,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:23:29,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-17 22:23:29,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:23:29,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-17 22:23:29,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2020-07-17 22:23:29,147 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,159 INFO L225 Difference]: With dead ends: 30 [2020-07-17 22:23:29,159 INFO L226 Difference]: Without dead ends: 18 [2020-07-17 22:23:29,162 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,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-17 22:23:29,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-17 22:23:29,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:23:29,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-17 22:23:29,206 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-17 22:23:29,206 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-17 22:23:29,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:29,211 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-17 22:23:29,212 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-17 22:23:29,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:23:29,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:23:29,213 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-17 22:23:29,213 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-17 22:23:29,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:29,217 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-17 22:23:29,218 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-17 22:23:29,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:23:29,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:23:29,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:23:29,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:23:29,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-17 22:23:29,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-07-17 22:23:29,224 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-07-17 22:23:29,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:23:29,224 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-07-17 22:23:29,225 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:23:29,225 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-17 22:23:29,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:23:29,226 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:23:29,226 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,227 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:23:29,227 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:23:29,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:23:29,228 INFO L82 PathProgramCache]: Analyzing trace with hash -118151420, now seen corresponding path program 1 times [2020-07-17 22:23:29,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:23:29,228 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526050449] [2020-07-17 22:23:29,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:23:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:29,314 INFO L280 TraceCheckUtils]: 0: Hoare triple {136#true} assume true; {136#true} is VALID [2020-07-17 22:23:29,315 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {136#true} {136#true} #26#return; {136#true} is VALID [2020-07-17 22:23:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:29,397 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,398 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,399 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,402 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,404 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,406 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,406 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,409 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,410 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,411 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,413 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,414 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,415 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,417 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,417 INFO L263 TraceCheckUtils]: 0: Hoare triple {136#true} call ULTIMATE.init(); {136#true} is VALID [2020-07-17 22:23:29,418 INFO L280 TraceCheckUtils]: 1: Hoare triple {136#true} assume true; {136#true} is VALID [2020-07-17 22:23:29,418 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {136#true} {136#true} #26#return; {136#true} is VALID [2020-07-17 22:23:29,432 INFO L263 TraceCheckUtils]: 3: Hoare triple {136#true} call #t~ret2 := main(); {136#true} is VALID [2020-07-17 22:23:29,437 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,438 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,438 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,439 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,439 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,440 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,446 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,447 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,449 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,450 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,451 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,456 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,457 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,457 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,457 INFO L280 TraceCheckUtils]: 18: Hoare triple {137#false} assume !false; {137#false} is VALID [2020-07-17 22:23:29,459 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,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526050449] [2020-07-17 22:23:29,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902781296] [2020-07-17 22:23:29,460 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,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:29,504 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:23:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:29,518 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:23:29,645 INFO L263 TraceCheckUtils]: 0: Hoare triple {136#true} call ULTIMATE.init(); {136#true} is VALID [2020-07-17 22:23:29,646 INFO L280 TraceCheckUtils]: 1: Hoare triple {136#true} assume true; {136#true} is VALID [2020-07-17 22:23:29,646 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {136#true} {136#true} #26#return; {136#true} is VALID [2020-07-17 22:23:29,646 INFO L263 TraceCheckUtils]: 3: Hoare triple {136#true} call #t~ret2 := main(); {136#true} is VALID [2020-07-17 22:23:29,647 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,647 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,649 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,650 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,650 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,653 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,654 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,655 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,659 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,659 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,660 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,662 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,663 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,663 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,663 INFO L280 TraceCheckUtils]: 18: Hoare triple {137#false} assume !false; {137#false} is VALID [2020-07-17 22:23:29,665 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,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:23:29,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-07-17 22:23:29,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272427736] [2020-07-17 22:23:29,670 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-17 22:23:29,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:23:29,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:23:29,703 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,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:23:29,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:23:29,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:23:29,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:23:29,704 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 7 states. [2020-07-17 22:23:29,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:29,839 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-17 22:23:29,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:23:29,839 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-17 22:23:29,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:23:29,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:23:29,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-17 22:23:29,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:23:29,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-17 22:23:29,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2020-07-17 22:23:29,880 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,882 INFO L225 Difference]: With dead ends: 25 [2020-07-17 22:23:29,882 INFO L226 Difference]: Without dead ends: 21 [2020-07-17 22:23:29,883 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,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-17 22:23:29,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-17 22:23:29,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:23:29,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-17 22:23:29,893 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-17 22:23:29,893 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-17 22:23:29,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:29,896 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-17 22:23:29,896 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-17 22:23:29,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:23:29,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:23:29,897 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-17 22:23:29,897 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-17 22:23:29,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:29,900 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-17 22:23:29,900 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-17 22:23:29,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:23:29,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:23:29,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:23:29,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:23:29,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:23:29,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-07-17 22:23:29,904 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2020-07-17 22:23:29,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:23:29,905 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-07-17 22:23:29,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:23:29,905 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-17 22:23:29,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:23:29,906 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:23:29,906 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,120 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,121 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:23:30,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:23:30,121 INFO L82 PathProgramCache]: Analyzing trace with hash 764931548, now seen corresponding path program 2 times [2020-07-17 22:23:30,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:23:30,122 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115601401] [2020-07-17 22:23:30,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:23:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:30,262 INFO L280 TraceCheckUtils]: 0: Hoare triple {321#true} assume true; {321#true} is VALID [2020-07-17 22:23:30,262 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {321#true} {321#true} #26#return; {321#true} is VALID [2020-07-17 22:23:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:30,516 INFO L280 TraceCheckUtils]: 0: Hoare triple {321#true} ~n := #in~n;~m := #in~m; {344#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-17 22:23:30,518 INFO L280 TraceCheckUtils]: 1: Hoare triple {344#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} assume ~n <= 0;#res := ~m + ~n; {364#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} is VALID [2020-07-17 22:23:30,519 INFO L280 TraceCheckUtils]: 2: Hoare triple {364#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} assume true; {364#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} is VALID [2020-07-17 22:23:30,522 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {364#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} {357#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} #30#return; {362#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-17 22:23:30,531 INFO L280 TraceCheckUtils]: 0: Hoare triple {321#true} ~n := #in~n;~m := #in~m; {344#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-17 22:23:30,532 INFO L280 TraceCheckUtils]: 1: Hoare triple {344#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} assume !(~n <= 0); {357#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} is VALID [2020-07-17 22:23:30,533 INFO L263 TraceCheckUtils]: 2: Hoare triple {357#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} call #t~ret0 := sum(~n - 1, 1 + ~m); {321#true} is VALID [2020-07-17 22:23:30,534 INFO L280 TraceCheckUtils]: 3: Hoare triple {321#true} ~n := #in~n;~m := #in~m; {344#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-17 22:23:30,535 INFO L280 TraceCheckUtils]: 4: Hoare triple {344#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} assume ~n <= 0;#res := ~m + ~n; {364#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} is VALID [2020-07-17 22:23:30,537 INFO L280 TraceCheckUtils]: 5: Hoare triple {364#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} assume true; {364#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} is VALID [2020-07-17 22:23:30,540 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {364#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} {357#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} #30#return; {362#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-17 22:23:30,541 INFO L280 TraceCheckUtils]: 7: Hoare triple {362#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {363#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-17 22:23:30,543 INFO L280 TraceCheckUtils]: 8: Hoare triple {363#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} assume true; {363#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-17 22:23:30,546 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {363#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} {344#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} #30#return; {355#(and (<= (+ |sum_#in~m| 2) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-17 22:23:30,548 INFO L280 TraceCheckUtils]: 0: Hoare triple {321#true} ~n := #in~n;~m := #in~m; {344#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-17 22:23:30,549 INFO L280 TraceCheckUtils]: 1: Hoare triple {344#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} assume !(~n <= 0); {344#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-17 22:23:30,550 INFO L263 TraceCheckUtils]: 2: Hoare triple {344#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} call #t~ret0 := sum(~n - 1, 1 + ~m); {321#true} is VALID [2020-07-17 22:23:30,551 INFO L280 TraceCheckUtils]: 3: Hoare triple {321#true} ~n := #in~n;~m := #in~m; {344#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-17 22:23:30,553 INFO L280 TraceCheckUtils]: 4: Hoare triple {344#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} assume !(~n <= 0); {357#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} is VALID [2020-07-17 22:23:30,553 INFO L263 TraceCheckUtils]: 5: Hoare triple {357#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} call #t~ret0 := sum(~n - 1, 1 + ~m); {321#true} is VALID [2020-07-17 22:23:30,554 INFO L280 TraceCheckUtils]: 6: Hoare triple {321#true} ~n := #in~n;~m := #in~m; {344#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-17 22:23:30,556 INFO L280 TraceCheckUtils]: 7: Hoare triple {344#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} assume ~n <= 0;#res := ~m + ~n; {364#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} is VALID [2020-07-17 22:23:30,557 INFO L280 TraceCheckUtils]: 8: Hoare triple {364#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} assume true; {364#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} is VALID [2020-07-17 22:23:30,560 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {364#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} {357#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} #30#return; {362#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-17 22:23:30,562 INFO L280 TraceCheckUtils]: 10: Hoare triple {362#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {363#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-17 22:23:30,563 INFO L280 TraceCheckUtils]: 11: Hoare triple {363#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} assume true; {363#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-17 22:23:30,566 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {363#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} {344#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} #30#return; {355#(and (<= (+ |sum_#in~m| 2) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-17 22:23:30,571 INFO L280 TraceCheckUtils]: 13: Hoare triple {355#(and (<= (+ |sum_#in~m| 2) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {356#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} is VALID [2020-07-17 22:23:30,573 INFO L280 TraceCheckUtils]: 14: Hoare triple {356#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} assume true; {356#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} is VALID [2020-07-17 22:23:30,575 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {356#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} {325#(<= main_~a~0 2)} #32#return; {342#(and (<= (+ main_~a~0 main_~b~0) |main_#t~ret1|) (<= |main_#t~ret1| (+ main_~a~0 main_~b~0)))} is VALID [2020-07-17 22:23:30,578 INFO L263 TraceCheckUtils]: 0: Hoare triple {321#true} call ULTIMATE.init(); {321#true} is VALID [2020-07-17 22:23:30,578 INFO L280 TraceCheckUtils]: 1: Hoare triple {321#true} assume true; {321#true} is VALID [2020-07-17 22:23:30,579 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {321#true} {321#true} #26#return; {321#true} is VALID [2020-07-17 22:23:30,579 INFO L263 TraceCheckUtils]: 3: Hoare triple {321#true} call #t~ret2 := main(); {321#true} is VALID [2020-07-17 22:23:30,580 INFO L280 TraceCheckUtils]: 4: Hoare triple {321#true} ~a~0 := 2;~b~0 := 3; {325#(<= main_~a~0 2)} is VALID [2020-07-17 22:23:30,581 INFO L263 TraceCheckUtils]: 5: Hoare triple {325#(<= main_~a~0 2)} call #t~ret1 := sum(~a~0, ~b~0); {321#true} is VALID [2020-07-17 22:23:30,582 INFO L280 TraceCheckUtils]: 6: Hoare triple {321#true} ~n := #in~n;~m := #in~m; {344#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-17 22:23:30,583 INFO L280 TraceCheckUtils]: 7: Hoare triple {344#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} assume !(~n <= 0); {344#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-17 22:23:30,583 INFO L263 TraceCheckUtils]: 8: Hoare triple {344#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} call #t~ret0 := sum(~n - 1, 1 + ~m); {321#true} is VALID [2020-07-17 22:23:30,584 INFO L280 TraceCheckUtils]: 9: Hoare triple {321#true} ~n := #in~n;~m := #in~m; {344#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-17 22:23:30,586 INFO L280 TraceCheckUtils]: 10: Hoare triple {344#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} assume !(~n <= 0); {357#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} is VALID [2020-07-17 22:23:30,586 INFO L263 TraceCheckUtils]: 11: Hoare triple {357#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} call #t~ret0 := sum(~n - 1, 1 + ~m); {321#true} is VALID [2020-07-17 22:23:30,588 INFO L280 TraceCheckUtils]: 12: Hoare triple {321#true} ~n := #in~n;~m := #in~m; {344#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-17 22:23:30,589 INFO L280 TraceCheckUtils]: 13: Hoare triple {344#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} assume ~n <= 0;#res := ~m + ~n; {364#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} is VALID [2020-07-17 22:23:30,590 INFO L280 TraceCheckUtils]: 14: Hoare triple {364#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} assume true; {364#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} is VALID [2020-07-17 22:23:30,593 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {364#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} {357#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} #30#return; {362#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-17 22:23:30,608 INFO L280 TraceCheckUtils]: 16: Hoare triple {362#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {363#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-17 22:23:30,610 INFO L280 TraceCheckUtils]: 17: Hoare triple {363#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} assume true; {363#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-17 22:23:30,613 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {363#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} {344#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} #30#return; {355#(and (<= (+ |sum_#in~m| 2) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-17 22:23:30,614 INFO L280 TraceCheckUtils]: 19: Hoare triple {355#(and (<= (+ |sum_#in~m| 2) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {356#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} is VALID [2020-07-17 22:23:30,616 INFO L280 TraceCheckUtils]: 20: Hoare triple {356#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} assume true; {356#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} is VALID [2020-07-17 22:23:30,618 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {356#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} {325#(<= main_~a~0 2)} #32#return; {342#(and (<= (+ main_~a~0 main_~b~0) |main_#t~ret1|) (<= |main_#t~ret1| (+ main_~a~0 main_~b~0)))} is VALID [2020-07-17 22:23:30,619 INFO L280 TraceCheckUtils]: 22: Hoare triple {342#(and (<= (+ main_~a~0 main_~b~0) |main_#t~ret1|) (<= |main_#t~ret1| (+ main_~a~0 main_~b~0)))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {343#(and (<= main_~result~0 (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) main_~result~0))} is VALID [2020-07-17 22:23:30,622 INFO L280 TraceCheckUtils]: 23: Hoare triple {343#(and (<= main_~result~0 (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) main_~result~0))} assume ~result~0 != ~a~0 + ~b~0; {322#false} is VALID [2020-07-17 22:23:30,623 INFO L280 TraceCheckUtils]: 24: Hoare triple {322#false} assume !false; {322#false} is VALID [2020-07-17 22:23:30,625 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-17 22:23:30,626 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115601401] [2020-07-17 22:23:30,627 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903274279] [2020-07-17 22:23:30,627 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:23:30,680 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:23:30,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:23:30,682 INFO L264 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 33 conjunts are in the unsatisfiable core [2020-07-17 22:23:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:30,693 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:23:31,042 INFO L263 TraceCheckUtils]: 0: Hoare triple {321#true} call ULTIMATE.init(); {321#true} is VALID [2020-07-17 22:23:31,043 INFO L280 TraceCheckUtils]: 1: Hoare triple {321#true} assume true; {321#true} is VALID [2020-07-17 22:23:31,043 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {321#true} {321#true} #26#return; {321#true} is VALID [2020-07-17 22:23:31,043 INFO L263 TraceCheckUtils]: 3: Hoare triple {321#true} call #t~ret2 := main(); {321#true} is VALID [2020-07-17 22:23:31,044 INFO L280 TraceCheckUtils]: 4: Hoare triple {321#true} ~a~0 := 2;~b~0 := 3; {380#(= 2 main_~a~0)} is VALID [2020-07-17 22:23:31,044 INFO L263 TraceCheckUtils]: 5: Hoare triple {380#(= 2 main_~a~0)} call #t~ret1 := sum(~a~0, ~b~0); {321#true} is VALID [2020-07-17 22:23:31,045 INFO L280 TraceCheckUtils]: 6: Hoare triple {321#true} ~n := #in~n;~m := #in~m; {387#(= sum_~m |sum_#in~m|)} is VALID [2020-07-17 22:23:31,045 INFO L280 TraceCheckUtils]: 7: Hoare triple {387#(= sum_~m |sum_#in~m|)} assume !(~n <= 0); {387#(= sum_~m |sum_#in~m|)} is VALID [2020-07-17 22:23:31,046 INFO L263 TraceCheckUtils]: 8: Hoare triple {387#(= sum_~m |sum_#in~m|)} call #t~ret0 := sum(~n - 1, 1 + ~m); {321#true} is VALID [2020-07-17 22:23:31,046 INFO L280 TraceCheckUtils]: 9: Hoare triple {321#true} ~n := #in~n;~m := #in~m; {387#(= sum_~m |sum_#in~m|)} is VALID [2020-07-17 22:23:31,047 INFO L280 TraceCheckUtils]: 10: Hoare triple {387#(= sum_~m |sum_#in~m|)} assume !(~n <= 0); {400#(and (= sum_~m |sum_#in~m|) (< 0 sum_~n))} is VALID [2020-07-17 22:23:31,047 INFO L263 TraceCheckUtils]: 11: Hoare triple {400#(and (= sum_~m |sum_#in~m|) (< 0 sum_~n))} call #t~ret0 := sum(~n - 1, 1 + ~m); {321#true} is VALID [2020-07-17 22:23:31,048 INFO L280 TraceCheckUtils]: 12: Hoare triple {321#true} ~n := #in~n;~m := #in~m; {407#(and (= sum_~m |sum_#in~m|) (<= |sum_#in~n| sum_~n))} is VALID [2020-07-17 22:23:31,049 INFO L280 TraceCheckUtils]: 13: Hoare triple {407#(and (= sum_~m |sum_#in~m|) (<= |sum_#in~n| sum_~n))} assume ~n <= 0;#res := ~m + ~n; {364#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} is VALID [2020-07-17 22:23:31,051 INFO L280 TraceCheckUtils]: 14: Hoare triple {364#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} assume true; {364#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} is VALID [2020-07-17 22:23:31,053 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {364#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} {400#(and (= sum_~m |sum_#in~m|) (< 0 sum_~n))} #30#return; {417#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~m| 1)))} is VALID [2020-07-17 22:23:31,054 INFO L280 TraceCheckUtils]: 16: Hoare triple {417#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~m| 1)))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {421#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~m| 1)))} is VALID [2020-07-17 22:23:31,055 INFO L280 TraceCheckUtils]: 17: Hoare triple {421#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~m| 1)))} assume true; {421#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~m| 1)))} is VALID [2020-07-17 22:23:31,057 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {421#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~m| 1)))} {387#(= sum_~m |sum_#in~m|)} #30#return; {428#(and (<= |sum_#t~ret0| (+ |sum_#in~m| 2)) (<= (+ |sum_#in~m| 2) |sum_#t~ret0|))} is VALID [2020-07-17 22:23:31,058 INFO L280 TraceCheckUtils]: 19: Hoare triple {428#(and (<= |sum_#t~ret0| (+ |sum_#in~m| 2)) (<= (+ |sum_#in~m| 2) |sum_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {432#(and (<= |sum_#res| (+ |sum_#in~m| 2)) (<= (+ |sum_#in~m| 2) |sum_#res|))} is VALID [2020-07-17 22:23:31,059 INFO L280 TraceCheckUtils]: 20: Hoare triple {432#(and (<= |sum_#res| (+ |sum_#in~m| 2)) (<= (+ |sum_#in~m| 2) |sum_#res|))} assume true; {432#(and (<= |sum_#res| (+ |sum_#in~m| 2)) (<= (+ |sum_#in~m| 2) |sum_#res|))} is VALID [2020-07-17 22:23:31,060 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {432#(and (<= |sum_#res| (+ |sum_#in~m| 2)) (<= (+ |sum_#in~m| 2) |sum_#res|))} {380#(= 2 main_~a~0)} #32#return; {439#(and (<= (+ main_~b~0 2) |main_#t~ret1|) (= 2 main_~a~0) (<= |main_#t~ret1| (+ main_~b~0 2)))} is VALID [2020-07-17 22:23:31,061 INFO L280 TraceCheckUtils]: 22: Hoare triple {439#(and (<= (+ main_~b~0 2) |main_#t~ret1|) (= 2 main_~a~0) (<= |main_#t~ret1| (+ main_~b~0 2)))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {443#(and (= 2 main_~a~0) (<= (+ main_~b~0 2) main_~result~0) (<= main_~result~0 (+ main_~b~0 2)))} is VALID [2020-07-17 22:23:31,062 INFO L280 TraceCheckUtils]: 23: Hoare triple {443#(and (= 2 main_~a~0) (<= (+ main_~b~0 2) main_~result~0) (<= main_~result~0 (+ main_~b~0 2)))} assume ~result~0 != ~a~0 + ~b~0; {322#false} is VALID [2020-07-17 22:23:31,062 INFO L280 TraceCheckUtils]: 24: Hoare triple {322#false} assume !false; {322#false} is VALID [2020-07-17 22:23:31,064 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-17 22:23:31,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:23:31,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2020-07-17 22:23:31,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742407738] [2020-07-17 22:23:31,065 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2020-07-17 22:23:31,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:23:31,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2020-07-17 22:23:31,119 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:23:31,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-17 22:23:31,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:23:31,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-17 22:23:31,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2020-07-17 22:23:31,121 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 22 states. [2020-07-17 22:23:32,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:32,002 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-17 22:23:32,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-17 22:23:32,002 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2020-07-17 22:23:32,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:23:32,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-17 22:23:32,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2020-07-17 22:23:32,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-17 22:23:32,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2020-07-17 22:23:32,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 26 transitions. [2020-07-17 22:23:32,061 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:32,061 INFO L225 Difference]: With dead ends: 24 [2020-07-17 22:23:32,061 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:23:32,062 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2020-07-17 22:23:32,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:23:32,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:23:32,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:23:32,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:23:32,063 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:23:32,063 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:23:32,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:32,064 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:23:32,064 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:23:32,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:23:32,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:23:32,065 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:23:32,065 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:23:32,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:32,065 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:23:32,065 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:23:32,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:23:32,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:23:32,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:23:32,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:23:32,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:23:32,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:23:32,067 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2020-07-17 22:23:32,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:23:32,067 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:23:32,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-17 22:23:32,067 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:23:32,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:23:32,268 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:23:32,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:23:32,316 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:23:32,316 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:23:32,316 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:23:32,316 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:23:32,317 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:23:32,317 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:23:32,317 INFO L268 CegarLoopResult]: For program point sumEXIT(lines 3 9) no Hoare annotation was computed. [2020-07-17 22:23:32,317 INFO L264 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n)) [2020-07-17 22:23:32,317 INFO L268 CegarLoopResult]: For program point L7-1(line 7) no Hoare annotation was computed. [2020-07-17 22:23:32,317 INFO L268 CegarLoopResult]: For program point L4(lines 4 8) no Hoare annotation was computed. [2020-07-17 22:23:32,317 INFO L268 CegarLoopResult]: For program point sumFINAL(lines 3 9) no Hoare annotation was computed. [2020-07-17 22:23:32,317 INFO L271 CegarLoopResult]: At program point sumENTRY(lines 3 9) the Hoare annotation is: true [2020-07-17 22:23:32,317 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2020-07-17 22:23:32,318 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 18) the Hoare annotation is: true [2020-07-17 22:23:32,318 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 11 18) no Hoare annotation was computed. [2020-07-17 22:23:32,318 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-17 22:23:32,318 INFO L268 CegarLoopResult]: For program point L15(lines 15 17) no Hoare annotation was computed. [2020-07-17 22:23:32,318 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (= 2 main_~a~0) [2020-07-17 22:23:32,318 INFO L268 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-07-17 22:23:32,318 INFO L268 CegarLoopResult]: For program point L15-2(lines 11 18) no Hoare annotation was computed. [2020-07-17 22:23:32,322 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:23:32,322 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:23:32,323 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:23:32,323 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:23:32,323 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:23:32,323 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:23:32,323 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-17 22:23:32,323 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:23:32,323 WARN L170 areAnnotationChecker]: sumFINAL has no Hoare annotation [2020-07-17 22:23:32,323 WARN L170 areAnnotationChecker]: L7-1 has no Hoare annotation [2020-07-17 22:23:32,324 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-17 22:23:32,324 WARN L170 areAnnotationChecker]: sumEXIT has no Hoare annotation [2020-07-17 22:23:32,324 WARN L170 areAnnotationChecker]: sumEXIT has no Hoare annotation [2020-07-17 22:23:32,324 WARN L170 areAnnotationChecker]: L7-1 has no Hoare annotation [2020-07-17 22:23:32,324 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-17 22:23:32,324 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-17 22:23:32,324 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-17 22:23:32,324 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-17 22:23:32,325 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2020-07-17 22:23:32,325 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:23:32,325 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:23:32,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:23:32 BoogieIcfgContainer [2020-07-17 22:23:32,327 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:23:32,332 INFO L168 Benchmark]: Toolchain (without parser) took 4520.12 ms. Allocated memory was 140.0 MB in the beginning and 246.4 MB in the end (delta: 106.4 MB). Free memory was 105.3 MB in the beginning and 116.2 MB in the end (delta: -10.9 MB). Peak memory consumption was 95.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:23:32,332 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 140.0 MB. Free memory was 123.1 MB in the beginning and 122.9 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:32,338 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.28 ms. Allocated memory is still 140.0 MB. Free memory was 104.9 MB in the beginning and 95.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:23:32,339 INFO L168 Benchmark]: Boogie Preprocessor took 25.17 ms. Allocated memory is still 140.0 MB. Free memory was 95.4 MB in the beginning and 94.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:23:32,339 INFO L168 Benchmark]: RCFGBuilder took 344.59 ms. Allocated memory was 140.0 MB in the beginning and 201.3 MB in the end (delta: 61.3 MB). Free memory was 94.1 MB in the beginning and 166.5 MB in the end (delta: -72.5 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:23:32,340 INFO L168 Benchmark]: TraceAbstraction took 3927.25 ms. Allocated memory was 201.3 MB in the beginning and 246.4 MB in the end (delta: 45.1 MB). Free memory was 166.5 MB in the beginning and 116.2 MB in the end (delta: 50.3 MB). Peak memory consumption was 95.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:23:32,343 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.17 ms. Allocated memory is still 140.0 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 216.28 ms. Allocated memory is still 140.0 MB. Free memory was 104.9 MB in the beginning and 95.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.17 ms. Allocated memory is still 140.0 MB. Free memory was 95.4 MB in the beginning and 94.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 344.59 ms. Allocated memory was 140.0 MB in the beginning and 201.3 MB in the end (delta: 61.3 MB). Free memory was 94.1 MB in the beginning and 166.5 MB in the end (delta: -72.5 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3927.25 ms. Allocated memory was 201.3 MB in the beginning and 246.4 MB in the end (delta: 45.1 MB). Free memory was 166.5 MB in the beginning and 116.2 MB in the end (delta: 50.3 MB). Peak memory consumption was 95.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.7s, OverallIterations: 3, TraceHistogramMax: 3, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 38 SDtfs, 38 SDslu, 159 SDs, 0 SdLazy, 185 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.7s 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 9 NumberOfFragments, 18 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 4 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 8760 SizeOfPredicates, 11 NumberOfNonLiveVariables, 126 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 21/36 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 correct! Received shutdown request...