./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/Fibonacci02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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/Fibonacci02.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7261cadd839cd02322bb28945f92ad1bd2170c0a65dd385996b5ff81cbb1de7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 09:06:21,008 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 09:06:21,010 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 09:06:21,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 09:06:21,041 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 09:06:21,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 09:06:21,046 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 09:06:21,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 09:06:21,049 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 09:06:21,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 09:06:21,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 09:06:21,055 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 09:06:21,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 09:06:21,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 09:06:21,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 09:06:21,059 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 09:06:21,060 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 09:06:21,061 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 09:06:21,061 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 09:06:21,065 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 09:06:21,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 09:06:21,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 09:06:21,067 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 09:06:21,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 09:06:21,074 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 09:06:21,074 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 09:06:21,074 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 09:06:21,075 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 09:06:21,076 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 09:06:21,076 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 09:06:21,076 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 09:06:21,077 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 09:06:21,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 09:06:21,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 09:06:21,080 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 09:06:21,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 09:06:21,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 09:06:21,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 09:06:21,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 09:06:21,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 09:06:21,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 09:06:21,083 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-02-17 09:06:21,106 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 09:06:21,107 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 09:06:21,107 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 09:06:21,107 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 09:06:21,108 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 09:06:21,108 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 09:06:21,109 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 09:06:21,109 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 09:06:21,109 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 09:06:21,109 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 09:06:21,110 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 09:06:21,110 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 09:06:21,110 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 09:06:21,110 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 09:06:21,110 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 09:06:21,110 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 09:06:21,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 09:06:21,111 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 09:06:21,111 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-17 09:06:21,111 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 09:06:21,111 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 09:06:21,111 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 09:06:21,111 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 09:06:21,112 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 09:06:21,112 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 09:06:21,112 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 09:06:21,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 09:06:21,112 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 09:06:21,113 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 09:06:21,113 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 09:06:21,113 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 09:06:21,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 09:06:21,113 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 09:06:21,113 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 09:06:21,114 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 09:06:21,114 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 09:06:21,114 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 09:06:21,114 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 ! overflow) ) 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 -> b7261cadd839cd02322bb28945f92ad1bd2170c0a65dd385996b5ff81cbb1de7 [2023-02-17 09:06:21,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 09:06:21,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 09:06:21,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 09:06:21,324 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 09:06:21,325 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 09:06:21,325 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci02.c [2023-02-17 09:06:22,320 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 09:06:22,467 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 09:06:22,467 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci02.c [2023-02-17 09:06:22,471 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36dc78437/95501f0c2847485688e99a805615eeda/FLAGf8efff9bc [2023-02-17 09:06:22,485 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36dc78437/95501f0c2847485688e99a805615eeda [2023-02-17 09:06:22,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 09:06:22,489 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 09:06:22,491 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 09:06:22,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 09:06:22,493 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 09:06:22,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 09:06:22" (1/1) ... [2023-02-17 09:06:22,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e607f79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:06:22, skipping insertion in model container [2023-02-17 09:06:22,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 09:06:22" (1/1) ... [2023-02-17 09:06:22,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 09:06:22,511 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 09:06:22,615 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/Fibonacci02.c[715,728] [2023-02-17 09:06:22,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 09:06:22,626 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 09:06:22,635 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/Fibonacci02.c[715,728] [2023-02-17 09:06:22,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 09:06:22,644 INFO L208 MainTranslator]: Completed translation [2023-02-17 09:06:22,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:06:22 WrapperNode [2023-02-17 09:06:22,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 09:06:22,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 09:06:22,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 09:06:22,646 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 09:06:22,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:06:22" (1/1) ... [2023-02-17 09:06:22,655 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:06:22" (1/1) ... [2023-02-17 09:06:22,665 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2023-02-17 09:06:22,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 09:06:22,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 09:06:22,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 09:06:22,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 09:06:22,671 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:06:22" (1/1) ... [2023-02-17 09:06:22,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:06:22" (1/1) ... [2023-02-17 09:06:22,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:06:22" (1/1) ... [2023-02-17 09:06:22,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:06:22" (1/1) ... [2023-02-17 09:06:22,674 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:06:22" (1/1) ... [2023-02-17 09:06:22,675 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:06:22" (1/1) ... [2023-02-17 09:06:22,675 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:06:22" (1/1) ... [2023-02-17 09:06:22,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:06:22" (1/1) ... [2023-02-17 09:06:22,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 09:06:22,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 09:06:22,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 09:06:22,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 09:06:22,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:06:22" (1/1) ... [2023-02-17 09:06:22,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 09:06:22,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:06:22,697 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-17 09:06:22,701 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-17 09:06:22,725 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2023-02-17 09:06:22,729 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2023-02-17 09:06:22,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 09:06:22,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 09:06:22,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 09:06:22,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 09:06:22,771 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 09:06:22,772 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 09:06:22,842 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 09:06:22,846 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 09:06:22,847 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-17 09:06:22,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:06:22 BoogieIcfgContainer [2023-02-17 09:06:22,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 09:06:22,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 09:06:22,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 09:06:22,852 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 09:06:22,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 09:06:22" (1/3) ... [2023-02-17 09:06:22,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b1d6dab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 09:06:22, skipping insertion in model container [2023-02-17 09:06:22,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:06:22" (2/3) ... [2023-02-17 09:06:22,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b1d6dab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 09:06:22, skipping insertion in model container [2023-02-17 09:06:22,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:06:22" (3/3) ... [2023-02-17 09:06:22,854 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci02.c [2023-02-17 09:06:22,866 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 09:06:22,867 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-02-17 09:06:22,920 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 09:06:22,924 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;@4a768c4a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 09:06:22,925 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-02-17 09:06:22,928 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 25 states have internal predecessors, (28), 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-17 09:06:22,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-17 09:06:22,934 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:06:22,934 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:06:22,935 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-02-17 09:06:22,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:06:22,939 INFO L85 PathProgramCache]: Analyzing trace with hash -108718961, now seen corresponding path program 1 times [2023-02-17 09:06:22,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:06:22,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096326575] [2023-02-17 09:06:22,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:06:22,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:06:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:23,050 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-17 09:06:23,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:06:23,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096326575] [2023-02-17 09:06:23,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096326575] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:06:23,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:06:23,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 09:06:23,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150124665] [2023-02-17 09:06:23,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:06:23,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 09:06:23,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:06:23,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 09:06:23,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:06:23,096 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 25 states have internal predecessors, (28), 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 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:06:23,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:06:23,140 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2023-02-17 09:06:23,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 09:06:23,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-17 09:06:23,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:06:23,147 INFO L225 Difference]: With dead ends: 35 [2023-02-17 09:06:23,148 INFO L226 Difference]: Without dead ends: 24 [2023-02-17 09:06:23,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:06:23,152 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:06:23,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 36 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:06:23,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-02-17 09:06:23,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2023-02-17 09:06:23,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 09:06:23,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2023-02-17 09:06:23,176 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 7 [2023-02-17 09:06:23,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:06:23,176 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-02-17 09:06:23,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:06:23,176 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2023-02-17 09:06:23,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-17 09:06:23,177 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:06:23,177 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:06:23,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 09:06:23,178 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-02-17 09:06:23,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:06:23,178 INFO L85 PathProgramCache]: Analyzing trace with hash 924679547, now seen corresponding path program 1 times [2023-02-17 09:06:23,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:06:23,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14167525] [2023-02-17 09:06:23,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:06:23,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:06:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:23,250 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-17 09:06:23,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:06:23,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14167525] [2023-02-17 09:06:23,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14167525] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:06:23,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:06:23,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 09:06:23,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213241485] [2023-02-17 09:06:23,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:06:23,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 09:06:23,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:06:23,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 09:06:23,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 09:06:23,253 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:06:23,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:06:23,294 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2023-02-17 09:06:23,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 09:06:23,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-17 09:06:23,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:06:23,296 INFO L225 Difference]: With dead ends: 22 [2023-02-17 09:06:23,296 INFO L226 Difference]: Without dead ends: 20 [2023-02-17 09:06:23,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-17 09:06:23,297 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:06:23,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 24 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:06:23,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-17 09:06:23,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-02-17 09:06:23,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 09:06:23,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-02-17 09:06:23,301 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 8 [2023-02-17 09:06:23,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:06:23,301 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-02-17 09:06:23,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:06:23,302 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-02-17 09:06:23,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-17 09:06:23,303 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:06:23,303 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:06:23,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 09:06:23,303 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-02-17 09:06:23,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:06:23,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1244761165, now seen corresponding path program 1 times [2023-02-17 09:06:23,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:06:23,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922577235] [2023-02-17 09:06:23,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:06:23,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:06:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:23,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-17 09:06:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:23,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 09:06:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 09:06:23,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:06:23,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922577235] [2023-02-17 09:06:23,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922577235] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:06:23,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:06:23,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 09:06:23,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333591434] [2023-02-17 09:06:23,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:06:23,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 09:06:23,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:06:23,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 09:06:23,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-17 09:06:23,463 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 09:06:23,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:06:23,524 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2023-02-17 09:06:23,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 09:06:23,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2023-02-17 09:06:23,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:06:23,527 INFO L225 Difference]: With dead ends: 36 [2023-02-17 09:06:23,527 INFO L226 Difference]: Without dead ends: 34 [2023-02-17 09:06:23,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-17 09:06:23,534 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:06:23,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 64 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:06:23,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-17 09:06:23,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2023-02-17 09:06:23,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-17 09:06:23,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-02-17 09:06:23,548 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 23 [2023-02-17 09:06:23,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:06:23,548 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-02-17 09:06:23,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 09:06:23,549 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-02-17 09:06:23,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 09:06:23,551 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:06:23,551 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:06:23,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 09:06:23,552 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-02-17 09:06:23,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:06:23,554 INFO L85 PathProgramCache]: Analyzing trace with hash 78572347, now seen corresponding path program 1 times [2023-02-17 09:06:23,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:06:23,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112828128] [2023-02-17 09:06:23,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:06:23,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:06:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:23,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-17 09:06:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:23,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 09:06:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:23,652 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 09:06:23,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:06:23,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112828128] [2023-02-17 09:06:23,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112828128] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:06:23,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119717368] [2023-02-17 09:06:23,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:06:23,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:06:23,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:06:23,663 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-17 09:06:23,664 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-17 09:06:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:23,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 09:06:23,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:06:23,774 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:06:23,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:06:23,849 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 09:06:23,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119717368] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:06:23,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:06:23,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2023-02-17 09:06:23,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62319589] [2023-02-17 09:06:23,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:06:23,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 09:06:23,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:06:23,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 09:06:23,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-02-17 09:06:23,858 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 15 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 09:06:24,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:06:24,088 INFO L93 Difference]: Finished difference Result 126 states and 172 transitions. [2023-02-17 09:06:24,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 09:06:24,088 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 24 [2023-02-17 09:06:24,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:06:24,091 INFO L225 Difference]: With dead ends: 126 [2023-02-17 09:06:24,091 INFO L226 Difference]: Without dead ends: 93 [2023-02-17 09:06:24,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2023-02-17 09:06:24,099 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 112 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 09:06:24,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 135 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 09:06:24,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-17 09:06:24,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2023-02-17 09:06:24,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 64 states have internal predecessors, (69), 11 states have call successors, (11), 3 states have call predecessors, (11), 6 states have return successors, (32), 13 states have call predecessors, (32), 10 states have call successors, (32) [2023-02-17 09:06:24,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions. [2023-02-17 09:06:24,126 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 24 [2023-02-17 09:06:24,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:06:24,126 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 112 transitions. [2023-02-17 09:06:24,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 09:06:24,127 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions. [2023-02-17 09:06:24,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-17 09:06:24,127 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:06:24,128 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:06:24,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-17 09:06:24,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:06:24,335 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-02-17 09:06:24,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:06:24,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1267704266, now seen corresponding path program 2 times [2023-02-17 09:06:24,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:06:24,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340169866] [2023-02-17 09:06:24,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:06:24,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:06:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:24,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:24,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 09:06:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 09:06:24,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:06:24,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340169866] [2023-02-17 09:06:24,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340169866] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:06:24,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116744816] [2023-02-17 09:06:24,432 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 09:06:24,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:06:24,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:06:24,434 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-17 09:06:24,436 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-17 09:06:24,462 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 09:06:24,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:06:24,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 09:06:24,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:06:24,482 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 09:06:24,483 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 09:06:24,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116744816] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:06:24,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 09:06:24,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2023-02-17 09:06:24,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240534353] [2023-02-17 09:06:24,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:06:24,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 09:06:24,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:06:24,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 09:06:24,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-17 09:06:24,485 INFO L87 Difference]: Start difference. First operand 81 states and 112 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 09:06:24,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:06:24,507 INFO L93 Difference]: Finished difference Result 102 states and 141 transitions. [2023-02-17 09:06:24,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 09:06:24,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2023-02-17 09:06:24,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:06:24,511 INFO L225 Difference]: With dead ends: 102 [2023-02-17 09:06:24,511 INFO L226 Difference]: Without dead ends: 101 [2023-02-17 09:06:24,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-17 09:06:24,513 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:06:24,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 59 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:06:24,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-17 09:06:24,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2023-02-17 09:06:24,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 11 states have call successors, (11), 3 states have call predecessors, (11), 7 states have return successors, (39), 15 states have call predecessors, (39), 10 states have call successors, (39) [2023-02-17 09:06:24,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2023-02-17 09:06:24,530 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 30 [2023-02-17 09:06:24,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:06:24,530 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2023-02-17 09:06:24,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 09:06:24,531 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2023-02-17 09:06:24,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-17 09:06:24,532 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:06:24,533 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:06:24,539 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-17 09:06:24,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:06:24,737 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-02-17 09:06:24,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:06:24,738 INFO L85 PathProgramCache]: Analyzing trace with hash -644126528, now seen corresponding path program 1 times [2023-02-17 09:06:24,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:06:24,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052858484] [2023-02-17 09:06:24,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:06:24,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:06:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:24,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:24,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 09:06:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:24,828 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 09:06:24,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:06:24,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052858484] [2023-02-17 09:06:24,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052858484] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:06:24,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968007724] [2023-02-17 09:06:24,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:06:24,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:06:24,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:06:24,830 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-17 09:06:24,832 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-17 09:06:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:24,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 09:06:24,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:06:24,907 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:06:24,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:06:24,972 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 09:06:24,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968007724] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:06:24,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:06:24,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2023-02-17 09:06:24,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506733692] [2023-02-17 09:06:24,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:06:24,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-17 09:06:24,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:06:24,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-17 09:06:24,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2023-02-17 09:06:24,977 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 15 states have internal predecessors, (57), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 09:06:25,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:06:25,448 INFO L93 Difference]: Finished difference Result 293 states and 459 transitions. [2023-02-17 09:06:25,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-17 09:06:25,448 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 15 states have internal predecessors, (57), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 31 [2023-02-17 09:06:25,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:06:25,450 INFO L225 Difference]: With dead ends: 293 [2023-02-17 09:06:25,450 INFO L226 Difference]: Without dead ends: 215 [2023-02-17 09:06:25,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2023-02-17 09:06:25,452 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 155 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 09:06:25,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 297 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 09:06:25,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-02-17 09:06:25,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 175. [2023-02-17 09:06:25,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 137 states have (on average 1.094890510948905) internal successors, (150), 137 states have internal predecessors, (150), 22 states have call successors, (22), 6 states have call predecessors, (22), 14 states have return successors, (83), 31 states have call predecessors, (83), 21 states have call successors, (83) [2023-02-17 09:06:25,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 255 transitions. [2023-02-17 09:06:25,478 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 255 transitions. Word has length 31 [2023-02-17 09:06:25,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:06:25,479 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 255 transitions. [2023-02-17 09:06:25,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 15 states have internal predecessors, (57), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 09:06:25,479 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 255 transitions. [2023-02-17 09:06:25,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-17 09:06:25,481 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:06:25,482 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:06:25,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-17 09:06:25,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:06:25,687 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-02-17 09:06:25,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:06:25,688 INFO L85 PathProgramCache]: Analyzing trace with hash 749848469, now seen corresponding path program 1 times [2023-02-17 09:06:25,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:06:25,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234266597] [2023-02-17 09:06:25,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:06:25,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:06:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:25,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-17 09:06:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:25,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-02-17 09:06:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:25,777 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2023-02-17 09:06:25,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:06:25,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234266597] [2023-02-17 09:06:25,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234266597] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:06:25,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:06:25,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 09:06:25,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828357037] [2023-02-17 09:06:25,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:06:25,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 09:06:25,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:06:25,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 09:06:25,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-17 09:06:25,785 INFO L87 Difference]: Start difference. First operand 175 states and 255 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 09:06:25,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:06:25,813 INFO L93 Difference]: Finished difference Result 191 states and 277 transitions. [2023-02-17 09:06:25,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 09:06:25,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2023-02-17 09:06:25,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:06:25,815 INFO L225 Difference]: With dead ends: 191 [2023-02-17 09:06:25,815 INFO L226 Difference]: Without dead ends: 190 [2023-02-17 09:06:25,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-17 09:06:25,816 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 4 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:06:25,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 99 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:06:25,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-02-17 09:06:25,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 182. [2023-02-17 09:06:25,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 143 states have (on average 1.0909090909090908) internal successors, (156), 142 states have internal predecessors, (156), 23 states have call successors, (23), 6 states have call predecessors, (23), 14 states have return successors, (89), 33 states have call predecessors, (89), 22 states have call successors, (89) [2023-02-17 09:06:25,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 268 transitions. [2023-02-17 09:06:25,828 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 268 transitions. Word has length 50 [2023-02-17 09:06:25,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:06:25,829 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 268 transitions. [2023-02-17 09:06:25,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 09:06:25,829 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 268 transitions. [2023-02-17 09:06:25,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-02-17 09:06:25,830 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:06:25,831 INFO L195 NwaCegarLoop]: trace histogram [10, 8, 7, 7, 7, 7, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:06:25,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-17 09:06:25,831 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-02-17 09:06:25,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:06:25,831 INFO L85 PathProgramCache]: Analyzing trace with hash -666929869, now seen corresponding path program 1 times [2023-02-17 09:06:25,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:06:25,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610855785] [2023-02-17 09:06:25,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:06:25,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:06:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:25,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-17 09:06:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:25,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-02-17 09:06:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:25,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:25,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:25,882 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2023-02-17 09:06:25,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:06:25,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610855785] [2023-02-17 09:06:25,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610855785] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:06:25,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606423633] [2023-02-17 09:06:25,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:06:25,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:06:25,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:06:25,884 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-17 09:06:25,886 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-17 09:06:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:25,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-17 09:06:25,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:06:26,037 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 78 proven. 102 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-17 09:06:26,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:06:26,213 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 2 proven. 181 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-17 09:06:26,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606423633] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:06:26,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:06:26,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 17, 17] total 26 [2023-02-17 09:06:26,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731367977] [2023-02-17 09:06:26,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:06:26,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-17 09:06:26,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:06:26,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-17 09:06:26,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2023-02-17 09:06:26,216 INFO L87 Difference]: Start difference. First operand 182 states and 268 transitions. Second operand has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 18 states have internal predecessors, (85), 13 states have call successors, (18), 10 states have call predecessors, (18), 4 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-17 09:06:26,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:06:26,632 INFO L93 Difference]: Finished difference Result 532 states and 857 transitions. [2023-02-17 09:06:26,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-17 09:06:26,633 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 18 states have internal predecessors, (85), 13 states have call successors, (18), 10 states have call predecessors, (18), 4 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) Word has length 73 [2023-02-17 09:06:26,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:06:26,635 INFO L225 Difference]: With dead ends: 532 [2023-02-17 09:06:26,635 INFO L226 Difference]: Without dead ends: 365 [2023-02-17 09:06:26,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 131 SyntacticMatches, 10 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=267, Invalid=1065, Unknown=0, NotChecked=0, Total=1332 [2023-02-17 09:06:26,637 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 309 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 09:06:26,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 502 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 09:06:26,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2023-02-17 09:06:26,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 332. [2023-02-17 09:06:26,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 262 states have (on average 1.0954198473282444) internal successors, (287), 260 states have internal predecessors, (287), 42 states have call successors, (42), 12 states have call predecessors, (42), 26 states have return successors, (130), 59 states have call predecessors, (130), 41 states have call successors, (130) [2023-02-17 09:06:26,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 459 transitions. [2023-02-17 09:06:26,672 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 459 transitions. Word has length 73 [2023-02-17 09:06:26,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:06:26,672 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 459 transitions. [2023-02-17 09:06:26,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 18 states have internal predecessors, (85), 13 states have call successors, (18), 10 states have call predecessors, (18), 4 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-17 09:06:26,672 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 459 transitions. [2023-02-17 09:06:26,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-17 09:06:26,676 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:06:26,686 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:06:26,693 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-17 09:06:26,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:06:26,891 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-02-17 09:06:26,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:06:26,892 INFO L85 PathProgramCache]: Analyzing trace with hash -147621069, now seen corresponding path program 2 times [2023-02-17 09:06:26,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:06:26,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723608093] [2023-02-17 09:06:26,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:06:26,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:06:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:26,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-02-17 09:06:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:26,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-02-17 09:06:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:26,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:26,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-17 09:06:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:26,975 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2023-02-17 09:06:26,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:06:26,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723608093] [2023-02-17 09:06:26,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723608093] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:06:26,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460933866] [2023-02-17 09:06:26,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 09:06:26,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:06:26,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:06:26,977 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:06:26,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-17 09:06:27,018 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 09:06:27,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:06:27,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 09:06:27,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:06:27,039 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2023-02-17 09:06:27,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:06:27,058 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2023-02-17 09:06:27,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460933866] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:06:27,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:06:27,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-02-17 09:06:27,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802293405] [2023-02-17 09:06:27,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:06:27,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 09:06:27,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:06:27,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 09:06:27,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-02-17 09:06:27,061 INFO L87 Difference]: Start difference. First operand 332 states and 459 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-17 09:06:27,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:06:27,104 INFO L93 Difference]: Finished difference Result 355 states and 484 transitions. [2023-02-17 09:06:27,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 09:06:27,104 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 86 [2023-02-17 09:06:27,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:06:27,106 INFO L225 Difference]: With dead ends: 355 [2023-02-17 09:06:27,106 INFO L226 Difference]: Without dead ends: 354 [2023-02-17 09:06:27,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-02-17 09:06:27,107 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:06:27,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 135 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:06:27,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2023-02-17 09:06:27,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 332. [2023-02-17 09:06:27,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 262 states have (on average 1.0954198473282444) internal successors, (287), 260 states have internal predecessors, (287), 42 states have call successors, (42), 12 states have call predecessors, (42), 26 states have return successors, (130), 59 states have call predecessors, (130), 41 states have call successors, (130) [2023-02-17 09:06:27,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 459 transitions. [2023-02-17 09:06:27,121 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 459 transitions. Word has length 86 [2023-02-17 09:06:27,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:06:27,121 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 459 transitions. [2023-02-17 09:06:27,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-17 09:06:27,122 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 459 transitions. [2023-02-17 09:06:27,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-02-17 09:06:27,123 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:06:27,123 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-17 09:06:27,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-17 09:06:27,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:06:27,328 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-02-17 09:06:27,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:06:27,328 INFO L85 PathProgramCache]: Analyzing trace with hash -281285789, now seen corresponding path program 1 times [2023-02-17 09:06:27,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:06:27,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209165342] [2023-02-17 09:06:27,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:06:27,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:06:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:27,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-02-17 09:06:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:27,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-02-17 09:06:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:27,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:27,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-17 09:06:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:27,578 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 179 proven. 119 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-17 09:06:27,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:06:27,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209165342] [2023-02-17 09:06:27,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209165342] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:06:27,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948993786] [2023-02-17 09:06:27,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:06:27,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:06:27,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:06:27,580 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:06:27,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-17 09:06:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:27,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-17 09:06:27,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:06:27,692 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 179 proven. 119 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-17 09:06:27,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:06:27,830 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 179 proven. 119 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-17 09:06:27,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948993786] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:06:27,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:06:27,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 24 [2023-02-17 09:06:27,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530736809] [2023-02-17 09:06:27,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:06:27,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-17 09:06:27,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:06:27,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-17 09:06:27,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2023-02-17 09:06:27,835 INFO L87 Difference]: Start difference. First operand 332 states and 459 transitions. Second operand has 24 states, 23 states have (on average 3.260869565217391) internal successors, (75), 16 states have internal predecessors, (75), 11 states have call successors, (14), 9 states have call predecessors, (14), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-17 09:06:28,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:06:28,104 INFO L93 Difference]: Finished difference Result 627 states and 915 transitions. [2023-02-17 09:06:28,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-17 09:06:28,105 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.260869565217391) internal successors, (75), 16 states have internal predecessors, (75), 11 states have call successors, (14), 9 states have call predecessors, (14), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 87 [2023-02-17 09:06:28,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:06:28,107 INFO L225 Difference]: With dead ends: 627 [2023-02-17 09:06:28,107 INFO L226 Difference]: Without dead ends: 316 [2023-02-17 09:06:28,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 160 SyntacticMatches, 27 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=441, Invalid=1119, Unknown=0, NotChecked=0, Total=1560 [2023-02-17 09:06:28,110 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 390 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 09:06:28,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 142 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 09:06:28,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2023-02-17 09:06:28,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 292. [2023-02-17 09:06:28,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 229 states have (on average 1.091703056768559) internal successors, (250), 231 states have internal predecessors, (250), 37 states have call successors, (37), 12 states have call predecessors, (37), 24 states have return successors, (72), 48 states have call predecessors, (72), 36 states have call successors, (72) [2023-02-17 09:06:28,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 359 transitions. [2023-02-17 09:06:28,123 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 359 transitions. Word has length 87 [2023-02-17 09:06:28,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:06:28,124 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 359 transitions. [2023-02-17 09:06:28,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.260869565217391) internal successors, (75), 16 states have internal predecessors, (75), 11 states have call successors, (14), 9 states have call predecessors, (14), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-17 09:06:28,124 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 359 transitions. [2023-02-17 09:06:28,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-02-17 09:06:28,125 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:06:28,125 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 8, 8, 8, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-17 09:06:28,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-17 09:06:28,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:06:28,335 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-02-17 09:06:28,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:06:28,336 INFO L85 PathProgramCache]: Analyzing trace with hash -2122545154, now seen corresponding path program 2 times [2023-02-17 09:06:28,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:06:28,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788418021] [2023-02-17 09:06:28,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:06:28,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:06:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:28,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-02-17 09:06:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:28,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:28,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:28,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-02-17 09:06:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:28,424 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-02-17 09:06:28,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:06:28,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788418021] [2023-02-17 09:06:28,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788418021] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:06:28,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920193509] [2023-02-17 09:06:28,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 09:06:28,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:06:28,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:06:28,426 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:06:28,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-17 09:06:28,461 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 09:06:28,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:06:28,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 09:06:28,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:06:28,482 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2023-02-17 09:06:28,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:06:28,524 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-02-17 09:06:28,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920193509] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:06:28,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:06:28,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2023-02-17 09:06:28,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722837616] [2023-02-17 09:06:28,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:06:28,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 09:06:28,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:06:28,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 09:06:28,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-02-17 09:06:28,526 INFO L87 Difference]: Start difference. First operand 292 states and 359 transitions. Second operand has 14 states, 13 states have (on average 3.0) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-17 09:06:28,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:06:28,572 INFO L93 Difference]: Finished difference Result 296 states and 361 transitions. [2023-02-17 09:06:28,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 09:06:28,573 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) Word has length 81 [2023-02-17 09:06:28,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:06:28,576 INFO L225 Difference]: With dead ends: 296 [2023-02-17 09:06:28,576 INFO L226 Difference]: Without dead ends: 295 [2023-02-17 09:06:28,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 161 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-02-17 09:06:28,577 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:06:28,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 79 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:06:28,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-02-17 09:06:28,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 292. [2023-02-17 09:06:28,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 229 states have (on average 1.0829694323144106) internal successors, (248), 231 states have internal predecessors, (248), 37 states have call successors, (37), 12 states have call predecessors, (37), 24 states have return successors, (72), 48 states have call predecessors, (72), 36 states have call successors, (72) [2023-02-17 09:06:28,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 357 transitions. [2023-02-17 09:06:28,587 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 357 transitions. Word has length 81 [2023-02-17 09:06:28,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:06:28,588 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 357 transitions. [2023-02-17 09:06:28,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-17 09:06:28,588 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 357 transitions. [2023-02-17 09:06:28,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-02-17 09:06:28,589 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:06:28,589 INFO L195 NwaCegarLoop]: trace histogram [13, 11, 9, 9, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2023-02-17 09:06:28,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-17 09:06:28,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:06:28,801 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-02-17 09:06:28,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:06:28,801 INFO L85 PathProgramCache]: Analyzing trace with hash 134659175, now seen corresponding path program 3 times [2023-02-17 09:06:28,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:06:28,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097681362] [2023-02-17 09:06:28,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:06:28,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:06:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:28,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-02-17 09:06:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:28,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:28,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:28,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-02-17 09:06:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:28,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:29,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:29,009 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 159 proven. 161 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-02-17 09:06:29,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:06:29,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097681362] [2023-02-17 09:06:29,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097681362] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:06:29,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477069070] [2023-02-17 09:06:29,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 09:06:29,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:06:29,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:06:29,011 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:06:29,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-17 09:06:29,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-17 09:06:29,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:06:29,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 09:06:29,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:06:29,113 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 36 proven. 4 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2023-02-17 09:06:29,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:06:29,205 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 36 proven. 4 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2023-02-17 09:06:29,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477069070] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:06:29,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:06:29,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 7] total 30 [2023-02-17 09:06:29,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840537949] [2023-02-17 09:06:29,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:06:29,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-17 09:06:29,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:06:29,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-17 09:06:29,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2023-02-17 09:06:29,207 INFO L87 Difference]: Start difference. First operand 292 states and 357 transitions. Second operand has 30 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 23 states have internal predecessors, (92), 13 states have call successors, (17), 8 states have call predecessors, (17), 4 states have return successors, (11), 10 states have call predecessors, (11), 6 states have call successors, (11) [2023-02-17 09:06:30,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:06:30,566 INFO L93 Difference]: Finished difference Result 643 states and 841 transitions. [2023-02-17 09:06:30,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-02-17 09:06:30,567 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 23 states have internal predecessors, (92), 13 states have call successors, (17), 8 states have call predecessors, (17), 4 states have return successors, (11), 10 states have call predecessors, (11), 6 states have call successors, (11) Word has length 99 [2023-02-17 09:06:30,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:06:30,568 INFO L225 Difference]: With dead ends: 643 [2023-02-17 09:06:30,569 INFO L226 Difference]: Without dead ends: 372 [2023-02-17 09:06:30,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 206 SyntacticMatches, 5 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3868 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3164, Invalid=10176, Unknown=0, NotChecked=0, Total=13340 [2023-02-17 09:06:30,573 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 565 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 09:06:30,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 113 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 09:06:30,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2023-02-17 09:06:30,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 308. [2023-02-17 09:06:30,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 245 states have (on average 1.1020408163265305) internal successors, (270), 239 states have internal predecessors, (270), 37 states have call successors, (37), 12 states have call predecessors, (37), 24 states have return successors, (69), 56 states have call predecessors, (69), 36 states have call successors, (69) [2023-02-17 09:06:30,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 376 transitions. [2023-02-17 09:06:30,584 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 376 transitions. Word has length 99 [2023-02-17 09:06:30,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:06:30,584 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 376 transitions. [2023-02-17 09:06:30,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 23 states have internal predecessors, (92), 13 states have call successors, (17), 8 states have call predecessors, (17), 4 states have return successors, (11), 10 states have call predecessors, (11), 6 states have call successors, (11) [2023-02-17 09:06:30,585 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 376 transitions. [2023-02-17 09:06:30,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-02-17 09:06:30,587 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:06:30,587 INFO L195 NwaCegarLoop]: trace histogram [18, 12, 12, 11, 11, 11, 11, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1] [2023-02-17 09:06:30,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-17 09:06:30,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-17 09:06:30,794 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-02-17 09:06:30,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:06:30,794 INFO L85 PathProgramCache]: Analyzing trace with hash 773631613, now seen corresponding path program 4 times [2023-02-17 09:06:30,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:06:30,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20116351] [2023-02-17 09:06:30,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:06:30,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:06:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:30,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-17 09:06:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:30,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:30,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:30,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:30,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-17 09:06:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:30,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-17 09:06:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:30,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:06:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:30,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-02-17 09:06:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:31,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:31,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:31,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-17 09:06:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:31,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-17 09:06:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:31,008 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 123 proven. 389 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2023-02-17 09:06:31,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:06:31,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20116351] [2023-02-17 09:06:31,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20116351] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:06:31,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520865900] [2023-02-17 09:06:31,008 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 09:06:31,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:06:31,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:06:31,010 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:06:31,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-17 09:06:31,052 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 09:06:31,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:06:31,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-17 09:06:31,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:06:31,135 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 471 proven. 189 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2023-02-17 09:06:31,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:06:31,309 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 157 proven. 425 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2023-02-17 09:06:31,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520865900] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:06:31,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:06:31,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 22] total 28 [2023-02-17 09:06:31,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231158023] [2023-02-17 09:06:31,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:06:31,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-17 09:06:31,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:06:31,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-17 09:06:31,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2023-02-17 09:06:31,311 INFO L87 Difference]: Start difference. First operand 308 states and 376 transitions. Second operand has 28 states, 27 states have (on average 4.074074074074074) internal successors, (110), 22 states have internal predecessors, (110), 16 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (17), 5 states have call predecessors, (17), 10 states have call successors, (17) [2023-02-17 09:06:31,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:06:31,716 INFO L93 Difference]: Finished difference Result 497 states and 621 transitions. [2023-02-17 09:06:31,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-02-17 09:06:31,717 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.074074074074074) internal successors, (110), 22 states have internal predecessors, (110), 16 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (17), 5 states have call predecessors, (17), 10 states have call successors, (17) Word has length 149 [2023-02-17 09:06:31,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:06:31,718 INFO L225 Difference]: With dead ends: 497 [2023-02-17 09:06:31,718 INFO L226 Difference]: Without dead ends: 190 [2023-02-17 09:06:31,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 296 SyntacticMatches, 25 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=866, Invalid=2440, Unknown=0, NotChecked=0, Total=3306 [2023-02-17 09:06:31,720 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 427 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 09:06:31,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 168 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 09:06:31,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-02-17 09:06:31,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 174. [2023-02-17 09:06:31,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 138 states have (on average 1.0579710144927537) internal successors, (146), 139 states have internal predecessors, (146), 23 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-17 09:06:31,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 191 transitions. [2023-02-17 09:06:31,727 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 191 transitions. Word has length 149 [2023-02-17 09:06:31,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:06:31,728 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 191 transitions. [2023-02-17 09:06:31,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.074074074074074) internal successors, (110), 22 states have internal predecessors, (110), 16 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (17), 5 states have call predecessors, (17), 10 states have call successors, (17) [2023-02-17 09:06:31,728 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 191 transitions. [2023-02-17 09:06:31,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-02-17 09:06:31,729 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:06:31,729 INFO L195 NwaCegarLoop]: trace histogram [19, 16, 14, 11, 11, 11, 11, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 3, 1, 1, 1, 1] [2023-02-17 09:06:31,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-17 09:06:31,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-17 09:06:31,934 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-02-17 09:06:31,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:06:31,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1242579183, now seen corresponding path program 3 times [2023-02-17 09:06:31,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:06:31,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494638846] [2023-02-17 09:06:31,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:06:31,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:06:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:32,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-17 09:06:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:32,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:32,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:32,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:32,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:32,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-17 09:06:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:32,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-02-17 09:06:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:32,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:32,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:32,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-02-17 09:06:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:32,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:32,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:32,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:32,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-17 09:06:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:32,343 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 78 proven. 135 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2023-02-17 09:06:32,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:06:32,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494638846] [2023-02-17 09:06:32,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494638846] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:06:32,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037565382] [2023-02-17 09:06:32,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 09:06:32,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:06:32,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:06:32,345 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:06:32,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-17 09:06:32,399 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-02-17 09:06:32,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:06:32,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-17 09:06:32,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:06:32,457 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 78 proven. 135 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2023-02-17 09:06:32,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:06:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 144 proven. 128 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-02-17 09:06:32,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037565382] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:06:32,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:06:32,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 17] total 26 [2023-02-17 09:06:32,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263457127] [2023-02-17 09:06:32,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:06:32,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-17 09:06:32,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:06:32,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-17 09:06:32,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2023-02-17 09:06:32,681 INFO L87 Difference]: Start difference. First operand 174 states and 191 transitions. Second operand has 27 states, 26 states have (on average 2.730769230769231) internal successors, (71), 27 states have internal predecessors, (71), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) [2023-02-17 09:06:32,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:06:32,736 INFO L93 Difference]: Finished difference Result 175 states and 191 transitions. [2023-02-17 09:06:32,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-17 09:06:32,736 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.730769230769231) internal successors, (71), 27 states have internal predecessors, (71), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) Word has length 167 [2023-02-17 09:06:32,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:06:32,737 INFO L225 Difference]: With dead ends: 175 [2023-02-17 09:06:32,737 INFO L226 Difference]: Without dead ends: 174 [2023-02-17 09:06:32,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 341 SyntacticMatches, 23 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2023-02-17 09:06:32,738 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:06:32,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 171 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:06:32,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-02-17 09:06:32,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2023-02-17 09:06:32,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 138 states have (on average 1.0289855072463767) internal successors, (142), 139 states have internal predecessors, (142), 23 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-17 09:06:32,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 187 transitions. [2023-02-17 09:06:32,744 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 187 transitions. Word has length 167 [2023-02-17 09:06:32,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:06:32,744 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 187 transitions. [2023-02-17 09:06:32,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.730769230769231) internal successors, (71), 27 states have internal predecessors, (71), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) [2023-02-17 09:06:32,745 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 187 transitions. [2023-02-17 09:06:32,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2023-02-17 09:06:32,747 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:06:32,748 INFO L195 NwaCegarLoop]: trace histogram [43, 40, 35, 22, 22, 22, 22, 20, 20, 20, 20, 20, 20, 20, 20, 19, 13, 8, 1, 1, 1, 1] [2023-02-17 09:06:32,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-17 09:06:32,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-17 09:06:32,953 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-02-17 09:06:32,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:06:32,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1895354522, now seen corresponding path program 4 times [2023-02-17 09:06:32,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:06:32,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105754311] [2023-02-17 09:06:32,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:06:32,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:06:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-17 09:06:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-17 09:06:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-02-17 09:06:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-02-17 09:06:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-17 09:06:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-02-17 09:06:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-17 09:06:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-02-17 09:06:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2023-02-17 09:06:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-17 09:06:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-02-17 09:06:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-02-17 09:06:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-17 09:06:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:34,812 INFO L134 CoverageAnalysis]: Checked inductivity of 5984 backedges. 820 proven. 1112 refuted. 0 times theorem prover too weak. 4052 trivial. 0 not checked. [2023-02-17 09:06:34,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:06:34,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105754311] [2023-02-17 09:06:34,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105754311] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:06:34,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856449465] [2023-02-17 09:06:34,813 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 09:06:34,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:06:34,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:06:34,814 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:06:34,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-17 09:06:34,936 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 09:06:34,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:06:34,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 81 conjunts are in the unsatisfiable core [2023-02-17 09:06:34,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:06:35,155 INFO L134 CoverageAnalysis]: Checked inductivity of 5984 backedges. 820 proven. 1112 refuted. 0 times theorem prover too weak. 4052 trivial. 0 not checked. [2023-02-17 09:06:35,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:06:36,334 INFO L134 CoverageAnalysis]: Checked inductivity of 5984 backedges. 1149 proven. 1015 refuted. 0 times theorem prover too weak. 3820 trivial. 0 not checked. [2023-02-17 09:06:36,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856449465] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:06:36,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:06:36,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 29] total 40 [2023-02-17 09:06:36,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928328961] [2023-02-17 09:06:36,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:06:36,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-17 09:06:36,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:06:36,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-17 09:06:36,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1273, Unknown=0, NotChecked=0, Total=1640 [2023-02-17 09:06:36,339 INFO L87 Difference]: Start difference. First operand 174 states and 187 transitions. Second operand has 41 states, 40 states have (on average 2.625) internal successors, (105), 41 states have internal predecessors, (105), 11 states have call successors, (12), 1 states have call predecessors, (12), 11 states have return successors, (28), 28 states have call predecessors, (28), 11 states have call successors, (28) [2023-02-17 09:06:36,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:06:36,424 INFO L93 Difference]: Finished difference Result 175 states and 187 transitions. [2023-02-17 09:06:36,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-17 09:06:36,425 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.625) internal successors, (105), 41 states have internal predecessors, (105), 11 states have call successors, (12), 1 states have call predecessors, (12), 11 states have return successors, (28), 28 states have call predecessors, (28), 11 states have call successors, (28) Word has length 410 [2023-02-17 09:06:36,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:06:36,426 INFO L225 Difference]: With dead ends: 175 [2023-02-17 09:06:36,426 INFO L226 Difference]: Without dead ends: 174 [2023-02-17 09:06:36,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 980 GetRequests, 858 SyntacticMatches, 82 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2558 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=381, Invalid=1341, Unknown=0, NotChecked=0, Total=1722 [2023-02-17 09:06:36,427 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 09:06:36,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 256 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 09:06:36,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-02-17 09:06:36,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2023-02-17 09:06:36,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 138 states have (on average 1.0072463768115942) internal successors, (139), 139 states have internal predecessors, (139), 23 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-17 09:06:36,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 184 transitions. [2023-02-17 09:06:36,433 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 184 transitions. Word has length 410 [2023-02-17 09:06:36,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:06:36,433 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 184 transitions. [2023-02-17 09:06:36,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.625) internal successors, (105), 41 states have internal predecessors, (105), 11 states have call successors, (12), 1 states have call predecessors, (12), 11 states have return successors, (28), 28 states have call predecessors, (28), 11 states have call successors, (28) [2023-02-17 09:06:36,434 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 184 transitions. [2023-02-17 09:06:36,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1066 [2023-02-17 09:06:36,449 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:06:36,450 INFO L195 NwaCegarLoop]: trace histogram [109, 108, 88, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 53, 34, 21, 1, 1, 1, 1] [2023-02-17 09:06:36,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-17 09:06:36,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-17 09:06:36,655 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-02-17 09:06:36,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:06:36,656 INFO L85 PathProgramCache]: Analyzing trace with hash -847997552, now seen corresponding path program 5 times [2023-02-17 09:06:36,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:06:36,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115831378] [2023-02-17 09:06:36,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:06:36,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:06:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:42,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-17 09:06:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:43,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-17 09:06:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-02-17 09:06:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-02-17 09:06:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-17 09:06:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-02-17 09:06:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-17 09:06:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-02-17 09:06:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2023-02-17 09:06:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-17 09:06:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-02-17 09:06:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-02-17 09:06:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-17 09:06:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 406 [2023-02-17 09:06:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:44,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-17 09:06:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-02-17 09:06:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-02-17 09:06:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-17 09:06:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-02-17 09:06:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-17 09:06:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-02-17 09:06:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 664 [2023-02-17 09:06:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-17 09:06:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-02-17 09:06:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-02-17 09:06:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-17 09:06:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-02-17 09:06:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-17 09:06:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-02-17 09:06:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2023-02-17 09:06:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-17 09:06:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-02-17 09:06:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:45,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:46,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:46,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-02-17 09:06:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:46,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:46,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 09:06:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:46,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 09:06:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:46,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-17 09:06:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:06:46,036 INFO L134 CoverageAnalysis]: Checked inductivity of 41466 backedges. 6686 proven. 7855 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2023-02-17 09:06:46,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:06:46,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115831378] [2023-02-17 09:06:46,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115831378] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:06:46,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816605453] [2023-02-17 09:06:46,037 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-17 09:06:46,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:06:46,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:06:46,039 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:06:46,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-17 09:06:46,491 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 83 check-sat command(s) [2023-02-17 09:06:46,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:06:46,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 1992 conjuncts, 217 conjunts are in the unsatisfiable core [2023-02-17 09:06:46,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:06:47,175 INFO L134 CoverageAnalysis]: Checked inductivity of 41466 backedges. 6686 proven. 7855 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2023-02-17 09:06:47,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:06:54,752 INFO L134 CoverageAnalysis]: Checked inductivity of 41466 backedges. 7863 proven. 7392 refuted. 0 times theorem prover too weak. 26211 trivial. 0 not checked. [2023-02-17 09:06:54,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816605453] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:06:54,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:06:54,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 41] total 54 [2023-02-17 09:06:54,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441975523] [2023-02-17 09:06:54,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:06:54,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-02-17 09:06:54,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:06:54,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-02-17 09:06:54,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=642, Invalid=2328, Unknown=0, NotChecked=0, Total=2970 [2023-02-17 09:06:54,756 INFO L87 Difference]: Start difference. First operand 174 states and 184 transitions. Second operand has 55 states, 54 states have (on average 2.574074074074074) internal successors, (139), 55 states have internal predecessors, (139), 15 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (38), 38 states have call predecessors, (38), 15 states have call successors, (38) [2023-02-17 09:06:54,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:06:54,832 INFO L93 Difference]: Finished difference Result 174 states and 184 transitions. [2023-02-17 09:06:54,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-17 09:06:54,832 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.574074074074074) internal successors, (139), 55 states have internal predecessors, (139), 15 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (38), 38 states have call predecessors, (38), 15 states have call successors, (38) Word has length 1065 [2023-02-17 09:06:54,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:06:54,834 INFO L225 Difference]: With dead ends: 174 [2023-02-17 09:06:54,834 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 09:06:54,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2561 GetRequests, 2262 SyntacticMatches, 246 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8552 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=642, Invalid=2328, Unknown=0, NotChecked=0, Total=2970 [2023-02-17 09:06:54,835 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 09:06:54,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 09:06:54,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 09:06:54,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 09:06:54,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:06:54,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 09:06:54,836 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1065 [2023-02-17 09:06:54,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:06:54,837 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 09:06:54,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.574074074074074) internal successors, (139), 55 states have internal predecessors, (139), 15 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (38), 38 states have call predecessors, (38), 15 states have call successors, (38) [2023-02-17 09:06:54,837 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 09:06:54,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 09:06:54,839 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2023-02-17 09:06:54,839 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2023-02-17 09:06:54,839 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2023-02-17 09:06:54,840 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2023-02-17 09:06:54,840 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2023-02-17 09:06:54,840 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2023-02-17 09:06:54,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-17 09:06:55,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-17 09:06:55,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 09:06:55,068 INFO L899 garLoopResultBuilder]: For program point fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2023-02-17 09:06:55,068 INFO L899 garLoopResultBuilder]: For program point fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2023-02-17 09:06:55,068 INFO L899 garLoopResultBuilder]: For program point fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2023-02-17 09:06:55,068 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 23) no Hoare annotation was computed. [2023-02-17 09:06:55,068 INFO L899 garLoopResultBuilder]: For program point fibonacciEXIT(lines 16 24) no Hoare annotation was computed. [2023-02-17 09:06:55,069 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 23) no Hoare annotation was computed. [2023-02-17 09:06:55,069 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 16 24) the Hoare annotation is: (let ((.cse6 (<= 1 |fibonacci_#in~n|)) (.cse2 (<= |fibonacci_#in~n| 9)) (.cse1 (<= 2 |fibonacci_#in~n|)) (.cse3 (<= |fibonacci_#in~n| 3)) (.cse4 (<= |fibonacci_#in~n| 4))) (let ((.cse7 (not .cse4)) (.cse10 (not .cse3)) (.cse12 (not .cse1)) (.cse9 (not .cse2)) (.cse13 (not .cse6)) (.cse16 (+ |fibonacci_#in~n| 1))) (and (let ((.cse0 (<= |fibonacci_#in~n| 2)) (.cse5 (< 1 |fibonacci_#in~n|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5) (let ((.cse8 (not .cse5)) (.cse11 (not .cse0))) (and (or .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse7 .cse8 .cse12 .cse9 .cse10 .cse11 .cse13))))) (let ((.cse14 (<= 5 .cse16))) (or (and .cse2 .cse14 .cse4) (and .cse1 .cse2 .cse14 .cse4 .cse6) (let ((.cse15 (not .cse14))) (and (or .cse7 .cse9 .cse15) (or .cse7 .cse12 .cse9 .cse15 .cse13))))) (let ((.cse17 (< 2 |fibonacci_#in~n|))) (or (and .cse1 .cse2 .cse17 .cse3 .cse4 .cse6) (and .cse2 .cse17 .cse3 .cse4) (let ((.cse18 (not .cse17))) (and (or .cse7 .cse9 .cse10 .cse18) (or .cse7 .cse12 .cse9 .cse10 .cse18 .cse13))))) (let ((.cse20 (<= 6 .cse16)) (.cse19 (<= |fibonacci_#in~n| 5))) (or (and .cse2 .cse19 .cse20) (and .cse1 .cse2 .cse19 .cse20 .cse6) (let ((.cse21 (not .cse19)) (.cse22 (not .cse20))) (and (or .cse9 .cse21 .cse22) (or .cse12 .cse9 .cse21 .cse22 .cse13)))))))) [2023-02-17 09:06:55,069 INFO L899 garLoopResultBuilder]: For program point fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2023-02-17 09:06:55,069 INFO L899 garLoopResultBuilder]: For program point fibonacciFINAL(lines 16 24) no Hoare annotation was computed. [2023-02-17 09:06:55,069 INFO L899 garLoopResultBuilder]: For program point fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2023-02-17 09:06:55,070 INFO L899 garLoopResultBuilder]: For program point fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2023-02-17 09:06:55,070 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2023-02-17 09:06:55,070 INFO L899 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2023-02-17 09:06:55,070 INFO L895 garLoopResultBuilder]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse18 (+ |fibonacci_#in~n| 1)) (.cse57 (+ fibonacci_~n (- 1)))) (let ((.cse22 (<= |fibonacci_#in~n| 2)) (.cse6 (<= |fibonacci_#in~n| 9)) (.cse7 (>= fibonacci_~n |fibonacci_#in~n|)) (.cse8 (= |fibonacci_#in~n| fibonacci_~n)) (.cse23 (<= fibonacci_~n 3)) (.cse24 (<= |fibonacci_#in~n| 3)) (.cse9 (<= fibonacci_~n |fibonacci_#in~n|)) (.cse25 (<= fibonacci_~n 2)) (.cse11 (<= 0 .cse57)) (.cse13 (<= fibonacci_~n 4)) (.cse15 (not (<= .cse57 0))) (.cse16 (<= fibonacci_~n 9)) (.cse17 (not (< fibonacci_~n 1))) (.cse14 (<= |fibonacci_#in~n| 4)) (.cse27 (< 1 |fibonacci_#in~n|)) (.cse33 (<= |fibonacci_#in~n| 7)) (.cse32 (< 3 |fibonacci_#in~n|)) (.cse29 (<= 8 .cse18)) (.cse10 (<= 1 |fibonacci_#in~n|)) (.cse12 (<= 2 |fibonacci_#in~n|)) (.cse52 (<= 6 .cse18)) (.cse51 (<= |fibonacci_#in~n| 5)) (.cse40 (< 2 |fibonacci_#in~n|)) (.cse44 (<= 7 .cse18)) (.cse42 (<= |fibonacci_#in~n| 6))) (let ((.cse43 (<= 6 fibonacci_~n)) (.cse45 (<= fibonacci_~n 6)) (.cse38 (not .cse42)) (.cse39 (not .cse44)) (.cse41 (< 1 .cse57)) (.cse46 (not .cse40)) (.cse49 (<= 5 fibonacci_~n)) (.cse50 (<= fibonacci_~n 5)) (.cse47 (not .cse51)) (.cse48 (not .cse52)) (.cse3 (not .cse12)) (.cse4 (not .cse10)) (.cse35 (not .cse29)) (.cse36 (not .cse32)) (.cse37 (not .cse33)) (.cse30 (<= fibonacci_~n 7)) (.cse31 (<= 7 fibonacci_~n)) (.cse34 (< 2 .cse57)) (.cse28 (not .cse27)) (.cse26 (< 0 .cse57)) (.cse0 (not .cse14)) (.cse19 (and .cse22 .cse6 .cse7 .cse8 .cse23 .cse24 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)) (.cse1 (not .cse6)) (.cse20 (not .cse24)) (.cse21 (not .cse22)) (.cse53 (and .cse22 .cse6 .cse7 .cse8 .cse23 .cse24 .cse15 .cse25 .cse11 .cse16))) (and (let ((.cse5 (<= 5 .cse18))) (or (let ((.cse2 (not .cse5))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse3 .cse1 .cse2 .cse4))) (and .cse6 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 4 fibonacci_~n) .cse16 .cse17))) (or .cse0 .cse19 .cse1 .cse20 .cse21) (or (and .cse22 .cse6 .cse7 .cse8 .cse23 .cse24 .cse9 .cse25 .cse10 .cse11 .cse26 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse17) (and (or .cse0 .cse28 .cse1 .cse20 .cse21) (or .cse0 .cse28 .cse3 .cse1 .cse20 .cse21 .cse4))) (or (and .cse6 .cse7 .cse8 .cse29 .cse9 .cse30 .cse10 .cse31 .cse11 .cse32 .cse12 .cse33 .cse15 .cse34 .cse16 .cse17) .cse1 .cse35 .cse36 .cse37) (or .cse38 .cse1 .cse39 (and .cse6 .cse7 .cse40 .cse8 .cse9 .cse41 .cse10 .cse42 .cse43 .cse11 .cse12 .cse44 .cse15 .cse45 .cse16 .cse17) .cse46) (or .cse1 .cse47 .cse46 .cse48 (and .cse6 .cse7 .cse40 .cse8 .cse49 .cse9 .cse41 .cse50 .cse10 .cse11 .cse12 .cse51 .cse15 .cse52 .cse16 .cse17)) (or .cse0 (and .cse22 .cse6 .cse7 .cse8 .cse25 .cse11 .cse16) .cse19 .cse1 .cse20 .cse21 .cse53) (let ((.cse54 (<= 9 |fibonacci_#in~n|))) (or .cse1 (and .cse12 .cse6 .cse7 .cse8 (<= 9 fibonacci_~n) .cse9 .cse54 .cse15 .cse10 .cse11 .cse16 .cse17) (not .cse54))) (or (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse42 .cse43 .cse11 .cse32 .cse12 .cse44 .cse15 .cse45 .cse34 .cse16 .cse17) .cse38 .cse3 .cse1 .cse39 .cse4 .cse36) (or (and .cse6 .cse7 .cse40 .cse8 .cse23 .cse24 .cse9 .cse41 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (or .cse0 .cse1 .cse20 .cse46) (or .cse0 .cse3 .cse1 .cse20 .cse46 .cse4))) (or (and .cse6 .cse7 .cse8 .cse49 .cse9 .cse50 .cse10 .cse11 .cse12 .cse51 .cse15 .cse52 .cse16 .cse17) (and (or .cse1 .cse47 .cse48) (or .cse3 .cse1 .cse47 .cse48 .cse4))) (or .cse28 .cse3 .cse1 .cse4 .cse35 .cse36 .cse37 (and .cse6 .cse7 .cse8 .cse29 .cse9 .cse30 .cse10 .cse31 .cse11 .cse26 .cse32 .cse12 .cse33 .cse27 .cse15 .cse34 .cse16 .cse17)) (let ((.cse56 (<= |fibonacci_#in~n| 8)) (.cse55 (<= 9 .cse18))) (or .cse28 (and .cse6 .cse7 .cse8 .cse55 (<= fibonacci_~n 8) .cse9 .cse10 (<= 8 fibonacci_~n) .cse11 .cse26 .cse12 .cse27 .cse15 .cse56 .cse16 .cse17) .cse1 (not .cse56) (not .cse55))) (or .cse0 .cse19 .cse1 .cse20 .cse21 .cse53))))) [2023-02-17 09:06:55,071 INFO L899 garLoopResultBuilder]: For program point L22-3(line 22) no Hoare annotation was computed. [2023-02-17 09:06:55,071 INFO L899 garLoopResultBuilder]: For program point L22-4(line 22) no Hoare annotation was computed. [2023-02-17 09:06:55,071 INFO L899 garLoopResultBuilder]: For program point L22-5(line 22) no Hoare annotation was computed. [2023-02-17 09:06:55,072 INFO L895 garLoopResultBuilder]: At program point L22-6(line 22) the Hoare annotation is: (let ((.cse74 (+ fibonacci_~n (- 1)))) (let ((.cse68 (<= |fibonacci_#in~n| 2)) (.cse35 (* |fibonacci_#t~ret4| (- 1))) (.cse4 (<= |fibonacci_#in~n| 9)) (.cse16 (<= (- 2147483648) |fibonacci_#t~ret4|)) (.cse7 (>= fibonacci_~n |fibonacci_#in~n|)) (.cse9 (= |fibonacci_#in~n| fibonacci_~n)) (.cse75 (= |fibonacci_#t~ret4| 0)) (.cse69 (<= fibonacci_~n 2)) (.cse15 (<= 0 .cse74)) (.cse21 (<= fibonacci_~n 9))) (let ((.cse73 (and .cse68 (< (+ .cse35 (- 2147483649)) (- 2147483648)) .cse4 .cse16 .cse7 .cse9 .cse75 .cse69 .cse15 .cse21)) (.cse71 (and .cse68 .cse4 .cse16 .cse7 .cse9 .cse75 .cse69 .cse15 .cse21)) (.cse39 (+ |fibonacci_#in~n| 1))) (let ((.cse51 (<= |fibonacci_#in~n| 7)) (.cse47 (<= 8 .cse39)) (.cse52 (< 3 |fibonacci_#in~n|)) (.cse55 (< 2 .cse74)) (.cse17 (<= 3 |fibonacci_#in~n|)) (.cse72 (or .cse73 .cse71)) (.cse5 (<= 1 |fibonacci_#t~ret4|)) (.cse59 (<= fibonacci_~n 3)) (.cse60 (<= |fibonacci_#in~n| 3)) (.cse11 (<= fibonacci_~n |fibonacci_#in~n|)) (.cse53 (= (+ |fibonacci_#t~ret4| (- 1)) 0)) (.cse34 (<= fibonacci_~n 4)) (.cse36 (<= |fibonacci_#in~n| 4)) (.cse19 (not (<= .cse74 0))) (.cse62 (<= |fibonacci_#t~ret4| 1)) (.cse22 (not (< fibonacci_~n 1))) (.cse32 (<= 6 .cse39)) (.cse8 (< 2 |fibonacci_#in~n|)) (.cse31 (<= |fibonacci_#in~n| 5)) (.cse70 (<= 1 |fibonacci_#in~n|)) (.cse61 (<= 2 |fibonacci_#in~n|)) (.cse54 (< 1 |fibonacci_#in~n|)) (.cse18 (<= 7 .cse39)) (.cse13 (<= |fibonacci_#in~n| 6))) (let ((.cse0 (not .cse13)) (.cse2 (not .cse18)) (.cse3 (< 1 (+ .cse35 2147483645))) (.cse6 (<= |fibonacci_#t~ret4| 5)) (.cse14 (<= 6 fibonacci_~n)) (.cse20 (<= fibonacci_~n 6)) (.cse56 (< 0 .cse74)) (.cse46 (not .cse54)) (.cse26 (not .cse61)) (.cse27 (not .cse70)) (.cse24 (not .cse31)) (.cse23 (not .cse8)) (.cse25 (not .cse32)) (.cse28 (<= 5 fibonacci_~n)) (.cse12 (< 1 .cse74)) (.cse29 (<= fibonacci_~n 5)) (.cse30 (<= |fibonacci_#t~ret4| 3)) (.cse42 (and .cse68 .cse4 .cse5 .cse7 .cse9 .cse59 .cse60 .cse11 .cse69 .cse70 .cse15 .cse61 .cse53 .cse34 .cse16 .cse36 .cse19 .cse62 .cse21 .cse22)) (.cse45 (not .cse68)) (.cse66 (and .cse72 .cse16 .cse9 .cse59 .cse60 .cse19 .cse62)) (.cse65 (and .cse68 .cse4 .cse5 .cse7 .cse9 .cse59 .cse60 .cse69 .cse15 .cse53 .cse16 .cse19 .cse62 .cse21)) (.cse37 (not .cse36)) (.cse43 (not .cse60)) (.cse44 (and .cse68 .cse4 .cse5 .cse7 .cse9 .cse59 .cse60 .cse11 .cse69 .cse15 .cse61 .cse53 .cse34 .cse16 .cse17 .cse36 .cse19 .cse62 .cse21 .cse22)) (.cse10 (<= 4 |fibonacci_#in~n|)) (.cse48 (<= fibonacci_~n 7)) (.cse49 (<= 7 fibonacci_~n)) (.cse50 (<= |fibonacci_#t~ret4| 8)) (.cse40 (or (and .cse52 .cse4 .cse16 .cse7 .cse55 .cse15 .cse21) (and .cse52 .cse53 .cse4 .cse16 .cse7 .cse55 .cse15 .cse21))) (.cse1 (not .cse4)) (.cse57 (not .cse47)) (.cse41 (not .cse52)) (.cse58 (not .cse51))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) .cse23) (or (and (or .cse1 .cse24 .cse25) (or .cse26 .cse1 .cse24 .cse25 .cse27)) (and .cse4 .cse5 .cse7 .cse9 .cse10 .cse28 .cse11 .cse29 .cse30 .cse15 .cse16 .cse17 .cse31 .cse19 .cse32 .cse21 .cse22)) (let ((.cse33 (<= 5 .cse39))) (or (and .cse4 .cse5 .cse33 .cse7 .cse9 .cse10 .cse11 .cse15 (<= |fibonacci_#t~ret4| 2) .cse34 .cse16 (< 1 (+ .cse35 2147483648)) .cse17 .cse36 .cse19 (<= 4 fibonacci_~n) .cse21 .cse22) (let ((.cse38 (not .cse33))) (and (or .cse37 .cse1 .cse38) (or .cse37 .cse26 .cse1 .cse38 .cse27))))) (or .cse0 .cse26 .cse1 .cse2 (and .cse3 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse17 .cse40 .cse18 .cse19 .cse20 .cse22) .cse27 .cse41) (or .cse42 .cse37 .cse1 .cse43 .cse44 .cse45) (or .cse46 .cse26 .cse1 (and .cse5 .cse7 .cse9 .cse10 .cse47 .cse11 .cse48 .cse49 .cse50 .cse15 .cse17 .cse51 (or (and .cse52 .cse53 .cse4 .cse16 .cse7 .cse54 .cse55 .cse15 .cse21 .cse56) (and .cse52 .cse4 .cse16 .cse7 .cse54 .cse55 .cse15 .cse21 .cse56)) .cse19 .cse22) .cse27 .cse57 .cse41 .cse58) (or (and (or (and .cse53 .cse4 .cse16 .cse7 .cse8 .cse12 .cse15 .cse21) (and .cse4 .cse16 .cse7 .cse8 .cse12 .cse15 .cse21)) .cse5 .cse9 .cse59 .cse60 .cse11 .cse15 .cse61 .cse34 .cse17 .cse36 .cse19 .cse62 .cse22) (and (or .cse37 .cse1 .cse43 .cse23) (or .cse37 .cse26 .cse1 .cse43 .cse23 .cse27))) (let ((.cse64 (<= 9 .cse39)) (.cse63 (<= |fibonacci_#in~n| 8))) (or .cse46 .cse1 (not .cse63) (not .cse64) (and .cse4 .cse5 .cse7 .cse9 (<= |fibonacci_#t~ret4| 13) .cse64 (<= fibonacci_~n 8) .cse10 .cse11 (<= 8 fibonacci_~n) .cse15 .cse56 .cse16 .cse17 (< 1 (+ .cse35 2147483637)) .cse54 .cse19 .cse63 .cse21 .cse22))) (or .cse42 .cse65 .cse37 .cse1 .cse43 .cse44 .cse45 .cse66) (let ((.cse67 (<= 9 |fibonacci_#in~n|))) (or .cse1 (not .cse67) (and .cse4 .cse5 .cse7 .cse9 .cse10 (<= |fibonacci_#t~ret4| 21) .cse11 .cse67 .cse15 .cse16 .cse17 (<= 9 fibonacci_~n) .cse19 .cse21 .cse22))) (or (and .cse68 .cse4 .cse5 .cse7 .cse9 .cse59 .cse60 .cse11 .cse69 .cse70 .cse15 .cse56 .cse61 .cse53 .cse34 .cse16 .cse36 .cse54 .cse19 .cse62 .cse21 .cse22) (and .cse68 .cse4 .cse5 .cse7 .cse9 .cse59 .cse60 .cse11 .cse69 .cse15 .cse56 .cse61 .cse53 .cse34 .cse16 .cse17 .cse36 .cse54 .cse19 .cse62 .cse21 .cse22) (and (or .cse37 .cse46 .cse1 .cse43 .cse45) (or .cse37 .cse46 .cse26 .cse1 .cse43 .cse45 .cse27))) (or .cse1 .cse24 .cse23 .cse25 (and .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse28 .cse11 .cse12 .cse29 .cse30 .cse15 .cse16 .cse17 .cse31 .cse19 .cse32 .cse21 .cse22)) (or .cse42 .cse45 .cse66 .cse71 (and .cse72 .cse62) .cse65 .cse37 (and .cse68 .cse53 .cse4 .cse16 .cse7 .cse9 .cse69 .cse15 .cse21) .cse73 .cse1 .cse43 .cse44 (and .cse68 .cse53 .cse4 .cse16 .cse7 .cse9 .cse69 .cse62 .cse15 .cse21)) (or (and .cse5 .cse7 .cse9 .cse10 .cse47 .cse11 .cse48 .cse49 .cse50 .cse15 .cse17 .cse40 .cse51 .cse19 .cse22) .cse1 .cse57 .cse41 .cse58))))))) [2023-02-17 09:06:55,072 INFO L899 garLoopResultBuilder]: For program point L22-7(line 22) no Hoare annotation was computed. [2023-02-17 09:06:55,072 INFO L899 garLoopResultBuilder]: For program point L22-8(line 22) no Hoare annotation was computed. [2023-02-17 09:06:55,072 INFO L899 garLoopResultBuilder]: For program point L22-9(line 22) no Hoare annotation was computed. [2023-02-17 09:06:55,072 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2023-02-17 09:06:55,072 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 09:06:55,072 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 09:06:55,072 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 34) no Hoare annotation was computed. [2023-02-17 09:06:55,073 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (and (>= |ULTIMATE.start_main_~x~0#1| 9) (<= |ULTIMATE.start_main_~x~0#1| 9)) [2023-02-17 09:06:55,073 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 09:06:55,073 INFO L899 garLoopResultBuilder]: For program point L29-1(line 29) no Hoare annotation was computed. [2023-02-17 09:06:55,073 INFO L902 garLoopResultBuilder]: At program point L27(lines 27 35) the Hoare annotation is: true [2023-02-17 09:06:55,073 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 09:06:55,075 INFO L445 BasicCegarLoop]: Path program histogram: [5, 4, 2, 1, 1, 1, 1, 1] [2023-02-17 09:06:55,077 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 09:06:55,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 09:06:55 BoogieIcfgContainer [2023-02-17 09:06:55,082 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 09:06:55,082 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 09:06:55,082 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 09:06:55,083 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 09:06:55,083 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:06:22" (3/4) ... [2023-02-17 09:06:55,085 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 09:06:55,088 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2023-02-17 09:06:55,091 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2023-02-17 09:06:55,091 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-17 09:06:55,091 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 09:06:55,091 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 09:06:55,111 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 09:06:55,111 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 09:06:55,112 INFO L158 Benchmark]: Toolchain (without parser) took 32622.88ms. Allocated memory was 136.3MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 96.0MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 264.3MB. Max. memory is 16.1GB. [2023-02-17 09:06:55,112 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 136.3MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 09:06:55,112 INFO L158 Benchmark]: CACSL2BoogieTranslator took 154.25ms. Allocated memory is still 136.3MB. Free memory was 96.0MB in the beginning and 85.9MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 09:06:55,113 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.38ms. Allocated memory is still 136.3MB. Free memory was 85.9MB in the beginning and 84.9MB in the end (delta: 983.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 09:06:55,113 INFO L158 Benchmark]: Boogie Preprocessor took 11.10ms. Allocated memory is still 136.3MB. Free memory was 84.9MB in the beginning and 83.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 09:06:55,113 INFO L158 Benchmark]: RCFGBuilder took 170.44ms. Allocated memory is still 136.3MB. Free memory was 83.8MB in the beginning and 73.9MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 09:06:55,114 INFO L158 Benchmark]: TraceAbstraction took 32232.41ms. Allocated memory was 136.3MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 73.4MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 239.1MB. Max. memory is 16.1GB. [2023-02-17 09:06:55,114 INFO L158 Benchmark]: Witness Printer took 28.75ms. Allocated memory is still 1.7GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 09:06:55,115 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.09ms. Allocated memory is still 136.3MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 154.25ms. Allocated memory is still 136.3MB. Free memory was 96.0MB in the beginning and 85.9MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.38ms. Allocated memory is still 136.3MB. Free memory was 85.9MB in the beginning and 84.9MB in the end (delta: 983.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 11.10ms. Allocated memory is still 136.3MB. Free memory was 84.9MB in the beginning and 83.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 170.44ms. Allocated memory is still 136.3MB. Free memory was 83.8MB in the beginning and 73.9MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 32232.41ms. Allocated memory was 136.3MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 73.4MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 239.1MB. Max. memory is 16.1GB. * Witness Printer took 28.75ms. Allocated memory is still 1.7GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 32.2s, OverallIterations: 16, TraceHistogramMax: 109, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2063 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2039 mSDsluCounter, 2468 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2052 mSDsCounter, 782 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4741 IncrementalHoareTripleChecker+Invalid, 5523 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 782 mSolverCounterUnsat, 416 mSDtfsCounter, 4741 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5615 GetRequests, 4735 SyntacticMatches, 426 SemanticMatches, 454 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17517 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=332occurred in iteration=8, InterpolantAutomatonStates: 328, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 243 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 491 PreInvPairs, 633 NumberOfFragments, 3850 HoareAnnotationTreeSize, 491 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 24.1s InterpolantComputationTime, 4692 NumberOfCodeBlocks, 4577 NumberOfCodeBlocksAsserted, 128 NumberOfCheckSat, 6925 ConstructedInterpolants, 0 QuantifiedInterpolants, 17235 SizeOfPredicates, 37 NumberOfNonLiveVariables, 4291 ConjunctsInSsa, 423 ConjunctsInUnsatCore, 39 InterpolantComputations, 5 PerfectInterpolantSequences, 123452/152111 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 - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-02-17 09:06:55,129 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 Result: TRUE