./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Addition01-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Addition01-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 91d2600fad1210650d8ad3da481cdcc11b280095 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 19:07:24,252 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 19:07:24,255 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 19:07:24,273 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 19:07:24,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 19:07:24,276 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 19:07:24,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 19:07:24,289 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 19:07:24,294 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 19:07:24,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 19:07:24,299 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 19:07:24,300 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 19:07:24,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 19:07:24,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 19:07:24,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 19:07:24,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 19:07:24,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 19:07:24,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 19:07:24,310 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 19:07:24,314 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 19:07:24,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 19:07:24,322 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 19:07:24,324 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 19:07:24,325 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 19:07:24,328 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 19:07:24,328 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 19:07:24,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 19:07:24,330 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 19:07:24,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 19:07:24,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 19:07:24,331 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 19:07:24,332 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 19:07:24,333 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 19:07:24,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 19:07:24,335 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 19:07:24,335 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 19:07:24,336 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 19:07:24,336 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 19:07:24,337 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 19:07:24,337 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 19:07:24,339 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 19:07:24,340 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 19:07:24,375 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 19:07:24,375 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 19:07:24,379 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 19:07:24,379 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 19:07:24,380 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 19:07:24,380 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 19:07:24,380 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 19:07:24,380 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 19:07:24,380 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 19:07:24,381 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 19:07:24,381 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 19:07:24,381 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 19:07:24,381 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 19:07:24,381 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 19:07:24,382 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 19:07:24,382 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 19:07:24,382 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 19:07:24,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 19:07:24,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 19:07:24,384 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 19:07:24,384 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 19:07:24,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 19:07:24,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 19:07:24,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 19:07:24,385 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 19:07:24,389 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 19:07:24,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 19:07:24,390 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 19:07:24,390 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 19:07:24,390 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 91d2600fad1210650d8ad3da481cdcc11b280095 [2020-07-28 19:07:24,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 19:07:24,716 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 19:07:24,719 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 19:07:24,721 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 19:07:24,721 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 19:07:24,722 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Addition01-2.c [2020-07-28 19:07:24,789 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adb158f96/4104d3ad257a4de88ba4dbfb5d0b885e/FLAG4764e156b [2020-07-28 19:07:25,230 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 19:07:25,231 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Addition01-2.c [2020-07-28 19:07:25,241 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adb158f96/4104d3ad257a4de88ba4dbfb5d0b885e/FLAG4764e156b [2020-07-28 19:07:25,632 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adb158f96/4104d3ad257a4de88ba4dbfb5d0b885e [2020-07-28 19:07:25,635 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 19:07:25,639 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 19:07:25,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 19:07:25,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 19:07:25,644 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 19:07:25,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:07:25" (1/1) ... [2020-07-28 19:07:25,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b85cab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:07:25, skipping insertion in model container [2020-07-28 19:07:25,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:07:25" (1/1) ... [2020-07-28 19:07:25,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 19:07:25,678 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 19:07:25,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:07:25,858 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 19:07:25,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:07:25,891 INFO L208 MainTranslator]: Completed translation [2020-07-28 19:07:25,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:07:25 WrapperNode [2020-07-28 19:07:25,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 19:07:25,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 19:07:25,893 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 19:07:25,893 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 19:07:25,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:07:25" (1/1) ... [2020-07-28 19:07:25,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:07:25" (1/1) ... [2020-07-28 19:07:25,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 19:07:25,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 19:07:25,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 19:07:25,992 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 19:07:26,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:07:25" (1/1) ... [2020-07-28 19:07:26,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:07:25" (1/1) ... [2020-07-28 19:07:26,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:07:25" (1/1) ... [2020-07-28 19:07:26,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:07:25" (1/1) ... [2020-07-28 19:07:26,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:07:25" (1/1) ... [2020-07-28 19:07:26,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:07:25" (1/1) ... [2020-07-28 19:07:26,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:07:25" (1/1) ... [2020-07-28 19:07:26,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 19:07:26,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 19:07:26,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 19:07:26,023 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 19:07:26,024 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:07:25" (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-28 19:07:26,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 19:07:26,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 19:07:26,092 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2020-07-28 19:07:26,093 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2020-07-28 19:07:26,450 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 19:07:26,450 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-28 19:07:26,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:07:26 BoogieIcfgContainer [2020-07-28 19:07:26,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 19:07:26,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 19:07:26,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 19:07:26,460 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 19:07:26,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 07:07:25" (1/3) ... [2020-07-28 19:07:26,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f7c09fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:07:26, skipping insertion in model container [2020-07-28 19:07:26,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:07:25" (2/3) ... [2020-07-28 19:07:26,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f7c09fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:07:26, skipping insertion in model container [2020-07-28 19:07:26,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:07:26" (3/3) ... [2020-07-28 19:07:26,464 INFO L109 eAbstractionObserver]: Analyzing ICFG Addition01-2.c [2020-07-28 19:07:26,472 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 19:07:26,480 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 19:07:26,492 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 19:07:26,520 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 19:07:26,521 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 19:07:26,521 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 19:07:26,521 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 19:07:26,521 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 19:07:26,521 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 19:07:26,521 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 19:07:26,521 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 19:07:26,541 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-07-28 19:07:26,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 19:07:26,549 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:07:26,550 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:07:26,550 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:07:26,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:07:26,557 INFO L82 PathProgramCache]: Analyzing trace with hash -2068195676, now seen corresponding path program 1 times [2020-07-28 19:07:26,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:07:26,569 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289986770] [2020-07-28 19:07:26,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:07:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:26,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:26,923 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} ~m := #in~m;~n := #in~n; {32#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-28 19:07:26,925 INFO L280 TraceCheckUtils]: 1: Hoare triple {32#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume 0 == ~n;#res := ~m; {33#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-28 19:07:26,926 INFO L280 TraceCheckUtils]: 2: Hoare triple {33#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} assume true; {33#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-28 19:07:26,928 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {33#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} {24#true} #44#return; {30#(and (<= |ULTIMATE.start_main_#t~ret4| (+ ULTIMATE.start_main_~m~0 ULTIMATE.start_main_~n~0)) (<= (+ ULTIMATE.start_main_~m~0 ULTIMATE.start_main_~n~0) |ULTIMATE.start_main_#t~ret4|))} is VALID [2020-07-28 19:07:26,931 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~result~0;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; {24#true} is VALID [2020-07-28 19:07:26,932 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume !(main_~m~0 < 0 || main_~m~0 > 1073741823);assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {24#true} is VALID [2020-07-28 19:07:26,932 INFO L280 TraceCheckUtils]: 2: Hoare triple {24#true} assume !(main_~n~0 < 0 || main_~n~0 > 1073741823); {24#true} is VALID [2020-07-28 19:07:26,933 INFO L263 TraceCheckUtils]: 3: Hoare triple {24#true} call main_#t~ret4 := addition(main_~m~0, main_~n~0); {24#true} is VALID [2020-07-28 19:07:26,934 INFO L280 TraceCheckUtils]: 4: Hoare triple {24#true} ~m := #in~m;~n := #in~n; {32#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-28 19:07:26,935 INFO L280 TraceCheckUtils]: 5: Hoare triple {32#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume 0 == ~n;#res := ~m; {33#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-28 19:07:26,936 INFO L280 TraceCheckUtils]: 6: Hoare triple {33#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} assume true; {33#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-28 19:07:26,938 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {33#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} {24#true} #44#return; {30#(and (<= |ULTIMATE.start_main_#t~ret4| (+ ULTIMATE.start_main_~m~0 ULTIMATE.start_main_~n~0)) (<= (+ ULTIMATE.start_main_~m~0 ULTIMATE.start_main_~n~0) |ULTIMATE.start_main_#t~ret4|))} is VALID [2020-07-28 19:07:26,940 INFO L280 TraceCheckUtils]: 8: Hoare triple {30#(and (<= |ULTIMATE.start_main_#t~ret4| (+ ULTIMATE.start_main_~m~0 ULTIMATE.start_main_~n~0)) (<= (+ ULTIMATE.start_main_~m~0 ULTIMATE.start_main_~n~0) |ULTIMATE.start_main_#t~ret4|))} assume -2147483648 <= main_#t~ret4 && main_#t~ret4 <= 2147483647;main_~result~0 := main_#t~ret4;havoc main_#t~ret4; {31#(and (<= (+ ULTIMATE.start_main_~m~0 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~result~0) (< ULTIMATE.start_main_~result~0 (+ ULTIMATE.start_main_~m~0 ULTIMATE.start_main_~n~0 1)))} is VALID [2020-07-28 19:07:26,941 INFO L280 TraceCheckUtils]: 9: Hoare triple {31#(and (<= (+ ULTIMATE.start_main_~m~0 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~result~0) (< ULTIMATE.start_main_~result~0 (+ ULTIMATE.start_main_~m~0 ULTIMATE.start_main_~n~0 1)))} assume !(main_~result~0 == main_~m~0 + main_~n~0); {25#false} is VALID [2020-07-28 19:07:26,942 INFO L280 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID [2020-07-28 19:07:26,943 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-28 19:07:26,944 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289986770] [2020-07-28 19:07:26,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:07:26,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-28 19:07:26,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760525195] [2020-07-28 19:07:26,954 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-28 19:07:26,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:07:26,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 19:07:26,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:07:26,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 19:07:26,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:07:26,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 19:07:26,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-28 19:07:26,998 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 6 states. [2020-07-28 19:07:27,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:27,387 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2020-07-28 19:07:27,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 19:07:27,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-28 19:07:27,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:07:27,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 19:07:27,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2020-07-28 19:07:27,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 19:07:27,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2020-07-28 19:07:27,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2020-07-28 19:07:27,473 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:07:27,486 INFO L225 Difference]: With dead ends: 33 [2020-07-28 19:07:27,486 INFO L226 Difference]: Without dead ends: 20 [2020-07-28 19:07:27,490 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-28 19:07:27,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-28 19:07:27,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-28 19:07:27,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:07:27,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2020-07-28 19:07:27,535 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-28 19:07:27,536 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-28 19:07:27,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:27,542 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2020-07-28 19:07:27,542 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2020-07-28 19:07:27,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:07:27,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:07:27,543 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-28 19:07:27,544 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-28 19:07:27,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:27,549 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2020-07-28 19:07:27,549 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2020-07-28 19:07:27,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:07:27,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:07:27,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:07:27,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:07:27,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-28 19:07:27,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2020-07-28 19:07:27,556 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 11 [2020-07-28 19:07:27,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:07:27,557 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-07-28 19:07:27,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 19:07:27,557 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2020-07-28 19:07:27,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-28 19:07:27,558 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:07:27,559 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:07:27,559 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 19:07:27,559 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:07:27,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:07:27,560 INFO L82 PathProgramCache]: Analyzing trace with hash 800728349, now seen corresponding path program 1 times [2020-07-28 19:07:27,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:07:27,560 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708826386] [2020-07-28 19:07:27,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:07:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:27,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:27,659 INFO L280 TraceCheckUtils]: 0: Hoare triple {142#true} ~m := #in~m;~n := #in~n; {151#(= |addition_#in~n| addition_~n)} is VALID [2020-07-28 19:07:27,660 INFO L280 TraceCheckUtils]: 1: Hoare triple {151#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {152#(and (= |addition_#in~n| addition_~n) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-28 19:07:27,661 INFO L280 TraceCheckUtils]: 2: Hoare triple {152#(and (= |addition_#in~n| addition_~n) (not (= 0 |addition_#in~n|)))} assume !(~n > 0); {153#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-28 19:07:27,662 INFO L280 TraceCheckUtils]: 3: Hoare triple {153#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} assume !(~n < 0); {153#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-28 19:07:27,664 INFO L280 TraceCheckUtils]: 4: Hoare triple {153#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} assume true; {153#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-28 19:07:27,665 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {153#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} {144#(<= 0 ULTIMATE.start_main_~n~0)} #44#return; {143#false} is VALID [2020-07-28 19:07:27,666 INFO L280 TraceCheckUtils]: 0: Hoare triple {142#true} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~result~0;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; {142#true} is VALID [2020-07-28 19:07:27,666 INFO L280 TraceCheckUtils]: 1: Hoare triple {142#true} assume !(main_~m~0 < 0 || main_~m~0 > 1073741823);assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {142#true} is VALID [2020-07-28 19:07:27,667 INFO L280 TraceCheckUtils]: 2: Hoare triple {142#true} assume !(main_~n~0 < 0 || main_~n~0 > 1073741823); {144#(<= 0 ULTIMATE.start_main_~n~0)} is VALID [2020-07-28 19:07:27,668 INFO L263 TraceCheckUtils]: 3: Hoare triple {144#(<= 0 ULTIMATE.start_main_~n~0)} call main_#t~ret4 := addition(main_~m~0, main_~n~0); {142#true} is VALID [2020-07-28 19:07:27,669 INFO L280 TraceCheckUtils]: 4: Hoare triple {142#true} ~m := #in~m;~n := #in~n; {151#(= |addition_#in~n| addition_~n)} is VALID [2020-07-28 19:07:27,670 INFO L280 TraceCheckUtils]: 5: Hoare triple {151#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {152#(and (= |addition_#in~n| addition_~n) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-28 19:07:27,671 INFO L280 TraceCheckUtils]: 6: Hoare triple {152#(and (= |addition_#in~n| addition_~n) (not (= 0 |addition_#in~n|)))} assume !(~n > 0); {153#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-28 19:07:27,672 INFO L280 TraceCheckUtils]: 7: Hoare triple {153#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} assume !(~n < 0); {153#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-28 19:07:27,673 INFO L280 TraceCheckUtils]: 8: Hoare triple {153#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} assume true; {153#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-28 19:07:27,674 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {153#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} {144#(<= 0 ULTIMATE.start_main_~n~0)} #44#return; {143#false} is VALID [2020-07-28 19:07:27,675 INFO L280 TraceCheckUtils]: 10: Hoare triple {143#false} assume -2147483648 <= main_#t~ret4 && main_#t~ret4 <= 2147483647;main_~result~0 := main_#t~ret4;havoc main_#t~ret4; {143#false} is VALID [2020-07-28 19:07:27,675 INFO L280 TraceCheckUtils]: 11: Hoare triple {143#false} assume !(main_~result~0 == main_~m~0 + main_~n~0); {143#false} is VALID [2020-07-28 19:07:27,676 INFO L280 TraceCheckUtils]: 12: Hoare triple {143#false} assume !false; {143#false} is VALID [2020-07-28 19:07:27,677 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-28 19:07:27,677 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708826386] [2020-07-28 19:07:27,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:07:27,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-28 19:07:27,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619672851] [2020-07-28 19:07:27,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-07-28 19:07:27,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:07:27,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 19:07:27,700 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:07:27,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 19:07:27,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:07:27,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 19:07:27,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-28 19:07:27,702 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand 6 states. [2020-07-28 19:07:27,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:27,945 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2020-07-28 19:07:27,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 19:07:27,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-07-28 19:07:27,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:07:27,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 19:07:27,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2020-07-28 19:07:27,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 19:07:27,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2020-07-28 19:07:27,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2020-07-28 19:07:28,030 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:07:28,032 INFO L225 Difference]: With dead ends: 31 [2020-07-28 19:07:28,033 INFO L226 Difference]: Without dead ends: 17 [2020-07-28 19:07:28,034 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-28 19:07:28,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-28 19:07:28,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-28 19:07:28,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:07:28,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2020-07-28 19:07:28,044 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-28 19:07:28,044 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-28 19:07:28,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:28,047 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2020-07-28 19:07:28,047 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2020-07-28 19:07:28,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:07:28,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:07:28,049 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-28 19:07:28,049 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-28 19:07:28,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:28,052 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2020-07-28 19:07:28,052 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2020-07-28 19:07:28,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:07:28,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:07:28,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:07:28,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:07:28,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-28 19:07:28,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2020-07-28 19:07:28,057 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2020-07-28 19:07:28,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:07:28,058 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-07-28 19:07:28,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 19:07:28,058 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2020-07-28 19:07:28,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-28 19:07:28,060 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:07:28,060 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:07:28,061 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 19:07:28,061 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:07:28,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:07:28,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1352688745, now seen corresponding path program 1 times [2020-07-28 19:07:28,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:07:28,063 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120900690] [2020-07-28 19:07:28,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:07:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:28,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:28,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:28,328 INFO L280 TraceCheckUtils]: 0: Hoare triple {247#true} ~m := #in~m;~n := #in~n; {262#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-28 19:07:28,330 INFO L280 TraceCheckUtils]: 1: Hoare triple {262#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume 0 == ~n;#res := ~m; {270#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-28 19:07:28,331 INFO L280 TraceCheckUtils]: 2: Hoare triple {270#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} assume true; {270#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-28 19:07:28,333 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {270#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} {263#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m) (<= 1 addition_~n))} #46#return; {268#(and (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#t~ret0|) (<= |addition_#t~ret0| (+ |addition_#in~n| |addition_#in~m|)))} is VALID [2020-07-28 19:07:28,335 INFO L280 TraceCheckUtils]: 0: Hoare triple {247#true} ~m := #in~m;~n := #in~n; {262#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-28 19:07:28,336 INFO L280 TraceCheckUtils]: 1: Hoare triple {262#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume !(0 == ~n); {262#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-28 19:07:28,338 INFO L280 TraceCheckUtils]: 2: Hoare triple {262#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume ~n > 0; {263#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m) (<= 1 addition_~n))} is VALID [2020-07-28 19:07:28,338 INFO L263 TraceCheckUtils]: 3: Hoare triple {263#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m) (<= 1 addition_~n))} call #t~ret0 := addition(1 + ~m, ~n - 1); {247#true} is VALID [2020-07-28 19:07:28,339 INFO L280 TraceCheckUtils]: 4: Hoare triple {247#true} ~m := #in~m;~n := #in~n; {262#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-28 19:07:28,340 INFO L280 TraceCheckUtils]: 5: Hoare triple {262#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume 0 == ~n;#res := ~m; {270#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-28 19:07:28,341 INFO L280 TraceCheckUtils]: 6: Hoare triple {270#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} assume true; {270#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-28 19:07:28,344 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {270#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} {263#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m) (<= 1 addition_~n))} #46#return; {268#(and (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#t~ret0|) (<= |addition_#t~ret0| (+ |addition_#in~n| |addition_#in~m|)))} is VALID [2020-07-28 19:07:28,345 INFO L280 TraceCheckUtils]: 8: Hoare triple {268#(and (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#t~ret0|) (<= |addition_#t~ret0| (+ |addition_#in~n| |addition_#in~m|)))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {269#(and (<= |addition_#res| (+ |addition_#in~n| |addition_#in~m|)) (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#res|))} is VALID [2020-07-28 19:07:28,346 INFO L280 TraceCheckUtils]: 9: Hoare triple {269#(and (<= |addition_#res| (+ |addition_#in~n| |addition_#in~m|)) (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#res|))} assume true; {269#(and (<= |addition_#res| (+ |addition_#in~n| |addition_#in~m|)) (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#res|))} is VALID [2020-07-28 19:07:28,348 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {269#(and (<= |addition_#res| (+ |addition_#in~n| |addition_#in~m|)) (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#res|))} {247#true} #44#return; {260#(and (<= |ULTIMATE.start_main_#t~ret4| (+ ULTIMATE.start_main_~m~0 ULTIMATE.start_main_~n~0)) (<= (+ ULTIMATE.start_main_~m~0 ULTIMATE.start_main_~n~0) |ULTIMATE.start_main_#t~ret4|))} is VALID [2020-07-28 19:07:28,349 INFO L280 TraceCheckUtils]: 0: Hoare triple {247#true} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~result~0;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; {247#true} is VALID [2020-07-28 19:07:28,349 INFO L280 TraceCheckUtils]: 1: Hoare triple {247#true} assume !(main_~m~0 < 0 || main_~m~0 > 1073741823);assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {247#true} is VALID [2020-07-28 19:07:28,350 INFO L280 TraceCheckUtils]: 2: Hoare triple {247#true} assume !(main_~n~0 < 0 || main_~n~0 > 1073741823); {247#true} is VALID [2020-07-28 19:07:28,350 INFO L263 TraceCheckUtils]: 3: Hoare triple {247#true} call main_#t~ret4 := addition(main_~m~0, main_~n~0); {247#true} is VALID [2020-07-28 19:07:28,351 INFO L280 TraceCheckUtils]: 4: Hoare triple {247#true} ~m := #in~m;~n := #in~n; {262#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-28 19:07:28,352 INFO L280 TraceCheckUtils]: 5: Hoare triple {262#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume !(0 == ~n); {262#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-28 19:07:28,354 INFO L280 TraceCheckUtils]: 6: Hoare triple {262#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume ~n > 0; {263#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m) (<= 1 addition_~n))} is VALID [2020-07-28 19:07:28,354 INFO L263 TraceCheckUtils]: 7: Hoare triple {263#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m) (<= 1 addition_~n))} call #t~ret0 := addition(1 + ~m, ~n - 1); {247#true} is VALID [2020-07-28 19:07:28,355 INFO L280 TraceCheckUtils]: 8: Hoare triple {247#true} ~m := #in~m;~n := #in~n; {262#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-28 19:07:28,356 INFO L280 TraceCheckUtils]: 9: Hoare triple {262#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume 0 == ~n;#res := ~m; {270#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-28 19:07:28,357 INFO L280 TraceCheckUtils]: 10: Hoare triple {270#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} assume true; {270#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-28 19:07:28,359 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {270#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} {263#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m) (<= 1 addition_~n))} #46#return; {268#(and (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#t~ret0|) (<= |addition_#t~ret0| (+ |addition_#in~n| |addition_#in~m|)))} is VALID [2020-07-28 19:07:28,361 INFO L280 TraceCheckUtils]: 12: Hoare triple {268#(and (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#t~ret0|) (<= |addition_#t~ret0| (+ |addition_#in~n| |addition_#in~m|)))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {269#(and (<= |addition_#res| (+ |addition_#in~n| |addition_#in~m|)) (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#res|))} is VALID [2020-07-28 19:07:28,362 INFO L280 TraceCheckUtils]: 13: Hoare triple {269#(and (<= |addition_#res| (+ |addition_#in~n| |addition_#in~m|)) (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#res|))} assume true; {269#(and (<= |addition_#res| (+ |addition_#in~n| |addition_#in~m|)) (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#res|))} is VALID [2020-07-28 19:07:28,364 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {269#(and (<= |addition_#res| (+ |addition_#in~n| |addition_#in~m|)) (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#res|))} {247#true} #44#return; {260#(and (<= |ULTIMATE.start_main_#t~ret4| (+ ULTIMATE.start_main_~m~0 ULTIMATE.start_main_~n~0)) (<= (+ ULTIMATE.start_main_~m~0 ULTIMATE.start_main_~n~0) |ULTIMATE.start_main_#t~ret4|))} is VALID [2020-07-28 19:07:28,366 INFO L280 TraceCheckUtils]: 15: Hoare triple {260#(and (<= |ULTIMATE.start_main_#t~ret4| (+ ULTIMATE.start_main_~m~0 ULTIMATE.start_main_~n~0)) (<= (+ ULTIMATE.start_main_~m~0 ULTIMATE.start_main_~n~0) |ULTIMATE.start_main_#t~ret4|))} assume -2147483648 <= main_#t~ret4 && main_#t~ret4 <= 2147483647;main_~result~0 := main_#t~ret4;havoc main_#t~ret4; {261#(and (<= (+ ULTIMATE.start_main_~m~0 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~result~0) (< ULTIMATE.start_main_~result~0 (+ ULTIMATE.start_main_~m~0 ULTIMATE.start_main_~n~0 1)))} is VALID [2020-07-28 19:07:28,368 INFO L280 TraceCheckUtils]: 16: Hoare triple {261#(and (<= (+ ULTIMATE.start_main_~m~0 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~result~0) (< ULTIMATE.start_main_~result~0 (+ ULTIMATE.start_main_~m~0 ULTIMATE.start_main_~n~0 1)))} assume !(main_~result~0 == main_~m~0 + main_~n~0); {248#false} is VALID [2020-07-28 19:07:28,368 INFO L280 TraceCheckUtils]: 17: Hoare triple {248#false} assume !false; {248#false} is VALID [2020-07-28 19:07:28,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 19:07:28,371 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120900690] [2020-07-28 19:07:28,371 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724928741] [2020-07-28 19:07:28,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:07:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:28,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-28 19:07:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:28,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:07:28,814 INFO L280 TraceCheckUtils]: 0: Hoare triple {247#true} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~result~0;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; {247#true} is VALID [2020-07-28 19:07:28,815 INFO L280 TraceCheckUtils]: 1: Hoare triple {247#true} assume !(main_~m~0 < 0 || main_~m~0 > 1073741823);assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {247#true} is VALID [2020-07-28 19:07:28,815 INFO L280 TraceCheckUtils]: 2: Hoare triple {247#true} assume !(main_~n~0 < 0 || main_~n~0 > 1073741823); {247#true} is VALID [2020-07-28 19:07:28,815 INFO L263 TraceCheckUtils]: 3: Hoare triple {247#true} call main_#t~ret4 := addition(main_~m~0, main_~n~0); {247#true} is VALID [2020-07-28 19:07:28,817 INFO L280 TraceCheckUtils]: 4: Hoare triple {247#true} ~m := #in~m;~n := #in~n; {262#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-28 19:07:28,818 INFO L280 TraceCheckUtils]: 5: Hoare triple {262#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume !(0 == ~n); {262#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-28 19:07:28,819 INFO L280 TraceCheckUtils]: 6: Hoare triple {262#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume ~n > 0; {263#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m) (<= 1 addition_~n))} is VALID [2020-07-28 19:07:28,819 INFO L263 TraceCheckUtils]: 7: Hoare triple {263#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m) (<= 1 addition_~n))} call #t~ret0 := addition(1 + ~m, ~n - 1); {247#true} is VALID [2020-07-28 19:07:28,821 INFO L280 TraceCheckUtils]: 8: Hoare triple {247#true} ~m := #in~m;~n := #in~n; {298#(and (<= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-28 19:07:28,822 INFO L280 TraceCheckUtils]: 9: Hoare triple {298#(and (<= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume 0 == ~n;#res := ~m; {302#(and (<= |addition_#in~n| 0) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-28 19:07:28,823 INFO L280 TraceCheckUtils]: 10: Hoare triple {302#(and (<= |addition_#in~n| 0) (= |addition_#in~m| |addition_#res|))} assume true; {302#(and (<= |addition_#in~n| 0) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-28 19:07:28,827 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {302#(and (<= |addition_#in~n| 0) (= |addition_#in~m| |addition_#res|))} {263#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m) (<= 1 addition_~n))} #46#return; {309#(and (<= 1 |addition_#in~n|) (<= |addition_#in~n| 1) (= (+ |addition_#in~m| 1) |addition_#t~ret0|))} is VALID [2020-07-28 19:07:28,828 INFO L280 TraceCheckUtils]: 12: Hoare triple {309#(and (<= 1 |addition_#in~n|) (<= |addition_#in~n| 1) (= (+ |addition_#in~m| 1) |addition_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {313#(and (<= 1 |addition_#in~n|) (<= |addition_#in~n| 1) (= |addition_#res| (+ |addition_#in~m| 1)))} is VALID [2020-07-28 19:07:28,829 INFO L280 TraceCheckUtils]: 13: Hoare triple {313#(and (<= 1 |addition_#in~n|) (<= |addition_#in~n| 1) (= |addition_#res| (+ |addition_#in~m| 1)))} assume true; {313#(and (<= 1 |addition_#in~n|) (<= |addition_#in~n| 1) (= |addition_#res| (+ |addition_#in~m| 1)))} is VALID [2020-07-28 19:07:28,831 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {313#(and (<= 1 |addition_#in~n|) (<= |addition_#in~n| 1) (= |addition_#res| (+ |addition_#in~m| 1)))} {247#true} #44#return; {320#(and (<= 1 ULTIMATE.start_main_~n~0) (= |ULTIMATE.start_main_#t~ret4| (+ ULTIMATE.start_main_~m~0 1)) (<= ULTIMATE.start_main_~n~0 1))} is VALID [2020-07-28 19:07:28,833 INFO L280 TraceCheckUtils]: 15: Hoare triple {320#(and (<= 1 ULTIMATE.start_main_~n~0) (= |ULTIMATE.start_main_#t~ret4| (+ ULTIMATE.start_main_~m~0 1)) (<= ULTIMATE.start_main_~n~0 1))} assume -2147483648 <= main_#t~ret4 && main_#t~ret4 <= 2147483647;main_~result~0 := main_#t~ret4;havoc main_#t~ret4; {324#(and (<= 1 ULTIMATE.start_main_~n~0) (= ULTIMATE.start_main_~result~0 (+ ULTIMATE.start_main_~m~0 1)) (<= ULTIMATE.start_main_~n~0 1))} is VALID [2020-07-28 19:07:28,835 INFO L280 TraceCheckUtils]: 16: Hoare triple {324#(and (<= 1 ULTIMATE.start_main_~n~0) (= ULTIMATE.start_main_~result~0 (+ ULTIMATE.start_main_~m~0 1)) (<= ULTIMATE.start_main_~n~0 1))} assume !(main_~result~0 == main_~m~0 + main_~n~0); {248#false} is VALID [2020-07-28 19:07:28,835 INFO L280 TraceCheckUtils]: 17: Hoare triple {248#false} assume !false; {248#false} is VALID [2020-07-28 19:07:28,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 19:07:28,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:07:28,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 15 [2020-07-28 19:07:28,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582934643] [2020-07-28 19:07:28,839 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2020-07-28 19:07:28,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:07:28,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-28 19:07:28,887 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:07:28,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-28 19:07:28,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:07:28,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-28 19:07:28,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2020-07-28 19:07:28,889 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 15 states. [2020-07-28 19:07:29,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:29,451 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2020-07-28 19:07:29,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-28 19:07:29,452 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2020-07-28 19:07:29,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:07:29,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-28 19:07:29,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2020-07-28 19:07:29,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-28 19:07:29,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2020-07-28 19:07:29,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 24 transitions. [2020-07-28 19:07:29,491 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-28 19:07:29,492 INFO L225 Difference]: With dead ends: 22 [2020-07-28 19:07:29,492 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 19:07:29,493 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2020-07-28 19:07:29,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 19:07:29,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 19:07:29,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:07:29,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 19:07:29,494 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 19:07:29,494 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 19:07:29,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:29,494 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 19:07:29,495 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 19:07:29,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:07:29,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:07:29,495 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 19:07:29,496 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 19:07:29,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:29,496 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 19:07:29,496 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 19:07:29,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:07:29,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:07:29,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:07:29,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:07:29,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 19:07:29,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 19:07:29,497 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2020-07-28 19:07:29,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:07:29,498 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 19:07:29,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-28 19:07:29,498 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 19:07:29,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:07:29,699 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-28 19:07:29,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 19:07:29,764 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 19:07:29,765 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 19:07:29,765 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 19:07:29,765 INFO L268 CegarLoopResult]: For program point L28(lines 28 32) no Hoare annotation was computed. [2020-07-28 19:07:29,765 INFO L271 CegarLoopResult]: At program point L26(lines 26 45) the Hoare annotation is: true [2020-07-28 19:07:29,765 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2020-07-28 19:07:29,766 INFO L268 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2020-07-28 19:07:29,766 INFO L268 CegarLoopResult]: For program point L40(lines 40 44) no Hoare annotation was computed. [2020-07-28 19:07:29,766 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (<= 0 ULTIMATE.start_main_~n~0) [2020-07-28 19:07:29,766 INFO L268 CegarLoopResult]: For program point L39-1(line 39) no Hoare annotation was computed. [2020-07-28 19:07:29,766 INFO L268 CegarLoopResult]: For program point L34(lines 34 38) no Hoare annotation was computed. [2020-07-28 19:07:29,766 INFO L268 CegarLoopResult]: For program point additionFINAL(lines 13 23) no Hoare annotation was computed. [2020-07-28 19:07:29,766 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m) (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|))) [2020-07-28 19:07:29,767 INFO L268 CegarLoopResult]: For program point L20(lines 20 22) no Hoare annotation was computed. [2020-07-28 19:07:29,767 INFO L268 CegarLoopResult]: For program point L21-1(line 21) no Hoare annotation was computed. [2020-07-28 19:07:29,767 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m) (<= 1 addition_~n)) [2020-07-28 19:07:29,767 INFO L268 CegarLoopResult]: For program point L17(lines 17 19) no Hoare annotation was computed. [2020-07-28 19:07:29,767 INFO L268 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-07-28 19:07:29,767 INFO L271 CegarLoopResult]: At program point additionENTRY(lines 13 23) the Hoare annotation is: true [2020-07-28 19:07:29,767 INFO L268 CegarLoopResult]: For program point L14(lines 14 16) no Hoare annotation was computed. [2020-07-28 19:07:29,767 INFO L268 CegarLoopResult]: For program point additionEXIT(lines 13 23) no Hoare annotation was computed. [2020-07-28 19:07:29,772 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 19:07:29,772 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-28 19:07:29,772 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-28 19:07:29,772 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-28 19:07:29,772 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-28 19:07:29,772 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-28 19:07:29,773 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 19:07:29,773 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-28 19:07:29,773 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-28 19:07:29,773 WARN L170 areAnnotationChecker]: additionFINAL has no Hoare annotation [2020-07-28 19:07:29,773 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-28 19:07:29,773 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-28 19:07:29,773 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 19:07:29,773 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-28 19:07:29,774 WARN L170 areAnnotationChecker]: additionEXIT has no Hoare annotation [2020-07-28 19:07:29,774 WARN L170 areAnnotationChecker]: additionEXIT has no Hoare annotation [2020-07-28 19:07:29,774 WARN L170 areAnnotationChecker]: additionEXIT has no Hoare annotation [2020-07-28 19:07:29,774 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-28 19:07:29,774 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-28 19:07:29,774 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-28 19:07:29,774 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-28 19:07:29,774 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-28 19:07:29,775 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-28 19:07:29,775 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-28 19:07:29,775 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-28 19:07:29,775 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-28 19:07:29,775 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-28 19:07:29,775 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-28 19:07:29,775 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 19:07:29,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 07:07:29 BoogieIcfgContainer [2020-07-28 19:07:29,786 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 19:07:29,787 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 19:07:29,787 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 19:07:29,787 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 19:07:29,788 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:07:26" (3/4) ... [2020-07-28 19:07:29,791 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 19:07:29,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure addition [2020-07-28 19:07:29,803 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-07-28 19:07:29,804 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-07-28 19:07:29,853 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 19:07:29,853 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 19:07:29,856 INFO L168 Benchmark]: Toolchain (without parser) took 4218.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.1 MB). Free memory was 950.9 MB in the beginning and 1.1 GB in the end (delta: -165.9 MB). Peak memory consumption was 42.2 MB. Max. memory is 11.5 GB. [2020-07-28 19:07:29,857 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 976.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:07:29,857 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.58 ms. Allocated memory is still 1.0 GB. Free memory was 950.9 MB in the beginning and 938.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2020-07-28 19:07:29,858 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -198.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 19:07:29,859 INFO L168 Benchmark]: Boogie Preprocessor took 31.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 19:07:29,859 INFO L168 Benchmark]: RCFGBuilder took 431.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2020-07-28 19:07:29,860 INFO L168 Benchmark]: TraceAbstraction took 3330.18 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -5.6 MB). Peak memory consumption was 62.0 MB. Max. memory is 11.5 GB. [2020-07-28 19:07:29,860 INFO L168 Benchmark]: Witness Printer took 66.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:07:29,864 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 976.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 252.58 ms. Allocated memory is still 1.0 GB. Free memory was 950.9 MB in the beginning and 938.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 97.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -198.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 431.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3330.18 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -5.6 MB). Peak memory consumption was 62.0 MB. Max. memory is 11.5 GB. * Witness Printer took 66.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.1s, OverallIterations: 3, TraceHistogramMax: 2, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 41 SDtfs, 41 SDslu, 101 SDs, 0 SdLazy, 213 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 11 PreInvPairs, 13 NumberOfFragments, 29 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 4 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 56 ConstructedInterpolants, 0 QuantifiedInterpolants, 4724 SizeOfPredicates, 7 NumberOfNonLiveVariables, 56 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 3/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...