./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 6c24879c 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-?-6c24879 [2022-07-12 06:21:43,664 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 06:21:43,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 06:21:43,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 06:21:43,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 06:21:43,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 06:21:43,718 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 06:21:43,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 06:21:43,722 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 06:21:43,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 06:21:43,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 06:21:43,729 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 06:21:43,730 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 06:21:43,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 06:21:43,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 06:21:43,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 06:21:43,736 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 06:21:43,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 06:21:43,739 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 06:21:43,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 06:21:43,746 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 06:21:43,747 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 06:21:43,748 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 06:21:43,749 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 06:21:43,750 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 06:21:43,756 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 06:21:43,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 06:21:43,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 06:21:43,758 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 06:21:43,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 06:21:43,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 06:21:43,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 06:21:43,762 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 06:21:43,763 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 06:21:43,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 06:21:43,764 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 06:21:43,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 06:21:43,765 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 06:21:43,765 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 06:21:43,765 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 06:21:43,766 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 06:21:43,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 06:21:43,768 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 06:21:43,801 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 06:21:43,802 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 06:21:43,802 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 06:21:43,802 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 06:21:43,803 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 06:21:43,803 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 06:21:43,804 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 06:21:43,804 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 06:21:43,804 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 06:21:43,805 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 06:21:43,805 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 06:21:43,805 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 06:21:43,806 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 06:21:43,806 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 06:21:43,806 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 06:21:43,806 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 06:21:43,806 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 06:21:43,807 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 06:21:43,807 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 06:21:43,807 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 06:21:43,807 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 06:21:43,807 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 06:21:43,808 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 06:21:43,808 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 06:21:43,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 06:21:43,808 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 06:21:43,808 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 06:21:43,809 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 06:21:43,809 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 06:21:43,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 06:21:43,809 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 06:21:43,810 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 06:21:43,810 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 06:21:43,810 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-12 06:21:44,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 06:21:44,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 06:21:44,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 06:21:44,053 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 06:21:44,053 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 06:21:44,054 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci04.c [2022-07-12 06:21:44,106 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d69ccb0a/29ffcb1cc92b45f6a8155e4f982750b1/FLAG3424869b7 [2022-07-12 06:21:44,509 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 06:21:44,510 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04.c [2022-07-12 06:21:44,516 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d69ccb0a/29ffcb1cc92b45f6a8155e4f982750b1/FLAG3424869b7 [2022-07-12 06:21:44,910 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d69ccb0a/29ffcb1cc92b45f6a8155e4f982750b1 [2022-07-12 06:21:44,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 06:21:44,914 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 06:21:44,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 06:21:44,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 06:21:44,920 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 06:21:44,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:21:44" (1/1) ... [2022-07-12 06:21:44,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@737183d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:44, skipping insertion in model container [2022-07-12 06:21:44,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:21:44" (1/1) ... [2022-07-12 06:21:44,928 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 06:21:44,940 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 06:21:45,124 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-12 06:21:45,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 06:21:45,138 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 06:21:45,153 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-12 06:21:45,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 06:21:45,166 INFO L208 MainTranslator]: Completed translation [2022-07-12 06:21:45,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:45 WrapperNode [2022-07-12 06:21:45,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 06:21:45,169 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 06:21:45,169 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 06:21:45,169 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 06:21:45,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:45" (1/1) ... [2022-07-12 06:21:45,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:45" (1/1) ... [2022-07-12 06:21:45,195 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2022-07-12 06:21:45,196 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 06:21:45,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 06:21:45,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 06:21:45,197 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 06:21:45,204 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:45" (1/1) ... [2022-07-12 06:21:45,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:45" (1/1) ... [2022-07-12 06:21:45,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:45" (1/1) ... [2022-07-12 06:21:45,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:45" (1/1) ... [2022-07-12 06:21:45,213 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:45" (1/1) ... [2022-07-12 06:21:45,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:45" (1/1) ... [2022-07-12 06:21:45,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:45" (1/1) ... [2022-07-12 06:21:45,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 06:21:45,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 06:21:45,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 06:21:45,222 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 06:21:45,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:45" (1/1) ... [2022-07-12 06:21:45,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 06:21:45,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:21:45,261 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-12 06:21:45,283 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-12 06:21:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2022-07-12 06:21:45,306 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2022-07-12 06:21:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 06:21:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 06:21:45,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 06:21:45,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 06:21:45,360 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 06:21:45,362 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 06:21:45,492 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 06:21:45,496 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 06:21:45,497 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 06:21:45,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:21:45 BoogieIcfgContainer [2022-07-12 06:21:45,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 06:21:45,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 06:21:45,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 06:21:45,504 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 06:21:45,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:21:44" (1/3) ... [2022-07-12 06:21:45,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca3a93a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:21:45, skipping insertion in model container [2022-07-12 06:21:45,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:45" (2/3) ... [2022-07-12 06:21:45,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca3a93a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:21:45, skipping insertion in model container [2022-07-12 06:21:45,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:21:45" (3/3) ... [2022-07-12 06:21:45,507 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2022-07-12 06:21:45,520 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 06:21:45,520 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 06:21:45,574 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 06:21:45,582 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@58968873, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@412213a9 [2022-07-12 06:21:45,583 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 06:21:45,587 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-12 06:21:45,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 06:21:45,598 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:45,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:45,599 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:45,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:45,605 INFO L85 PathProgramCache]: Analyzing trace with hash 117289724, now seen corresponding path program 1 times [2022-07-12 06:21:45,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:45,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723578355] [2022-07-12 06:21:45,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:45,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:45,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:21:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:45,847 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-12 06:21:45,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:45,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723578355] [2022-07-12 06:21:45,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723578355] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:21:45,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:21:45,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 06:21:45,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367221474] [2022-07-12 06:21:45,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:21:45,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 06:21:45,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:45,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 06:21:45,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 06:21:45,897 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-12 06:21:45,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:45,996 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-07-12 06:21:45,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 06:21:45,999 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-12 06:21:46,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:46,006 INFO L225 Difference]: With dead ends: 31 [2022-07-12 06:21:46,006 INFO L226 Difference]: Without dead ends: 18 [2022-07-12 06:21:46,009 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-12 06:21:46,013 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.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:21:46,014 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.0s Time] [2022-07-12 06:21:46,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-12 06:21:46,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-12 06:21:46,048 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-12 06:21:46,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-07-12 06:21:46,052 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2022-07-12 06:21:46,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:46,053 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-07-12 06:21:46,053 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-12 06:21:46,053 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-07-12 06:21:46,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 06:21:46,056 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:46,056 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:46,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 06:21:46,057 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:46,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:46,059 INFO L85 PathProgramCache]: Analyzing trace with hash 36927066, now seen corresponding path program 1 times [2022-07-12 06:21:46,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:46,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143124245] [2022-07-12 06:21:46,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:46,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:21:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,143 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-12 06:21:46,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:46,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143124245] [2022-07-12 06:21:46,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143124245] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:21:46,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:21:46,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 06:21:46,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773789081] [2022-07-12 06:21:46,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:21:46,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 06:21:46,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:46,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 06:21:46,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 06:21:46,150 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-12 06:21:46,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:46,206 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-07-12 06:21:46,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 06:21:46,207 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-12 06:21:46,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:46,209 INFO L225 Difference]: With dead ends: 24 [2022-07-12 06:21:46,209 INFO L226 Difference]: Without dead ends: 20 [2022-07-12 06:21:46,213 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-12 06:21:46,215 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-12 06:21:46,216 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-12 06:21:46,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-12 06:21:46,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-07-12 06:21:46,222 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-12 06:21:46,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-07-12 06:21:46,223 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2022-07-12 06:21:46,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:46,224 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-07-12 06:21:46,224 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-12 06:21:46,224 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-07-12 06:21:46,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 06:21:46,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:46,225 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-12 06:21:46,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 06:21:46,226 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:46,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:46,227 INFO L85 PathProgramCache]: Analyzing trace with hash 703243533, now seen corresponding path program 1 times [2022-07-12 06:21:46,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:46,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366369588] [2022-07-12 06:21:46,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:46,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:21:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 06:21:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,328 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-12 06:21:46,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:46,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366369588] [2022-07-12 06:21:46,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366369588] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:21:46,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805435448] [2022-07-12 06:21:46,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:46,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:46,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:21:46,331 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-12 06:21:46,387 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-12 06:21:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 06:21:46,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:21:46,513 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-12 06:21:46,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:21:46,766 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-12 06:21:46,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805435448] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:21:46,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:21:46,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2022-07-12 06:21:46,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076813294] [2022-07-12 06:21:46,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:21:46,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 06:21:46,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:46,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 06:21:46,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-07-12 06:21:46,770 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-12 06:21:46,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:46,988 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2022-07-12 06:21:46,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 06:21:46,989 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-12 06:21:46,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:46,992 INFO L225 Difference]: With dead ends: 46 [2022-07-12 06:21:46,992 INFO L226 Difference]: Without dead ends: 29 [2022-07-12 06:21:46,994 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-12 06:21:46,997 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-12 06:21:46,999 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-12 06:21:47,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-12 06:21:47,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-12 06:21:47,006 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-12 06:21:47,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2022-07-12 06:21:47,008 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 23 [2022-07-12 06:21:47,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:47,008 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2022-07-12 06:21:47,009 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-12 06:21:47,009 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2022-07-12 06:21:47,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-12 06:21:47,011 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:47,011 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-12 06:21:47,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 06:21:47,223 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-12 06:21:47,224 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:47,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:47,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1937134450, now seen corresponding path program 1 times [2022-07-12 06:21:47,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:47,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51371112] [2022-07-12 06:21:47,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:47,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:47,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:21:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:47,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:47,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:47,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:47,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:21:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:47,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:47,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:47,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:47,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:47,500 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-12 06:21:47,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:47,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51371112] [2022-07-12 06:21:47,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51371112] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:21:47,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913490888] [2022-07-12 06:21:47,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:47,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:47,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:21:47,507 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-12 06:21:47,509 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-12 06:21:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:47,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 06:21:47,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:21:47,664 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-12 06:21:47,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:21:48,007 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-12 06:21:48,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913490888] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:21:48,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:21:48,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2022-07-12 06:21:48,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220202653] [2022-07-12 06:21:48,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:21:48,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 06:21:48,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:48,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 06:21:48,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-07-12 06:21:48,010 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-12 06:21:48,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:48,213 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2022-07-12 06:21:48,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 06:21:48,214 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-12 06:21:48,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:48,216 INFO L225 Difference]: With dead ends: 73 [2022-07-12 06:21:48,216 INFO L226 Difference]: Without dead ends: 44 [2022-07-12 06:21:48,217 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-12 06:21:48,218 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-12 06:21:48,219 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-12 06:21:48,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-12 06:21:48,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-07-12 06:21:48,226 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-12 06:21:48,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2022-07-12 06:21:48,228 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 61 transitions. Word has length 65 [2022-07-12 06:21:48,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:48,228 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 61 transitions. [2022-07-12 06:21:48,228 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-12 06:21:48,229 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 61 transitions. [2022-07-12 06:21:48,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-12 06:21:48,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:48,231 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-12 06:21:48,251 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-12 06:21:48,443 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-12 06:21:48,444 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:48,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:48,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1961744707, now seen corresponding path program 2 times [2022-07-12 06:21:48,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:48,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585835564] [2022-07-12 06:21:48,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:48,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:48,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:21:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:48,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:48,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:48,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:48,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:48,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:48,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:21:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:48,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 06:21:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:48,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:48,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:48,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 06:21:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:48,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:48,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:48,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:48,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:21:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:48,660 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-12 06:21:48,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:48,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585835564] [2022-07-12 06:21:48,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585835564] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:21:48,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972816739] [2022-07-12 06:21:48,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 06:21:48,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:48,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:21:48,663 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-12 06:21:48,667 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-12 06:21:48,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 06:21:48,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:21:48,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 06:21:48,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:21:48,842 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-12 06:21:48,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:21:49,402 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-12 06:21:49,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972816739] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:21:49,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:21:49,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 11] total 17 [2022-07-12 06:21:49,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920302794] [2022-07-12 06:21:49,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:21:49,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 06:21:49,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:49,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 06:21:49,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-07-12 06:21:49,405 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-12 06:21:49,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:49,688 INFO L93 Difference]: Finished difference Result 101 states and 150 transitions. [2022-07-12 06:21:49,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 06:21:49,719 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-12 06:21:49,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:49,721 INFO L225 Difference]: With dead ends: 101 [2022-07-12 06:21:49,721 INFO L226 Difference]: Without dead ends: 60 [2022-07-12 06:21:49,722 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-12 06:21:49,723 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 66 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 06:21:49,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 91 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 06:21:49,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-12 06:21:49,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2022-07-12 06:21:49,737 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-12 06:21:49,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-07-12 06:21:49,740 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 104 [2022-07-12 06:21:49,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:49,744 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2022-07-12 06:21:49,744 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-12 06:21:49,745 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-07-12 06:21:49,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 06:21:49,763 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:49,763 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-12 06:21:49,790 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-12 06:21:49,983 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-12 06:21:49,984 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:49,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:49,984 INFO L85 PathProgramCache]: Analyzing trace with hash -2094125593, now seen corresponding path program 3 times [2022-07-12 06:21:49,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:49,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272329221] [2022-07-12 06:21:49,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:49,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 06:21:50,031 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 06:21:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 06:21:50,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 06:21:50,076 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 06:21:50,076 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 06:21:50,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 06:21:50,082 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2022-07-12 06:21:50,086 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 06:21:50,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 06:21:50 BoogieIcfgContainer [2022-07-12 06:21:50,150 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 06:21:50,151 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 06:21:50,151 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 06:21:50,151 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 06:21:50,151 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:21:45" (3/4) ... [2022-07-12 06:21:50,152 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 06:21:50,199 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 06:21:50,199 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 06:21:50,200 INFO L158 Benchmark]: Toolchain (without parser) took 5285.89ms. Allocated memory was 83.9MB in the beginning and 121.6MB in the end (delta: 37.7MB). Free memory was 60.8MB in the beginning and 84.9MB in the end (delta: -24.1MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2022-07-12 06:21:50,200 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 83.9MB. Free memory is still 58.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 06:21:50,200 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.47ms. Allocated memory is still 83.9MB. Free memory was 60.8MB in the beginning and 60.9MB in the end (delta: -153.5kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 06:21:50,201 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.33ms. Allocated memory is still 83.9MB. Free memory was 60.9MB in the beginning and 59.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 06:21:50,201 INFO L158 Benchmark]: Boogie Preprocessor took 22.18ms. Allocated memory is still 83.9MB. Free memory was 59.5MB in the beginning and 58.7MB in the end (delta: 770.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 06:21:50,201 INFO L158 Benchmark]: RCFGBuilder took 278.28ms. Allocated memory is still 83.9MB. Free memory was 58.6MB in the beginning and 49.9MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 06:21:50,202 INFO L158 Benchmark]: TraceAbstraction took 4649.84ms. Allocated memory was 83.9MB in the beginning and 121.6MB in the end (delta: 37.7MB). Free memory was 49.3MB in the beginning and 89.1MB in the end (delta: -39.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 06:21:50,202 INFO L158 Benchmark]: Witness Printer took 48.74ms. Allocated memory is still 121.6MB. Free memory was 89.1MB in the beginning and 84.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 06:21:50,208 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.22ms. Allocated memory is still 83.9MB. Free memory is still 58.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.47ms. Allocated memory is still 83.9MB. Free memory was 60.8MB in the beginning and 60.9MB in the end (delta: -153.5kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.33ms. Allocated memory is still 83.9MB. Free memory was 60.9MB in the beginning and 59.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.18ms. Allocated memory is still 83.9MB. Free memory was 59.5MB in the beginning and 58.7MB in the end (delta: 770.6kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 278.28ms. Allocated memory is still 83.9MB. Free memory was 58.6MB in the beginning and 49.9MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4649.84ms. Allocated memory was 83.9MB in the beginning and 121.6MB in the end (delta: 37.7MB). Free memory was 49.3MB in the beginning and 89.1MB in the end (delta: -39.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 48.74ms. Allocated memory is still 121.6MB. Free memory was 89.1MB in the beginning and 84.9MB in the end (delta: 4.2MB). 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: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 169 mSDsluCounter, 319 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 242 mSDsCounter, 173 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 513 IncrementalHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 173 mSolverCounterUnsat, 77 mSDtfsCounter, 513 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.5s 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.1s 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-12 06:21:50,234 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