./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/Fibonacci04.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d19306ce3d42a6a85ce0e73aaa2bade9eaab24620b40f9180d62be222dc7b30 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 05:03:06,602 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 05:03:06,605 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 05:03:06,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 05:03:06,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 05:03:06,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 05:03:06,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 05:03:06,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 05:03:06,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 05:03:06,667 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 05:03:06,668 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 05:03:06,674 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 05:03:06,674 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 05:03:06,676 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 05:03:06,677 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 05:03:06,680 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 05:03:06,681 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 05:03:06,683 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 05:03:06,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 05:03:06,688 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 05:03:06,690 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 05:03:06,691 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 05:03:06,692 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 05:03:06,693 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 05:03:06,694 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 05:03:06,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 05:03:06,701 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 05:03:06,701 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 05:03:06,702 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 05:03:06,703 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 05:03:06,703 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 05:03:06,704 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 05:03:06,705 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 05:03:06,706 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 05:03:06,707 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 05:03:06,708 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 05:03:06,708 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 05:03:06,709 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 05:03:06,709 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 05:03:06,709 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 05:03:06,710 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 05:03:06,711 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 05:03:06,716 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 05:03:06,742 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 05:03:06,743 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 05:03:06,743 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 05:03:06,744 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 05:03:06,744 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 05:03:06,744 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 05:03:06,745 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 05:03:06,745 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 05:03:06,745 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 05:03:06,746 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 05:03:06,747 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 05:03:06,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 05:03:06,747 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 05:03:06,747 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 05:03:06,747 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 05:03:06,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 05:03:06,748 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 05:03:06,748 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 05:03:06,748 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 05:03:06,748 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 05:03:06,748 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 05:03:06,749 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 05:03:06,749 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 05:03:06,749 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 05:03:06,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 05:03:06,750 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 05:03:06,750 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 05:03:06,750 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 05:03:06,750 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 05:03:06,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 05:03:06,751 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 05:03:06,751 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 05:03:06,751 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 05:03:06,751 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> 8d19306ce3d42a6a85ce0e73aaa2bade9eaab24620b40f9180d62be222dc7b30 [2022-07-21 05:03:07,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 05:03:07,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 05:03:07,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 05:03:07,100 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 05:03:07,101 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 05:03:07,102 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci04.c [2022-07-21 05:03:07,160 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34b456f85/cdcb9a0f0ace4fbf945c9aa34a487abe/FLAG531f1015a [2022-07-21 05:03:07,573 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 05:03:07,574 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04.c [2022-07-21 05:03:07,580 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34b456f85/cdcb9a0f0ace4fbf945c9aa34a487abe/FLAG531f1015a [2022-07-21 05:03:08,001 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34b456f85/cdcb9a0f0ace4fbf945c9aa34a487abe [2022-07-21 05:03:08,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 05:03:08,005 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 05:03:08,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 05:03:08,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 05:03:08,011 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 05:03:08,011 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:03:08" (1/1) ... [2022-07-21 05:03:08,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b96da3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:03:08, skipping insertion in model container [2022-07-21 05:03:08,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:03:08" (1/1) ... [2022-07-21 05:03:08,020 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 05:03:08,031 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 05:03:08,162 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04.c[780,793] [2022-07-21 05:03:08,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 05:03:08,178 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 05:03:08,197 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04.c[780,793] [2022-07-21 05:03:08,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 05:03:08,212 INFO L208 MainTranslator]: Completed translation [2022-07-21 05:03:08,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:03:08 WrapperNode [2022-07-21 05:03:08,214 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 05:03:08,215 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 05:03:08,215 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 05:03:08,215 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 05:03:08,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:03:08" (1/1) ... [2022-07-21 05:03:08,231 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:03:08" (1/1) ... [2022-07-21 05:03:08,245 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2022-07-21 05:03:08,245 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 05:03:08,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 05:03:08,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 05:03:08,247 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 05:03:08,256 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:03:08" (1/1) ... [2022-07-21 05:03:08,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:03:08" (1/1) ... [2022-07-21 05:03:08,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:03:08" (1/1) ... [2022-07-21 05:03:08,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:03:08" (1/1) ... [2022-07-21 05:03:08,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:03:08" (1/1) ... [2022-07-21 05:03:08,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:03:08" (1/1) ... [2022-07-21 05:03:08,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:03:08" (1/1) ... [2022-07-21 05:03:08,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 05:03:08,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 05:03:08,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 05:03:08,285 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 05:03:08,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:03:08" (1/1) ... [2022-07-21 05:03:08,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 05:03:08,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:03:08,317 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 05:03:08,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 05:03:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2022-07-21 05:03:08,364 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2022-07-21 05:03:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 05:03:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 05:03:08,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 05:03:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 05:03:08,425 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 05:03:08,427 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 05:03:08,550 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 05:03:08,556 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 05:03:08,557 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 05:03:08,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:03:08 BoogieIcfgContainer [2022-07-21 05:03:08,559 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 05:03:08,560 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 05:03:08,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 05:03:08,563 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 05:03:08,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:03:08" (1/3) ... [2022-07-21 05:03:08,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb52b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:03:08, skipping insertion in model container [2022-07-21 05:03:08,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:03:08" (2/3) ... [2022-07-21 05:03:08,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb52b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:03:08, skipping insertion in model container [2022-07-21 05:03:08,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:03:08" (3/3) ... [2022-07-21 05:03:08,566 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2022-07-21 05:03:08,578 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 05:03:08,579 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 05:03:08,630 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 05:03:08,638 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7239e63a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@41943c2d [2022-07-21 05:03:08,638 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 05:03:08,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 05:03:08,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 05:03:08,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:03:08,654 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:03:08,654 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:03:08,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:03:08,660 INFO L85 PathProgramCache]: Analyzing trace with hash 117289724, now seen corresponding path program 1 times [2022-07-21 05:03:08,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:03:08,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407042063] [2022-07-21 05:03:08,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:03:08,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:03:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:08,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:03:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:08,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 05:03:08,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:03:08,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407042063] [2022-07-21 05:03:08,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407042063] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:03:08,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:03:08,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 05:03:08,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271695786] [2022-07-21 05:03:08,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:03:08,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 05:03:08,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:03:08,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 05:03:08,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:03:08,966 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 05:03:09,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:03:09,052 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-07-21 05:03:09,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 05:03:09,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-07-21 05:03:09,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:03:09,063 INFO L225 Difference]: With dead ends: 31 [2022-07-21 05:03:09,064 INFO L226 Difference]: Without dead ends: 18 [2022-07-21 05:03:09,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 05:03:09,073 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:03:09,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 40 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:03:09,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-21 05:03:09,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-21 05:03:09,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-21 05:03:09,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-07-21 05:03:09,117 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2022-07-21 05:03:09,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:03:09,117 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-07-21 05:03:09,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 05:03:09,118 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-07-21 05:03:09,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 05:03:09,120 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:03:09,120 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:03:09,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 05:03:09,121 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:03:09,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:03:09,123 INFO L85 PathProgramCache]: Analyzing trace with hash 36927066, now seen corresponding path program 1 times [2022-07-21 05:03:09,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:03:09,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487592815] [2022-07-21 05:03:09,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:03:09,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:03:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:09,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:03:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:09,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 05:03:09,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:03:09,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487592815] [2022-07-21 05:03:09,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487592815] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:03:09,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:03:09,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 05:03:09,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196184305] [2022-07-21 05:03:09,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:03:09,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 05:03:09,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:03:09,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 05:03:09,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:03:09,210 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 05:03:09,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:03:09,265 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-07-21 05:03:09,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 05:03:09,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-07-21 05:03:09,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:03:09,266 INFO L225 Difference]: With dead ends: 24 [2022-07-21 05:03:09,267 INFO L226 Difference]: Without dead ends: 20 [2022-07-21 05:03:09,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 05:03:09,268 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:03:09,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 32 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:03:09,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-21 05:03:09,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-07-21 05:03:09,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-21 05:03:09,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-07-21 05:03:09,275 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2022-07-21 05:03:09,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:03:09,275 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-07-21 05:03:09,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 05:03:09,276 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-07-21 05:03:09,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-21 05:03:09,277 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:03:09,277 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:03:09,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 05:03:09,277 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:03:09,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:03:09,278 INFO L85 PathProgramCache]: Analyzing trace with hash 703243533, now seen corresponding path program 1 times [2022-07-21 05:03:09,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:03:09,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94805827] [2022-07-21 05:03:09,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:03:09,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:03:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:09,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:03:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:09,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:09,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 05:03:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:09,389 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 05:03:09,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:03:09,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94805827] [2022-07-21 05:03:09,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94805827] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:03:09,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66388306] [2022-07-21 05:03:09,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:03:09,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:03:09,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:03:09,399 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:03:09,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 05:03:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:09,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 05:03:09,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:03:09,539 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 05:03:09,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:03:09,763 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 05:03:09,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66388306] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:03:09,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:03:09,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2022-07-21 05:03:09,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098098107] [2022-07-21 05:03:09,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:03:09,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 05:03:09,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:03:09,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 05:03:09,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-07-21 05:03:09,772 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-21 05:03:09,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:03:09,986 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2022-07-21 05:03:09,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 05:03:09,987 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 23 [2022-07-21 05:03:09,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:03:09,988 INFO L225 Difference]: With dead ends: 46 [2022-07-21 05:03:09,989 INFO L226 Difference]: Without dead ends: 29 [2022-07-21 05:03:09,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2022-07-21 05:03:09,990 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:03:09,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 63 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:03:09,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-21 05:03:10,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-21 05:03:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-07-21 05:03:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2022-07-21 05:03:10,004 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 23 [2022-07-21 05:03:10,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:03:10,005 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2022-07-21 05:03:10,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-21 05:03:10,005 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2022-07-21 05:03:10,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-21 05:03:10,007 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:03:10,008 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:03:10,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 05:03:10,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:03:10,209 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:03:10,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:03:10,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1937134450, now seen corresponding path program 1 times [2022-07-21 05:03:10,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:03:10,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406590393] [2022-07-21 05:03:10,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:03:10,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:03:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:03:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:03:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:03:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:03:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:03:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,544 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-21 05:03:10,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:03:10,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406590393] [2022-07-21 05:03:10,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406590393] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:03:10,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124058522] [2022-07-21 05:03:10,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:03:10,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:03:10,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:03:10,556 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:03:10,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 05:03:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 05:03:10,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:03:10,671 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-07-21 05:03:10,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:03:11,106 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 82 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-21 05:03:11,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124058522] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:03:11,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:03:11,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2022-07-21 05:03:11,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74959053] [2022-07-21 05:03:11,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:03:11,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-21 05:03:11,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:03:11,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-21 05:03:11,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-07-21 05:03:11,116 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2022-07-21 05:03:11,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:03:11,326 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2022-07-21 05:03:11,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 05:03:11,328 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 65 [2022-07-21 05:03:11,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:03:11,336 INFO L225 Difference]: With dead ends: 73 [2022-07-21 05:03:11,337 INFO L226 Difference]: Without dead ends: 44 [2022-07-21 05:03:11,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2022-07-21 05:03:11,340 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 37 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:03:11,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 93 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:03:11,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-21 05:03:11,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-07-21 05:03:11,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (19), 9 states have call predecessors, (19), 7 states have call successors, (19) [2022-07-21 05:03:11,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2022-07-21 05:03:11,367 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 61 transitions. Word has length 65 [2022-07-21 05:03:11,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:03:11,368 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 61 transitions. [2022-07-21 05:03:11,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2022-07-21 05:03:11,369 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 61 transitions. [2022-07-21 05:03:11,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-21 05:03:11,373 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:03:11,373 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 10, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:03:11,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 05:03:11,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-21 05:03:11,592 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:03:11,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:03:11,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1961744707, now seen corresponding path program 2 times [2022-07-21 05:03:11,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:03:11,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539331843] [2022-07-21 05:03:11,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:03:11,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:03:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:11,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:03:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:11,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:11,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:11,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:11,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:11,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:03:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:11,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:03:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:11,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 05:03:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:11,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:11,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:03:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:11,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 05:03:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:11,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:11,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:11,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:03:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:11,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:03:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:11,848 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 85 proven. 119 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2022-07-21 05:03:11,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:03:11,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539331843] [2022-07-21 05:03:11,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539331843] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:03:11,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389782156] [2022-07-21 05:03:11,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 05:03:11,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:03:11,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:03:11,851 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:03:11,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 05:03:11,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 05:03:11,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:03:11,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 05:03:11,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:03:12,032 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 64 proven. 158 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2022-07-21 05:03:12,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:03:12,581 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 64 proven. 170 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2022-07-21 05:03:12,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389782156] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:03:12,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:03:12,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 11] total 17 [2022-07-21 05:03:12,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827933818] [2022-07-21 05:03:12,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:03:12,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-21 05:03:12,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:03:12,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-21 05:03:12,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-07-21 05:03:12,584 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. Second operand has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 10 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-21 05:03:12,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:03:12,781 INFO L93 Difference]: Finished difference Result 101 states and 150 transitions. [2022-07-21 05:03:12,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 05:03:12,782 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 10 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) Word has length 104 [2022-07-21 05:03:12,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:03:12,783 INFO L225 Difference]: With dead ends: 101 [2022-07-21 05:03:12,784 INFO L226 Difference]: Without dead ends: 60 [2022-07-21 05:03:12,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 227 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2022-07-21 05:03:12,785 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 66 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:03:12,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 91 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:03:12,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-21 05:03:12,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2022-07-21 05:03:12,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (16), 9 states have call predecessors, (16), 7 states have call successors, (16) [2022-07-21 05:03:12,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-07-21 05:03:12,793 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 104 [2022-07-21 05:03:12,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:03:12,793 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2022-07-21 05:03:12,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 10 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-21 05:03:12,794 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-07-21 05:03:12,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-21 05:03:12,795 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:03:12,796 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:03:12,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 05:03:13,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:03:13,019 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:03:13,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:03:13,020 INFO L85 PathProgramCache]: Analyzing trace with hash -2094125593, now seen corresponding path program 3 times [2022-07-21 05:03:13,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:03:13,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930575243] [2022-07-21 05:03:13,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:03:13,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:03:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 05:03:13,038 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 05:03:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 05:03:13,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 05:03:13,103 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 05:03:13,104 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 05:03:13,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 05:03:13,109 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2022-07-21 05:03:13,113 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 05:03:13,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 05:03:13 BoogieIcfgContainer [2022-07-21 05:03:13,149 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 05:03:13,150 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 05:03:13,150 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 05:03:13,150 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 05:03:13,151 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:03:08" (3/4) ... [2022-07-21 05:03:13,152 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 05:03:13,193 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 05:03:13,193 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 05:03:13,194 INFO L158 Benchmark]: Toolchain (without parser) took 5188.55ms. Allocated memory was 52.4MB in the beginning and 75.5MB in the end (delta: 23.1MB). Free memory was 28.8MB in the beginning and 47.0MB in the end (delta: -18.1MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2022-07-21 05:03:13,194 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 52.4MB. Free memory is still 33.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 05:03:13,194 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.71ms. Allocated memory is still 52.4MB. Free memory was 28.7MB in the beginning and 34.5MB in the end (delta: -5.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 05:03:13,195 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.59ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 34.4MB in the beginning and 45.6MB in the end (delta: -11.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 05:03:13,195 INFO L158 Benchmark]: Boogie Preprocessor took 37.83ms. Allocated memory is still 62.9MB. Free memory was 45.6MB in the beginning and 44.8MB in the end (delta: 718.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 05:03:13,199 INFO L158 Benchmark]: RCFGBuilder took 274.25ms. Allocated memory is still 62.9MB. Free memory was 44.7MB in the beginning and 36.1MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-21 05:03:13,200 INFO L158 Benchmark]: TraceAbstraction took 4588.79ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 35.4MB in the beginning and 50.6MB in the end (delta: -15.2MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2022-07-21 05:03:13,200 INFO L158 Benchmark]: Witness Printer took 43.55ms. Allocated memory is still 75.5MB. Free memory was 50.6MB in the beginning and 47.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 05:03:13,203 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 52.4MB. Free memory is still 33.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.71ms. Allocated memory is still 52.4MB. Free memory was 28.7MB in the beginning and 34.5MB in the end (delta: -5.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.59ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 34.4MB in the beginning and 45.6MB in the end (delta: -11.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.83ms. Allocated memory is still 62.9MB. Free memory was 45.6MB in the beginning and 44.8MB in the end (delta: 718.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 274.25ms. Allocated memory is still 62.9MB. Free memory was 44.7MB in the beginning and 36.1MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4588.79ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 35.4MB in the beginning and 50.6MB in the end (delta: -15.2MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * Witness Printer took 43.55ms. Allocated memory is still 75.5MB. Free memory was 50.6MB in the beginning and 47.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 35]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L30] int x = __VERIFIER_nondet_int(); [L31] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L19] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L21] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L19] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L21] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L19] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L21] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L19] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L21] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L24] return fibonacci(n-1) + fibonacci(n-2); [L31] RET, EXPR fibonacci(x) VAL [fibonacci(x)=5, x=5] [L31] int result = fibonacci(x); [L32] COND FALSE !(x != 5 || result == 3) VAL [result=5, x=5] [L35] reach_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 6, TraceHistogramMax: 15, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 169 mSDsluCounter, 319 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 242 mSDsCounter, 173 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 510 IncrementalHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 173 mSolverCounterUnsat, 77 mSDtfsCounter, 510 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 499 GetRequests, 421 SyntacticMatches, 7 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=4, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 511 NumberOfCodeBlocks, 511 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 586 ConstructedInterpolants, 0 QuantifiedInterpolants, 1103 SizeOfPredicates, 10 NumberOfNonLiveVariables, 501 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 1567/2250 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-21 05:03:13,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE