./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 574ddb4e 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/Fibonacci05.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 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-18 19:35:00,255 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 19:35:00,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 19:35:00,276 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 19:35:00,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 19:35:00,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 19:35:00,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 19:35:00,279 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 19:35:00,280 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 19:35:00,280 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 19:35:00,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 19:35:00,281 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 19:35:00,282 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 19:35:00,282 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 19:35:00,283 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 19:35:00,284 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 19:35:00,284 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 19:35:00,285 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 19:35:00,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 19:35:00,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 19:35:00,304 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 19:35:00,309 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 19:35:00,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 19:35:00,312 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 19:35:00,315 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 19:35:00,318 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 19:35:00,319 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 19:35:00,320 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 19:35:00,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 19:35:00,321 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 19:35:00,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 19:35:00,324 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 19:35:00,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 19:35:00,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 19:35:00,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 19:35:00,327 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 19:35:00,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 19:35:00,328 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 19:35:00,328 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 19:35:00,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 19:35:00,331 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 19:35:00,332 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 19:35:00,354 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 19:35:00,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 19:35:00,355 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 19:35:00,355 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 19:35:00,356 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 19:35:00,356 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 19:35:00,357 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 19:35:00,357 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 19:35:00,358 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 19:35:00,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 19:35:00,358 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 19:35:00,359 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 19:35:00,359 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 19:35:00,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 19:35:00,359 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 19:35:00,359 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 19:35:00,360 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 19:35:00,360 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 19:35:00,360 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 19:35:00,360 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 19:35:00,360 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 19:35:00,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 19:35:00,361 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 19:35:00,361 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 19:35:00,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 19:35:00,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 19:35:00,361 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 19:35:00,361 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 19:35:00,362 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 19:35:00,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 19:35:00,363 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 19:35:00,363 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 19:35:00,363 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 19:35:00,363 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 19:35:00,363 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 19:35:00,364 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd [2023-02-18 19:35:00,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 19:35:00,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 19:35:00,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 19:35:00,624 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 19:35:00,626 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 19:35:00,627 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci05.c [2023-02-18 19:35:01,730 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 19:35:01,864 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 19:35:01,864 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c [2023-02-18 19:35:01,868 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c154619c9/8eab63a4fc574ea18f08d7a39d92cbe1/FLAG9d4f3704c [2023-02-18 19:35:01,881 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c154619c9/8eab63a4fc574ea18f08d7a39d92cbe1 [2023-02-18 19:35:01,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 19:35:01,884 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 19:35:01,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 19:35:01,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 19:35:01,888 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 19:35:01,889 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:35:01" (1/1) ... [2023-02-18 19:35:01,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d0609f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:35:01, skipping insertion in model container [2023-02-18 19:35:01,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:35:01" (1/1) ... [2023-02-18 19:35:01,895 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 19:35:01,907 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 19:35:02,017 WARN L237 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/Fibonacci05.c[746,759] [2023-02-18 19:35:02,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 19:35:02,029 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 19:35:02,037 WARN L237 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/Fibonacci05.c[746,759] [2023-02-18 19:35:02,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 19:35:02,045 INFO L208 MainTranslator]: Completed translation [2023-02-18 19:35:02,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:35:02 WrapperNode [2023-02-18 19:35:02,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 19:35:02,046 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 19:35:02,046 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 19:35:02,046 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 19:35:02,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:35:02" (1/1) ... [2023-02-18 19:35:02,054 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:35:02" (1/1) ... [2023-02-18 19:35:02,062 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2023-02-18 19:35:02,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 19:35:02,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 19:35:02,063 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 19:35:02,063 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 19:35:02,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:35:02" (1/1) ... [2023-02-18 19:35:02,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:35:02" (1/1) ... [2023-02-18 19:35:02,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:35:02" (1/1) ... [2023-02-18 19:35:02,069 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:35:02" (1/1) ... [2023-02-18 19:35:02,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:35:02" (1/1) ... [2023-02-18 19:35:02,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:35:02" (1/1) ... [2023-02-18 19:35:02,098 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:35:02" (1/1) ... [2023-02-18 19:35:02,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:35:02" (1/1) ... [2023-02-18 19:35:02,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 19:35:02,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 19:35:02,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 19:35:02,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 19:35:02,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:35:02" (1/1) ... [2023-02-18 19:35:02,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 19:35:02,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:35:02,132 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) [2023-02-18 19:35:02,146 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 [2023-02-18 19:35:02,167 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2023-02-18 19:35:02,168 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2023-02-18 19:35:02,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 19:35:02,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 19:35:02,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 19:35:02,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 19:35:02,207 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 19:35:02,209 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 19:35:02,309 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 19:35:02,315 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 19:35:02,315 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-18 19:35:02,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:35:02 BoogieIcfgContainer [2023-02-18 19:35:02,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 19:35:02,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 19:35:02,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 19:35:02,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 19:35:02,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 07:35:01" (1/3) ... [2023-02-18 19:35:02,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320a5290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:35:02, skipping insertion in model container [2023-02-18 19:35:02,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:35:02" (2/3) ... [2023-02-18 19:35:02,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320a5290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:35:02, skipping insertion in model container [2023-02-18 19:35:02,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:35:02" (3/3) ... [2023-02-18 19:35:02,323 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2023-02-18 19:35:02,336 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 19:35:02,336 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 19:35:02,372 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 19:35:02,378 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3642e251, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 19:35:02,378 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 19:35:02,382 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) [2023-02-18 19:35:02,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-18 19:35:02,388 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:35:02,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:35:02,389 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:35:02,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:35:02,393 INFO L85 PathProgramCache]: Analyzing trace with hash 117289724, now seen corresponding path program 1 times [2023-02-18 19:35:02,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:35:02,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42905958] [2023-02-18 19:35:02,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:35:02,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:35:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:02,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 19:35:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:02,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 19:35:02,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:35:02,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42905958] [2023-02-18 19:35:02,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42905958] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 19:35:02,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 19:35:02,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 19:35:02,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275713715] [2023-02-18 19:35:02,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 19:35:02,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 19:35:02,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:35:02,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 19:35:02,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 19:35:02,598 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) [2023-02-18 19:35:02,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:35:02,669 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2023-02-18 19:35:02,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 19:35:02,671 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 [2023-02-18 19:35:02,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:35:02,676 INFO L225 Difference]: With dead ends: 31 [2023-02-18 19:35:02,677 INFO L226 Difference]: Without dead ends: 18 [2023-02-18 19:35:02,679 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 [2023-02-18 19:35:02,690 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 [2023-02-18 19:35:02,691 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] [2023-02-18 19:35:02,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-02-18 19:35:02,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-02-18 19:35:02,739 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) [2023-02-18 19:35:02,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-02-18 19:35:02,741 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2023-02-18 19:35:02,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:35:02,742 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-02-18 19:35:02,742 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) [2023-02-18 19:35:02,742 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-02-18 19:35:02,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-18 19:35:02,743 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:35:02,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:35:02,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 19:35:02,743 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:35:02,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:35:02,744 INFO L85 PathProgramCache]: Analyzing trace with hash 36927066, now seen corresponding path program 1 times [2023-02-18 19:35:02,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:35:02,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048483783] [2023-02-18 19:35:02,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:35:02,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:35:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:02,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 19:35:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:02,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 19:35:02,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:35:02,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048483783] [2023-02-18 19:35:02,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048483783] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 19:35:02,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 19:35:02,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 19:35:02,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668262045] [2023-02-18 19:35:02,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 19:35:02,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 19:35:02,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:35:02,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 19:35:02,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 19:35:02,850 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) [2023-02-18 19:35:02,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:35:02,885 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2023-02-18 19:35:02,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 19:35:02,886 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 [2023-02-18 19:35:02,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:35:02,887 INFO L225 Difference]: With dead ends: 24 [2023-02-18 19:35:02,887 INFO L226 Difference]: Without dead ends: 20 [2023-02-18 19:35:02,887 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 [2023-02-18 19:35:02,888 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 [2023-02-18 19:35:02,888 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] [2023-02-18 19:35:02,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-18 19:35:02,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2023-02-18 19:35:02,896 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) [2023-02-18 19:35:02,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-02-18 19:35:02,897 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2023-02-18 19:35:02,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:35:02,897 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-02-18 19:35:02,898 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) [2023-02-18 19:35:02,898 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-02-18 19:35:02,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-18 19:35:02,900 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:35:02,900 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:35:02,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 19:35:02,900 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:35:02,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:35:02,901 INFO L85 PathProgramCache]: Analyzing trace with hash 703243533, now seen corresponding path program 1 times [2023-02-18 19:35:02,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:35:02,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807578439] [2023-02-18 19:35:02,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:35:02,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:35:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:02,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 19:35:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:02,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:03,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 19:35:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:03,006 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 19:35:03,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:35:03,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807578439] [2023-02-18 19:35:03,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807578439] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 19:35:03,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905605683] [2023-02-18 19:35:03,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:35:03,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:35:03,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:35:03,010 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) [2023-02-18 19:35:03,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-18 19:35:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:03,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-18 19:35:03,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:35:03,101 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 19:35:03,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:35:03,201 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-18 19:35:03,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905605683] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 19:35:03,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 19:35:03,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2023-02-18 19:35:03,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050585795] [2023-02-18 19:35:03,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 19:35:03,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 19:35:03,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:35:03,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 19:35:03,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-02-18 19:35:03,204 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) [2023-02-18 19:35:03,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:35:03,348 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2023-02-18 19:35:03,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 19:35:03,348 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 [2023-02-18 19:35:03,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:35:03,350 INFO L225 Difference]: With dead ends: 46 [2023-02-18 19:35:03,350 INFO L226 Difference]: Without dead ends: 29 [2023-02-18 19:35:03,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2023-02-18 19:35:03,352 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 19:35:03,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 63 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 19:35:03,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-18 19:35:03,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-18 19:35:03,357 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) [2023-02-18 19:35:03,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2023-02-18 19:35:03,358 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 23 [2023-02-18 19:35:03,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:35:03,359 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2023-02-18 19:35:03,359 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) [2023-02-18 19:35:03,359 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2023-02-18 19:35:03,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-18 19:35:03,361 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:35:03,361 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:35:03,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-18 19:35:03,566 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 [2023-02-18 19:35:03,567 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:35:03,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:35:03,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1937134450, now seen corresponding path program 1 times [2023-02-18 19:35:03,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:35:03,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50148445] [2023-02-18 19:35:03,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:35:03,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:35:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:03,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 19:35:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:03,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:03,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:03,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 19:35:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:03,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 19:35:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:03,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:03,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 19:35:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:03,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:03,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 19:35:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-02-18 19:35:03,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:35:03,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50148445] [2023-02-18 19:35:03,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50148445] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 19:35:03,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522301418] [2023-02-18 19:35:03,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:35:03,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:35:03,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:35:03,954 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) [2023-02-18 19:35:03,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-18 19:35:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:04,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 19:35:04,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:35:04,054 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2023-02-18 19:35:04,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:35:04,178 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 82 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-18 19:35:04,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522301418] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 19:35:04,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 19:35:04,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2023-02-18 19:35:04,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227691197] [2023-02-18 19:35:04,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 19:35:04,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 19:35:04,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:35:04,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 19:35:04,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2023-02-18 19:35:04,182 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) [2023-02-18 19:35:04,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:35:04,316 INFO L93 Difference]: Finished difference Result 73 states and 123 transitions. [2023-02-18 19:35:04,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 19:35:04,317 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 [2023-02-18 19:35:04,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:35:04,318 INFO L225 Difference]: With dead ends: 73 [2023-02-18 19:35:04,318 INFO L226 Difference]: Without dead ends: 44 [2023-02-18 19:35:04,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 134 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2023-02-18 19:35:04,320 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 19:35:04,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 93 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 19:35:04,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-18 19:35:04,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-02-18 19:35:04,325 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, (24), 9 states have call predecessors, (24), 7 states have call successors, (24) [2023-02-18 19:35:04,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 66 transitions. [2023-02-18 19:35:04,326 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 66 transitions. Word has length 65 [2023-02-18 19:35:04,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:35:04,326 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 66 transitions. [2023-02-18 19:35:04,327 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) [2023-02-18 19:35:04,327 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 66 transitions. [2023-02-18 19:35:04,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-02-18 19:35:04,330 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:35:04,330 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 17, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:35:04,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 19:35:04,537 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 [2023-02-18 19:35:04,537 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:35:04,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:35:04,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1389805118, now seen corresponding path program 2 times [2023-02-18 19:35:04,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:35:04,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913443571] [2023-02-18 19:35:04,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:35:04,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:35:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:04,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 19:35:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:04,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:04,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:04,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:04,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:04,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 19:35:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:04,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 19:35:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:04,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-18 19:35:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:04,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:04,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 19:35:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:04,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 19:35:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:05,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:05,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:05,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:05,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 19:35:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:05,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 19:35:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:05,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-18 19:35:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:05,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:05,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:05,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:05,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 19:35:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:05,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 19:35:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:05,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-18 19:35:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:05,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:05,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 19:35:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:05,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 253 proven. 368 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2023-02-18 19:35:05,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:35:05,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913443571] [2023-02-18 19:35:05,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913443571] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 19:35:05,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675074669] [2023-02-18 19:35:05,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 19:35:05,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:35:05,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:35:05,160 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) [2023-02-18 19:35:05,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 19:35:05,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 19:35:05,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 19:35:05,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-18 19:35:05,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:35:05,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 459 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2023-02-18 19:35:05,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:35:05,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 485 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2023-02-18 19:35:05,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675074669] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 19:35:05,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 19:35:05,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 23 [2023-02-18 19:35:05,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435078820] [2023-02-18 19:35:05,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 19:35:05,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-18 19:35:05,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:35:05,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-18 19:35:05,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2023-02-18 19:35:05,534 INFO L87 Difference]: Start difference. First operand 44 states and 66 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2023-02-18 19:35:05,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:35:05,850 INFO L93 Difference]: Finished difference Result 119 states and 223 transitions. [2023-02-18 19:35:05,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-18 19:35:05,852 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) Word has length 171 [2023-02-18 19:35:05,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:35:05,858 INFO L225 Difference]: With dead ends: 119 [2023-02-18 19:35:05,859 INFO L226 Difference]: Without dead ends: 76 [2023-02-18 19:35:05,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 379 SyntacticMatches, 9 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=515, Invalid=1291, Unknown=0, NotChecked=0, Total=1806 [2023-02-18 19:35:05,863 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 78 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 19:35:05,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 108 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 19:35:05,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-18 19:35:05,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2023-02-18 19:35:05,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 12 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (37), 13 states have call predecessors, (37), 12 states have call successors, (37) [2023-02-18 19:35:05,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 105 transitions. [2023-02-18 19:35:05,889 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 105 transitions. Word has length 171 [2023-02-18 19:35:05,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:35:05,889 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 105 transitions. [2023-02-18 19:35:05,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2023-02-18 19:35:05,890 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 105 transitions. [2023-02-18 19:35:05,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2023-02-18 19:35:05,892 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:35:05,892 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:35:05,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-18 19:35:06,097 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 [2023-02-18 19:35:06,098 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:35:06,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:35:06,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1020156483, now seen corresponding path program 3 times [2023-02-18 19:35:06,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:35:06,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085391758] [2023-02-18 19:35:06,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:35:06,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:35:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:06,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 19:35:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:06,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:06,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:06,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:06,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:06,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:06,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:06,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 19:35:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:06,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 19:35:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:06,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-18 19:35:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:06,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:06,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 19:35:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:06,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-18 19:35:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:06,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:06,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:06,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 19:35:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:06,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 19:35:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:06,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-18 19:35:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:06,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:06,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:06,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:06,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 19:35:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:06,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 19:35:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:06,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-18 19:35:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:06,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:06,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 19:35:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:06,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-18 19:35:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:07,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:07,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:07,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:07,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:07,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:07,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 19:35:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:07,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 19:35:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:07,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-18 19:35:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:07,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:07,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 19:35:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:07,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-18 19:35:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:07,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:07,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:07,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 19:35:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:07,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 19:35:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:07,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-18 19:35:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:07,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:07,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:07,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:07,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 19:35:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:07,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 19:35:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:07,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-18 19:35:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:07,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 19:35:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:07,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 19:35:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:35:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 844 proven. 1612 refuted. 0 times theorem prover too weak. 4664 trivial. 0 not checked. [2023-02-18 19:35:07,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:35:07,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085391758] [2023-02-18 19:35:07,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085391758] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 19:35:07,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740452025] [2023-02-18 19:35:07,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 19:35:07,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:35:07,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:35:07,252 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 19:35:07,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 19:35:07,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2023-02-18 19:35:07,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 19:35:07,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-18 19:35:07,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:35:07,450 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1491 refuted. 0 times theorem prover too weak. 5415 trivial. 0 not checked. [2023-02-18 19:35:07,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:35:07,640 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1548 refuted. 0 times theorem prover too weak. 5358 trivial. 0 not checked. [2023-02-18 19:35:07,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740452025] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 19:35:07,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 19:35:07,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11, 17] total 33 [2023-02-18 19:35:07,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171161337] [2023-02-18 19:35:07,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 19:35:07,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-18 19:35:07,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:35:07,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-18 19:35:07,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2023-02-18 19:35:07,643 INFO L87 Difference]: Start difference. First operand 66 states and 105 transitions. Second operand has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) [2023-02-18 19:35:08,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:35:08,056 INFO L93 Difference]: Finished difference Result 172 states and 339 transitions. [2023-02-18 19:35:08,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-18 19:35:08,058 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) Word has length 351 [2023-02-18 19:35:08,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:35:08,059 INFO L225 Difference]: With dead ends: 172 [2023-02-18 19:35:08,059 INFO L226 Difference]: Without dead ends: 109 [2023-02-18 19:35:08,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 774 SyntacticMatches, 21 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=654, Invalid=1896, Unknown=0, NotChecked=0, Total=2550 [2023-02-18 19:35:08,061 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 140 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 19:35:08,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 171 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 19:35:08,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-18 19:35:08,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2023-02-18 19:35:08,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 64 states have (on average 1.109375) internal successors, (71), 62 states have internal predecessors, (71), 17 states have call successors, (17), 12 states have call predecessors, (17), 9 states have return successors, (38), 16 states have call predecessors, (38), 17 states have call successors, (38) [2023-02-18 19:35:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 126 transitions. [2023-02-18 19:35:08,071 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 126 transitions. Word has length 351 [2023-02-18 19:35:08,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:35:08,084 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 126 transitions. [2023-02-18 19:35:08,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) [2023-02-18 19:35:08,085 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 126 transitions. [2023-02-18 19:35:08,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2023-02-18 19:35:08,089 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:35:08,090 INFO L195 NwaCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:35:08,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-18 19:35:08,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:35:08,295 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:35:08,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:35:08,296 INFO L85 PathProgramCache]: Analyzing trace with hash 670316307, now seen corresponding path program 4 times [2023-02-18 19:35:08,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:35:08,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625498450] [2023-02-18 19:35:08,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:35:08,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:35:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 19:35:08,340 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 19:35:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 19:35:08,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 19:35:08,440 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-18 19:35:08,441 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 19:35:08,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-18 19:35:08,446 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2023-02-18 19:35:08,451 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 19:35:08,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 07:35:08 BoogieIcfgContainer [2023-02-18 19:35:08,551 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 19:35:08,552 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 19:35:08,552 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 19:35:08,552 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 19:35:08,552 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:35:02" (3/4) ... [2023-02-18 19:35:08,554 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-18 19:35:08,635 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 19:35:08,635 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 19:35:08,636 INFO L158 Benchmark]: Toolchain (without parser) took 6751.50ms. Allocated memory was 111.1MB in the beginning and 245.4MB in the end (delta: 134.2MB). Free memory was 65.4MB in the beginning and 97.5MB in the end (delta: -32.1MB). Peak memory consumption was 103.8MB. Max. memory is 16.1GB. [2023-02-18 19:35:08,636 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 111.1MB. Free memory was 82.8MB in the beginning and 82.8MB in the end (delta: 24.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 19:35:08,636 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.30ms. Allocated memory is still 111.1MB. Free memory was 65.4MB in the beginning and 55.5MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-18 19:35:08,636 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.62ms. Allocated memory is still 111.1MB. Free memory was 55.5MB in the beginning and 54.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 19:35:08,637 INFO L158 Benchmark]: Boogie Preprocessor took 40.79ms. Allocated memory is still 111.1MB. Free memory was 53.8MB in the beginning and 85.2MB in the end (delta: -31.4MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2023-02-18 19:35:08,637 INFO L158 Benchmark]: RCFGBuilder took 212.73ms. Allocated memory was 111.1MB in the beginning and 138.4MB in the end (delta: 27.3MB). Free memory was 85.2MB in the beginning and 105.5MB in the end (delta: -20.4MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2023-02-18 19:35:08,637 INFO L158 Benchmark]: TraceAbstraction took 6233.21ms. Allocated memory was 138.4MB in the beginning and 245.4MB in the end (delta: 107.0MB). Free memory was 105.5MB in the beginning and 106.9MB in the end (delta: -1.4MB). Peak memory consumption was 105.0MB. Max. memory is 16.1GB. [2023-02-18 19:35:08,637 INFO L158 Benchmark]: Witness Printer took 83.57ms. Allocated memory is still 245.4MB. Free memory was 106.9MB in the beginning and 97.5MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 19:35:08,639 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.28ms. Allocated memory is still 111.1MB. Free memory was 82.8MB in the beginning and 82.8MB in the end (delta: 24.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 159.30ms. Allocated memory is still 111.1MB. Free memory was 65.4MB in the beginning and 55.5MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.62ms. Allocated memory is still 111.1MB. Free memory was 55.5MB in the beginning and 54.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.79ms. Allocated memory is still 111.1MB. Free memory was 53.8MB in the beginning and 85.2MB in the end (delta: -31.4MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * RCFGBuilder took 212.73ms. Allocated memory was 111.1MB in the beginning and 138.4MB in the end (delta: 27.3MB). Free memory was 85.2MB in the beginning and 105.5MB in the end (delta: -20.4MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6233.21ms. Allocated memory was 138.4MB in the beginning and 245.4MB in the end (delta: 107.0MB). Free memory was 105.5MB in the beginning and 106.9MB in the end (delta: -1.4MB). Peak memory consumption was 105.0MB. Max. memory is 16.1GB. * Witness Printer took 83.57ms. Allocated memory is still 245.4MB. Free memory was 106.9MB in the beginning and 97.5MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. 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: 33]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L17] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) VAL [fibonacci(x)=21, x=8] [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L33] reach_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 7, TraceHistogramMax: 67, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 320 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 303 mSDsluCounter, 507 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 404 mSDsCounter, 550 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1038 IncrementalHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 550 mSolverCounterUnsat, 103 mSDtfsCounter, 1038 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1518 GetRequests, 1338 SyntacticMatches, 41 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1525 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=6, InterpolantAutomatonStates: 100, 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, 6 MinimizatonAttempts, 30 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1701 NumberOfCodeBlocks, 1604 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1837 ConstructedInterpolants, 0 QuantifiedInterpolants, 3639 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1233 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 20564/26763 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! [2023-02-18 19:35:08,674 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