./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_2-1.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-simple/fibo_2calls_2-1.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 0d7907681604b1ce9d21af31806cc60e045b313d ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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-simple/fibo_2calls_2-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 0d7907681604b1ce9d21af31806cc60e045b313d .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 19:10:03,514 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 19:10:03,516 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 19:10:03,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 19:10:03,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 19:10:03,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 19:10:03,531 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 19:10:03,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 19:10:03,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 19:10:03,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 19:10:03,537 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 19:10:03,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 19:10:03,538 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 19:10:03,540 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 19:10:03,541 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 19:10:03,542 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 19:10:03,543 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 19:10:03,544 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 19:10:03,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 19:10:03,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 19:10:03,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 19:10:03,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 19:10:03,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 19:10:03,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 19:10:03,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 19:10:03,556 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 19:10:03,557 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 19:10:03,558 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 19:10:03,558 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 19:10:03,559 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 19:10:03,560 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 19:10:03,560 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 19:10:03,561 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 19:10:03,562 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 19:10:03,563 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 19:10:03,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 19:10:03,564 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 19:10:03,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 19:10:03,565 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 19:10:03,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 19:10:03,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 19:10:03,567 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:10:03,582 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 19:10:03,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 19:10:03,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 19:10:03,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 19:10:03,585 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 19:10:03,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 19:10:03,585 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 19:10:03,586 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 19:10:03,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 19:10:03,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 19:10:03,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 19:10:03,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 19:10:03,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 19:10:03,587 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 19:10:03,587 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 19:10:03,588 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 19:10:03,588 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 19:10:03,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 19:10:03,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 19:10:03,589 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 19:10:03,589 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 19:10:03,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 19:10:03,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 19:10:03,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 19:10:03,590 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 19:10:03,591 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 19:10:03,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 19:10:03,591 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 19:10:03,591 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 19:10:03,592 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 -> 0d7907681604b1ce9d21af31806cc60e045b313d [2020-07-28 19:10:03,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 19:10:03,915 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 19:10:03,919 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 19:10:03,920 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 19:10:03,921 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 19:10:03,922 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_2-1.c [2020-07-28 19:10:03,979 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5ca596b3/dd0a8374b06a431d9ef0b74acbd81946/FLAGd6d8c8a85 [2020-07-28 19:10:04,350 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 19:10:04,351 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_2-1.c [2020-07-28 19:10:04,360 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5ca596b3/dd0a8374b06a431d9ef0b74acbd81946/FLAGd6d8c8a85 [2020-07-28 19:10:04,724 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5ca596b3/dd0a8374b06a431d9ef0b74acbd81946 [2020-07-28 19:10:04,728 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 19:10:04,731 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 19:10:04,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 19:10:04,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 19:10:04,741 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 19:10:04,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:10:04" (1/1) ... [2020-07-28 19:10:04,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a29b25e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:04, skipping insertion in model container [2020-07-28 19:10:04,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:10:04" (1/1) ... [2020-07-28 19:10:04,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 19:10:04,773 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 19:10:04,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:10:04,969 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 19:10:04,994 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:10:05,009 INFO L208 MainTranslator]: Completed translation [2020-07-28 19:10:05,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:05 WrapperNode [2020-07-28 19:10:05,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 19:10:05,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 19:10:05,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 19:10:05,011 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 19:10:05,024 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:10:05" (1/1) ... [2020-07-28 19:10:05,029 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:10:05" (1/1) ... [2020-07-28 19:10:05,044 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 19:10:05,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 19:10:05,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 19:10:05,045 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 19:10:05,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:05" (1/1) ... [2020-07-28 19:10:05,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:05" (1/1) ... [2020-07-28 19:10:05,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:05" (1/1) ... [2020-07-28 19:10:05,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:05" (1/1) ... [2020-07-28 19:10:05,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:05" (1/1) ... [2020-07-28 19:10:05,116 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:05" (1/1) ... [2020-07-28 19:10:05,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:05" (1/1) ... [2020-07-28 19:10:05,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 19:10:05,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 19:10:05,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 19:10:05,119 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 19:10:05,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:05" (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:10:05,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 19:10:05,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 19:10:05,185 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-07-28 19:10:05,186 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-07-28 19:10:05,186 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-07-28 19:10:05,187 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-07-28 19:10:05,593 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 19:10:05,593 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-28 19:10:05,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:10:05 BoogieIcfgContainer [2020-07-28 19:10:05,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 19:10:05,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 19:10:05,599 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 19:10:05,602 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 19:10:05,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 07:10:04" (1/3) ... [2020-07-28 19:10:05,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@179f99b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:10:05, skipping insertion in model container [2020-07-28 19:10:05,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:05" (2/3) ... [2020-07-28 19:10:05,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@179f99b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:10:05, skipping insertion in model container [2020-07-28 19:10:05,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:10:05" (3/3) ... [2020-07-28 19:10:05,606 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_2-1.c [2020-07-28 19:10:05,614 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 19:10:05,620 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 19:10:05,632 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 19:10:05,654 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 19:10:05,654 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 19:10:05,654 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 19:10:05,654 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 19:10:05,654 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 19:10:05,655 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 19:10:05,655 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 19:10:05,655 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 19:10:05,672 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-07-28 19:10:05,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 19:10:05,678 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:10:05,679 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:10:05,680 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:10:05,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:10:05,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2020-07-28 19:10:05,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:10:05,697 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370007599] [2020-07-28 19:10:05,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:10:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:05,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:10:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:05,918 INFO L280 TraceCheckUtils]: 0: Hoare triple {31#true} ~n := #in~n; {38#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-28 19:10:05,920 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {39#(<= |fibo1_#in~n| 0)} is VALID [2020-07-28 19:10:05,921 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#(<= |fibo1_#in~n| 0)} assume true; {39#(<= |fibo1_#in~n| 0)} is VALID [2020-07-28 19:10:05,924 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#(<= |fibo1_#in~n| 0)} {33#(<= 2 ULTIMATE.start_main_~x~0)} #46#return; {32#false} is VALID [2020-07-28 19:10:05,927 INFO L280 TraceCheckUtils]: 0: Hoare triple {31#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 2; {33#(<= 2 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 19:10:05,927 INFO L263 TraceCheckUtils]: 1: Hoare triple {33#(<= 2 ULTIMATE.start_main_~x~0)} call main_#t~ret4 := fibo1(main_~x~0); {31#true} is VALID [2020-07-28 19:10:05,928 INFO L280 TraceCheckUtils]: 2: Hoare triple {31#true} ~n := #in~n; {38#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-28 19:10:05,930 INFO L280 TraceCheckUtils]: 3: Hoare triple {38#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {39#(<= |fibo1_#in~n| 0)} is VALID [2020-07-28 19:10:05,932 INFO L280 TraceCheckUtils]: 4: Hoare triple {39#(<= |fibo1_#in~n| 0)} assume true; {39#(<= |fibo1_#in~n| 0)} is VALID [2020-07-28 19:10:05,935 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {39#(<= |fibo1_#in~n| 0)} {33#(<= 2 ULTIMATE.start_main_~x~0)} #46#return; {32#false} is VALID [2020-07-28 19:10:05,935 INFO L280 TraceCheckUtils]: 6: Hoare triple {32#false} assume -2147483648 <= main_#t~ret4 && main_#t~ret4 <= 2147483647;main_~result~0 := main_#t~ret4;havoc main_#t~ret4; {32#false} is VALID [2020-07-28 19:10:05,935 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#false} assume 1 == main_~result~0; {32#false} is VALID [2020-07-28 19:10:05,936 INFO L280 TraceCheckUtils]: 8: Hoare triple {32#false} assume !false; {32#false} is VALID [2020-07-28 19:10:05,937 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:10:05,937 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370007599] [2020-07-28 19:10:05,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:10:05,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 19:10:05,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397068500] [2020-07-28 19:10:05,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-07-28 19:10:05,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:10:05,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 19:10:05,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:10:05,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 19:10:05,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:10:05,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 19:10:05,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 19:10:05,983 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2020-07-28 19:10:06,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:06,418 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2020-07-28 19:10:06,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 19:10:06,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-07-28 19:10:06,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:10:06,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 19:10:06,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2020-07-28 19:10:06,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 19:10:06,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2020-07-28 19:10:06,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2020-07-28 19:10:06,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:10:06,533 INFO L225 Difference]: With dead ends: 38 [2020-07-28 19:10:06,533 INFO L226 Difference]: Without dead ends: 26 [2020-07-28 19:10:06,537 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-28 19:10:06,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-28 19:10:06,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-28 19:10:06,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:10:06,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2020-07-28 19:10:06,584 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-28 19:10:06,584 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-28 19:10:06,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:06,592 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2020-07-28 19:10:06,592 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-07-28 19:10:06,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:10:06,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:10:06,594 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-28 19:10:06,594 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-28 19:10:06,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:06,600 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2020-07-28 19:10:06,601 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-07-28 19:10:06,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:10:06,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:10:06,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:10:06,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:10:06,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-28 19:10:06,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2020-07-28 19:10:06,610 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2020-07-28 19:10:06,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:10:06,610 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-07-28 19:10:06,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 19:10:06,611 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-07-28 19:10:06,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 19:10:06,612 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:10:06,612 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:10:06,613 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 19:10:06,613 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:10:06,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:10:06,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2020-07-28 19:10:06,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:10:06,615 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252554158] [2020-07-28 19:10:06,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:10:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:06,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:10:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:06,692 INFO L280 TraceCheckUtils]: 0: Hoare triple {176#true} ~n := #in~n; {184#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-28 19:10:06,693 INFO L280 TraceCheckUtils]: 1: Hoare triple {184#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {184#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-28 19:10:06,694 INFO L280 TraceCheckUtils]: 2: Hoare triple {184#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {185#(<= |fibo1_#in~n| 1)} is VALID [2020-07-28 19:10:06,695 INFO L280 TraceCheckUtils]: 3: Hoare triple {185#(<= |fibo1_#in~n| 1)} assume true; {185#(<= |fibo1_#in~n| 1)} is VALID [2020-07-28 19:10:06,696 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {185#(<= |fibo1_#in~n| 1)} {178#(<= 2 ULTIMATE.start_main_~x~0)} #46#return; {177#false} is VALID [2020-07-28 19:10:06,698 INFO L280 TraceCheckUtils]: 0: Hoare triple {176#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 2; {178#(<= 2 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 19:10:06,698 INFO L263 TraceCheckUtils]: 1: Hoare triple {178#(<= 2 ULTIMATE.start_main_~x~0)} call main_#t~ret4 := fibo1(main_~x~0); {176#true} is VALID [2020-07-28 19:10:06,699 INFO L280 TraceCheckUtils]: 2: Hoare triple {176#true} ~n := #in~n; {184#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-28 19:10:06,700 INFO L280 TraceCheckUtils]: 3: Hoare triple {184#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {184#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-28 19:10:06,701 INFO L280 TraceCheckUtils]: 4: Hoare triple {184#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {185#(<= |fibo1_#in~n| 1)} is VALID [2020-07-28 19:10:06,702 INFO L280 TraceCheckUtils]: 5: Hoare triple {185#(<= |fibo1_#in~n| 1)} assume true; {185#(<= |fibo1_#in~n| 1)} is VALID [2020-07-28 19:10:06,703 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {185#(<= |fibo1_#in~n| 1)} {178#(<= 2 ULTIMATE.start_main_~x~0)} #46#return; {177#false} is VALID [2020-07-28 19:10:06,704 INFO L280 TraceCheckUtils]: 7: Hoare triple {177#false} assume -2147483648 <= main_#t~ret4 && main_#t~ret4 <= 2147483647;main_~result~0 := main_#t~ret4;havoc main_#t~ret4; {177#false} is VALID [2020-07-28 19:10:06,704 INFO L280 TraceCheckUtils]: 8: Hoare triple {177#false} assume 1 == main_~result~0; {177#false} is VALID [2020-07-28 19:10:06,704 INFO L280 TraceCheckUtils]: 9: Hoare triple {177#false} assume !false; {177#false} is VALID [2020-07-28 19:10:06,706 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:10:06,706 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252554158] [2020-07-28 19:10:06,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:10:06,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 19:10:06,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129132660] [2020-07-28 19:10:06,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-28 19:10:06,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:10:06,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 19:10:06,722 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:10:06,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 19:10:06,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:10:06,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 19:10:06,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 19:10:06,724 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 5 states. [2020-07-28 19:10:06,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:06,903 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-07-28 19:10:06,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 19:10:06,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-28 19:10:06,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:10:06,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 19:10:06,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2020-07-28 19:10:06,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 19:10:06,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2020-07-28 19:10:06,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2020-07-28 19:10:06,960 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:10:06,963 INFO L225 Difference]: With dead ends: 32 [2020-07-28 19:10:06,963 INFO L226 Difference]: Without dead ends: 28 [2020-07-28 19:10:06,964 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-28 19:10:06,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-28 19:10:06,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-07-28 19:10:06,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:10:06,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 26 states. [2020-07-28 19:10:06,978 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 26 states. [2020-07-28 19:10:06,978 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 26 states. [2020-07-28 19:10:06,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:06,986 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2020-07-28 19:10:06,986 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2020-07-28 19:10:06,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:10:06,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:10:06,988 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 28 states. [2020-07-28 19:10:06,989 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 28 states. [2020-07-28 19:10:06,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:06,995 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2020-07-28 19:10:06,997 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2020-07-28 19:10:06,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:10:07,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:10:07,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:10:07,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:10:07,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-28 19:10:07,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2020-07-28 19:10:07,008 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2020-07-28 19:10:07,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:10:07,009 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-07-28 19:10:07,009 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 19:10:07,009 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-07-28 19:10:07,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-28 19:10:07,013 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:10:07,013 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:10:07,014 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 19:10:07,014 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:10:07,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:10:07,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2020-07-28 19:10:07,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:10:07,017 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804092064] [2020-07-28 19:10:07,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:10:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:07,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:10:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:07,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:10:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:07,144 INFO L280 TraceCheckUtils]: 0: Hoare triple {318#true} ~n := #in~n; {348#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-28 19:10:07,145 INFO L280 TraceCheckUtils]: 1: Hoare triple {348#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {349#(<= |fibo2_#in~n| 0)} is VALID [2020-07-28 19:10:07,146 INFO L280 TraceCheckUtils]: 2: Hoare triple {349#(<= |fibo2_#in~n| 0)} assume true; {349#(<= |fibo2_#in~n| 0)} is VALID [2020-07-28 19:10:07,148 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {349#(<= |fibo2_#in~n| 0)} {339#(< 1 fibo1_~n)} #52#return; {319#false} is VALID [2020-07-28 19:10:07,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-28 19:10:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:07,155 INFO L280 TraceCheckUtils]: 0: Hoare triple {318#true} ~n := #in~n; {318#true} is VALID [2020-07-28 19:10:07,156 INFO L280 TraceCheckUtils]: 1: Hoare triple {318#true} assume ~n < 1;#res := 0; {318#true} is VALID [2020-07-28 19:10:07,156 INFO L280 TraceCheckUtils]: 2: Hoare triple {318#true} assume true; {318#true} is VALID [2020-07-28 19:10:07,156 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {318#true} {319#false} #54#return; {319#false} is VALID [2020-07-28 19:10:07,157 INFO L280 TraceCheckUtils]: 0: Hoare triple {318#true} ~n := #in~n; {318#true} is VALID [2020-07-28 19:10:07,158 INFO L280 TraceCheckUtils]: 1: Hoare triple {318#true} assume !(~n < 1); {338#(< 0 fibo1_~n)} is VALID [2020-07-28 19:10:07,159 INFO L280 TraceCheckUtils]: 2: Hoare triple {338#(< 0 fibo1_~n)} assume !(1 == ~n); {339#(< 1 fibo1_~n)} is VALID [2020-07-28 19:10:07,159 INFO L263 TraceCheckUtils]: 3: Hoare triple {339#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {318#true} is VALID [2020-07-28 19:10:07,160 INFO L280 TraceCheckUtils]: 4: Hoare triple {318#true} ~n := #in~n; {348#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-28 19:10:07,161 INFO L280 TraceCheckUtils]: 5: Hoare triple {348#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {349#(<= |fibo2_#in~n| 0)} is VALID [2020-07-28 19:10:07,161 INFO L280 TraceCheckUtils]: 6: Hoare triple {349#(<= |fibo2_#in~n| 0)} assume true; {349#(<= |fibo2_#in~n| 0)} is VALID [2020-07-28 19:10:07,163 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {349#(<= |fibo2_#in~n| 0)} {339#(< 1 fibo1_~n)} #52#return; {319#false} is VALID [2020-07-28 19:10:07,163 INFO L280 TraceCheckUtils]: 8: Hoare triple {319#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {319#false} is VALID [2020-07-28 19:10:07,164 INFO L263 TraceCheckUtils]: 9: Hoare triple {319#false} call #t~ret1 := fibo2(~n - 2); {318#true} is VALID [2020-07-28 19:10:07,164 INFO L280 TraceCheckUtils]: 10: Hoare triple {318#true} ~n := #in~n; {318#true} is VALID [2020-07-28 19:10:07,164 INFO L280 TraceCheckUtils]: 11: Hoare triple {318#true} assume ~n < 1;#res := 0; {318#true} is VALID [2020-07-28 19:10:07,165 INFO L280 TraceCheckUtils]: 12: Hoare triple {318#true} assume true; {318#true} is VALID [2020-07-28 19:10:07,165 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {318#true} {319#false} #54#return; {319#false} is VALID [2020-07-28 19:10:07,165 INFO L280 TraceCheckUtils]: 14: Hoare triple {319#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {319#false} is VALID [2020-07-28 19:10:07,166 INFO L280 TraceCheckUtils]: 15: Hoare triple {319#false} assume true; {319#false} is VALID [2020-07-28 19:10:07,166 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {319#false} {320#(<= 2 ULTIMATE.start_main_~x~0)} #46#return; {319#false} is VALID [2020-07-28 19:10:07,171 INFO L280 TraceCheckUtils]: 0: Hoare triple {318#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 2; {320#(<= 2 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 19:10:07,172 INFO L263 TraceCheckUtils]: 1: Hoare triple {320#(<= 2 ULTIMATE.start_main_~x~0)} call main_#t~ret4 := fibo1(main_~x~0); {318#true} is VALID [2020-07-28 19:10:07,172 INFO L280 TraceCheckUtils]: 2: Hoare triple {318#true} ~n := #in~n; {318#true} is VALID [2020-07-28 19:10:07,173 INFO L280 TraceCheckUtils]: 3: Hoare triple {318#true} assume !(~n < 1); {338#(< 0 fibo1_~n)} is VALID [2020-07-28 19:10:07,174 INFO L280 TraceCheckUtils]: 4: Hoare triple {338#(< 0 fibo1_~n)} assume !(1 == ~n); {339#(< 1 fibo1_~n)} is VALID [2020-07-28 19:10:07,175 INFO L263 TraceCheckUtils]: 5: Hoare triple {339#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {318#true} is VALID [2020-07-28 19:10:07,175 INFO L280 TraceCheckUtils]: 6: Hoare triple {318#true} ~n := #in~n; {348#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-28 19:10:07,176 INFO L280 TraceCheckUtils]: 7: Hoare triple {348#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {349#(<= |fibo2_#in~n| 0)} is VALID [2020-07-28 19:10:07,178 INFO L280 TraceCheckUtils]: 8: Hoare triple {349#(<= |fibo2_#in~n| 0)} assume true; {349#(<= |fibo2_#in~n| 0)} is VALID [2020-07-28 19:10:07,184 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {349#(<= |fibo2_#in~n| 0)} {339#(< 1 fibo1_~n)} #52#return; {319#false} is VALID [2020-07-28 19:10:07,185 INFO L280 TraceCheckUtils]: 10: Hoare triple {319#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {319#false} is VALID [2020-07-28 19:10:07,185 INFO L263 TraceCheckUtils]: 11: Hoare triple {319#false} call #t~ret1 := fibo2(~n - 2); {318#true} is VALID [2020-07-28 19:10:07,185 INFO L280 TraceCheckUtils]: 12: Hoare triple {318#true} ~n := #in~n; {318#true} is VALID [2020-07-28 19:10:07,186 INFO L280 TraceCheckUtils]: 13: Hoare triple {318#true} assume ~n < 1;#res := 0; {318#true} is VALID [2020-07-28 19:10:07,186 INFO L280 TraceCheckUtils]: 14: Hoare triple {318#true} assume true; {318#true} is VALID [2020-07-28 19:10:07,187 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {318#true} {319#false} #54#return; {319#false} is VALID [2020-07-28 19:10:07,187 INFO L280 TraceCheckUtils]: 16: Hoare triple {319#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {319#false} is VALID [2020-07-28 19:10:07,188 INFO L280 TraceCheckUtils]: 17: Hoare triple {319#false} assume true; {319#false} is VALID [2020-07-28 19:10:07,188 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {319#false} {320#(<= 2 ULTIMATE.start_main_~x~0)} #46#return; {319#false} is VALID [2020-07-28 19:10:07,188 INFO L280 TraceCheckUtils]: 19: Hoare triple {319#false} assume -2147483648 <= main_#t~ret4 && main_#t~ret4 <= 2147483647;main_~result~0 := main_#t~ret4;havoc main_#t~ret4; {319#false} is VALID [2020-07-28 19:10:07,188 INFO L280 TraceCheckUtils]: 20: Hoare triple {319#false} assume 1 == main_~result~0; {319#false} is VALID [2020-07-28 19:10:07,189 INFO L280 TraceCheckUtils]: 21: Hoare triple {319#false} assume !false; {319#false} is VALID [2020-07-28 19:10:07,194 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:10:07,195 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804092064] [2020-07-28 19:10:07,195 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332294698] [2020-07-28 19:10:07,196 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:10:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:07,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-28 19:10:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:07,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:10:07,644 INFO L280 TraceCheckUtils]: 0: Hoare triple {318#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 2; {320#(<= 2 ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 19:10:07,644 INFO L263 TraceCheckUtils]: 1: Hoare triple {320#(<= 2 ULTIMATE.start_main_~x~0)} call main_#t~ret4 := fibo1(main_~x~0); {318#true} is VALID [2020-07-28 19:10:07,645 INFO L280 TraceCheckUtils]: 2: Hoare triple {318#true} ~n := #in~n; {359#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-28 19:10:07,647 INFO L280 TraceCheckUtils]: 3: Hoare triple {359#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {359#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-28 19:10:07,648 INFO L280 TraceCheckUtils]: 4: Hoare triple {359#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {359#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-28 19:10:07,648 INFO L263 TraceCheckUtils]: 5: Hoare triple {359#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {318#true} is VALID [2020-07-28 19:10:07,649 INFO L280 TraceCheckUtils]: 6: Hoare triple {318#true} ~n := #in~n; {372#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-28 19:10:07,650 INFO L280 TraceCheckUtils]: 7: Hoare triple {372#(<= |fibo2_#in~n| fibo2_~n)} assume ~n < 1;#res := 0; {349#(<= |fibo2_#in~n| 0)} is VALID [2020-07-28 19:10:07,650 INFO L280 TraceCheckUtils]: 8: Hoare triple {349#(<= |fibo2_#in~n| 0)} assume true; {349#(<= |fibo2_#in~n| 0)} is VALID [2020-07-28 19:10:07,652 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {349#(<= |fibo2_#in~n| 0)} {359#(<= |fibo1_#in~n| fibo1_~n)} #52#return; {382#(<= |fibo1_#in~n| 1)} is VALID [2020-07-28 19:10:07,653 INFO L280 TraceCheckUtils]: 10: Hoare triple {382#(<= |fibo1_#in~n| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {382#(<= |fibo1_#in~n| 1)} is VALID [2020-07-28 19:10:07,653 INFO L263 TraceCheckUtils]: 11: Hoare triple {382#(<= |fibo1_#in~n| 1)} call #t~ret1 := fibo2(~n - 2); {318#true} is VALID [2020-07-28 19:10:07,653 INFO L280 TraceCheckUtils]: 12: Hoare triple {318#true} ~n := #in~n; {318#true} is VALID [2020-07-28 19:10:07,654 INFO L280 TraceCheckUtils]: 13: Hoare triple {318#true} assume ~n < 1;#res := 0; {318#true} is VALID [2020-07-28 19:10:07,654 INFO L280 TraceCheckUtils]: 14: Hoare triple {318#true} assume true; {318#true} is VALID [2020-07-28 19:10:07,656 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {318#true} {382#(<= |fibo1_#in~n| 1)} #54#return; {382#(<= |fibo1_#in~n| 1)} is VALID [2020-07-28 19:10:07,656 INFO L280 TraceCheckUtils]: 16: Hoare triple {382#(<= |fibo1_#in~n| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {382#(<= |fibo1_#in~n| 1)} is VALID [2020-07-28 19:10:07,657 INFO L280 TraceCheckUtils]: 17: Hoare triple {382#(<= |fibo1_#in~n| 1)} assume true; {382#(<= |fibo1_#in~n| 1)} is VALID [2020-07-28 19:10:07,658 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {382#(<= |fibo1_#in~n| 1)} {320#(<= 2 ULTIMATE.start_main_~x~0)} #46#return; {319#false} is VALID [2020-07-28 19:10:07,659 INFO L280 TraceCheckUtils]: 19: Hoare triple {319#false} assume -2147483648 <= main_#t~ret4 && main_#t~ret4 <= 2147483647;main_~result~0 := main_#t~ret4;havoc main_#t~ret4; {319#false} is VALID [2020-07-28 19:10:07,659 INFO L280 TraceCheckUtils]: 20: Hoare triple {319#false} assume 1 == main_~result~0; {319#false} is VALID [2020-07-28 19:10:07,660 INFO L280 TraceCheckUtils]: 21: Hoare triple {319#false} assume !false; {319#false} is VALID [2020-07-28 19:10:07,661 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:10:07,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:10:07,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-28 19:10:07,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788279516] [2020-07-28 19:10:07,663 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-07-28 19:10:07,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:10:07,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-28 19:10:07,712 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:10:07,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-28 19:10:07,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:10:07,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-28 19:10:07,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-28 19:10:07,714 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 10 states. [2020-07-28 19:10:08,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:08,311 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2020-07-28 19:10:08,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-28 19:10:08,312 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-07-28 19:10:08,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:10:08,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 19:10:08,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2020-07-28 19:10:08,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 19:10:08,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2020-07-28 19:10:08,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 71 transitions. [2020-07-28 19:10:08,472 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:10:08,474 INFO L225 Difference]: With dead ends: 54 [2020-07-28 19:10:08,474 INFO L226 Difference]: Without dead ends: 30 [2020-07-28 19:10:08,475 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-07-28 19:10:08,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-28 19:10:08,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-07-28 19:10:08,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:10:08,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 28 states. [2020-07-28 19:10:08,490 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 28 states. [2020-07-28 19:10:08,491 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 28 states. [2020-07-28 19:10:08,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:08,494 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2020-07-28 19:10:08,494 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2020-07-28 19:10:08,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:10:08,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:10:08,496 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states. [2020-07-28 19:10:08,496 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states. [2020-07-28 19:10:08,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:08,499 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2020-07-28 19:10:08,499 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2020-07-28 19:10:08,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:10:08,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:10:08,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:10:08,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:10:08,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-28 19:10:08,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2020-07-28 19:10:08,503 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 22 [2020-07-28 19:10:08,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:10:08,504 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-07-28 19:10:08,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-28 19:10:08,504 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-07-28 19:10:08,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-28 19:10:08,505 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:10:08,505 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:10:08,720 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-28 19:10:08,720 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:10:08,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:10:08,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2020-07-28 19:10:08,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:10:08,722 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591463070] [2020-07-28 19:10:08,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:10:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 19:10:08,742 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 19:10:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 19:10:08,762 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 19:10:08,777 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 19:10:08,777 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 19:10:08,777 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-28 19:10:08,792 FATAL L488 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret4 := fibo1(~x~0); [2020-07-28 19:10:08,793 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportCounterexampleResult(TraceAbstractionStarter.java:626) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResults(TraceAbstractionStarter.java:525) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-28 19:10:08,797 INFO L168 Benchmark]: Toolchain (without parser) took 4067.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.5 MB). Free memory was 950.8 MB in the beginning and 1.2 GB in the end (delta: -232.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:10:08,798 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:10:08,799 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.97 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 19:10:08,800 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.31 ms. Allocated memory is still 1.0 GB. Free memory is still 940.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:10:08,802 INFO L168 Benchmark]: Boogie Preprocessor took 74.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 940.1 MB in the beginning and 1.1 GB in the end (delta: -191.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 19:10:08,804 INFO L168 Benchmark]: RCFGBuilder took 478.73 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.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2020-07-28 19:10:08,806 INFO L168 Benchmark]: TraceAbstraction took 3195.54 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -70.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:10:08,811 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 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 276.97 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.31 ms. Allocated memory is still 1.0 GB. Free memory is still 940.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 940.1 MB in the beginning and 1.1 GB in the end (delta: -191.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 478.73 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.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3195.54 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -70.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:216) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 19:10:10,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 19:10:10,803 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 19:10:10,815 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 19:10:10,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 19:10:10,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 19:10:10,818 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 19:10:10,820 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 19:10:10,822 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 19:10:10,823 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 19:10:10,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 19:10:10,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 19:10:10,828 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 19:10:10,829 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 19:10:10,830 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 19:10:10,834 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 19:10:10,835 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 19:10:10,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 19:10:10,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 19:10:10,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 19:10:10,841 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 19:10:10,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 19:10:10,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 19:10:10,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 19:10:10,851 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 19:10:10,852 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 19:10:10,852 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 19:10:10,853 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 19:10:10,854 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 19:10:10,855 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 19:10:10,856 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 19:10:10,857 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 19:10:10,858 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 19:10:10,858 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 19:10:10,860 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 19:10:10,860 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 19:10:10,861 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 19:10:10,862 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 19:10:10,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 19:10:10,863 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 19:10:10,864 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 19:10:10,865 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-07-28 19:10:10,898 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 19:10:10,900 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 19:10:10,902 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 19:10:10,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 19:10:10,904 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 19:10:10,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 19:10:10,905 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 19:10:10,905 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 19:10:10,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 19:10:10,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 19:10:10,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 19:10:10,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 19:10:10,908 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 19:10:10,908 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 19:10:10,908 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 19:10:10,909 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 19:10:10,909 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 19:10:10,909 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 19:10:10,910 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 19:10:10,910 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 19:10:10,910 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 19:10:10,910 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 19:10:10,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 19:10:10,911 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 19:10:10,911 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 19:10:10,912 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 19:10:10,912 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 19:10:10,912 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 19:10:10,912 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 19:10:10,913 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 19:10:10,913 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 19:10:10,913 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 0d7907681604b1ce9d21af31806cc60e045b313d [2020-07-28 19:10:11,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 19:10:11,260 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 19:10:11,264 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 19:10:11,266 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 19:10:11,273 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 19:10:11,274 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_2-1.c [2020-07-28 19:10:11,343 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6aa27441/f27636be0791483c95a92f9fad9184d8/FLAG2c2e88379 [2020-07-28 19:10:11,807 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 19:10:11,808 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_2-1.c [2020-07-28 19:10:11,814 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6aa27441/f27636be0791483c95a92f9fad9184d8/FLAG2c2e88379 [2020-07-28 19:10:12,195 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6aa27441/f27636be0791483c95a92f9fad9184d8 [2020-07-28 19:10:12,198 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 19:10:12,202 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 19:10:12,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 19:10:12,203 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 19:10:12,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 19:10:12,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:10:12" (1/1) ... [2020-07-28 19:10:12,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ebfc50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:12, skipping insertion in model container [2020-07-28 19:10:12,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:10:12" (1/1) ... [2020-07-28 19:10:12,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 19:10:12,237 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 19:10:12,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:10:12,415 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 19:10:12,433 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:10:12,448 INFO L208 MainTranslator]: Completed translation [2020-07-28 19:10:12,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:12 WrapperNode [2020-07-28 19:10:12,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 19:10:12,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 19:10:12,449 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 19:10:12,450 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 19:10:12,458 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:10:12" (1/1) ... [2020-07-28 19:10:12,464 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:10:12" (1/1) ... [2020-07-28 19:10:12,534 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 19:10:12,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 19:10:12,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 19:10:12,535 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 19:10:12,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:12" (1/1) ... [2020-07-28 19:10:12,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:12" (1/1) ... [2020-07-28 19:10:12,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:12" (1/1) ... [2020-07-28 19:10:12,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:12" (1/1) ... [2020-07-28 19:10:12,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:12" (1/1) ... [2020-07-28 19:10:12,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:12" (1/1) ... [2020-07-28 19:10:12,553 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:12" (1/1) ... [2020-07-28 19:10:12,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 19:10:12,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 19:10:12,555 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 19:10:12,555 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 19:10:12,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:12" (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:10:12,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 19:10:12,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 19:10:12,612 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-07-28 19:10:12,612 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-07-28 19:10:12,612 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-07-28 19:10:12,612 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-07-28 19:10:12,919 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 19:10:12,919 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-28 19:10:12,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:10:12 BoogieIcfgContainer [2020-07-28 19:10:12,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 19:10:12,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 19:10:12,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 19:10:12,927 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 19:10:12,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 07:10:12" (1/3) ... [2020-07-28 19:10:12,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79de2e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:10:12, skipping insertion in model container [2020-07-28 19:10:12,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:10:12" (2/3) ... [2020-07-28 19:10:12,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79de2e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:10:12, skipping insertion in model container [2020-07-28 19:10:12,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:10:12" (3/3) ... [2020-07-28 19:10:12,930 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_2-1.c [2020-07-28 19:10:12,938 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 19:10:12,944 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 19:10:12,956 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 19:10:12,975 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 19:10:12,976 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 19:10:12,976 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 19:10:12,976 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 19:10:12,976 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 19:10:12,976 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 19:10:12,976 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 19:10:12,977 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 19:10:12,992 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-07-28 19:10:12,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 19:10:12,996 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:10:12,997 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:10:12,998 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:10:13,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:10:13,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1762602805, now seen corresponding path program 1 times [2020-07-28 19:10:13,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 19:10:13,015 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [876964141] [2020-07-28 19:10:13,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-07-28 19:10:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:13,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-28 19:10:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:13,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:10:13,194 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 2bv32; {34#(= (_ bv2 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 19:10:13,196 INFO L263 TraceCheckUtils]: 1: Hoare triple {34#(= (_ bv2 32) ULTIMATE.start_main_~x~0)} call main_#t~ret4 := fibo1(main_~x~0); {29#true} is VALID [2020-07-28 19:10:13,197 INFO L280 TraceCheckUtils]: 2: Hoare triple {29#true} ~n := #in~n; {41#(= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-28 19:10:13,199 INFO L280 TraceCheckUtils]: 3: Hoare triple {41#(= |fibo1_#in~n| fibo1_~n)} assume ~bvslt32(~n, 1bv32);#res := 0bv32; {45#(bvslt |fibo1_#in~n| (_ bv1 32))} is VALID [2020-07-28 19:10:13,200 INFO L280 TraceCheckUtils]: 4: Hoare triple {45#(bvslt |fibo1_#in~n| (_ bv1 32))} assume true; {45#(bvslt |fibo1_#in~n| (_ bv1 32))} is VALID [2020-07-28 19:10:13,202 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {45#(bvslt |fibo1_#in~n| (_ bv1 32))} {34#(= (_ bv2 32) ULTIMATE.start_main_~x~0)} #44#return; {30#false} is VALID [2020-07-28 19:10:13,203 INFO L280 TraceCheckUtils]: 6: Hoare triple {30#false} main_~result~0 := main_#t~ret4;havoc main_#t~ret4; {30#false} is VALID [2020-07-28 19:10:13,203 INFO L280 TraceCheckUtils]: 7: Hoare triple {30#false} assume 1bv32 == main_~result~0; {30#false} is VALID [2020-07-28 19:10:13,204 INFO L280 TraceCheckUtils]: 8: Hoare triple {30#false} assume !false; {30#false} is VALID [2020-07-28 19:10:13,207 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:10:13,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 19:10:13,350 INFO L280 TraceCheckUtils]: 8: Hoare triple {30#false} assume !false; {30#false} is VALID [2020-07-28 19:10:13,351 INFO L280 TraceCheckUtils]: 7: Hoare triple {30#false} assume 1bv32 == main_~result~0; {30#false} is VALID [2020-07-28 19:10:13,351 INFO L280 TraceCheckUtils]: 6: Hoare triple {30#false} main_~result~0 := main_#t~ret4;havoc main_#t~ret4; {30#false} is VALID [2020-07-28 19:10:13,353 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {45#(bvslt |fibo1_#in~n| (_ bv1 32))} {70#(not (bvslt ULTIMATE.start_main_~x~0 (_ bv1 32)))} #44#return; {30#false} is VALID [2020-07-28 19:10:13,354 INFO L280 TraceCheckUtils]: 4: Hoare triple {45#(bvslt |fibo1_#in~n| (_ bv1 32))} assume true; {45#(bvslt |fibo1_#in~n| (_ bv1 32))} is VALID [2020-07-28 19:10:13,355 INFO L280 TraceCheckUtils]: 3: Hoare triple {80#(or (bvslt |fibo1_#in~n| (_ bv1 32)) (not (bvslt fibo1_~n (_ bv1 32))))} assume ~bvslt32(~n, 1bv32);#res := 0bv32; {45#(bvslt |fibo1_#in~n| (_ bv1 32))} is VALID [2020-07-28 19:10:13,356 INFO L280 TraceCheckUtils]: 2: Hoare triple {29#true} ~n := #in~n; {80#(or (bvslt |fibo1_#in~n| (_ bv1 32)) (not (bvslt fibo1_~n (_ bv1 32))))} is VALID [2020-07-28 19:10:13,356 INFO L263 TraceCheckUtils]: 1: Hoare triple {70#(not (bvslt ULTIMATE.start_main_~x~0 (_ bv1 32)))} call main_#t~ret4 := fibo1(main_~x~0); {29#true} is VALID [2020-07-28 19:10:13,357 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 2bv32; {70#(not (bvslt ULTIMATE.start_main_~x~0 (_ bv1 32)))} is VALID [2020-07-28 19:10:13,358 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:10:13,360 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [876964141] [2020-07-28 19:10:13,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:10:13,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2020-07-28 19:10:13,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396491606] [2020-07-28 19:10:13,367 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2020-07-28 19:10:13,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:10:13,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-28 19:10:13,405 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:10:13,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-28 19:10:13,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 19:10:13,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-28 19:10:13,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-28 19:10:13,418 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 7 states. [2020-07-28 19:10:13,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:13,825 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2020-07-28 19:10:13,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 19:10:13,826 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2020-07-28 19:10:13,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:10:13,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 19:10:13,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2020-07-28 19:10:13,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 19:10:13,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2020-07-28 19:10:13,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2020-07-28 19:10:13,960 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:10:13,973 INFO L225 Difference]: With dead ends: 36 [2020-07-28 19:10:13,973 INFO L226 Difference]: Without dead ends: 24 [2020-07-28 19:10:13,977 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-28 19:10:13,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-28 19:10:14,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-28 19:10:14,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:10:14,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-28 19:10:14,024 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-28 19:10:14,024 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-28 19:10:14,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:14,031 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2020-07-28 19:10:14,031 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-07-28 19:10:14,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:10:14,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:10:14,033 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-28 19:10:14,033 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-28 19:10:14,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:14,038 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2020-07-28 19:10:14,038 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-07-28 19:10:14,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:10:14,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:10:14,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:10:14,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:10:14,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-28 19:10:14,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2020-07-28 19:10:14,046 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 9 [2020-07-28 19:10:14,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:10:14,047 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-07-28 19:10:14,047 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-28 19:10:14,047 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-07-28 19:10:14,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 19:10:14,048 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:10:14,048 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:10:14,261 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 19:10:14,261 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:10:14,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:10:14,263 INFO L82 PathProgramCache]: Analyzing trace with hash -450158515, now seen corresponding path program 1 times [2020-07-28 19:10:14,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 19:10:14,264 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993997154] [2020-07-28 19:10:14,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-07-28 19:10:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:14,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-28 19:10:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:14,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:10:14,347 INFO L280 TraceCheckUtils]: 0: Hoare triple {212#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 2bv32; {217#(= (_ bv2 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 19:10:14,348 INFO L263 TraceCheckUtils]: 1: Hoare triple {217#(= (_ bv2 32) ULTIMATE.start_main_~x~0)} call main_#t~ret4 := fibo1(main_~x~0); {212#true} is VALID [2020-07-28 19:10:14,349 INFO L280 TraceCheckUtils]: 2: Hoare triple {212#true} ~n := #in~n; {224#(= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-28 19:10:14,351 INFO L280 TraceCheckUtils]: 3: Hoare triple {224#(= |fibo1_#in~n| fibo1_~n)} assume !~bvslt32(~n, 1bv32); {224#(= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-28 19:10:14,353 INFO L280 TraceCheckUtils]: 4: Hoare triple {224#(= |fibo1_#in~n| fibo1_~n)} assume 1bv32 == ~n;#res := 1bv32; {231#(= (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-28 19:10:14,354 INFO L280 TraceCheckUtils]: 5: Hoare triple {231#(= (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv0 32))} assume true; {231#(= (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-28 19:10:14,356 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {231#(= (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv0 32))} {217#(= (_ bv2 32) ULTIMATE.start_main_~x~0)} #44#return; {213#false} is VALID [2020-07-28 19:10:14,356 INFO L280 TraceCheckUtils]: 7: Hoare triple {213#false} main_~result~0 := main_#t~ret4;havoc main_#t~ret4; {213#false} is VALID [2020-07-28 19:10:14,357 INFO L280 TraceCheckUtils]: 8: Hoare triple {213#false} assume 1bv32 == main_~result~0; {213#false} is VALID [2020-07-28 19:10:14,357 INFO L280 TraceCheckUtils]: 9: Hoare triple {213#false} assume !false; {213#false} is VALID [2020-07-28 19:10:14,358 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:10:14,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 19:10:14,450 INFO L280 TraceCheckUtils]: 9: Hoare triple {213#false} assume !false; {213#false} is VALID [2020-07-28 19:10:14,450 INFO L280 TraceCheckUtils]: 8: Hoare triple {213#false} assume 1bv32 == main_~result~0; {213#false} is VALID [2020-07-28 19:10:14,451 INFO L280 TraceCheckUtils]: 7: Hoare triple {213#false} main_~result~0 := main_#t~ret4;havoc main_#t~ret4; {213#false} is VALID [2020-07-28 19:10:14,454 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {231#(= (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv0 32))} {256#(not (= (_ bv1 32) ULTIMATE.start_main_~x~0))} #44#return; {213#false} is VALID [2020-07-28 19:10:14,455 INFO L280 TraceCheckUtils]: 5: Hoare triple {231#(= (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv0 32))} assume true; {231#(= (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-28 19:10:14,456 INFO L280 TraceCheckUtils]: 4: Hoare triple {266#(or (= (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv1 32) fibo1_~n)))} assume 1bv32 == ~n;#res := 1bv32; {231#(= (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-28 19:10:14,457 INFO L280 TraceCheckUtils]: 3: Hoare triple {266#(or (= (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv1 32) fibo1_~n)))} assume !~bvslt32(~n, 1bv32); {266#(or (= (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv1 32) fibo1_~n)))} is VALID [2020-07-28 19:10:14,458 INFO L280 TraceCheckUtils]: 2: Hoare triple {212#true} ~n := #in~n; {266#(or (= (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv1 32) fibo1_~n)))} is VALID [2020-07-28 19:10:14,459 INFO L263 TraceCheckUtils]: 1: Hoare triple {256#(not (= (_ bv1 32) ULTIMATE.start_main_~x~0))} call main_#t~ret4 := fibo1(main_~x~0); {212#true} is VALID [2020-07-28 19:10:14,460 INFO L280 TraceCheckUtils]: 0: Hoare triple {212#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 2bv32; {256#(not (= (_ bv1 32) ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 19:10:14,461 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:10:14,461 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993997154] [2020-07-28 19:10:14,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:10:14,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2020-07-28 19:10:14,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658768031] [2020-07-28 19:10:14,464 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2020-07-28 19:10:14,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:10:14,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-28 19:10:14,487 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:10:14,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-28 19:10:14,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 19:10:14,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-28 19:10:14,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-28 19:10:14,489 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand 7 states. [2020-07-28 19:10:14,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:14,854 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2020-07-28 19:10:14,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 19:10:14,855 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2020-07-28 19:10:14,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:10:14,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 19:10:14,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2020-07-28 19:10:14,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 19:10:14,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2020-07-28 19:10:14,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2020-07-28 19:10:14,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:10:14,927 INFO L225 Difference]: With dead ends: 30 [2020-07-28 19:10:14,927 INFO L226 Difference]: Without dead ends: 26 [2020-07-28 19:10:14,928 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-28 19:10:14,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-28 19:10:14,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2020-07-28 19:10:14,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:10:14,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2020-07-28 19:10:14,940 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2020-07-28 19:10:14,940 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2020-07-28 19:10:14,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:14,944 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2020-07-28 19:10:14,944 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-28 19:10:14,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:10:14,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:10:14,946 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2020-07-28 19:10:14,946 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2020-07-28 19:10:14,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:14,950 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2020-07-28 19:10:14,950 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-28 19:10:14,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:10:14,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:10:14,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:10:14,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:10:14,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-28 19:10:14,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2020-07-28 19:10:14,955 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 10 [2020-07-28 19:10:14,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:10:14,956 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-07-28 19:10:14,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-28 19:10:14,956 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-07-28 19:10:14,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-28 19:10:14,958 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:10:14,958 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:10:15,170 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 19:10:15,170 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:10:15,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:10:15,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1017181589, now seen corresponding path program 1 times [2020-07-28 19:10:15,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 19:10:15,173 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598717768] [2020-07-28 19:10:15,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-07-28 19:10:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:15,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-28 19:10:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:10:15,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:10:15,323 INFO L280 TraceCheckUtils]: 0: Hoare triple {397#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 2bv32; {402#(= (_ bv2 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 19:10:15,324 INFO L263 TraceCheckUtils]: 1: Hoare triple {402#(= (_ bv2 32) ULTIMATE.start_main_~x~0)} call main_#t~ret4 := fibo1(main_~x~0); {397#true} is VALID [2020-07-28 19:10:15,325 INFO L280 TraceCheckUtils]: 2: Hoare triple {397#true} ~n := #in~n; {409#(= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-28 19:10:15,325 INFO L280 TraceCheckUtils]: 3: Hoare triple {409#(= |fibo1_#in~n| fibo1_~n)} assume !~bvslt32(~n, 1bv32); {409#(= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-28 19:10:15,326 INFO L280 TraceCheckUtils]: 4: Hoare triple {409#(= |fibo1_#in~n| fibo1_~n)} assume !(1bv32 == ~n); {409#(= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-28 19:10:15,327 INFO L263 TraceCheckUtils]: 5: Hoare triple {409#(= |fibo1_#in~n| fibo1_~n)} call #t~ret0 := fibo2(~bvsub32(~n, 1bv32)); {397#true} is VALID [2020-07-28 19:10:15,327 INFO L280 TraceCheckUtils]: 6: Hoare triple {397#true} ~n := #in~n; {422#(= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-28 19:10:15,328 INFO L280 TraceCheckUtils]: 7: Hoare triple {422#(= |fibo2_#in~n| fibo2_~n)} assume ~bvslt32(~n, 1bv32);#res := 0bv32; {426#(bvslt |fibo2_#in~n| (_ bv1 32))} is VALID [2020-07-28 19:10:15,329 INFO L280 TraceCheckUtils]: 8: Hoare triple {426#(bvslt |fibo2_#in~n| (_ bv1 32))} assume true; {426#(bvslt |fibo2_#in~n| (_ bv1 32))} is VALID [2020-07-28 19:10:15,331 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {426#(bvslt |fibo2_#in~n| (_ bv1 32))} {409#(= |fibo1_#in~n| fibo1_~n)} #50#return; {433#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} is VALID [2020-07-28 19:10:15,331 INFO L263 TraceCheckUtils]: 10: Hoare triple {433#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} call #t~ret1 := fibo2(~bvsub32(~n, 2bv32)); {397#true} is VALID [2020-07-28 19:10:15,331 INFO L280 TraceCheckUtils]: 11: Hoare triple {397#true} ~n := #in~n; {397#true} is VALID [2020-07-28 19:10:15,332 INFO L280 TraceCheckUtils]: 12: Hoare triple {397#true} assume ~bvslt32(~n, 1bv32);#res := 0bv32; {397#true} is VALID [2020-07-28 19:10:15,332 INFO L280 TraceCheckUtils]: 13: Hoare triple {397#true} assume true; {397#true} is VALID [2020-07-28 19:10:15,334 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {397#true} {433#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} #52#return; {433#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} is VALID [2020-07-28 19:10:15,334 INFO L280 TraceCheckUtils]: 15: Hoare triple {433#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} #res := ~bvadd32(#t~ret0, #t~ret1);havoc #t~ret0;havoc #t~ret1; {433#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} is VALID [2020-07-28 19:10:15,335 INFO L280 TraceCheckUtils]: 16: Hoare triple {433#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} assume true; {433#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} is VALID [2020-07-28 19:10:15,337 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {433#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} {402#(= (_ bv2 32) ULTIMATE.start_main_~x~0)} #44#return; {398#false} is VALID [2020-07-28 19:10:15,337 INFO L280 TraceCheckUtils]: 18: Hoare triple {398#false} main_~result~0 := main_#t~ret4;havoc main_#t~ret4; {398#false} is VALID [2020-07-28 19:10:15,337 INFO L280 TraceCheckUtils]: 19: Hoare triple {398#false} assume 1bv32 == main_~result~0; {398#false} is VALID [2020-07-28 19:10:15,338 INFO L280 TraceCheckUtils]: 20: Hoare triple {398#false} assume !false; {398#false} is VALID [2020-07-28 19:10:15,340 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:10:15,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 19:10:15,680 INFO L523 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-28 19:10:15,791 INFO L280 TraceCheckUtils]: 20: Hoare triple {398#false} assume !false; {398#false} is VALID [2020-07-28 19:10:15,791 INFO L280 TraceCheckUtils]: 19: Hoare triple {398#false} assume 1bv32 == main_~result~0; {398#false} is VALID [2020-07-28 19:10:15,792 INFO L280 TraceCheckUtils]: 18: Hoare triple {398#false} main_~result~0 := main_#t~ret4;havoc main_#t~ret4; {398#false} is VALID [2020-07-28 19:10:15,795 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {433#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} {476#(not (bvslt (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967295 32)) (_ bv1 32)))} #44#return; {398#false} is VALID [2020-07-28 19:10:15,797 INFO L280 TraceCheckUtils]: 16: Hoare triple {433#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} assume true; {433#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} is VALID [2020-07-28 19:10:15,797 INFO L280 TraceCheckUtils]: 15: Hoare triple {433#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} #res := ~bvadd32(#t~ret0, #t~ret1);havoc #t~ret0;havoc #t~ret1; {433#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} is VALID [2020-07-28 19:10:15,799 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {397#true} {433#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} #52#return; {433#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} is VALID [2020-07-28 19:10:15,799 INFO L280 TraceCheckUtils]: 13: Hoare triple {397#true} assume true; {397#true} is VALID [2020-07-28 19:10:15,799 INFO L280 TraceCheckUtils]: 12: Hoare triple {397#true} assume ~bvslt32(~n, 1bv32);#res := 0bv32; {397#true} is VALID [2020-07-28 19:10:15,800 INFO L280 TraceCheckUtils]: 11: Hoare triple {397#true} ~n := #in~n; {397#true} is VALID [2020-07-28 19:10:15,800 INFO L263 TraceCheckUtils]: 10: Hoare triple {433#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} call #t~ret1 := fibo2(~bvsub32(~n, 2bv32)); {397#true} is VALID [2020-07-28 19:10:15,801 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {426#(bvslt |fibo2_#in~n| (_ bv1 32))} {504#(or (bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32)) (not (bvslt (bvadd fibo1_~n (_ bv4294967295 32)) (_ bv1 32))))} #50#return; {433#(bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))} is VALID [2020-07-28 19:10:15,802 INFO L280 TraceCheckUtils]: 8: Hoare triple {426#(bvslt |fibo2_#in~n| (_ bv1 32))} assume true; {426#(bvslt |fibo2_#in~n| (_ bv1 32))} is VALID [2020-07-28 19:10:15,805 INFO L280 TraceCheckUtils]: 7: Hoare triple {514#(or (bvslt |fibo2_#in~n| (_ bv1 32)) (not (bvslt fibo2_~n (_ bv1 32))))} assume ~bvslt32(~n, 1bv32);#res := 0bv32; {426#(bvslt |fibo2_#in~n| (_ bv1 32))} is VALID [2020-07-28 19:10:15,805 INFO L280 TraceCheckUtils]: 6: Hoare triple {397#true} ~n := #in~n; {514#(or (bvslt |fibo2_#in~n| (_ bv1 32)) (not (bvslt fibo2_~n (_ bv1 32))))} is VALID [2020-07-28 19:10:15,806 INFO L263 TraceCheckUtils]: 5: Hoare triple {504#(or (bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32)) (not (bvslt (bvadd fibo1_~n (_ bv4294967295 32)) (_ bv1 32))))} call #t~ret0 := fibo2(~bvsub32(~n, 1bv32)); {397#true} is VALID [2020-07-28 19:10:15,814 INFO L280 TraceCheckUtils]: 4: Hoare triple {504#(or (bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32)) (not (bvslt (bvadd fibo1_~n (_ bv4294967295 32)) (_ bv1 32))))} assume !(1bv32 == ~n); {504#(or (bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32)) (not (bvslt (bvadd fibo1_~n (_ bv4294967295 32)) (_ bv1 32))))} is VALID [2020-07-28 19:10:15,815 INFO L280 TraceCheckUtils]: 3: Hoare triple {504#(or (bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32)) (not (bvslt (bvadd fibo1_~n (_ bv4294967295 32)) (_ bv1 32))))} assume !~bvslt32(~n, 1bv32); {504#(or (bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32)) (not (bvslt (bvadd fibo1_~n (_ bv4294967295 32)) (_ bv1 32))))} is VALID [2020-07-28 19:10:15,816 INFO L280 TraceCheckUtils]: 2: Hoare triple {397#true} ~n := #in~n; {504#(or (bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32)) (not (bvslt (bvadd fibo1_~n (_ bv4294967295 32)) (_ bv1 32))))} is VALID [2020-07-28 19:10:15,816 INFO L263 TraceCheckUtils]: 1: Hoare triple {476#(not (bvslt (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967295 32)) (_ bv1 32)))} call main_#t~ret4 := fibo1(main_~x~0); {397#true} is VALID [2020-07-28 19:10:15,817 INFO L280 TraceCheckUtils]: 0: Hoare triple {397#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 2bv32; {476#(not (bvslt (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967295 32)) (_ bv1 32)))} is VALID [2020-07-28 19:10:15,819 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:10:15,820 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1598717768] [2020-07-28 19:10:15,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:10:15,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-28 19:10:15,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219487877] [2020-07-28 19:10:15,821 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-07-28 19:10:15,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:10:15,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-28 19:10:15,891 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:10:15,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-28 19:10:15,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 19:10:15,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-28 19:10:15,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-28 19:10:15,893 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand 10 states. [2020-07-28 19:10:16,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:16,720 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2020-07-28 19:10:16,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-28 19:10:16,721 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-07-28 19:10:16,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:10:16,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 19:10:16,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2020-07-28 19:10:16,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 19:10:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2020-07-28 19:10:16,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2020-07-28 19:10:16,834 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-28 19:10:16,836 INFO L225 Difference]: With dead ends: 36 [2020-07-28 19:10:16,837 INFO L226 Difference]: Without dead ends: 32 [2020-07-28 19:10:16,837 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-07-28 19:10:16,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-28 19:10:16,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2020-07-28 19:10:16,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:10:16,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 28 states. [2020-07-28 19:10:16,855 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 28 states. [2020-07-28 19:10:16,855 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 28 states. [2020-07-28 19:10:16,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:16,858 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2020-07-28 19:10:16,858 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2020-07-28 19:10:16,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:10:16,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:10:16,860 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 32 states. [2020-07-28 19:10:16,860 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 32 states. [2020-07-28 19:10:16,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:10:16,864 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2020-07-28 19:10:16,864 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2020-07-28 19:10:16,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:10:16,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:10:16,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:10:16,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:10:16,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-28 19:10:16,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-07-28 19:10:16,869 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 21 [2020-07-28 19:10:16,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:10:16,869 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-07-28 19:10:16,869 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-28 19:10:16,870 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-07-28 19:10:16,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-28 19:10:16,871 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:10:16,871 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:10:17,081 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 19:10:17,082 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:10:17,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:10:17,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1369022552, now seen corresponding path program 1 times [2020-07-28 19:10:17,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 19:10:17,085 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439785628] [2020-07-28 19:10:17,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-07-28 19:10:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 19:10:17,103 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 19:10:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 19:10:17,112 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 19:10:17,130 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2020-07-28 19:10:17,130 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 19:10:17,331 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-07-28 19:10:17,345 FATAL L488 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret4 := fibo1(~x~0); [2020-07-28 19:10:17,349 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportCounterexampleResult(TraceAbstractionStarter.java:626) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResults(TraceAbstractionStarter.java:525) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-28 19:10:17,355 INFO L168 Benchmark]: Toolchain (without parser) took 5153.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -188.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:10:17,355 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:10:17,356 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.31 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 19:10:17,358 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -140.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 19:10:17,358 INFO L168 Benchmark]: Boogie Preprocessor took 20.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:10:17,359 INFO L168 Benchmark]: RCFGBuilder took 367.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2020-07-28 19:10:17,360 INFO L168 Benchmark]: TraceAbstraction took 4426.67 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -85.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:10:17,366 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 246.31 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -140.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 367.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4426.67 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -85.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:216) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...