./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 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/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-?-6c24879 [2022-07-13 02:10:49,929 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 02:10:49,931 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 02:10:49,971 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 02:10:49,972 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 02:10:49,973 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 02:10:49,975 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 02:10:49,977 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 02:10:49,979 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 02:10:49,982 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 02:10:49,983 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 02:10:49,985 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 02:10:49,986 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 02:10:49,987 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 02:10:49,988 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 02:10:49,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 02:10:49,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 02:10:49,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 02:10:49,995 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 02:10:50,000 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 02:10:50,002 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 02:10:50,003 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 02:10:50,003 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 02:10:50,004 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 02:10:50,006 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 02:10:50,012 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 02:10:50,012 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 02:10:50,012 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 02:10:50,013 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 02:10:50,014 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 02:10:50,015 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 02:10:50,015 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 02:10:50,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 02:10:50,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 02:10:50,018 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 02:10:50,019 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 02:10:50,019 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 02:10:50,019 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 02:10:50,020 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 02:10:50,020 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 02:10:50,021 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 02:10:50,022 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 02:10:50,023 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-07-13 02:10:50,053 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 02:10:50,054 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 02:10:50,054 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 02:10:50,054 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 02:10:50,055 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 02:10:50,055 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 02:10:50,056 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 02:10:50,056 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 02:10:50,056 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 02:10:50,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 02:10:50,057 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 02:10:50,057 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 02:10:50,057 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 02:10:50,058 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 02:10:50,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 02:10:50,058 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 02:10:50,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 02:10:50,058 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 02:10:50,058 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-13 02:10:50,059 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 02:10:50,059 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 02:10:50,059 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 02:10:50,059 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 02:10:50,059 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 02:10:50,060 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 02:10:50,060 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 02:10:50,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 02:10:50,060 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 02:10:50,060 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 02:10:50,061 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 02:10:50,061 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 02:10:50,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 02:10:50,061 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 02:10:50,061 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 [2022-07-13 02:10:50,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 02:10:50,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 02:10:50,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 02:10:50,306 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 02:10:50,306 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 02:10:50,307 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci02.c [2022-07-13 02:10:50,373 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08ab23edf/7ef4b865d1014edd83a5073b3247bda4/FLAG3e42a5398 [2022-07-13 02:10:50,725 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 02:10:50,725 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci02.c [2022-07-13 02:10:50,729 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08ab23edf/7ef4b865d1014edd83a5073b3247bda4/FLAG3e42a5398 [2022-07-13 02:10:51,164 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08ab23edf/7ef4b865d1014edd83a5073b3247bda4 [2022-07-13 02:10:51,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 02:10:51,167 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 02:10:51,169 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 02:10:51,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 02:10:51,172 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 02:10:51,173 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:10:51" (1/1) ... [2022-07-13 02:10:51,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65640da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:10:51, skipping insertion in model container [2022-07-13 02:10:51,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:10:51" (1/1) ... [2022-07-13 02:10:51,179 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 02:10:51,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 02:10:51,313 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci02.c[715,728] [2022-07-13 02:10:51,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 02:10:51,319 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 02:10:51,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci02.c[715,728] [2022-07-13 02:10:51,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 02:10:51,340 INFO L208 MainTranslator]: Completed translation [2022-07-13 02:10:51,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:10:51 WrapperNode [2022-07-13 02:10:51,341 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 02:10:51,342 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 02:10:51,342 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 02:10:51,342 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 02:10:51,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:10:51" (1/1) ... [2022-07-13 02:10:51,351 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:10:51" (1/1) ... [2022-07-13 02:10:51,362 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-07-13 02:10:51,362 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 02:10:51,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 02:10:51,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 02:10:51,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 02:10:51,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:10:51" (1/1) ... [2022-07-13 02:10:51,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:10:51" (1/1) ... [2022-07-13 02:10:51,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:10:51" (1/1) ... [2022-07-13 02:10:51,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:10:51" (1/1) ... [2022-07-13 02:10:51,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:10:51" (1/1) ... [2022-07-13 02:10:51,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:10:51" (1/1) ... [2022-07-13 02:10:51,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:10:51" (1/1) ... [2022-07-13 02:10:51,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 02:10:51,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 02:10:51,395 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 02:10:51,395 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 02:10:51,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:10:51" (1/1) ... [2022-07-13 02:10:51,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 02:10:51,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:10:51,423 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 02:10:51,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 02:10:51,462 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2022-07-13 02:10:51,463 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2022-07-13 02:10:51,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 02:10:51,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 02:10:51,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 02:10:51,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 02:10:51,505 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 02:10:51,506 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 02:10:51,584 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 02:10:51,589 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 02:10:51,589 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 02:10:51,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:10:51 BoogieIcfgContainer [2022-07-13 02:10:51,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 02:10:51,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 02:10:51,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 02:10:51,596 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 02:10:51,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:10:51" (1/3) ... [2022-07-13 02:10:51,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42435f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:10:51, skipping insertion in model container [2022-07-13 02:10:51,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:10:51" (2/3) ... [2022-07-13 02:10:51,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42435f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:10:51, skipping insertion in model container [2022-07-13 02:10:51,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:10:51" (3/3) ... [2022-07-13 02:10:51,598 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci02.c [2022-07-13 02:10:51,624 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 02:10:51,624 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-07-13 02:10:51,664 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 02:10:51,670 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@23f06a78, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@64bc069e [2022-07-13 02:10:51,670 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-13 02:10:51,674 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) [2022-07-13 02:10:51,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-13 02:10:51,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:10:51,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:10:51,681 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-13 02:10:51,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:10:51,686 INFO L85 PathProgramCache]: Analyzing trace with hash -108718961, now seen corresponding path program 1 times [2022-07-13 02:10:51,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:10:51,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980299363] [2022-07-13 02:10:51,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:10:51,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:10:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:51,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:10:51,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:10:51,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980299363] [2022-07-13 02:10:51,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980299363] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:10:51,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:10:51,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 02:10:51,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206144914] [2022-07-13 02:10:51,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:10:51,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:10:51,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:10:51,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:10:51,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 02:10:51,866 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 5 states, 3 states have (on average 2.0) internal successors, (6), 4 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) [2022-07-13 02:10:51,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:10:51,943 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-07-13 02:10:51,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 02:10:51,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 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 [2022-07-13 02:10:51,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:10:51,953 INFO L225 Difference]: With dead ends: 33 [2022-07-13 02:10:51,964 INFO L226 Difference]: Without dead ends: 22 [2022-07-13 02:10:51,968 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 [2022-07-13 02:10:51,971 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 38 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:10:51,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 39 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:10:51,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-13 02:10:52,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-13 02:10:52,012 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) [2022-07-13 02:10:52,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-07-13 02:10:52,015 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 7 [2022-07-13 02:10:52,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:10:52,016 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-07-13 02:10:52,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 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) [2022-07-13 02:10:52,016 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-07-13 02:10:52,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-13 02:10:52,017 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:10:52,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:10:52,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 02:10:52,018 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-13 02:10:52,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:10:52,019 INFO L85 PathProgramCache]: Analyzing trace with hash 924679547, now seen corresponding path program 1 times [2022-07-13 02:10:52,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:10:52,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471166782] [2022-07-13 02:10:52,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:10:52,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:10:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:52,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:10:52,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:10:52,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471166782] [2022-07-13 02:10:52,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471166782] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:10:52,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:10:52,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 02:10:52,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021830946] [2022-07-13 02:10:52,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:10:52,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 02:10:52,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:10:52,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 02:10:52,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 02:10:52,048 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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) [2022-07-13 02:10:52,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:10:52,069 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-07-13 02:10:52,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 02:10:52,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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 [2022-07-13 02:10:52,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:10:52,072 INFO L225 Difference]: With dead ends: 24 [2022-07-13 02:10:52,072 INFO L226 Difference]: Without dead ends: 22 [2022-07-13 02:10:52,073 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 [2022-07-13 02:10:52,074 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 11 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:10:52,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 22 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:10:52,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-13 02:10:52,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-07-13 02:10:52,081 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) [2022-07-13 02:10:52,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-07-13 02:10:52,082 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 8 [2022-07-13 02:10:52,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:10:52,082 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-07-13 02:10:52,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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) [2022-07-13 02:10:52,083 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-07-13 02:10:52,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 02:10:52,084 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:10:52,084 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:10:52,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 02:10:52,085 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-13 02:10:52,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:10:52,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1244761165, now seen corresponding path program 1 times [2022-07-13 02:10:52,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:10:52,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142854221] [2022-07-13 02:10:52,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:10:52,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:10:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:52,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 02:10:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:52,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 02:10:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:52,191 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 02:10:52,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:10:52,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142854221] [2022-07-13 02:10:52,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142854221] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:10:52,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:10:52,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 02:10:52,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232861990] [2022-07-13 02:10:52,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:10:52,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:10:52,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:10:52,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:10:52,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 02:10:52,195 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) [2022-07-13 02:10:52,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:10:52,247 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-07-13 02:10:52,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 02:10:52,248 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 [2022-07-13 02:10:52,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:10:52,251 INFO L225 Difference]: With dead ends: 36 [2022-07-13 02:10:52,251 INFO L226 Difference]: Without dead ends: 34 [2022-07-13 02:10:52,252 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 [2022-07-13 02:10:52,253 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 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 [2022-07-13 02:10:52,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 64 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:10:52,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-13 02:10:52,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-07-13 02:10:52,263 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) [2022-07-13 02:10:52,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-07-13 02:10:52,265 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 23 [2022-07-13 02:10:52,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:10:52,265 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-07-13 02:10:52,266 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) [2022-07-13 02:10:52,266 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-07-13 02:10:52,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 02:10:52,267 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:10:52,267 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] [2022-07-13 02:10:52,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 02:10:52,268 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-13 02:10:52,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:10:52,269 INFO L85 PathProgramCache]: Analyzing trace with hash 78572347, now seen corresponding path program 1 times [2022-07-13 02:10:52,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:10:52,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128057580] [2022-07-13 02:10:52,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:10:52,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:10:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:52,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 02:10:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:52,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 02:10:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:52,404 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 02:10:52,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:10:52,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128057580] [2022-07-13 02:10:52,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128057580] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:10:52,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66460009] [2022-07-13 02:10:52,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:10:52,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:10:52,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:10:52,412 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:10:52,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 02:10:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:52,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 02:10:52,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:10:52,556 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:10:52,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:10:52,684 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 02:10:52,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66460009] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:10:52,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:10:52,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2022-07-13 02:10:52,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780691812] [2022-07-13 02:10:52,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:10:52,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 02:10:52,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:10:52,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 02:10:52,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-07-13 02:10:52,688 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) [2022-07-13 02:10:52,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:10:52,987 INFO L93 Difference]: Finished difference Result 126 states and 172 transitions. [2022-07-13 02:10:52,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 02:10:52,988 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 [2022-07-13 02:10:52,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:10:52,995 INFO L225 Difference]: With dead ends: 126 [2022-07-13 02:10:52,995 INFO L226 Difference]: Without dead ends: 93 [2022-07-13 02:10:52,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-07-13 02:10:53,004 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 120 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 02:10:53,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 135 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 02:10:53,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-13 02:10:53,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2022-07-13 02:10:53,040 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) [2022-07-13 02:10:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions. [2022-07-13 02:10:53,045 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 24 [2022-07-13 02:10:53,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:10:53,045 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 112 transitions. [2022-07-13 02:10:53,045 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) [2022-07-13 02:10:53,046 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions. [2022-07-13 02:10:53,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 02:10:53,047 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:10:53,047 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] [2022-07-13 02:10:53,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 02:10:53,272 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 [2022-07-13 02:10:53,272 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-13 02:10:53,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:10:53,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1267704266, now seen corresponding path program 2 times [2022-07-13 02:10:53,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:10:53,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895966385] [2022-07-13 02:10:53,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:10:53,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:10:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:53,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:10:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:53,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 02:10:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:53,340 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 02:10:53,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:10:53,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895966385] [2022-07-13 02:10:53,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895966385] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:10:53,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681518447] [2022-07-13 02:10:53,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 02:10:53,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:10:53,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:10:53,343 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:10:53,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 02:10:53,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 02:10:53,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:10:53,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 02:10:53,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:10:53,427 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 02:10:53,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:10:53,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681518447] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:10:53,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:10:53,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-07-13 02:10:53,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634746816] [2022-07-13 02:10:53,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:10:53,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:10:53,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:10:53,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:10:53,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-13 02:10:53,430 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) [2022-07-13 02:10:53,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:10:53,456 INFO L93 Difference]: Finished difference Result 95 states and 128 transitions. [2022-07-13 02:10:53,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 02:10:53,457 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 [2022-07-13 02:10:53,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:10:53,460 INFO L225 Difference]: With dead ends: 95 [2022-07-13 02:10:53,461 INFO L226 Difference]: Without dead ends: 94 [2022-07-13 02:10:53,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-13 02:10:53,463 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:10:53,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 64 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:10:53,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-13 02:10:53,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2022-07-13 02:10:53,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 66 states have (on average 1.106060606060606) internal successors, (73), 66 states have internal predecessors, (73), 11 states have call successors, (11), 3 states have call predecessors, (11), 6 states have return successors, (32), 15 states have call predecessors, (32), 10 states have call successors, (32) [2022-07-13 02:10:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 116 transitions. [2022-07-13 02:10:53,488 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 116 transitions. Word has length 30 [2022-07-13 02:10:53,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:10:53,488 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 116 transitions. [2022-07-13 02:10:53,489 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) [2022-07-13 02:10:53,489 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 116 transitions. [2022-07-13 02:10:53,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-13 02:10:53,495 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:10:53,495 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] [2022-07-13 02:10:53,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 02:10:53,699 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 [2022-07-13 02:10:53,700 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-13 02:10:53,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:10:53,700 INFO L85 PathProgramCache]: Analyzing trace with hash -644126528, now seen corresponding path program 1 times [2022-07-13 02:10:53,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:10:53,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460511349] [2022-07-13 02:10:53,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:10:53,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:10:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:53,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:10:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:53,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 02:10:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:53,767 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 02:10:53,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:10:53,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460511349] [2022-07-13 02:10:53,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460511349] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:10:53,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443941734] [2022-07-13 02:10:53,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:10:53,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:10:53,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:10:53,769 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:10:53,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 02:10:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:53,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 02:10:53,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:10:53,887 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:10:53,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:10:53,995 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 02:10:53,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443941734] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:10:53,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:10:53,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2022-07-13 02:10:53,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637897796] [2022-07-13 02:10:53,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:10:53,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:10:53,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:10:53,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:10:53,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-07-13 02:10:53,999 INFO L87 Difference]: Start difference. First operand 85 states and 116 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) [2022-07-13 02:10:54,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:10:54,649 INFO L93 Difference]: Finished difference Result 287 states and 442 transitions. [2022-07-13 02:10:54,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-13 02:10:54,649 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 [2022-07-13 02:10:54,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:10:54,651 INFO L225 Difference]: With dead ends: 287 [2022-07-13 02:10:54,652 INFO L226 Difference]: Without dead ends: 211 [2022-07-13 02:10:54,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2022-07-13 02:10:54,655 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 168 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 02:10:54,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 326 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 02:10:54,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-13 02:10:54,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 175. [2022-07-13 02:10:54,679 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) [2022-07-13 02:10:54,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 255 transitions. [2022-07-13 02:10:54,682 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 255 transitions. Word has length 31 [2022-07-13 02:10:54,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:10:54,683 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 255 transitions. [2022-07-13 02:10:54,683 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) [2022-07-13 02:10:54,683 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 255 transitions. [2022-07-13 02:10:54,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 02:10:54,686 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:10:54,686 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:10:54,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 02:10:54,909 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 [2022-07-13 02:10:54,910 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-13 02:10:54,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:10:54,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1089076188, now seen corresponding path program 1 times [2022-07-13 02:10:54,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:10:54,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674007134] [2022-07-13 02:10:54,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:10:54,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:10:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:54,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 02:10:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:54,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 02:10:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:54,982 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-07-13 02:10:54,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:10:54,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674007134] [2022-07-13 02:10:54,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674007134] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:10:54,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:10:54,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 02:10:54,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452594751] [2022-07-13 02:10:54,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:10:54,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:10:54,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:10:54,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:10:54,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 02:10:54,985 INFO L87 Difference]: Start difference. First operand 175 states and 255 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) [2022-07-13 02:10:55,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:10:55,019 INFO L93 Difference]: Finished difference Result 192 states and 278 transitions. [2022-07-13 02:10:55,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 02:10:55,019 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 55 [2022-07-13 02:10:55,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:10:55,022 INFO L225 Difference]: With dead ends: 192 [2022-07-13 02:10:55,022 INFO L226 Difference]: Without dead ends: 190 [2022-07-13 02:10:55,023 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 [2022-07-13 02:10:55,023 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:10:55,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 99 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:10:55,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-13 02:10:55,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 182. [2022-07-13 02:10:55,040 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) [2022-07-13 02:10:55,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 268 transitions. [2022-07-13 02:10:55,043 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 268 transitions. Word has length 55 [2022-07-13 02:10:55,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:10:55,043 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 268 transitions. [2022-07-13 02:10:55,043 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) [2022-07-13 02:10:55,043 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 268 transitions. [2022-07-13 02:10:55,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-13 02:10:55,045 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:10:55,045 INFO L195 NwaCegarLoop]: trace histogram [11, 9, 7, 7, 7, 7, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-13 02:10:55,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 02:10:55,046 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-13 02:10:55,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:10:55,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1167140976, now seen corresponding path program 1 times [2022-07-13 02:10:55,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:10:55,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474340474] [2022-07-13 02:10:55,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:10:55,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:10:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:55,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 02:10:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:55,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 02:10:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:55,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 02:10:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:55,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:10:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:55,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:10:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:55,136 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-07-13 02:10:55,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:10:55,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474340474] [2022-07-13 02:10:55,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474340474] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:10:55,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705745066] [2022-07-13 02:10:55,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:10:55,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:10:55,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:10:55,144 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) [2022-07-13 02:10:55,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 02:10:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:55,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 02:10:55,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:10:55,354 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 116 proven. 75 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-07-13 02:10:55,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:10:55,537 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 35 proven. 175 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-13 02:10:55,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705745066] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:10:55,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:10:55,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 15, 15] total 24 [2022-07-13 02:10:55,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229714621] [2022-07-13 02:10:55,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:10:55,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-13 02:10:55,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:10:55,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-13 02:10:55,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2022-07-13 02:10:55,540 INFO L87 Difference]: Start difference. First operand 182 states and 268 transitions. Second operand has 24 states, 22 states have (on average 3.727272727272727) internal successors, (82), 17 states have internal predecessors, (82), 12 states have call successors, (18), 9 states have call predecessors, (18), 4 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 02:10:56,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:10:56,096 INFO L93 Difference]: Finished difference Result 497 states and 797 transitions. [2022-07-13 02:10:56,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 02:10:56,096 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 3.727272727272727) internal successors, (82), 17 states have internal predecessors, (82), 12 states have call successors, (18), 9 states have call predecessors, (18), 4 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) Word has length 82 [2022-07-13 02:10:56,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:10:56,099 INFO L225 Difference]: With dead ends: 497 [2022-07-13 02:10:56,099 INFO L226 Difference]: Without dead ends: 330 [2022-07-13 02:10:56,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=963, Unknown=0, NotChecked=0, Total=1190 [2022-07-13 02:10:56,102 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 243 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 02:10:56,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 443 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 02:10:56,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-07-13 02:10:56,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 302. [2022-07-13 02:10:56,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 238 states have (on average 1.096638655462185) internal successors, (261), 237 states have internal predecessors, (261), 38 states have call successors, (38), 11 states have call predecessors, (38), 24 states have return successors, (115), 53 states have call predecessors, (115), 37 states have call successors, (115) [2022-07-13 02:10:56,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 414 transitions. [2022-07-13 02:10:56,131 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 414 transitions. Word has length 82 [2022-07-13 02:10:56,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:10:56,132 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 414 transitions. [2022-07-13 02:10:56,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 3.727272727272727) internal successors, (82), 17 states have internal predecessors, (82), 12 states have call successors, (18), 9 states have call predecessors, (18), 4 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 02:10:56,132 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 414 transitions. [2022-07-13 02:10:56,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-13 02:10:56,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:10:56,134 INFO L195 NwaCegarLoop]: trace histogram [14, 12, 10, 10, 10, 10, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-07-13 02:10:56,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 02:10:56,347 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 [2022-07-13 02:10:56,347 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-13 02:10:56,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:10:56,348 INFO L85 PathProgramCache]: Analyzing trace with hash -753402631, now seen corresponding path program 1 times [2022-07-13 02:10:56,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:10:56,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579482566] [2022-07-13 02:10:56,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:10:56,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:10:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:56,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 02:10:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:56,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 02:10:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:56,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 02:10:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:56,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:10:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:56,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:10:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:56,453 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2022-07-13 02:10:56,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:10:56,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579482566] [2022-07-13 02:10:56,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579482566] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:10:56,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918678731] [2022-07-13 02:10:56,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:10:56,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:10:56,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:10:56,456 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) [2022-07-13 02:10:56,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 02:10:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:56,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-13 02:10:56,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:10:56,769 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 178 proven. 184 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-13 02:10:56,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:10:56,895 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 53 proven. 330 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 02:10:56,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918678731] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:10:56,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:10:56,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 21, 21] total 25 [2022-07-13 02:10:56,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345512948] [2022-07-13 02:10:56,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:10:56,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-13 02:10:56,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:10:56,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-13 02:10:56,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2022-07-13 02:10:56,899 INFO L87 Difference]: Start difference. First operand 302 states and 414 transitions. Second operand has 25 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 17 states have internal predecessors, (85), 12 states have call successors, (17), 10 states have call predecessors, (17), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 02:10:57,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:10:57,458 INFO L93 Difference]: Finished difference Result 643 states and 932 transitions. [2022-07-13 02:10:57,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 02:10:57,459 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 17 states have internal predecessors, (85), 12 states have call successors, (17), 10 states have call predecessors, (17), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 101 [2022-07-13 02:10:57,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:10:57,462 INFO L225 Difference]: With dead ends: 643 [2022-07-13 02:10:57,462 INFO L226 Difference]: Without dead ends: 362 [2022-07-13 02:10:57,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=996, Unknown=0, NotChecked=0, Total=1260 [2022-07-13 02:10:57,465 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 264 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 02:10:57,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 486 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 02:10:57,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-07-13 02:10:57,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 325. [2022-07-13 02:10:57,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 256 states have (on average 1.09765625) internal successors, (281), 255 states have internal predecessors, (281), 42 states have call successors, (42), 12 states have call predecessors, (42), 25 states have return successors, (117), 57 states have call predecessors, (117), 41 states have call successors, (117) [2022-07-13 02:10:57,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 440 transitions. [2022-07-13 02:10:57,498 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 440 transitions. Word has length 101 [2022-07-13 02:10:57,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:10:57,499 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 440 transitions. [2022-07-13 02:10:57,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 17 states have internal predecessors, (85), 12 states have call successors, (17), 10 states have call predecessors, (17), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 02:10:57,500 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 440 transitions. [2022-07-13 02:10:57,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-13 02:10:57,501 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:10:57,501 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] [2022-07-13 02:10:57,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 02:10:57,715 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 [2022-07-13 02:10:57,716 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-13 02:10:57,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:10:57,716 INFO L85 PathProgramCache]: Analyzing trace with hash -147621069, now seen corresponding path program 2 times [2022-07-13 02:10:57,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:10:57,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523720339] [2022-07-13 02:10:57,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:10:57,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:10:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:57,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 02:10:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:57,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 02:10:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:57,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:10:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:57,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 02:10:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:57,941 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 178 proven. 119 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 02:10:57,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:10:57,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523720339] [2022-07-13 02:10:57,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523720339] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:10:57,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871829451] [2022-07-13 02:10:57,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 02:10:57,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:10:57,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:10:57,944 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) [2022-07-13 02:10:57,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 02:10:57,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 02:10:57,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:10:57,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-13 02:10:57,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:10:58,101 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 178 proven. 119 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 02:10:58,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:10:58,278 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 178 proven. 119 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 02:10:58,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871829451] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:10:58,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:10:58,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 24 [2022-07-13 02:10:58,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400065950] [2022-07-13 02:10:58,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:10:58,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-13 02:10:58,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:10:58,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-13 02:10:58,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2022-07-13 02:10:58,283 INFO L87 Difference]: Start difference. First operand 325 states and 440 transitions. Second operand has 24 states, 23 states have (on average 3.217391304347826) internal successors, (74), 16 states have internal predecessors, (74), 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) [2022-07-13 02:10:58,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:10:58,747 INFO L93 Difference]: Finished difference Result 618 states and 883 transitions. [2022-07-13 02:10:58,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-13 02:10:58,748 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.217391304347826) internal successors, (74), 16 states have internal predecessors, (74), 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 86 [2022-07-13 02:10:58,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:10:58,751 INFO L225 Difference]: With dead ends: 618 [2022-07-13 02:10:58,751 INFO L226 Difference]: Without dead ends: 314 [2022-07-13 02:10:58,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 183 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=441, Invalid=1119, Unknown=0, NotChecked=0, Total=1560 [2022-07-13 02:10:58,755 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 461 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 02:10:58,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 137 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 02:10:58,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-07-13 02:10:58,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 288. [2022-07-13 02:10:58,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 226 states have (on average 1.092920353982301) internal successors, (247), 228 states have internal predecessors, (247), 37 states have call successors, (37), 12 states have call predecessors, (37), 23 states have return successors, (68), 47 states have call predecessors, (68), 36 states have call successors, (68) [2022-07-13 02:10:58,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 352 transitions. [2022-07-13 02:10:58,774 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 352 transitions. Word has length 86 [2022-07-13 02:10:58,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:10:58,774 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 352 transitions. [2022-07-13 02:10:58,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.217391304347826) internal successors, (74), 16 states have internal predecessors, (74), 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) [2022-07-13 02:10:58,775 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 352 transitions. [2022-07-13 02:10:58,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-13 02:10:58,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:10:58,776 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 8, 8, 8, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:10:58,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 02:10:58,997 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 [2022-07-13 02:10:58,997 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-13 02:10:58,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:10:58,998 INFO L85 PathProgramCache]: Analyzing trace with hash 208625464, now seen corresponding path program 3 times [2022-07-13 02:10:58,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:10:58,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655636556] [2022-07-13 02:10:58,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:10:58,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:10:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:59,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 02:10:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:59,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:10:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:59,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:10:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:59,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 02:10:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:59,077 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-07-13 02:10:59,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:10:59,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655636556] [2022-07-13 02:10:59,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655636556] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:10:59,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851050981] [2022-07-13 02:10:59,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 02:10:59,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:10:59,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:10:59,081 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) [2022-07-13 02:10:59,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 02:10:59,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 02:10:59,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:10:59,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 02:10:59,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:10:59,170 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2022-07-13 02:10:59,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:10:59,304 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-07-13 02:10:59,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851050981] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:10:59,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:10:59,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2022-07-13 02:10:59,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395123255] [2022-07-13 02:10:59,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:10:59,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 02:10:59,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:10:59,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 02:10:59,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-07-13 02:10:59,307 INFO L87 Difference]: Start difference. First operand 288 states and 352 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 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) [2022-07-13 02:10:59,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:10:59,400 INFO L93 Difference]: Finished difference Result 297 states and 362 transitions. [2022-07-13 02:10:59,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 02:10:59,400 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 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 80 [2022-07-13 02:10:59,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:10:59,402 INFO L225 Difference]: With dead ends: 297 [2022-07-13 02:10:59,402 INFO L226 Difference]: Without dead ends: 296 [2022-07-13 02:10:59,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-07-13 02:10:59,403 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 18 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:10:59,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 141 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:10:59,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-07-13 02:10:59,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 288. [2022-07-13 02:10:59,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 226 states have (on average 1.084070796460177) internal successors, (245), 228 states have internal predecessors, (245), 37 states have call successors, (37), 12 states have call predecessors, (37), 23 states have return successors, (68), 47 states have call predecessors, (68), 36 states have call successors, (68) [2022-07-13 02:10:59,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 350 transitions. [2022-07-13 02:10:59,415 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 350 transitions. Word has length 80 [2022-07-13 02:10:59,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:10:59,416 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 350 transitions. [2022-07-13 02:10:59,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 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) [2022-07-13 02:10:59,416 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 350 transitions. [2022-07-13 02:10:59,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-13 02:10:59,417 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:10:59,417 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] [2022-07-13 02:10:59,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 02:10:59,630 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 [2022-07-13 02:10:59,630 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-13 02:10:59,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:10:59,631 INFO L85 PathProgramCache]: Analyzing trace with hash -2122545154, now seen corresponding path program 2 times [2022-07-13 02:10:59,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:10:59,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599432299] [2022-07-13 02:10:59,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:10:59,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:10:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:59,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 02:10:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:59,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:10:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:59,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:10:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:59,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 02:10:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:59,690 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2022-07-13 02:10:59,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:10:59,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599432299] [2022-07-13 02:10:59,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599432299] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:10:59,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:10:59,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 02:10:59,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36546779] [2022-07-13 02:10:59,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:10:59,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:10:59,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:10:59,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:10:59,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 02:10:59,692 INFO L87 Difference]: Start difference. First operand 288 states and 350 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 02:10:59,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:10:59,718 INFO L93 Difference]: Finished difference Result 296 states and 361 transitions. [2022-07-13 02:10:59,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 02:10:59,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 81 [2022-07-13 02:10:59,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:10:59,720 INFO L225 Difference]: With dead ends: 296 [2022-07-13 02:10:59,720 INFO L226 Difference]: Without dead ends: 295 [2022-07-13 02:10:59,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 02:10:59,721 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:10:59,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 66 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:10:59,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-07-13 02:10:59,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2022-07-13 02:10:59,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 230 states have (on average 1.0826086956521739) internal successors, (249), 232 states have internal predecessors, (249), 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) [2022-07-13 02:10:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 358 transitions. [2022-07-13 02:10:59,737 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 358 transitions. Word has length 81 [2022-07-13 02:10:59,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:10:59,738 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 358 transitions. [2022-07-13 02:10:59,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 02:10:59,738 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 358 transitions. [2022-07-13 02:10:59,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-13 02:10:59,739 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:10:59,739 INFO L195 NwaCegarLoop]: trace histogram [13, 10, 9, 9, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2022-07-13 02:10:59,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 02:10:59,740 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-13 02:10:59,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:10:59,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1583653005, now seen corresponding path program 3 times [2022-07-13 02:10:59,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:10:59,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909646873] [2022-07-13 02:10:59,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:10:59,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:10:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:59,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 02:10:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:59,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:10:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:59,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:10:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:59,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 02:10:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:59,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:10:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:59,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 02:10:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:10:59,951 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 168 proven. 157 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 02:10:59,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:10:59,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909646873] [2022-07-13 02:10:59,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909646873] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:10:59,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595462354] [2022-07-13 02:10:59,952 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 02:10:59,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:10:59,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:10:59,956 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) [2022-07-13 02:10:59,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 02:10:59,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-13 02:10:59,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:10:59,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 02:10:59,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:11:00,074 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2022-07-13 02:11:00,074 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:11:00,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595462354] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:11:00,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:11:00,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [22] total 25 [2022-07-13 02:11:00,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144077326] [2022-07-13 02:11:00,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:11:00,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 02:11:00,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:11:00,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 02:11:00,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2022-07-13 02:11:00,077 INFO L87 Difference]: Start difference. First operand 293 states and 358 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 02:11:00,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:11:00,136 INFO L93 Difference]: Finished difference Result 462 states and 592 transitions. [2022-07-13 02:11:00,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:11:00,136 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 99 [2022-07-13 02:11:00,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:11:00,138 INFO L225 Difference]: With dead ends: 462 [2022-07-13 02:11:00,138 INFO L226 Difference]: Without dead ends: 190 [2022-07-13 02:11:00,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2022-07-13 02:11:00,141 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:11:00,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 32 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:11:00,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-13 02:11:00,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-07-13 02:11:00,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 150 states have (on average 1.1266666666666667) internal successors, (169), 152 states have internal predecessors, (169), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (27), 25 states have call predecessors, (27), 24 states have call successors, (27) [2022-07-13 02:11:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 221 transitions. [2022-07-13 02:11:00,152 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 221 transitions. Word has length 99 [2022-07-13 02:11:00,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:11:00,153 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 221 transitions. [2022-07-13 02:11:00,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 02:11:00,153 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 221 transitions. [2022-07-13 02:11:00,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-13 02:11:00,154 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:11:00,154 INFO L195 NwaCegarLoop]: trace histogram [13, 11, 9, 9, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2022-07-13 02:11:00,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 02:11:00,377 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,SelfDestructingSolverStorable12 [2022-07-13 02:11:00,378 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-13 02:11:00,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:11:00,378 INFO L85 PathProgramCache]: Analyzing trace with hash -120532817, now seen corresponding path program 4 times [2022-07-13 02:11:00,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:11:00,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646308331] [2022-07-13 02:11:00,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:11:00,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:11:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:00,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 02:11:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:00,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:00,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:00,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 02:11:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:00,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:00,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:00,565 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 161 proven. 161 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-13 02:11:00,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:11:00,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646308331] [2022-07-13 02:11:00,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646308331] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:11:00,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329705898] [2022-07-13 02:11:00,566 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 02:11:00,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:11:00,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:11:00,568 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) [2022-07-13 02:11:00,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 02:11:00,616 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 02:11:00,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:11:00,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-13 02:11:00,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:11:00,727 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 172 proven. 163 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 02:11:00,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:11:00,945 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 172 proven. 164 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 02:11:00,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329705898] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:11:00,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:11:00,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 21] total 25 [2022-07-13 02:11:00,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656821436] [2022-07-13 02:11:00,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:11:00,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-13 02:11:00,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:11:00,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-13 02:11:00,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2022-07-13 02:11:00,947 INFO L87 Difference]: Start difference. First operand 190 states and 221 transitions. Second operand has 25 states, 24 states have (on average 3.625) internal successors, (87), 18 states have internal predecessors, (87), 13 states have call successors, (16), 8 states have call predecessors, (16), 3 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-13 02:11:01,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:11:01,472 INFO L93 Difference]: Finished difference Result 375 states and 442 transitions. [2022-07-13 02:11:01,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-13 02:11:01,473 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.625) internal successors, (87), 18 states have internal predecessors, (87), 13 states have call successors, (16), 8 states have call predecessors, (16), 3 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Word has length 100 [2022-07-13 02:11:01,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:11:01,474 INFO L225 Difference]: With dead ends: 375 [2022-07-13 02:11:01,474 INFO L226 Difference]: Without dead ends: 206 [2022-07-13 02:11:01,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 211 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=673, Invalid=1877, Unknown=0, NotChecked=0, Total=2550 [2022-07-13 02:11:01,476 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 489 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 02:11:01,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 129 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 02:11:01,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-13 02:11:01,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 189. [2022-07-13 02:11:01,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 149 states have (on average 1.1208053691275168) internal successors, (167), 151 states have internal predecessors, (167), 25 states have call successors, (25), 13 states have call predecessors, (25), 13 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2022-07-13 02:11:01,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 218 transitions. [2022-07-13 02:11:01,486 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 218 transitions. Word has length 100 [2022-07-13 02:11:01,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:11:01,487 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 218 transitions. [2022-07-13 02:11:01,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.625) internal successors, (87), 18 states have internal predecessors, (87), 13 states have call successors, (16), 8 states have call predecessors, (16), 3 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-13 02:11:01,487 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 218 transitions. [2022-07-13 02:11:01,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-13 02:11:01,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:11:01,490 INFO L195 NwaCegarLoop]: trace histogram [14, 12, 9, 9, 9, 9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1] [2022-07-13 02:11:01,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 02:11:01,706 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,SelfDestructingSolverStorable13 [2022-07-13 02:11:01,706 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-13 02:11:01,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:11:01,707 INFO L85 PathProgramCache]: Analyzing trace with hash -284873213, now seen corresponding path program 5 times [2022-07-13 02:11:01,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:11:01,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589032169] [2022-07-13 02:11:01,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:11:01,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:11:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:01,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 02:11:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:01,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:01,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:01,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:01,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 02:11:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:01,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 02:11:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:01,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:01,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:01,827 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 38 proven. 23 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2022-07-13 02:11:01,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:11:01,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589032169] [2022-07-13 02:11:01,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589032169] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:11:01,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171277708] [2022-07-13 02:11:01,828 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 02:11:01,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:11:01,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:11:01,830 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) [2022-07-13 02:11:01,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 02:11:01,893 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-07-13 02:11:01,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:11:01,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 02:11:01,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:11:01,964 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 26 proven. 56 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2022-07-13 02:11:01,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:11:02,244 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 26 proven. 58 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2022-07-13 02:11:02,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171277708] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:11:02,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:11:02,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-07-13 02:11:02,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36337819] [2022-07-13 02:11:02,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:11:02,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:11:02,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:11:02,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:11:02,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-07-13 02:11:02,246 INFO L87 Difference]: Start difference. First operand 189 states and 218 transitions. Second operand has 19 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 5 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (15), 12 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-13 02:11:02,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:11:02,317 INFO L93 Difference]: Finished difference Result 189 states and 218 transitions. [2022-07-13 02:11:02,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 02:11:02,318 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 5 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (15), 12 states have call predecessors, (15), 5 states have call successors, (15) Word has length 114 [2022-07-13 02:11:02,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:11:02,319 INFO L225 Difference]: With dead ends: 189 [2022-07-13 02:11:02,319 INFO L226 Difference]: Without dead ends: 187 [2022-07-13 02:11:02,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2022-07-13 02:11:02,321 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:11:02,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 138 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:11:02,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-13 02:11:02,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-07-13 02:11:02,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 148 states have (on average 1.0608108108108107) internal successors, (157), 149 states have internal predecessors, (157), 25 states have call successors, (25), 13 states have call predecessors, (25), 13 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2022-07-13 02:11:02,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 208 transitions. [2022-07-13 02:11:02,331 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 208 transitions. Word has length 114 [2022-07-13 02:11:02,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:11:02,331 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 208 transitions. [2022-07-13 02:11:02,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 5 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (15), 12 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-13 02:11:02,332 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 208 transitions. [2022-07-13 02:11:02,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-13 02:11:02,334 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:11:02,334 INFO L195 NwaCegarLoop]: trace histogram [19, 16, 14, 11, 11, 11, 11, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 3, 1, 1, 1, 1] [2022-07-13 02:11:02,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-13 02:11:02,547 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,SelfDestructingSolverStorable14 [2022-07-13 02:11:02,547 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-13 02:11:02,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:11:02,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1425556519, now seen corresponding path program 4 times [2022-07-13 02:11:02,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:11:02,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746676891] [2022-07-13 02:11:02,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:11:02,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:11:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:02,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 02:11:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:02,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:02,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:02,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:02,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:02,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 02:11:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:02,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 02:11:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:02,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:02,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:02,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 02:11:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:02,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:02,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:02,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:02,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 02:11:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:02,776 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 78 proven. 129 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2022-07-13 02:11:02,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:11:02,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746676891] [2022-07-13 02:11:02,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746676891] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:11:02,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189297238] [2022-07-13 02:11:02,777 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 02:11:02,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:11:02,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:11:02,778 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) [2022-07-13 02:11:02,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 02:11:02,845 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 02:11:02,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:11:02,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-13 02:11:02,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:11:03,045 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 78 proven. 129 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2022-07-13 02:11:03,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:11:03,939 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 144 proven. 122 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2022-07-13 02:11:03,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189297238] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:11:03,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:11:03,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 17] total 26 [2022-07-13 02:11:03,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265750239] [2022-07-13 02:11:03,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:11:03,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-13 02:11:03,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:11:03,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-13 02:11:03,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2022-07-13 02:11:03,941 INFO L87 Difference]: Start difference. First operand 187 states and 208 transitions. Second operand has 27 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 27 states have internal predecessors, (68), 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) [2022-07-13 02:11:04,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:11:04,020 INFO L93 Difference]: Finished difference Result 188 states and 208 transitions. [2022-07-13 02:11:04,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 02:11:04,020 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 27 states have internal predecessors, (68), 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 166 [2022-07-13 02:11:04,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:11:04,021 INFO L225 Difference]: With dead ends: 188 [2022-07-13 02:11:04,021 INFO L226 Difference]: Without dead ends: 187 [2022-07-13 02:11:04,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2022-07-13 02:11:04,022 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 43 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:11:04,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 160 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:11:04,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-13 02:11:04,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-07-13 02:11:04,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 148 states have (on average 1.0337837837837838) internal successors, (153), 149 states have internal predecessors, (153), 25 states have call successors, (25), 13 states have call predecessors, (25), 13 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2022-07-13 02:11:04,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 204 transitions. [2022-07-13 02:11:04,030 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 204 transitions. Word has length 166 [2022-07-13 02:11:04,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:11:04,031 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 204 transitions. [2022-07-13 02:11:04,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 27 states have internal predecessors, (68), 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) [2022-07-13 02:11:04,031 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 204 transitions. [2022-07-13 02:11:04,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2022-07-13 02:11:04,035 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:11:04,036 INFO L195 NwaCegarLoop]: trace histogram [43, 40, 35, 22, 22, 22, 22, 20, 20, 20, 20, 20, 20, 20, 19, 19, 13, 8, 1, 1, 1, 1] [2022-07-13 02:11:04,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 02:11:04,251 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,SelfDestructingSolverStorable15 [2022-07-13 02:11:04,251 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-13 02:11:04,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:11:04,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1446613788, now seen corresponding path program 5 times [2022-07-13 02:11:04,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:11:04,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531450870] [2022-07-13 02:11:04,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:11:04,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:11:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 02:11:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 02:11:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 02:11:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 02:11:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 02:11:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-13 02:11:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 02:11:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 02:11:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-07-13 02:11:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 02:11:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 02:11:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 02:11:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 02:11:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:04,913 INFO L134 CoverageAnalysis]: Checked inductivity of 5965 backedges. 820 proven. 1093 refuted. 0 times theorem prover too weak. 4052 trivial. 0 not checked. [2022-07-13 02:11:04,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:11:04,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531450870] [2022-07-13 02:11:04,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531450870] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:11:04,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699635879] [2022-07-13 02:11:04,914 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 02:11:04,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:11:04,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:11:04,916 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) [2022-07-13 02:11:04,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 02:11:05,100 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2022-07-13 02:11:05,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:11:05,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 81 conjunts are in the unsatisfiable core [2022-07-13 02:11:05,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:11:05,516 INFO L134 CoverageAnalysis]: Checked inductivity of 5965 backedges. 820 proven. 1093 refuted. 0 times theorem prover too weak. 4052 trivial. 0 not checked. [2022-07-13 02:11:05,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:11:10,157 INFO L134 CoverageAnalysis]: Checked inductivity of 5965 backedges. 1149 proven. 996 refuted. 0 times theorem prover too weak. 3820 trivial. 0 not checked. [2022-07-13 02:11:10,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699635879] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:11:10,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:11:10,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 29] total 40 [2022-07-13 02:11:10,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676481435] [2022-07-13 02:11:10,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:11:10,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-13 02:11:10,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:11:10,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-13 02:11:10,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1273, Unknown=0, NotChecked=0, Total=1640 [2022-07-13 02:11:10,160 INFO L87 Difference]: Start difference. First operand 187 states and 204 transitions. Second operand has 41 states, 40 states have (on average 2.55) internal successors, (102), 41 states have internal predecessors, (102), 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) [2022-07-13 02:11:10,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:11:10,253 INFO L93 Difference]: Finished difference Result 188 states and 204 transitions. [2022-07-13 02:11:10,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 02:11:10,253 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.55) internal successors, (102), 41 states have internal predecessors, (102), 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 409 [2022-07-13 02:11:10,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:11:10,255 INFO L225 Difference]: With dead ends: 188 [2022-07-13 02:11:10,255 INFO L226 Difference]: Without dead ends: 187 [2022-07-13 02:11:10,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 978 GetRequests, 938 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=381, Invalid=1341, Unknown=0, NotChecked=0, Total=1722 [2022-07-13 02:11:10,257 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:11:10,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 154 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:11:10,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-13 02:11:10,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-07-13 02:11:10,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 148 states have (on average 1.0135135135135136) internal successors, (150), 149 states have internal predecessors, (150), 25 states have call successors, (25), 13 states have call predecessors, (25), 13 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2022-07-13 02:11:10,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 201 transitions. [2022-07-13 02:11:10,265 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 201 transitions. Word has length 409 [2022-07-13 02:11:10,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:11:10,267 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 201 transitions. [2022-07-13 02:11:10,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.55) internal successors, (102), 41 states have internal predecessors, (102), 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) [2022-07-13 02:11:10,267 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 201 transitions. [2022-07-13 02:11:10,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1065 [2022-07-13 02:11:10,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:11:10,298 INFO L195 NwaCegarLoop]: trace histogram [109, 108, 88, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 53, 53, 34, 21, 1, 1, 1, 1] [2022-07-13 02:11:10,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 02:11:10,522 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,SelfDestructingSolverStorable16 [2022-07-13 02:11:10,523 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-13 02:11:10,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:11:10,524 INFO L85 PathProgramCache]: Analyzing trace with hash -581544090, now seen corresponding path program 6 times [2022-07-13 02:11:10,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:11:10,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182619119] [2022-07-13 02:11:10,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:11:10,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:11:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 02:11:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 02:11:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 02:11:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 02:11:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 02:11:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-13 02:11:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 02:11:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 02:11:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-13 02:11:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 02:11:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 02:11:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 02:11:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 02:11:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 406 [2022-07-13 02:11:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:11,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 02:11:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 02:11:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 02:11:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 02:11:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-13 02:11:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 02:11:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 02:11:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 664 [2022-07-13 02:11:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 02:11:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 02:11:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 02:11:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 02:11:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-13 02:11:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 02:11:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 02:11:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-13 02:11:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 02:11:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 02:11:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:12,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 02:11:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 02:11:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 02:11:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 02:11:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:11:12,569 INFO L134 CoverageAnalysis]: Checked inductivity of 41413 backedges. 6686 proven. 7802 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2022-07-13 02:11:12,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:11:12,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182619119] [2022-07-13 02:11:12,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182619119] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:11:12,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005946192] [2022-07-13 02:11:12,570 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 02:11:12,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:11:12,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:11:12,576 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:11:12,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 02:11:13,103 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 83 check-sat command(s) [2022-07-13 02:11:13,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:11:13,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 1991 conjuncts, 217 conjunts are in the unsatisfiable core [2022-07-13 02:11:13,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:11:14,138 INFO L134 CoverageAnalysis]: Checked inductivity of 41413 backedges. 6686 proven. 7802 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2022-07-13 02:11:14,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:11:38,076 INFO L134 CoverageAnalysis]: Checked inductivity of 41413 backedges. 7863 proven. 7339 refuted. 0 times theorem prover too weak. 26211 trivial. 0 not checked. [2022-07-13 02:11:38,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005946192] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:11:38,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:11:38,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 41] total 54 [2022-07-13 02:11:38,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865385979] [2022-07-13 02:11:38,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:11:38,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-13 02:11:38,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:11:38,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-13 02:11:38,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=642, Invalid=2328, Unknown=0, NotChecked=0, Total=2970 [2022-07-13 02:11:38,081 INFO L87 Difference]: Start difference. First operand 187 states and 201 transitions. Second operand has 55 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 55 states have internal predecessors, (136), 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) [2022-07-13 02:11:38,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:11:38,180 INFO L93 Difference]: Finished difference Result 187 states and 201 transitions. [2022-07-13 02:11:38,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-13 02:11:38,181 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 55 states have internal predecessors, (136), 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 1064 [2022-07-13 02:11:38,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:11:38,183 INFO L225 Difference]: With dead ends: 187 [2022-07-13 02:11:38,183 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 02:11:38,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2559 GetRequests, 2506 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1468 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=642, Invalid=2328, Unknown=0, NotChecked=0, Total=2970 [2022-07-13 02:11:38,185 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 78 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:11:38,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 129 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:11:38,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 02:11:38,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 02:11:38,186 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) [2022-07-13 02:11:38,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 02:11:38,187 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1064 [2022-07-13 02:11:38,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:11:38,187 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 02:11:38,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 55 states have internal predecessors, (136), 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) [2022-07-13 02:11:38,187 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 02:11:38,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 02:11:38,190 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-07-13 02:11:38,190 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-07-13 02:11:38,190 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-07-13 02:11:38,191 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-07-13 02:11:38,191 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-07-13 02:11:38,191 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-07-13 02:11:38,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-13 02:11:38,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 02:11:38,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 02:11:39,043 INFO L899 garLoopResultBuilder]: For program point fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-07-13 02:11:39,044 INFO L899 garLoopResultBuilder]: For program point fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-07-13 02:11:39,044 INFO L899 garLoopResultBuilder]: For program point fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-07-13 02:11:39,044 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 23) no Hoare annotation was computed. [2022-07-13 02:11:39,044 INFO L899 garLoopResultBuilder]: For program point fibonacciEXIT(lines 16 24) no Hoare annotation was computed. [2022-07-13 02:11:39,044 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 23) no Hoare annotation was computed. [2022-07-13 02:11:39,044 INFO L899 garLoopResultBuilder]: For program point fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-07-13 02:11:39,044 INFO L899 garLoopResultBuilder]: For program point fibonacciFINAL(lines 16 24) no Hoare annotation was computed. [2022-07-13 02:11:39,044 INFO L899 garLoopResultBuilder]: For program point fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-07-13 02:11:39,044 INFO L899 garLoopResultBuilder]: For program point fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-07-13 02:11:39,044 INFO L902 garLoopResultBuilder]: At program point fibonacciENTRY(lines 16 24) the Hoare annotation is: true [2022-07-13 02:11:39,044 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-07-13 02:11:39,045 INFO L899 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2022-07-13 02:11:39,045 INFO L895 garLoopResultBuilder]: At program point L22-2(line 22) the Hoare annotation is: (and (or (not (<= |fibonacci_#in~n| 2)) (< 1 fibonacci_~n)) (or (not (<= |fibonacci_#in~n| 9)) (= fibonacci_~n |fibonacci_#in~n|))) [2022-07-13 02:11:39,045 INFO L899 garLoopResultBuilder]: For program point L22-3(line 22) no Hoare annotation was computed. [2022-07-13 02:11:39,045 INFO L899 garLoopResultBuilder]: For program point L22-4(line 22) no Hoare annotation was computed. [2022-07-13 02:11:39,045 INFO L899 garLoopResultBuilder]: For program point L22-5(line 22) no Hoare annotation was computed. [2022-07-13 02:11:39,047 INFO L895 garLoopResultBuilder]: At program point L22-6(line 22) the Hoare annotation is: (let ((.cse0 (<= 2 |fibonacci_#t~ret4|)) (.cse1 (= fibonacci_~n |fibonacci_#in~n|))) (and (or (not (<= 7 |fibonacci_#in~n|)) (not (<= |fibonacci_#in~n| 7)) (and .cse0 (<= |fibonacci_#t~ret4| 8) .cse1)) (or (not (<= |fibonacci_#in~n| 2)) (< 1 fibonacci_~n)) (or (not (<= |fibonacci_#in~n| 5)) (not (<= 5 |fibonacci_#in~n|)) (and .cse0 (<= |fibonacci_#t~ret4| 3) .cse1)) (or (and .cse0 (<= |fibonacci_#t~ret4| 21) .cse1) (not (<= |fibonacci_#in~n| 9)) (not (<= 9 |fibonacci_#in~n|))) (or (and .cse0 (<= |fibonacci_#t~ret4| 2) .cse1) (not (< 3 |fibonacci_#in~n|)) (not (<= |fibonacci_#in~n| 4))) (or (not (<= |fibonacci_#in~n| 8)) (and .cse0 (<= |fibonacci_#t~ret4| 13) .cse1) (not (<= 8 |fibonacci_#in~n|))) (or (not (<= |fibonacci_#in~n| 3)) (and (<= 1 |fibonacci_#t~ret4|) (<= |fibonacci_#t~ret4| 1) .cse1)) (or (and .cse0 (<= |fibonacci_#t~ret4| 5) .cse1) (not (<= |fibonacci_#in~n| 6)) (not (<= 6 |fibonacci_#in~n|))))) [2022-07-13 02:11:39,047 INFO L899 garLoopResultBuilder]: For program point L22-7(line 22) no Hoare annotation was computed. [2022-07-13 02:11:39,047 INFO L899 garLoopResultBuilder]: For program point L22-8(line 22) no Hoare annotation was computed. [2022-07-13 02:11:39,047 INFO L899 garLoopResultBuilder]: For program point L22-9(line 22) no Hoare annotation was computed. [2022-07-13 02:11:39,047 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-07-13 02:11:39,047 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 02:11:39,047 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 02:11:39,048 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 34) no Hoare annotation was computed. [2022-07-13 02:11:39,048 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 02:11:39,048 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (and (<= 9 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 9)) [2022-07-13 02:11:39,048 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 02:11:39,048 INFO L899 garLoopResultBuilder]: For program point L29-1(line 29) no Hoare annotation was computed. [2022-07-13 02:11:39,048 INFO L895 garLoopResultBuilder]: At program point L27(lines 27 35) the Hoare annotation is: (<= |ULTIMATE.start_main_~x~0#1| 9) [2022-07-13 02:11:39,052 INFO L356 BasicCegarLoop]: Path program histogram: [6, 5, 2, 1, 1, 1, 1, 1] [2022-07-13 02:11:39,054 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 02:11:39,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 02:11:39 BoogieIcfgContainer [2022-07-13 02:11:39,071 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 02:11:39,072 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 02:11:39,072 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 02:11:39,072 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 02:11:39,073 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:10:51" (3/4) ... [2022-07-13 02:11:39,077 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 02:11:39,088 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2022-07-13 02:11:39,094 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-13 02:11:39,095 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-13 02:11:39,095 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 02:11:39,095 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 02:11:39,134 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 02:11:39,134 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 02:11:39,135 INFO L158 Benchmark]: Toolchain (without parser) took 47968.45ms. Allocated memory was 100.7MB in the beginning and 281.0MB in the end (delta: 180.4MB). Free memory was 68.4MB in the beginning and 86.9MB in the end (delta: -18.6MB). Peak memory consumption was 160.9MB. Max. memory is 16.1GB. [2022-07-13 02:11:39,136 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 100.7MB. Free memory was 55.4MB in the beginning and 55.3MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 02:11:39,136 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.51ms. Allocated memory is still 100.7MB. Free memory was 68.2MB in the beginning and 75.7MB in the end (delta: -7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 02:11:39,136 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.04ms. Allocated memory is still 100.7MB. Free memory was 75.7MB in the beginning and 74.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 02:11:39,136 INFO L158 Benchmark]: Boogie Preprocessor took 25.76ms. Allocated memory is still 100.7MB. Free memory was 74.4MB in the beginning and 73.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 02:11:39,137 INFO L158 Benchmark]: RCFGBuilder took 196.37ms. Allocated memory is still 100.7MB. Free memory was 73.3MB in the beginning and 64.4MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 02:11:39,137 INFO L158 Benchmark]: TraceAbstraction took 47478.85ms. Allocated memory was 100.7MB in the beginning and 281.0MB in the end (delta: 180.4MB). Free memory was 63.6MB in the beginning and 89.0MB in the end (delta: -25.5MB). Peak memory consumption was 155.6MB. Max. memory is 16.1GB. [2022-07-13 02:11:39,138 INFO L158 Benchmark]: Witness Printer took 62.77ms. Allocated memory is still 281.0MB. Free memory was 89.0MB in the beginning and 86.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 02:11:39,142 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 100.7MB. Free memory was 55.4MB in the beginning and 55.3MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 171.51ms. Allocated memory is still 100.7MB. Free memory was 68.2MB in the beginning and 75.7MB in the end (delta: -7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.04ms. Allocated memory is still 100.7MB. Free memory was 75.7MB in the beginning and 74.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.76ms. Allocated memory is still 100.7MB. Free memory was 74.4MB in the beginning and 73.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 196.37ms. Allocated memory is still 100.7MB. Free memory was 73.3MB in the beginning and 64.4MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 47478.85ms. Allocated memory was 100.7MB in the beginning and 281.0MB in the end (delta: 180.4MB). Free memory was 63.6MB in the beginning and 89.0MB in the end (delta: -25.5MB). Peak memory consumption was 155.6MB. Max. memory is 16.1GB. * Witness Printer took 62.77ms. Allocated memory is still 281.0MB. Free memory was 89.0MB in the beginning and 86.9MB 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: 47.4s, OverallIterations: 18, TraceHistogramMax: 109, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2098 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2042 mSDsluCounter, 2764 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2270 mSDsCounter, 721 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3991 IncrementalHoareTripleChecker+Invalid, 4712 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 721 mSolverCounterUnsat, 494 mSDtfsCounter, 3991 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5642 GetRequests, 5233 SyntacticMatches, 6 SemanticMatches, 403 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4201 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=9, InterpolantAutomatonStates: 265, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 190 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 551 PreInvPairs, 644 NumberOfFragments, 166 HoareAnnotationTreeSize, 551 FomulaSimplifications, 3131 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 1628 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 37.6s InterpolantComputationTime, 4946 NumberOfCodeBlocks, 4797 NumberOfCodeBlocksAsserted, 161 NumberOfCheckSat, 7161 ConstructedInterpolants, 0 QuantifiedInterpolants, 16907 SizeOfPredicates, 41 NumberOfNonLiveVariables, 4422 ConjunctsInSsa, 445 ConjunctsInUnsatCore, 42 InterpolantComputations, 7 PerfectInterpolantSequences, 123900/152393 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: x <= 9 RESULT: Ultimate proved your program to be correct! [2022-07-13 02:11:39,205 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