./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17335c9c-efa0-47ce-9ff7-92b3c8cac6a7/bin/ukojak-LBtLqBUTdQ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17335c9c-efa0-47ce-9ff7-92b3c8cac6a7/bin/ukojak-LBtLqBUTdQ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17335c9c-efa0-47ce-9ff7-92b3c8cac6a7/bin/ukojak-LBtLqBUTdQ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17335c9c-efa0-47ce-9ff7-92b3c8cac6a7/bin/ukojak-LBtLqBUTdQ/config/KojakReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17335c9c-efa0-47ce-9ff7-92b3c8cac6a7/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17335c9c-efa0-47ce-9ff7-92b3c8cac6a7/bin/ukojak-LBtLqBUTdQ --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 01:24:13,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 01:24:13,247 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 01:24:13,301 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 01:24:13,302 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 01:24:13,306 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 01:24:13,307 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 01:24:13,311 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 01:24:13,314 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 01:24:13,320 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 01:24:13,321 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 01:24:13,322 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 01:24:13,323 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 01:24:13,324 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 01:24:13,326 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 01:24:13,327 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 01:24:13,328 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 01:24:13,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 01:24:13,331 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 01:24:13,334 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 01:24:13,336 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 01:24:13,337 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 01:24:13,339 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 01:24:13,340 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 01:24:13,343 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 01:24:13,344 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 01:24:13,344 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 01:24:13,345 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 01:24:13,346 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 01:24:13,347 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 01:24:13,347 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 01:24:13,348 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 01:24:13,349 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 01:24:13,350 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 01:24:13,351 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 01:24:13,352 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 01:24:13,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 01:24:13,353 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 01:24:13,353 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 01:24:13,354 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 01:24:13,355 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 01:24:13,356 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17335c9c-efa0-47ce-9ff7-92b3c8cac6a7/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-11-23 01:24:13,384 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 01:24:13,385 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 01:24:13,386 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 01:24:13,386 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-11-23 01:24:13,387 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 01:24:13,387 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 01:24:13,387 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 01:24:13,388 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 01:24:13,388 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 01:24:13,388 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 01:24:13,388 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 01:24:13,388 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 01:24:13,389 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 01:24:13,389 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 01:24:13,389 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 01:24:13,389 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 01:24:13,389 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 01:24:13,389 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 01:24:13,390 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-11-23 01:24:13,390 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-11-23 01:24:13,390 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 01:24:13,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 01:24:13,391 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 01:24:13,391 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 01:24:13,391 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 01:24:13,391 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-11-23 01:24:13,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 01:24:13,391 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 01:24:13,392 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17335c9c-efa0-47ce-9ff7-92b3c8cac6a7/bin/ukojak-LBtLqBUTdQ/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17335c9c-efa0-47ce-9ff7-92b3c8cac6a7/bin/ukojak-LBtLqBUTdQ 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 -> Kojak 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 -> 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 [2021-11-23 01:24:13,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 01:24:13,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 01:24:13,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 01:24:13,684 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 01:24:13,685 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 01:24:13,686 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17335c9c-efa0-47ce-9ff7-92b3c8cac6a7/bin/ukojak-LBtLqBUTdQ/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2021-11-23 01:24:13,772 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17335c9c-efa0-47ce-9ff7-92b3c8cac6a7/bin/ukojak-LBtLqBUTdQ/data/5de5863a3/1817d60adf4942a187904459dcbe9a95/FLAGd3ed4bbe9 [2021-11-23 01:24:14,257 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 01:24:14,259 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17335c9c-efa0-47ce-9ff7-92b3c8cac6a7/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2021-11-23 01:24:14,273 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17335c9c-efa0-47ce-9ff7-92b3c8cac6a7/bin/ukojak-LBtLqBUTdQ/data/5de5863a3/1817d60adf4942a187904459dcbe9a95/FLAGd3ed4bbe9 [2021-11-23 01:24:14,618 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17335c9c-efa0-47ce-9ff7-92b3c8cac6a7/bin/ukojak-LBtLqBUTdQ/data/5de5863a3/1817d60adf4942a187904459dcbe9a95 [2021-11-23 01:24:14,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 01:24:14,621 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 01:24:14,624 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 01:24:14,624 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 01:24:14,627 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 01:24:14,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:24:14" (1/1) ... [2021-11-23 01:24:14,630 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36dd60b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:14, skipping insertion in model container [2021-11-23 01:24:14,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:24:14" (1/1) ... [2021-11-23 01:24:14,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 01:24:14,656 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 01:24:14,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17335c9c-efa0-47ce-9ff7-92b3c8cac6a7/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c[947,960] [2021-11-23 01:24:14,829 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 01:24:14,837 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 01:24:14,852 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17335c9c-efa0-47ce-9ff7-92b3c8cac6a7/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c[947,960] [2021-11-23 01:24:14,853 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 01:24:14,865 INFO L208 MainTranslator]: Completed translation [2021-11-23 01:24:14,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:14 WrapperNode [2021-11-23 01:24:14,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 01:24:14,867 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 01:24:14,867 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 01:24:14,868 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 01:24:14,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:14" (1/1) ... [2021-11-23 01:24:14,883 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:14" (1/1) ... [2021-11-23 01:24:14,899 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2021-11-23 01:24:14,900 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 01:24:14,901 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 01:24:14,901 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 01:24:14,901 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 01:24:14,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:14" (1/1) ... [2021-11-23 01:24:14,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:14" (1/1) ... [2021-11-23 01:24:14,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:14" (1/1) ... [2021-11-23 01:24:14,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:14" (1/1) ... [2021-11-23 01:24:14,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:14" (1/1) ... [2021-11-23 01:24:14,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:14" (1/1) ... [2021-11-23 01:24:14,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:14" (1/1) ... [2021-11-23 01:24:14,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 01:24:14,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 01:24:14,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 01:24:14,921 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 01:24:14,922 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:24:14" (1/1) ... [2021-11-23 01:24:14,930 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 01:24:14,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17335c9c-efa0-47ce-9ff7-92b3c8cac6a7/bin/ukojak-LBtLqBUTdQ/z3 [2021-11-23 01:24:14,970 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17335c9c-efa0-47ce-9ff7-92b3c8cac6a7/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-11-23 01:24:14,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17335c9c-efa0-47ce-9ff7-92b3c8cac6a7/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-11-23 01:24:15,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 01:24:15,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 01:24:15,016 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2021-11-23 01:24:15,017 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2021-11-23 01:24:15,017 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2021-11-23 01:24:15,017 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2021-11-23 01:24:15,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 01:24:15,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 01:24:15,088 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 01:24:15,091 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 01:24:15,233 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 01:24:15,246 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 01:24:15,246 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-23 01:24:15,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:24:15 BoogieIcfgContainer [2021-11-23 01:24:15,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 01:24:15,266 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-11-23 01:24:15,266 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-11-23 01:24:15,281 INFO L275 PluginConnector]: CodeCheck initialized [2021-11-23 01:24:15,281 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:24:15" (1/1) ... [2021-11-23 01:24:15,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:24:15,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:24:15,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 26 states and 33 transitions. [2021-11-23 01:24:15,378 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2021-11-23 01:24:15,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-23 01:24:15,383 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:24:15,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:24:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:24:15,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:24:15,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:24:15,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 30 states and 39 transitions. [2021-11-23 01:24:15,663 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2021-11-23 01:24:15,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-23 01:24:15,664 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:24:15,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:24:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:24:15,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:24:15,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:24:15,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 34 states and 46 transitions. [2021-11-23 01:24:15,983 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2021-11-23 01:24:15,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 01:24:15,987 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:24:15,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:24:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:24:16,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 01:24:16,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:24:16,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 36 states and 50 transitions. [2021-11-23 01:24:16,274 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2021-11-23 01:24:16,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-23 01:24:16,276 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:24:16,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:24:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:24:16,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 01:24:17,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:24:17,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 43 states and 66 transitions. [2021-11-23 01:24:17,081 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 66 transitions. [2021-11-23 01:24:17,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 01:24:17,083 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:24:17,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:24:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:24:17,262 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 01:24:17,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:24:17,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 45 states and 69 transitions. [2021-11-23 01:24:17,666 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 69 transitions. [2021-11-23 01:24:17,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 01:24:17,669 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:24:17,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:24:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:24:17,936 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 01:24:18,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:24:18,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 45 states and 66 transitions. [2021-11-23 01:24:18,568 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2021-11-23 01:24:18,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 01:24:18,570 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:24:18,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:24:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:24:18,729 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 01:24:19,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:24:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 57 states and 95 transitions. [2021-11-23 01:24:19,927 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 95 transitions. [2021-11-23 01:24:19,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-23 01:24:19,932 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:24:19,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:24:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:24:19,987 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-23 01:24:20,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:24:20,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 57 states and 94 transitions. [2021-11-23 01:24:20,162 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 94 transitions. [2021-11-23 01:24:20,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-23 01:24:20,165 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:24:20,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:24:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:24:20,558 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-23 01:24:21,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:24:21,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 60 states and 102 transitions. [2021-11-23 01:24:21,894 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 102 transitions. [2021-11-23 01:24:21,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-23 01:24:21,897 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:24:21,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:24:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:24:22,122 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 9 proven. 62 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-11-23 01:24:23,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:24:23,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 70 states and 129 transitions. [2021-11-23 01:24:23,140 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 129 transitions. [2021-11-23 01:24:23,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-23 01:24:23,143 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:24:23,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:24:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:24:23,207 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 16 proven. 77 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2021-11-23 01:24:23,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:24:23,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 72 states and 131 transitions. [2021-11-23 01:24:23,472 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 131 transitions. [2021-11-23 01:24:23,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-23 01:24:23,474 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:24:23,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:24:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:24:23,534 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 16 proven. 77 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2021-11-23 01:24:23,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:24:23,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 74 states and 133 transitions. [2021-11-23 01:24:23,793 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 133 transitions. [2021-11-23 01:24:23,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-11-23 01:24:23,796 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:24:23,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:24:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:24:24,018 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 44 proven. 193 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2021-11-23 01:24:25,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:24:25,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 84 states and 161 transitions. [2021-11-23 01:24:25,184 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 161 transitions. [2021-11-23 01:24:25,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-11-23 01:24:25,188 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:24:25,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:24:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:24:25,274 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 49 proven. 241 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2021-11-23 01:24:25,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:24:25,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 86 states and 163 transitions. [2021-11-23 01:24:25,574 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 163 transitions. [2021-11-23 01:24:25,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-11-23 01:24:25,577 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:24:25,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:24:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:24:25,656 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 44 proven. 193 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2021-11-23 01:24:25,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:24:25,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 88 states and 165 transitions. [2021-11-23 01:24:25,965 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 165 transitions. [2021-11-23 01:24:25,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2021-11-23 01:24:25,969 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:24:25,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:24:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:24:26,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1097 backedges. 186 proven. 229 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2021-11-23 01:24:27,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:24:27,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 90 states and 164 transitions. [2021-11-23 01:24:27,325 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 164 transitions. [2021-11-23 01:24:27,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2021-11-23 01:24:27,330 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:24:27,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:24:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:24:27,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2003 backedges. 71 proven. 461 refuted. 0 times theorem prover too weak. 1471 trivial. 0 not checked. [2021-11-23 01:24:29,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:24:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 102 states and 195 transitions. [2021-11-23 01:24:29,250 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 195 transitions. [2021-11-23 01:24:29,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2021-11-23 01:24:29,253 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:24:29,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:24:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:24:29,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2003 backedges. 71 proven. 461 refuted. 0 times theorem prover too weak. 1471 trivial. 0 not checked. [2021-11-23 01:24:29,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:24:29,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 104 states and 197 transitions. [2021-11-23 01:24:29,736 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 197 transitions. [2021-11-23 01:24:29,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2021-11-23 01:24:29,740 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:24:29,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:24:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:24:30,265 INFO L134 CoverageAnalysis]: Checked inductivity of 5016 backedges. 576 proven. 701 refuted. 0 times theorem prover too weak. 3739 trivial. 0 not checked. [2021-11-23 01:24:30,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:24:30,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 104 states and 196 transitions. [2021-11-23 01:24:30,790 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 196 transitions. [2021-11-23 01:24:30,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2021-11-23 01:24:30,796 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:24:30,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:24:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:24:31,149 INFO L134 CoverageAnalysis]: Checked inductivity of 7277 backedges. 208 proven. 1069 refuted. 0 times theorem prover too weak. 6000 trivial. 0 not checked. [2021-11-23 01:24:32,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:24:32,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 116 states and 229 transitions. [2021-11-23 01:24:32,938 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 229 transitions. [2021-11-23 01:24:32,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2021-11-23 01:24:32,944 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:24:32,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:24:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:24:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 12466 backedges. 233 proven. 1458 refuted. 0 times theorem prover too weak. 10775 trivial. 0 not checked. [2021-11-23 01:24:33,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:24:33,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 118 states and 231 transitions. [2021-11-23 01:24:33,581 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 231 transitions. [2021-11-23 01:24:33,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2021-11-23 01:24:33,586 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:24:33,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:24:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:24:33,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6090 backedges. 673 proven. 163 refuted. 0 times theorem prover too weak. 5254 trivial. 0 not checked. [2021-11-23 01:24:34,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:24:34,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 118 states and 230 transitions. [2021-11-23 01:24:34,112 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 230 transitions. [2021-11-23 01:24:34,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2021-11-23 01:24:34,118 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:24:34,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:24:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:24:34,796 INFO L134 CoverageAnalysis]: Checked inductivity of 10358 backedges. 568 proven. 833 refuted. 0 times theorem prover too weak. 8957 trivial. 0 not checked. [2021-11-23 01:24:36,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:24:36,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 121 states and 202 transitions. [2021-11-23 01:24:36,942 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 202 transitions. [2021-11-23 01:24:36,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2021-11-23 01:24:36,949 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:24:36,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:24:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:24:37,453 INFO L134 CoverageAnalysis]: Checked inductivity of 14700 backedges. 491 proven. 1193 refuted. 0 times theorem prover too weak. 13016 trivial. 0 not checked. [2021-11-23 01:24:38,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:24:38,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 125 states and 204 transitions. [2021-11-23 01:24:38,611 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 204 transitions. [2021-11-23 01:24:38,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2021-11-23 01:24:38,618 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:24:38,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:24:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:24:39,052 INFO L134 CoverageAnalysis]: Checked inductivity of 17073 backedges. 616 proven. 912 refuted. 0 times theorem prover too weak. 15545 trivial. 0 not checked. [2021-11-23 01:24:39,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:24:39,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 125 states and 199 transitions. [2021-11-23 01:24:39,607 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 199 transitions. [2021-11-23 01:24:39,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2021-11-23 01:24:39,616 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:24:39,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:24:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:24:40,110 INFO L134 CoverageAnalysis]: Checked inductivity of 11340 backedges. 840 proven. 628 refuted. 0 times theorem prover too weak. 9872 trivial. 0 not checked. [2021-11-23 01:24:40,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:24:40,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 125 states and 197 transitions. [2021-11-23 01:24:40,588 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 197 transitions. [2021-11-23 01:24:40,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2021-11-23 01:24:40,593 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:24:40,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:24:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:24:41,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6900 backedges. 270 proven. 1021 refuted. 0 times theorem prover too weak. 5609 trivial. 0 not checked. [2021-11-23 01:24:41,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:24:41,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 125 states and 191 transitions. [2021-11-23 01:24:41,546 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 191 transitions. [2021-11-23 01:24:41,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2021-11-23 01:24:41,550 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:24:41,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:24:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:24:41,672 INFO L134 CoverageAnalysis]: Checked inductivity of 5352 backedges. 393 proven. 387 refuted. 0 times theorem prover too weak. 4572 trivial. 0 not checked. [2021-11-23 01:24:42,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:24:42,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 125 states and 190 transitions. [2021-11-23 01:24:42,149 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 190 transitions. [2021-11-23 01:24:42,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2021-11-23 01:24:42,153 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:24:42,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:24:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 01:24:42,223 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 01:24:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 01:24:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 01:24:42,563 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 01:24:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 01:24:42,824 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 29 iterations. [2021-11-23 01:24:43,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 01:24:43 ImpRootNode [2021-11-23 01:24:43,047 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-11-23 01:24:43,052 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 01:24:43,053 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 01:24:43,053 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 01:24:43,053 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:24:15" (3/4) ... [2021-11-23 01:24:43,055 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-23 01:24:43,260 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17335c9c-efa0-47ce-9ff7-92b3c8cac6a7/bin/ukojak-LBtLqBUTdQ/witness.graphml [2021-11-23 01:24:43,261 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 01:24:43,262 INFO L158 Benchmark]: Toolchain (without parser) took 28640.11ms. Allocated memory was 94.4MB in the beginning and 247.5MB in the end (delta: 153.1MB). Free memory was 58.7MB in the beginning and 106.3MB in the end (delta: -47.6MB). Peak memory consumption was 105.7MB. Max. memory is 16.1GB. [2021-11-23 01:24:43,262 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 94.4MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 01:24:43,262 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.33ms. Allocated memory is still 94.4MB. Free memory was 58.5MB in the beginning and 71.7MB in the end (delta: -13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-23 01:24:43,263 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.00ms. Allocated memory is still 94.4MB. Free memory was 71.7MB in the beginning and 70.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 01:24:43,264 INFO L158 Benchmark]: Boogie Preprocessor took 19.50ms. Allocated memory is still 94.4MB. Free memory was 70.1MB in the beginning and 69.3MB in the end (delta: 865.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 01:24:43,264 INFO L158 Benchmark]: RCFGBuilder took 344.61ms. Allocated memory is still 94.4MB. Free memory was 69.3MB in the beginning and 60.0MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-23 01:24:43,264 INFO L158 Benchmark]: CodeCheck took 27785.70ms. Allocated memory was 94.4MB in the beginning and 247.5MB in the end (delta: 153.1MB). Free memory was 59.6MB in the beginning and 117.8MB in the end (delta: -58.2MB). Peak memory consumption was 95.7MB. Max. memory is 16.1GB. [2021-11-23 01:24:43,265 INFO L158 Benchmark]: Witness Printer took 208.38ms. Allocated memory is still 247.5MB. Free memory was 117.8MB in the beginning and 106.3MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-23 01:24:43,267 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.5s, OverallIterations: 29, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6880 SdHoareTripleChecker+Valid, 30.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3171 mSDsluCounter, 5674 SdHoareTripleChecker+Invalid, 25.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3599 mSDsCounter, 6098 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21996 IncrementalHoareTripleChecker+Invalid, 28094 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6098 mSolverCounterUnsat, 2075 mSDtfsCounter, 21996 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32912 GetRequests, 31783 SyntacticMatches, 795 SemanticMatches, 334 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56735 ImplicationChecksByTransitivity, 19.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 7865 NumberOfCodeBlocks, 7865 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 7378 ConstructedInterpolants, 0 QuantifiedInterpolants, 9450 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 2 PerfectInterpolantSequences, 94208/104616 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 8; VAL [x=8] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [fibo1(x)=21, x=8] [L39] int result = fibo1(x); [L40] COND TRUE result == 21 VAL [result=21, x=8] [L41] reach_error() VAL [result=21, x=8] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 94.4MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.33ms. Allocated memory is still 94.4MB. Free memory was 58.5MB in the beginning and 71.7MB in the end (delta: -13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.00ms. Allocated memory is still 94.4MB. Free memory was 71.7MB in the beginning and 70.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.50ms. Allocated memory is still 94.4MB. Free memory was 70.1MB in the beginning and 69.3MB in the end (delta: 865.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 344.61ms. Allocated memory is still 94.4MB. Free memory was 69.3MB in the beginning and 60.0MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * CodeCheck took 27785.70ms. Allocated memory was 94.4MB in the beginning and 247.5MB in the end (delta: 153.1MB). Free memory was 59.6MB in the beginning and 117.8MB in the end (delta: -58.2MB). Peak memory consumption was 95.7MB. Max. memory is 16.1GB. * Witness Printer took 208.38ms. Allocated memory is still 247.5MB. Free memory was 117.8MB in the beginning and 106.3MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2021-11-23 01:24:43,331 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17335c9c-efa0-47ce-9ff7-92b3c8cac6a7/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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