/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/Addition02.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 14:43:05,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:43:05,995 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:43:06,017 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:43:06,017 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:43:06,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:43:06,021 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:43:06,033 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:43:06,036 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:43:06,040 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:43:06,042 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:43:06,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:43:06,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:43:06,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:43:06,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:43:06,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:43:06,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:43:06,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:43:06,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:43:06,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:43:06,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:43:06,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:43:06,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:43:06,069 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:43:06,071 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:43:06,071 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:43:06,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:43:06,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:43:06,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:43:06,076 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:43:06,076 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:43:06,077 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:43:06,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:43:06,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:43:06,080 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:43:06,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:43:06,081 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:43:06,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:43:06,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:43:06,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:43:06,083 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:43:06,084 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-10 14:43:06,118 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:43:06,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:43:06,126 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:43:06,126 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:43:06,126 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:43:06,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:43:06,127 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:43:06,127 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:43:06,127 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:43:06,127 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:43:06,127 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:43:06,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:43:06,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:43:06,128 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:43:06,128 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:43:06,128 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:43:06,128 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:43:06,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:43:06,129 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:43:06,129 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:43:06,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:43:06,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:43:06,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:43:06,130 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:43:06,131 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:43:06,131 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:43:06,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:43:06,131 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:43:06,131 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:43:06,131 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:43:06,445 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:43:06,459 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:43:06,464 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:43:06,465 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:43:06,466 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:43:06,467 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Addition02.c [2020-07-10 14:43:06,540 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/938d92e9a/970bb27082894530beb4e01823c20c0c/FLAG7e0015de8 [2020-07-10 14:43:07,061 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:43:07,062 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Addition02.c [2020-07-10 14:43:07,071 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/938d92e9a/970bb27082894530beb4e01823c20c0c/FLAG7e0015de8 [2020-07-10 14:43:07,404 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/938d92e9a/970bb27082894530beb4e01823c20c0c [2020-07-10 14:43:07,414 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:43:07,416 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:43:07,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:43:07,419 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:43:07,423 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:43:07,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:43:07" (1/1) ... [2020-07-10 14:43:07,429 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20a1ed89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:07, skipping insertion in model container [2020-07-10 14:43:07,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:43:07" (1/1) ... [2020-07-10 14:43:07,438 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:43:07,460 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:43:07,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:43:07,711 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:43:07,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:43:07,743 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:43:07,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:07 WrapperNode [2020-07-10 14:43:07,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:43:07,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:43:07,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:43:07,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:43:07,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:07" (1/1) ... [2020-07-10 14:43:07,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:07" (1/1) ... [2020-07-10 14:43:07,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:07" (1/1) ... [2020-07-10 14:43:07,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:07" (1/1) ... [2020-07-10 14:43:07,772 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:07" (1/1) ... [2020-07-10 14:43:07,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:07" (1/1) ... [2020-07-10 14:43:07,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:07" (1/1) ... [2020-07-10 14:43:07,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:43:07,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:43:07,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:43:07,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:43:07,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:43:07,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:43:07,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:43:07,959 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2020-07-10 14:43:07,959 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:43:07,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:43:07,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 14:43:07,960 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2020-07-10 14:43:07,960 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:43:07,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:43:07,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:43:08,409 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:43:08,409 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 14:43:08,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:43:08 BoogieIcfgContainer [2020-07-10 14:43:08,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:43:08,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:43:08,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:43:08,418 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:43:08,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:43:07" (1/3) ... [2020-07-10 14:43:08,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f96cc86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:43:08, skipping insertion in model container [2020-07-10 14:43:08,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:07" (2/3) ... [2020-07-10 14:43:08,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f96cc86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:43:08, skipping insertion in model container [2020-07-10 14:43:08,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:43:08" (3/3) ... [2020-07-10 14:43:08,422 INFO L109 eAbstractionObserver]: Analyzing ICFG Addition02.c [2020-07-10 14:43:08,431 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:43:08,438 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:43:08,452 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:43:08,476 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:43:08,476 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:43:08,476 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:43:08,476 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:43:08,478 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:43:08,478 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:43:08,478 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:43:08,479 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:43:08,498 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-07-10 14:43:08,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-10 14:43:08,505 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:08,506 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:43:08,507 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:08,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:08,513 INFO L82 PathProgramCache]: Analyzing trace with hash -854965079, now seen corresponding path program 1 times [2020-07-10 14:43:08,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:08,524 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715822086] [2020-07-10 14:43:08,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:08,829 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-10 14:43:08,830 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {29#true} {29#true} #42#return; {29#true} is VALID [2020-07-10 14:43:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:08,909 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#true} ~m := #in~m;~n := #in~n; {40#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-10 14:43:08,911 INFO L280 TraceCheckUtils]: 1: Hoare triple {40#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume 0 == ~n;#res := ~m; {41#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-10 14:43:08,932 INFO L280 TraceCheckUtils]: 2: Hoare triple {41#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} assume true; {41#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-10 14:43:08,954 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {41#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} {33#(<= 0 main_~n~0)} #46#return; {38#(and (<= (+ |main_#t~ret4| main_~n~0) main_~m~0) (<= main_~m~0 (+ |main_#t~ret4| main_~n~0)))} is VALID [2020-07-10 14:43:08,955 INFO L263 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2020-07-10 14:43:08,956 INFO L280 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-10 14:43:08,956 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #42#return; {29#true} is VALID [2020-07-10 14:43:08,957 INFO L263 TraceCheckUtils]: 3: Hoare triple {29#true} call #t~ret5 := main(); {29#true} is VALID [2020-07-10 14:43:08,958 INFO L280 TraceCheckUtils]: 4: Hoare triple {29#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; {29#true} is VALID [2020-07-10 14:43:08,958 INFO L280 TraceCheckUtils]: 5: Hoare triple {29#true} assume !(~m~0 < 0 || ~m~0 > 1073741823);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {29#true} is VALID [2020-07-10 14:43:08,973 INFO L280 TraceCheckUtils]: 6: Hoare triple {29#true} assume !(~n~0 < 0 || ~n~0 > 1073741823); {33#(<= 0 main_~n~0)} is VALID [2020-07-10 14:43:08,974 INFO L263 TraceCheckUtils]: 7: Hoare triple {33#(<= 0 main_~n~0)} call #t~ret4 := addition(~m~0, ~n~0); {29#true} is VALID [2020-07-10 14:43:08,976 INFO L280 TraceCheckUtils]: 8: Hoare triple {29#true} ~m := #in~m;~n := #in~n; {40#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-10 14:43:08,982 INFO L280 TraceCheckUtils]: 9: Hoare triple {40#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume 0 == ~n;#res := ~m; {41#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-10 14:43:08,985 INFO L280 TraceCheckUtils]: 10: Hoare triple {41#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} assume true; {41#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-10 14:43:08,999 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {41#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} {33#(<= 0 main_~n~0)} #46#return; {38#(and (<= (+ |main_#t~ret4| main_~n~0) main_~m~0) (<= main_~m~0 (+ |main_#t~ret4| main_~n~0)))} is VALID [2020-07-10 14:43:09,018 INFO L280 TraceCheckUtils]: 12: Hoare triple {38#(and (<= (+ |main_#t~ret4| main_~n~0) main_~m~0) (<= main_~m~0 (+ |main_#t~ret4| main_~n~0)))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {39#(and (<= (+ main_~n~0 main_~result~0) main_~m~0) (<= main_~m~0 (+ main_~n~0 main_~result~0)))} is VALID [2020-07-10 14:43:09,032 INFO L280 TraceCheckUtils]: 13: Hoare triple {39#(and (<= (+ main_~n~0 main_~result~0) main_~m~0) (<= main_~m~0 (+ main_~n~0 main_~result~0)))} assume !(~result~0 == ~m~0 - ~n~0); {30#false} is VALID [2020-07-10 14:43:09,032 INFO L280 TraceCheckUtils]: 14: Hoare triple {30#false} assume !false; {30#false} is VALID [2020-07-10 14:43:09,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:43:09,035 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715822086] [2020-07-10 14:43:09,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:43:09,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 14:43:09,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651803558] [2020-07-10 14:43:09,043 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-07-10 14:43:09,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:09,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 14:43:09,090 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:43:09,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 14:43:09,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:09,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 14:43:09,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 14:43:09,105 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 7 states. [2020-07-10 14:43:09,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:09,670 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2020-07-10 14:43:09,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 14:43:09,670 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-07-10 14:43:09,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:09,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 14:43:09,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-10 14:43:09,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 14:43:09,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-10 14:43:09,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2020-07-10 14:43:09,758 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:43:09,771 INFO L225 Difference]: With dead ends: 38 [2020-07-10 14:43:09,771 INFO L226 Difference]: Without dead ends: 24 [2020-07-10 14:43:09,775 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-10 14:43:09,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-10 14:43:09,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-10 14:43:09,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:09,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-10 14:43:09,822 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-10 14:43:09,822 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-10 14:43:09,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:09,829 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-07-10 14:43:09,829 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-07-10 14:43:09,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:09,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:09,831 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-10 14:43:09,831 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-10 14:43:09,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:09,836 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-07-10 14:43:09,837 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-07-10 14:43:09,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:09,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:09,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:09,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:09,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-10 14:43:09,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2020-07-10 14:43:09,844 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 15 [2020-07-10 14:43:09,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:09,844 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-07-10 14:43:09,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 14:43:09,845 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-07-10 14:43:09,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 14:43:09,846 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:09,846 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:43:09,847 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:43:09,847 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:09,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:09,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1632999070, now seen corresponding path program 1 times [2020-07-10 14:43:09,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:09,848 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330024261] [2020-07-10 14:43:09,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:09,876 INFO L280 TraceCheckUtils]: 0: Hoare triple {176#true} assume true; {176#true} is VALID [2020-07-10 14:43:09,876 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {176#true} {176#true} #42#return; {176#true} is VALID [2020-07-10 14:43:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:09,914 INFO L280 TraceCheckUtils]: 0: Hoare triple {176#true} ~m := #in~m;~n := #in~n; {176#true} is VALID [2020-07-10 14:43:09,915 INFO L280 TraceCheckUtils]: 1: Hoare triple {176#true} assume !(0 == ~n); {186#(not (= 0 addition_~n))} is VALID [2020-07-10 14:43:09,916 INFO L280 TraceCheckUtils]: 2: Hoare triple {186#(not (= 0 addition_~n))} assume !(~n > 0); {187#(and (<= addition_~n 0) (not (= 0 addition_~n)))} is VALID [2020-07-10 14:43:09,917 INFO L280 TraceCheckUtils]: 3: Hoare triple {187#(and (<= addition_~n 0) (not (= 0 addition_~n)))} assume !(~n < 0); {177#false} is VALID [2020-07-10 14:43:09,918 INFO L280 TraceCheckUtils]: 4: Hoare triple {177#false} assume true; {177#false} is VALID [2020-07-10 14:43:09,918 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {177#false} {176#true} #46#return; {177#false} is VALID [2020-07-10 14:43:09,918 INFO L263 TraceCheckUtils]: 0: Hoare triple {176#true} call ULTIMATE.init(); {176#true} is VALID [2020-07-10 14:43:09,919 INFO L280 TraceCheckUtils]: 1: Hoare triple {176#true} assume true; {176#true} is VALID [2020-07-10 14:43:09,919 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {176#true} {176#true} #42#return; {176#true} is VALID [2020-07-10 14:43:09,919 INFO L263 TraceCheckUtils]: 3: Hoare triple {176#true} call #t~ret5 := main(); {176#true} is VALID [2020-07-10 14:43:09,920 INFO L280 TraceCheckUtils]: 4: Hoare triple {176#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; {176#true} is VALID [2020-07-10 14:43:09,920 INFO L280 TraceCheckUtils]: 5: Hoare triple {176#true} assume !(~m~0 < 0 || ~m~0 > 1073741823);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {176#true} is VALID [2020-07-10 14:43:09,920 INFO L280 TraceCheckUtils]: 6: Hoare triple {176#true} assume !(~n~0 < 0 || ~n~0 > 1073741823); {176#true} is VALID [2020-07-10 14:43:09,921 INFO L263 TraceCheckUtils]: 7: Hoare triple {176#true} call #t~ret4 := addition(~m~0, ~n~0); {176#true} is VALID [2020-07-10 14:43:09,921 INFO L280 TraceCheckUtils]: 8: Hoare triple {176#true} ~m := #in~m;~n := #in~n; {176#true} is VALID [2020-07-10 14:43:09,922 INFO L280 TraceCheckUtils]: 9: Hoare triple {176#true} assume !(0 == ~n); {186#(not (= 0 addition_~n))} is VALID [2020-07-10 14:43:09,923 INFO L280 TraceCheckUtils]: 10: Hoare triple {186#(not (= 0 addition_~n))} assume !(~n > 0); {187#(and (<= addition_~n 0) (not (= 0 addition_~n)))} is VALID [2020-07-10 14:43:09,924 INFO L280 TraceCheckUtils]: 11: Hoare triple {187#(and (<= addition_~n 0) (not (= 0 addition_~n)))} assume !(~n < 0); {177#false} is VALID [2020-07-10 14:43:09,924 INFO L280 TraceCheckUtils]: 12: Hoare triple {177#false} assume true; {177#false} is VALID [2020-07-10 14:43:09,924 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {177#false} {176#true} #46#return; {177#false} is VALID [2020-07-10 14:43:09,925 INFO L280 TraceCheckUtils]: 14: Hoare triple {177#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {177#false} is VALID [2020-07-10 14:43:09,925 INFO L280 TraceCheckUtils]: 15: Hoare triple {177#false} assume !(~result~0 == ~m~0 - ~n~0); {177#false} is VALID [2020-07-10 14:43:09,925 INFO L280 TraceCheckUtils]: 16: Hoare triple {177#false} assume !false; {177#false} is VALID [2020-07-10 14:43:09,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:43:09,927 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330024261] [2020-07-10 14:43:09,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:43:09,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 14:43:09,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349503390] [2020-07-10 14:43:09,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-10 14:43:09,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:09,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 14:43:09,949 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:43:09,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 14:43:09,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:09,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 14:43:09,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-10 14:43:09,950 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 4 states. [2020-07-10 14:43:10,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:10,035 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2020-07-10 14:43:10,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 14:43:10,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-10 14:43:10,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:10,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:43:10,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2020-07-10 14:43:10,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:43:10,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2020-07-10 14:43:10,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2020-07-10 14:43:10,103 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:43:10,105 INFO L225 Difference]: With dead ends: 34 [2020-07-10 14:43:10,105 INFO L226 Difference]: Without dead ends: 26 [2020-07-10 14:43:10,106 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-10 14:43:10,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-10 14:43:10,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2020-07-10 14:43:10,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:10,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2020-07-10 14:43:10,120 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2020-07-10 14:43:10,120 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2020-07-10 14:43:10,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:10,124 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-07-10 14:43:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-07-10 14:43:10,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:10,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:10,126 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2020-07-10 14:43:10,126 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2020-07-10 14:43:10,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:10,130 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-07-10 14:43:10,130 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-07-10 14:43:10,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:10,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:10,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:10,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:10,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-10 14:43:10,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2020-07-10 14:43:10,136 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 17 [2020-07-10 14:43:10,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:10,136 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-07-10 14:43:10,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 14:43:10,137 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-10 14:43:10,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 14:43:10,139 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:10,140 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:43:10,140 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 14:43:10,143 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:10,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:10,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1746800232, now seen corresponding path program 1 times [2020-07-10 14:43:10,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:10,144 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156325359] [2020-07-10 14:43:10,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:43:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:43:10,204 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 14:43:10,204 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 14:43:10,205 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 14:43:10,243 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 14:43:10,243 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 14:43:10,244 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 14:43:10,244 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 14:43:10,244 WARN L170 areAnnotationChecker]: additionENTRY has no Hoare annotation [2020-07-10 14:43:10,244 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:43:10,244 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 14:43:10,245 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 14:43:10,245 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-10 14:43:10,245 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-10 14:43:10,245 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-10 14:43:10,246 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-10 14:43:10,246 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:43:10,246 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 14:43:10,246 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-10 14:43:10,246 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-10 14:43:10,247 WARN L170 areAnnotationChecker]: additionFINAL has no Hoare annotation [2020-07-10 14:43:10,247 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 14:43:10,247 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 14:43:10,247 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 14:43:10,248 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-10 14:43:10,248 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-10 14:43:10,248 WARN L170 areAnnotationChecker]: additionEXIT has no Hoare annotation [2020-07-10 14:43:10,248 WARN L170 areAnnotationChecker]: additionEXIT has no Hoare annotation [2020-07-10 14:43:10,248 WARN L170 areAnnotationChecker]: additionEXIT has no Hoare annotation [2020-07-10 14:43:10,249 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 14:43:10,249 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 14:43:10,249 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-10 14:43:10,249 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-10 14:43:10,250 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-10 14:43:10,250 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-10 14:43:10,250 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-10 14:43:10,250 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-10 14:43:10,250 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-10 14:43:10,250 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-10 14:43:10,251 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-10 14:43:10,251 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-10 14:43:10,251 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-10 14:43:10,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-10 14:43:10,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 02:43:10 BoogieIcfgContainer [2020-07-10 14:43:10,255 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 14:43:10,259 INFO L168 Benchmark]: Toolchain (without parser) took 2842.30 ms. Allocated memory was 145.8 MB in the beginning and 235.9 MB in the end (delta: 90.2 MB). Free memory was 103.2 MB in the beginning and 112.5 MB in the end (delta: -9.4 MB). Peak memory consumption was 80.8 MB. Max. memory is 7.1 GB. [2020-07-10 14:43:10,260 INFO L168 Benchmark]: CDTParser took 1.16 ms. Allocated memory is still 145.8 MB. Free memory is still 121.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 14:43:10,261 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.10 ms. Allocated memory is still 145.8 MB. Free memory was 103.2 MB in the beginning and 93.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-10 14:43:10,262 INFO L168 Benchmark]: Boogie Preprocessor took 34.30 ms. Allocated memory is still 145.8 MB. Free memory was 93.2 MB in the beginning and 91.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-10 14:43:10,263 INFO L168 Benchmark]: RCFGBuilder took 634.24 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 91.8 MB in the beginning and 162.8 MB in the end (delta: -71.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-10 14:43:10,265 INFO L168 Benchmark]: TraceAbstraction took 1840.66 ms. Allocated memory was 202.4 MB in the beginning and 235.9 MB in the end (delta: 33.6 MB). Free memory was 161.8 MB in the beginning and 112.5 MB in the end (delta: 49.3 MB). Peak memory consumption was 82.9 MB. Max. memory is 7.1 GB. [2020-07-10 14:43:10,269 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.16 ms. Allocated memory is still 145.8 MB. Free memory is still 121.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 325.10 ms. Allocated memory is still 145.8 MB. Free memory was 103.2 MB in the beginning and 93.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.30 ms. Allocated memory is still 145.8 MB. Free memory was 93.2 MB in the beginning and 91.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 634.24 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 91.8 MB in the beginning and 162.8 MB in the end (delta: -71.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1840.66 ms. Allocated memory was 202.4 MB in the beginning and 235.9 MB in the end (delta: 33.6 MB). Free memory was 161.8 MB in the beginning and 112.5 MB in the end (delta: 49.3 MB). Peak memory consumption was 82.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 43]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L27] int m = __VERIFIER_nondet_int(); [L28] COND FALSE !(m < 0 || m > 1073741823) [L33] int n = __VERIFIER_nondet_int(); [L34] COND FALSE !(n < 0 || n > 1073741823) VAL [m=0, n=1] [L39] CALL, EXPR addition(m,n) VAL [\old(m)=0, \old(n)=1] [L14] COND FALSE !(n == 0) VAL [\old(m)=0, \old(n)=1, m=0, n=1] [L17] COND TRUE n > 0 VAL [\old(m)=0, \old(n)=1, m=0, n=1] [L18] CALL, EXPR addition(m+1, n-1) VAL [\old(m)=1, \old(n)=0] [L14] COND TRUE n == 0 [L15] return m; VAL [\old(m)=1, \old(n)=0, \result=1, m=1, n=0] [L18] RET, EXPR addition(m+1, n-1) VAL [\old(m)=0, \old(n)=1, addition(m+1, n-1)=1, m=0, n=1] [L18] return addition(m+1, n-1); [L39] RET, EXPR addition(m,n) VAL [addition(m,n)=1, m=0, n=1] [L39] int result = addition(m,n); [L40] COND FALSE !(result == m - n) VAL [m=0, n=1, result=1] [L43] __VERIFIER_error() VAL [m=0, n=1, result=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 2, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 51 SDtfs, 27 SDslu, 93 SDs, 0 SdLazy, 95 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 30 ConstructedInterpolants, 0 QuantifiedInterpolants, 1172 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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...