/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/Addition02.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 00:33:47,359 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:33:47,362 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:33:47,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:33:47,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:33:47,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:33:47,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:33:47,395 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:33:47,398 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:33:47,401 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:33:47,404 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:33:47,406 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:33:47,406 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:33:47,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:33:47,411 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:33:47,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:33:47,414 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:33:47,415 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:33:47,417 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:33:47,422 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:33:47,427 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:33:47,432 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:33:47,433 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:33:47,434 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:33:47,437 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:33:47,437 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:33:47,437 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:33:47,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:33:47,440 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:33:47,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:33:47,442 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:33:47,443 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:33:47,444 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:33:47,445 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:33:47,446 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:33:47,446 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:33:47,447 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:33:47,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:33:47,447 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:33:47,448 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:33:47,450 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:33:47,450 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 00:33:47,473 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:33:47,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:33:47,475 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:33:47,476 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:33:47,476 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:33:47,476 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:33:47,476 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:33:47,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:33:47,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:33:47,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:33:47,478 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:33:47,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:33:47,479 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:33:47,479 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:33:47,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:33:47,480 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:33:47,480 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:33:47,480 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:33:47,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:33:47,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:33:47,481 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:33:47,481 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:33:47,481 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 00:33:47,747 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:33:47,763 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:33:47,767 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:33:47,769 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:33:47,769 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:33:47,770 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Addition02.c [2020-07-11 00:33:47,847 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f5345f4d/e37f966f53264893a0d593cc71412105/FLAGdd9e4aab0 [2020-07-11 00:33:48,308 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:33:48,309 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Addition02.c [2020-07-11 00:33:48,316 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f5345f4d/e37f966f53264893a0d593cc71412105/FLAGdd9e4aab0 [2020-07-11 00:33:48,681 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f5345f4d/e37f966f53264893a0d593cc71412105 [2020-07-11 00:33:48,695 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:33:48,698 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:33:48,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:33:48,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:33:48,704 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:33:48,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:33:48" (1/1) ... [2020-07-11 00:33:48,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e4851ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:48, skipping insertion in model container [2020-07-11 00:33:48,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:33:48" (1/1) ... [2020-07-11 00:33:48,721 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:33:48,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:33:48,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:33:48,951 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:33:48,970 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:33:48,985 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:33:48,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:48 WrapperNode [2020-07-11 00:33:48,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:33:48,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:33:48,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:33:48,987 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:33:49,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:48" (1/1) ... [2020-07-11 00:33:49,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:48" (1/1) ... [2020-07-11 00:33:49,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:48" (1/1) ... [2020-07-11 00:33:49,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:48" (1/1) ... [2020-07-11 00:33:49,013 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:48" (1/1) ... [2020-07-11 00:33:49,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:48" (1/1) ... [2020-07-11 00:33:49,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:48" (1/1) ... [2020-07-11 00:33:49,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:33:49,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:33:49,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:33:49,020 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:33:49,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:48" (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-11 00:33:49,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:33:49,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:33:49,170 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2020-07-11 00:33:49,170 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:33:49,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:33:49,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 00:33:49,171 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2020-07-11 00:33:49,171 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:33:49,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:33:49,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:33:49,508 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:33:49,509 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-11 00:33:49,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:33:49 BoogieIcfgContainer [2020-07-11 00:33:49,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:33:49,515 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:33:49,515 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:33:49,520 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:33:49,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:33:48" (1/3) ... [2020-07-11 00:33:49,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4276ceae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:33:49, skipping insertion in model container [2020-07-11 00:33:49,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:48" (2/3) ... [2020-07-11 00:33:49,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4276ceae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:33:49, skipping insertion in model container [2020-07-11 00:33:49,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:33:49" (3/3) ... [2020-07-11 00:33:49,525 INFO L109 eAbstractionObserver]: Analyzing ICFG Addition02.c [2020-07-11 00:33:49,538 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:33:49,546 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:33:49,561 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:33:49,586 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:33:49,586 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:33:49,586 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:33:49,587 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:33:49,587 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:33:49,587 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:33:49,587 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:33:49,587 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:33:49,605 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2020-07-11 00:33:49,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-11 00:33:49,618 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:49,619 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:33:49,619 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:49,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:49,627 INFO L82 PathProgramCache]: Analyzing trace with hash 935018920, now seen corresponding path program 1 times [2020-07-11 00:33:49,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:49,640 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1724667235] [2020-07-11 00:33:49,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:49,981 INFO L280 TraceCheckUtils]: 0: Hoare triple {45#true} assume true; {45#true} is VALID [2020-07-11 00:33:49,982 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {45#true} {45#true} #58#return; {45#true} is VALID [2020-07-11 00:33:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:50,119 INFO L280 TraceCheckUtils]: 0: Hoare triple {45#true} ~m := #in~m; {58#(= |addition_#in~m| addition_~m)} is VALID [2020-07-11 00:33:50,121 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#(= |addition_#in~m| addition_~m)} ~n := #in~n; {59#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-11 00:33:50,122 INFO L280 TraceCheckUtils]: 2: Hoare triple {59#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume 0 == ~n; {60#(and (= 0 |addition_#in~n|) (= |addition_#in~m| addition_~m))} is VALID [2020-07-11 00:33:50,123 INFO L280 TraceCheckUtils]: 3: Hoare triple {60#(and (= 0 |addition_#in~n|) (= |addition_#in~m| addition_~m))} #res := ~m; {61#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-11 00:33:50,125 INFO L280 TraceCheckUtils]: 4: Hoare triple {61#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} assume true; {61#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-11 00:33:50,127 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {61#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} {49#(<= 0 main_~n~0)} #62#return; {56#(and (<= (+ |main_#t~ret4| main_~n~0) main_~m~0) (<= main_~m~0 (+ |main_#t~ret4| main_~n~0)))} is VALID [2020-07-11 00:33:50,129 INFO L263 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2020-07-11 00:33:50,129 INFO L280 TraceCheckUtils]: 1: Hoare triple {45#true} assume true; {45#true} is VALID [2020-07-11 00:33:50,130 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {45#true} {45#true} #58#return; {45#true} is VALID [2020-07-11 00:33:50,130 INFO L263 TraceCheckUtils]: 3: Hoare triple {45#true} call #t~ret5 := main(); {45#true} is VALID [2020-07-11 00:33:50,130 INFO L280 TraceCheckUtils]: 4: Hoare triple {45#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {45#true} is VALID [2020-07-11 00:33:50,131 INFO L280 TraceCheckUtils]: 5: Hoare triple {45#true} ~m~0 := #t~nondet2; {45#true} is VALID [2020-07-11 00:33:50,131 INFO L280 TraceCheckUtils]: 6: Hoare triple {45#true} havoc #t~nondet2; {45#true} is VALID [2020-07-11 00:33:50,132 INFO L280 TraceCheckUtils]: 7: Hoare triple {45#true} assume !(~m~0 < 0 || ~m~0 > 1073741823); {45#true} is VALID [2020-07-11 00:33:50,132 INFO L280 TraceCheckUtils]: 8: Hoare triple {45#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {45#true} is VALID [2020-07-11 00:33:50,133 INFO L280 TraceCheckUtils]: 9: Hoare triple {45#true} ~n~0 := #t~nondet3; {45#true} is VALID [2020-07-11 00:33:50,134 INFO L280 TraceCheckUtils]: 10: Hoare triple {45#true} havoc #t~nondet3; {45#true} is VALID [2020-07-11 00:33:50,135 INFO L280 TraceCheckUtils]: 11: Hoare triple {45#true} assume !(~n~0 < 0 || ~n~0 > 1073741823); {49#(<= 0 main_~n~0)} is VALID [2020-07-11 00:33:50,135 INFO L263 TraceCheckUtils]: 12: Hoare triple {49#(<= 0 main_~n~0)} call #t~ret4 := addition(~m~0, ~n~0); {45#true} is VALID [2020-07-11 00:33:50,137 INFO L280 TraceCheckUtils]: 13: Hoare triple {45#true} ~m := #in~m; {58#(= |addition_#in~m| addition_~m)} is VALID [2020-07-11 00:33:50,138 INFO L280 TraceCheckUtils]: 14: Hoare triple {58#(= |addition_#in~m| addition_~m)} ~n := #in~n; {59#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-11 00:33:50,139 INFO L280 TraceCheckUtils]: 15: Hoare triple {59#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume 0 == ~n; {60#(and (= 0 |addition_#in~n|) (= |addition_#in~m| addition_~m))} is VALID [2020-07-11 00:33:50,140 INFO L280 TraceCheckUtils]: 16: Hoare triple {60#(and (= 0 |addition_#in~n|) (= |addition_#in~m| addition_~m))} #res := ~m; {61#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-11 00:33:50,142 INFO L280 TraceCheckUtils]: 17: Hoare triple {61#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} assume true; {61#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-11 00:33:50,144 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {61#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} {49#(<= 0 main_~n~0)} #62#return; {56#(and (<= (+ |main_#t~ret4| main_~n~0) main_~m~0) (<= main_~m~0 (+ |main_#t~ret4| main_~n~0)))} is VALID [2020-07-11 00:33:50,145 INFO L280 TraceCheckUtils]: 19: Hoare triple {56#(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; {56#(and (<= (+ |main_#t~ret4| main_~n~0) main_~m~0) (<= main_~m~0 (+ |main_#t~ret4| main_~n~0)))} is VALID [2020-07-11 00:33:50,147 INFO L280 TraceCheckUtils]: 20: Hoare triple {56#(and (<= (+ |main_#t~ret4| main_~n~0) main_~m~0) (<= main_~m~0 (+ |main_#t~ret4| main_~n~0)))} ~result~0 := #t~ret4; {57#(and (<= main_~m~0 (+ main_~result~0 main_~n~0)) (<= (+ main_~result~0 main_~n~0) main_~m~0))} is VALID [2020-07-11 00:33:50,148 INFO L280 TraceCheckUtils]: 21: Hoare triple {57#(and (<= main_~m~0 (+ main_~result~0 main_~n~0)) (<= (+ main_~result~0 main_~n~0) main_~m~0))} havoc #t~ret4; {57#(and (<= main_~m~0 (+ main_~result~0 main_~n~0)) (<= (+ main_~result~0 main_~n~0) main_~m~0))} is VALID [2020-07-11 00:33:50,149 INFO L280 TraceCheckUtils]: 22: Hoare triple {57#(and (<= main_~m~0 (+ main_~result~0 main_~n~0)) (<= (+ main_~result~0 main_~n~0) main_~m~0))} assume !(~result~0 == ~m~0 - ~n~0); {46#false} is VALID [2020-07-11 00:33:50,150 INFO L280 TraceCheckUtils]: 23: Hoare triple {46#false} assume !false; {46#false} is VALID [2020-07-11 00:33:50,154 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-11 00:33:50,155 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1724667235] [2020-07-11 00:33:50,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:33:50,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-11 00:33:50,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596242929] [2020-07-11 00:33:50,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-07-11 00:33:50,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:50,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-11 00:33:50,216 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:50,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-11 00:33:50,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:50,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-11 00:33:50,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-11 00:33:50,230 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 9 states. [2020-07-11 00:33:51,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:51,022 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2020-07-11 00:33:51,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 00:33:51,022 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-07-11 00:33:51,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:51,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 00:33:51,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2020-07-11 00:33:51,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 00:33:51,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2020-07-11 00:33:51,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 65 transitions. [2020-07-11 00:33:51,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:51,141 INFO L225 Difference]: With dead ends: 56 [2020-07-11 00:33:51,141 INFO L226 Difference]: Without dead ends: 37 [2020-07-11 00:33:51,146 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-07-11 00:33:51,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-11 00:33:51,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-11 00:33:51,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:51,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2020-07-11 00:33:51,231 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-11 00:33:51,232 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-11 00:33:51,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:51,238 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2020-07-11 00:33:51,239 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2020-07-11 00:33:51,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:51,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:51,241 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-11 00:33:51,241 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-11 00:33:51,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:51,246 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2020-07-11 00:33:51,246 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2020-07-11 00:33:51,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:51,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:51,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:51,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:51,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-11 00:33:51,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2020-07-11 00:33:51,254 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 24 [2020-07-11 00:33:51,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:51,255 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2020-07-11 00:33:51,255 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-11 00:33:51,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 42 transitions. [2020-07-11 00:33:51,317 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-11 00:33:51,317 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2020-07-11 00:33:51,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-11 00:33:51,319 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:51,319 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:33:51,320 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:33:51,320 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:51,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:51,321 INFO L82 PathProgramCache]: Analyzing trace with hash 2135506668, now seen corresponding path program 1 times [2020-07-11 00:33:51,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:51,322 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [706177953] [2020-07-11 00:33:51,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:51,363 INFO L280 TraceCheckUtils]: 0: Hoare triple {334#true} assume true; {334#true} is VALID [2020-07-11 00:33:51,364 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {334#true} {334#true} #58#return; {334#true} is VALID [2020-07-11 00:33:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:51,431 INFO L280 TraceCheckUtils]: 0: Hoare triple {334#true} ~m := #in~m; {334#true} is VALID [2020-07-11 00:33:51,432 INFO L280 TraceCheckUtils]: 1: Hoare triple {334#true} ~n := #in~n; {346#(= |addition_#in~n| addition_~n)} is VALID [2020-07-11 00:33:51,433 INFO L280 TraceCheckUtils]: 2: Hoare triple {346#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {347#(and (= |addition_#in~n| addition_~n) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-11 00:33:51,434 INFO L280 TraceCheckUtils]: 3: Hoare triple {347#(and (= |addition_#in~n| addition_~n) (not (= 0 |addition_#in~n|)))} assume !(~n > 0); {348#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-11 00:33:51,435 INFO L280 TraceCheckUtils]: 4: Hoare triple {348#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} assume !(~n < 0); {348#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-11 00:33:51,436 INFO L280 TraceCheckUtils]: 5: Hoare triple {348#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} assume true; {348#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-11 00:33:51,438 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {348#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} {338#(<= 0 main_~n~0)} #62#return; {335#false} is VALID [2020-07-11 00:33:51,438 INFO L263 TraceCheckUtils]: 0: Hoare triple {334#true} call ULTIMATE.init(); {334#true} is VALID [2020-07-11 00:33:51,439 INFO L280 TraceCheckUtils]: 1: Hoare triple {334#true} assume true; {334#true} is VALID [2020-07-11 00:33:51,439 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {334#true} {334#true} #58#return; {334#true} is VALID [2020-07-11 00:33:51,439 INFO L263 TraceCheckUtils]: 3: Hoare triple {334#true} call #t~ret5 := main(); {334#true} is VALID [2020-07-11 00:33:51,440 INFO L280 TraceCheckUtils]: 4: Hoare triple {334#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {334#true} is VALID [2020-07-11 00:33:51,440 INFO L280 TraceCheckUtils]: 5: Hoare triple {334#true} ~m~0 := #t~nondet2; {334#true} is VALID [2020-07-11 00:33:51,440 INFO L280 TraceCheckUtils]: 6: Hoare triple {334#true} havoc #t~nondet2; {334#true} is VALID [2020-07-11 00:33:51,441 INFO L280 TraceCheckUtils]: 7: Hoare triple {334#true} assume !(~m~0 < 0 || ~m~0 > 1073741823); {334#true} is VALID [2020-07-11 00:33:51,441 INFO L280 TraceCheckUtils]: 8: Hoare triple {334#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {334#true} is VALID [2020-07-11 00:33:51,441 INFO L280 TraceCheckUtils]: 9: Hoare triple {334#true} ~n~0 := #t~nondet3; {334#true} is VALID [2020-07-11 00:33:51,441 INFO L280 TraceCheckUtils]: 10: Hoare triple {334#true} havoc #t~nondet3; {334#true} is VALID [2020-07-11 00:33:51,442 INFO L280 TraceCheckUtils]: 11: Hoare triple {334#true} assume !(~n~0 < 0 || ~n~0 > 1073741823); {338#(<= 0 main_~n~0)} is VALID [2020-07-11 00:33:51,443 INFO L263 TraceCheckUtils]: 12: Hoare triple {338#(<= 0 main_~n~0)} call #t~ret4 := addition(~m~0, ~n~0); {334#true} is VALID [2020-07-11 00:33:51,443 INFO L280 TraceCheckUtils]: 13: Hoare triple {334#true} ~m := #in~m; {334#true} is VALID [2020-07-11 00:33:51,444 INFO L280 TraceCheckUtils]: 14: Hoare triple {334#true} ~n := #in~n; {346#(= |addition_#in~n| addition_~n)} is VALID [2020-07-11 00:33:51,445 INFO L280 TraceCheckUtils]: 15: Hoare triple {346#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {347#(and (= |addition_#in~n| addition_~n) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-11 00:33:51,446 INFO L280 TraceCheckUtils]: 16: Hoare triple {347#(and (= |addition_#in~n| addition_~n) (not (= 0 |addition_#in~n|)))} assume !(~n > 0); {348#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-11 00:33:51,447 INFO L280 TraceCheckUtils]: 17: Hoare triple {348#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} assume !(~n < 0); {348#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-11 00:33:51,447 INFO L280 TraceCheckUtils]: 18: Hoare triple {348#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} assume true; {348#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-11 00:33:51,449 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {348#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} {338#(<= 0 main_~n~0)} #62#return; {335#false} is VALID [2020-07-11 00:33:51,449 INFO L280 TraceCheckUtils]: 20: Hoare triple {335#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {335#false} is VALID [2020-07-11 00:33:51,450 INFO L280 TraceCheckUtils]: 21: Hoare triple {335#false} ~result~0 := #t~ret4; {335#false} is VALID [2020-07-11 00:33:51,450 INFO L280 TraceCheckUtils]: 22: Hoare triple {335#false} havoc #t~ret4; {335#false} is VALID [2020-07-11 00:33:51,450 INFO L280 TraceCheckUtils]: 23: Hoare triple {335#false} assume !(~result~0 == ~m~0 - ~n~0); {335#false} is VALID [2020-07-11 00:33:51,451 INFO L280 TraceCheckUtils]: 24: Hoare triple {335#false} assume !false; {335#false} is VALID [2020-07-11 00:33:51,452 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-11 00:33:51,452 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [706177953] [2020-07-11 00:33:51,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:33:51,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 00:33:51,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923225420] [2020-07-11 00:33:51,455 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-07-11 00:33:51,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:51,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 00:33:51,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:51,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 00:33:51,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:51,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 00:33:51,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:33:51,485 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 6 states. [2020-07-11 00:33:51,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:51,814 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2020-07-11 00:33:51,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 00:33:51,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-07-11 00:33:51,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:51,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:33:51,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2020-07-11 00:33:51,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:33:51,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2020-07-11 00:33:51,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 64 transitions. [2020-07-11 00:33:51,931 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:51,934 INFO L225 Difference]: With dead ends: 56 [2020-07-11 00:33:51,934 INFO L226 Difference]: Without dead ends: 32 [2020-07-11 00:33:51,935 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-11 00:33:51,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-11 00:33:51,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-11 00:33:51,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:51,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-11 00:33:51,979 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-11 00:33:51,979 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-11 00:33:51,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:51,982 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-11 00:33:51,982 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-11 00:33:51,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:51,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:51,984 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-11 00:33:51,984 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-11 00:33:51,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:51,987 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-11 00:33:51,987 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-11 00:33:51,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:51,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:51,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:51,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:51,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-11 00:33:51,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-07-11 00:33:51,991 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 25 [2020-07-11 00:33:51,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:51,993 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-07-11 00:33:51,994 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 00:33:51,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 33 transitions. [2020-07-11 00:33:52,055 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-11 00:33:52,056 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-11 00:33:52,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-11 00:33:52,057 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:52,057 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:33:52,058 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:33:52,058 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:52,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:52,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1044754306, now seen corresponding path program 1 times [2020-07-11 00:33:52,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:52,059 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [180439606] [2020-07-11 00:33:52,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 00:33:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 00:33:52,110 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-11 00:33:52,111 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 00:33:52,111 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 00:33:52,144 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 00:33:52,144 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 00:33:52,145 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 00:33:52,145 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 00:33:52,145 WARN L170 areAnnotationChecker]: additionENTRY has no Hoare annotation [2020-07-11 00:33:52,145 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 00:33:52,145 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 00:33:52,145 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 00:33:52,145 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-11 00:33:52,145 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-11 00:33:52,146 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 00:33:52,146 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-11 00:33:52,146 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-11 00:33:52,146 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-11 00:33:52,146 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-11 00:33:52,146 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-11 00:33:52,146 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-11 00:33:52,149 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-11 00:33:52,149 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-11 00:33:52,150 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-11 00:33:52,150 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-11 00:33:52,150 WARN L170 areAnnotationChecker]: additionFINAL has no Hoare annotation [2020-07-11 00:33:52,150 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-11 00:33:52,158 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-11 00:33:52,158 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-11 00:33:52,158 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-11 00:33:52,158 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-11 00:33:52,159 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2020-07-11 00:33:52,159 WARN L170 areAnnotationChecker]: additionEXIT has no Hoare annotation [2020-07-11 00:33:52,159 WARN L170 areAnnotationChecker]: additionEXIT has no Hoare annotation [2020-07-11 00:33:52,159 WARN L170 areAnnotationChecker]: additionEXIT has no Hoare annotation [2020-07-11 00:33:52,160 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-11 00:33:52,160 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-11 00:33:52,160 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-11 00:33:52,160 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 00:33:52,160 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2020-07-11 00:33:52,160 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-11 00:33:52,160 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-11 00:33:52,160 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2020-07-11 00:33:52,160 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-11 00:33:52,161 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-11 00:33:52,161 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2020-07-11 00:33:52,161 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2020-07-11 00:33:52,161 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2020-07-11 00:33:52,161 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-11 00:33:52,161 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-11 00:33:52,161 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-11 00:33:52,162 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2020-07-11 00:33:52,162 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2020-07-11 00:33:52,162 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-11 00:33:52,162 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-11 00:33:52,162 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-11 00:33:52,162 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-11 00:33:52,162 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-11 00:33:52,163 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-11 00:33:52,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 12:33:52 BoogieIcfgContainer [2020-07-11 00:33:52,167 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 00:33:52,172 INFO L168 Benchmark]: Toolchain (without parser) took 3472.81 ms. Allocated memory was 138.9 MB in the beginning and 245.4 MB in the end (delta: 106.4 MB). Free memory was 103.3 MB in the beginning and 115.9 MB in the end (delta: -12.6 MB). Peak memory consumption was 93.8 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:52,173 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 138.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 00:33:52,174 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.17 ms. Allocated memory is still 138.9 MB. Free memory was 103.0 MB in the beginning and 93.2 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:52,175 INFO L168 Benchmark]: Boogie Preprocessor took 32.66 ms. Allocated memory is still 138.9 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-11 00:33:52,178 INFO L168 Benchmark]: RCFGBuilder took 494.14 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 91.6 MB in the beginning and 162.0 MB in the end (delta: -70.4 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:52,180 INFO L168 Benchmark]: TraceAbstraction took 2652.45 ms. Allocated memory was 203.9 MB in the beginning and 245.4 MB in the end (delta: 41.4 MB). Free memory was 161.4 MB in the beginning and 115.9 MB in the end (delta: 45.5 MB). Peak memory consumption was 86.9 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:52,195 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.27 ms. Allocated memory is still 138.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 286.17 ms. Allocated memory is still 138.9 MB. Free memory was 103.0 MB in the beginning and 93.2 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.66 ms. Allocated memory is still 138.9 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 494.14 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 91.6 MB in the beginning and 162.0 MB in the end (delta: -70.4 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2652.45 ms. Allocated memory was 203.9 MB in the beginning and 245.4 MB in the end (delta: 41.4 MB). Free memory was 161.4 MB in the beginning and 115.9 MB in the end (delta: 45.5 MB). Peak memory consumption was 86.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(); VAL [__VERIFIER_nondet_int()=0, m=0] [L28] COND FALSE !(m < 0 || m > 1073741823) VAL [m=0] [L33] int n = __VERIFIER_nondet_int(); VAL [__VERIFIER_nondet_int()=1, m=0, n=1] [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 VAL [\old(m)=1, \old(n)=0, m=1, 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); VAL [\old(m)=0, \old(n)=1, \result=1, addition(m+1, n-1)=1, m=0, n=1] [L39] RET, EXPR addition(m,n) VAL [addition(m,n)=1, m=0, n=1] [L39] int result = addition(m,n); VAL [addition(m,n)=1, m=0, n=1, result=1] [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, 42 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2.5s, OverallIterations: 3, TraceHistogramMax: 2, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 70 SDtfs, 84 SDslu, 208 SDs, 0 SdLazy, 154 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred 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.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 83 NumberOfCodeBlocks, 83 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 3437 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...