/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain EqDomain -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 12:13:15,170 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 12:13:15,172 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 12:13:15,210 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 12:13:15,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 12:13:15,214 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 12:13:15,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 12:13:15,217 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 12:13:15,218 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 12:13:15,223 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 12:13:15,224 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 12:13:15,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 12:13:15,227 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 12:13:15,229 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 12:13:15,230 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 12:13:15,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 12:13:15,232 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 12:13:15,232 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 12:13:15,233 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 12:13:15,235 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 12:13:15,236 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 12:13:15,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 12:13:15,237 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 12:13:15,238 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 12:13:15,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 12:13:15,241 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 12:13:15,241 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 12:13:15,242 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 12:13:15,242 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 12:13:15,243 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 12:13:15,243 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 12:13:15,244 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 12:13:15,244 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 12:13:15,245 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 12:13:15,246 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 12:13:15,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 12:13:15,247 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 12:13:15,247 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 12:13:15,247 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 12:13:15,248 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 12:13:15,248 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 12:13:15,251 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-01 12:13:15,281 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 12:13:15,281 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 12:13:15,282 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 12:13:15,282 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 12:13:15,283 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 12:13:15,283 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 12:13:15,283 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 12:13:15,283 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 12:13:15,283 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 12:13:15,283 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 12:13:15,284 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 12:13:15,284 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 12:13:15,284 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 12:13:15,285 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 12:13:15,285 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 12:13:15,285 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 12:13:15,285 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 12:13:15,285 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 12:13:15,286 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 12:13:15,286 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 12:13:15,286 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 12:13:15,286 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 12:13:15,286 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 12:13:15,286 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 12:13:15,286 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 12:13:15,286 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 12:13:15,287 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 12:13:15,287 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 12:13:15,287 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 12:13:15,287 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 12:13:15,287 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 12:13:15,287 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 12:13:15,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 12:13:15,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 12:13:15,288 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 12:13:15,288 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 12:13:15,288 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 12:13:15,288 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 12:13:15,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 12:13:15,288 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 12:13:15,289 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 12:13:15,289 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.sifa: Abstract Domain -> EqDomain [2023-04-01 12:13:15,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 12:13:15,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 12:13:15,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 12:13:15,524 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 12:13:15,525 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 12:13:15,526 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_5-2.c [2023-04-01 12:13:16,658 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 12:13:16,841 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 12:13:16,842 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_5-2.c [2023-04-01 12:13:16,848 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9273cd07/3109858b1bfb4f82a8b344bb3db58b75/FLAG3f39b9022 [2023-04-01 12:13:16,861 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9273cd07/3109858b1bfb4f82a8b344bb3db58b75 [2023-04-01 12:13:16,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 12:13:16,864 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 12:13:16,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 12:13:16,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 12:13:16,869 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 12:13:16,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:13:16" (1/1) ... [2023-04-01 12:13:16,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72eb932a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:13:16, skipping insertion in model container [2023-04-01 12:13:16,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:13:16" (1/1) ... [2023-04-01 12:13:16,878 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 12:13:16,895 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 12:13:17,019 WARN L247 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-simple/fibo_2calls_5-2.c[946,959] [2023-04-01 12:13:17,024 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 12:13:17,035 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 12:13:17,052 WARN L247 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-simple/fibo_2calls_5-2.c[946,959] [2023-04-01 12:13:17,053 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 12:13:17,067 INFO L208 MainTranslator]: Completed translation [2023-04-01 12:13:17,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:13:17 WrapperNode [2023-04-01 12:13:17,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 12:13:17,069 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 12:13:17,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 12:13:17,069 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 12:13:17,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:13:17" (1/1) ... [2023-04-01 12:13:17,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:13:17" (1/1) ... [2023-04-01 12:13:17,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:13:17" (1/1) ... [2023-04-01 12:13:17,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:13:17" (1/1) ... [2023-04-01 12:13:17,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:13:17" (1/1) ... [2023-04-01 12:13:17,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:13:17" (1/1) ... [2023-04-01 12:13:17,091 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:13:17" (1/1) ... [2023-04-01 12:13:17,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:13:17" (1/1) ... [2023-04-01 12:13:17,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 12:13:17,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 12:13:17,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 12:13:17,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 12:13:17,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:13:17" (1/1) ... [2023-04-01 12:13:17,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 12:13:17,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:13:17,130 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-01 12:13:17,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-01 12:13:17,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 12:13:17,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 12:13:17,173 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 12:13:17,174 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2023-04-01 12:13:17,175 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2023-04-01 12:13:17,175 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 12:13:17,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 12:13:17,175 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 12:13:17,175 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 12:13:17,175 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 12:13:17,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 12:13:17,176 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2023-04-01 12:13:17,176 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2023-04-01 12:13:17,176 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 12:13:17,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 12:13:17,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 12:13:17,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 12:13:17,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 12:13:17,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 12:13:17,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 12:13:17,234 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 12:13:17,236 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 12:13:17,350 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 12:13:17,364 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 12:13:17,365 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-04-01 12:13:17,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:13:17 BoogieIcfgContainer [2023-04-01 12:13:17,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 12:13:17,369 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 12:13:17,369 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 12:13:17,372 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 12:13:17,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 12:13:16" (1/3) ... [2023-04-01 12:13:17,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb4c2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:13:17, skipping insertion in model container [2023-04-01 12:13:17,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:13:17" (2/3) ... [2023-04-01 12:13:17,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb4c2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:13:17, skipping insertion in model container [2023-04-01 12:13:17,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:13:17" (3/3) ... [2023-04-01 12:13:17,375 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-2.c [2023-04-01 12:13:17,387 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 12:13:17,388 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 12:13:17,427 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 12:13:17,433 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@31d74f59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 12:13:17,433 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 12:13:17,437 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-01 12:13:17,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-04-01 12:13:17,443 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:13:17,444 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:13:17,444 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:13:17,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:13:17,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1638346757, now seen corresponding path program 1 times [2023-04-01 12:13:17,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:13:17,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021159636] [2023-04-01 12:13:17,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:13:17,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:13:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:13:17,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 12:13:17,793 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:13:17,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021159636] [2023-04-01 12:13:17,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021159636] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 12:13:17,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 12:13:17,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 12:13:17,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726081003] [2023-04-01 12:13:17,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 12:13:17,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 12:13:17,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:13:17,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 12:13:17,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 12:13:17,825 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 12:13:17,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:13:17,894 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2023-04-01 12:13:17,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 12:13:17,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2023-04-01 12:13:17,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:13:17,903 INFO L225 Difference]: With dead ends: 44 [2023-04-01 12:13:17,903 INFO L226 Difference]: Without dead ends: 30 [2023-04-01 12:13:17,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 12:13:17,911 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 12:13:17,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 129 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 12:13:17,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-04-01 12:13:17,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-04-01 12:13:17,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-04-01 12:13:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-04-01 12:13:17,983 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2023-04-01 12:13:17,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:13:17,984 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-04-01 12:13:17,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 12:13:17,985 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-04-01 12:13:17,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-04-01 12:13:17,987 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:13:17,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:13:17,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 12:13:17,989 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:13:17,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:13:17,990 INFO L85 PathProgramCache]: Analyzing trace with hash -40226507, now seen corresponding path program 1 times [2023-04-01 12:13:17,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:13:17,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747008176] [2023-04-01 12:13:17,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:13:17,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:13:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:13:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 12:13:18,103 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:13:18,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747008176] [2023-04-01 12:13:18,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747008176] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 12:13:18,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 12:13:18,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 12:13:18,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923090847] [2023-04-01 12:13:18,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 12:13:18,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 12:13:18,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:13:18,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 12:13:18,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 12:13:18,106 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 12:13:18,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:13:18,150 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2023-04-01 12:13:18,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 12:13:18,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2023-04-01 12:13:18,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:13:18,152 INFO L225 Difference]: With dead ends: 36 [2023-04-01 12:13:18,152 INFO L226 Difference]: Without dead ends: 32 [2023-04-01 12:13:18,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 12:13:18,153 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 12:13:18,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 12:13:18,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-04-01 12:13:18,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2023-04-01 12:13:18,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-04-01 12:13:18,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-04-01 12:13:18,161 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2023-04-01 12:13:18,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:13:18,161 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-04-01 12:13:18,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 12:13:18,162 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-04-01 12:13:18,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-04-01 12:13:18,163 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:13:18,163 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:13:18,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-01 12:13:18,163 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:13:18,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:13:18,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1791010960, now seen corresponding path program 1 times [2023-04-01 12:13:18,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:13:18,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097663599] [2023-04-01 12:13:18,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:13:18,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:13:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:13:18,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 12:13:18,280 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:13:18,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097663599] [2023-04-01 12:13:18,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097663599] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:13:18,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138565552] [2023-04-01 12:13:18,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:13:18,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:13:18,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:13:18,289 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:13:18,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-01 12:13:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:13:18,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 12:13:18,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:13:18,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 12:13:18,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:13:18,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 12:13:18,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138565552] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:13:18,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1888801912] [2023-04-01 12:13:18,766 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-04-01 12:13:18,767 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:13:18,780 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 12:13:18,784 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 12:13:18,785 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 12:13:18,948 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 43 for LOIs [2023-04-01 12:13:19,208 INFO L197 IcfgInterpreter]: Interpreting procedure fibo1 with input of size 46 for LOIs [2023-04-01 12:13:19,278 INFO L197 IcfgInterpreter]: Interpreting procedure fibo2 with input of size 46 for LOIs [2023-04-01 12:13:19,289 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 12:13:19,295 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 12:13:20,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1888801912] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 12:13:20,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:13:20,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6, 7, 7] total 22 [2023-04-01 12:13:20,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43721288] [2023-04-01 12:13:20,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 12:13:20,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-01 12:13:20,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:13:20,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-01 12:13:20,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2023-04-01 12:13:20,034 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 12 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-01 12:13:20,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:13:20,627 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2023-04-01 12:13:20,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-01 12:13:20,628 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 26 [2023-04-01 12:13:20,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:13:20,634 INFO L225 Difference]: With dead ends: 72 [2023-04-01 12:13:20,634 INFO L226 Difference]: Without dead ends: 48 [2023-04-01 12:13:20,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2023-04-01 12:13:20,639 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 77 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 12:13:20,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 5 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 12:13:20,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-04-01 12:13:20,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2023-04-01 12:13:20,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-04-01 12:13:20,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2023-04-01 12:13:20,666 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26 [2023-04-01 12:13:20,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:13:20,667 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2023-04-01 12:13:20,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-01 12:13:20,668 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2023-04-01 12:13:20,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-04-01 12:13:20,670 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:13:20,670 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:13:20,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-01 12:13:20,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:13:20,877 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:13:20,878 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:13:20,878 INFO L85 PathProgramCache]: Analyzing trace with hash 997297373, now seen corresponding path program 1 times [2023-04-01 12:13:20,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:13:20,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036160183] [2023-04-01 12:13:20,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:13:20,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:13:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:13:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 12:13:20,966 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:13:20,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036160183] [2023-04-01 12:13:20,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036160183] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:13:20,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76006974] [2023-04-01 12:13:20,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:13:20,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:13:20,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:13:20,974 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:13:20,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-01 12:13:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:13:21,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 12:13:21,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:13:21,100 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 12:13:21,100 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:13:21,395 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 12:13:21,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76006974] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:13:21,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [920945836] [2023-04-01 12:13:21,398 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 12:13:21,398 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:13:21,399 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:13:21,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:13:21,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 14 [2023-04-01 12:13:21,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686357678] [2023-04-01 12:13:21,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:13:21,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-01 12:13:21,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:13:21,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-01 12:13:21,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-04-01 12:13:21,404 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 14 states, 11 states have (on average 4.090909090909091) internal successors, (45), 14 states have internal predecessors, (45), 11 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 11 states have call successors, (14) [2023-04-01 12:13:21,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:13:21,610 INFO L93 Difference]: Finished difference Result 89 states and 125 transitions. [2023-04-01 12:13:21,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 12:13:21,612 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 4.090909090909091) internal successors, (45), 14 states have internal predecessors, (45), 11 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 11 states have call successors, (14) Word has length 39 [2023-04-01 12:13:21,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:13:21,613 INFO L225 Difference]: With dead ends: 89 [2023-04-01 12:13:21,614 INFO L226 Difference]: Without dead ends: 57 [2023-04-01 12:13:21,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2023-04-01 12:13:21,615 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 34 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 12:13:21,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 143 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 12:13:21,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-04-01 12:13:21,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2023-04-01 12:13:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-04-01 12:13:21,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2023-04-01 12:13:21,627 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 39 [2023-04-01 12:13:21,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:13:21,627 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2023-04-01 12:13:21,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 4.090909090909091) internal successors, (45), 14 states have internal predecessors, (45), 11 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 11 states have call successors, (14) [2023-04-01 12:13:21,628 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2023-04-01 12:13:21,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-04-01 12:13:21,629 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:13:21,629 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:13:21,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-01 12:13:21,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-04-01 12:13:21,840 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:13:21,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:13:21,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1525437707, now seen corresponding path program 1 times [2023-04-01 12:13:21,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:13:21,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591750066] [2023-04-01 12:13:21,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:13:21,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:13:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:13:21,956 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-01 12:13:21,956 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:13:21,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591750066] [2023-04-01 12:13:21,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591750066] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:13:21,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130288796] [2023-04-01 12:13:21,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:13:21,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:13:21,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:13:21,958 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:13:21,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-01 12:13:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:13:22,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 12:13:22,017 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:13:22,093 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 12:13:22,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:13:22,368 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 12:13:22,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130288796] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:13:22,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [477894235] [2023-04-01 12:13:22,372 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 12:13:22,372 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:13:22,372 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:13:22,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:13:22,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2023-04-01 12:13:22,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246592320] [2023-04-01 12:13:22,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:13:22,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-01 12:13:22,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:13:22,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-01 12:13:22,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2023-04-01 12:13:22,378 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (14), 7 states have call predecessors, (14), 11 states have call successors, (14) [2023-04-01 12:13:22,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:13:22,767 INFO L93 Difference]: Finished difference Result 125 states and 207 transitions. [2023-04-01 12:13:22,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-01 12:13:22,768 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (14), 7 states have call predecessors, (14), 11 states have call successors, (14) Word has length 40 [2023-04-01 12:13:22,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:13:22,772 INFO L225 Difference]: With dead ends: 125 [2023-04-01 12:13:22,772 INFO L226 Difference]: Without dead ends: 81 [2023-04-01 12:13:22,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2023-04-01 12:13:22,777 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 51 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 12:13:22,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 247 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 12:13:22,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-04-01 12:13:22,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2023-04-01 12:13:22,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.146341463414634) internal successors, (47), 44 states have internal predecessors, (47), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (32), 15 states have call predecessors, (32), 15 states have call successors, (32) [2023-04-01 12:13:22,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 95 transitions. [2023-04-01 12:13:22,808 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 95 transitions. Word has length 40 [2023-04-01 12:13:22,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:13:22,809 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 95 transitions. [2023-04-01 12:13:22,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (14), 7 states have call predecessors, (14), 11 states have call successors, (14) [2023-04-01 12:13:22,809 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 95 transitions. [2023-04-01 12:13:22,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-04-01 12:13:22,816 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:13:22,816 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:13:22,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-01 12:13:23,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:13:23,022 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:13:23,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:13:23,023 INFO L85 PathProgramCache]: Analyzing trace with hash -684158310, now seen corresponding path program 1 times [2023-04-01 12:13:23,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:13:23,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571883703] [2023-04-01 12:13:23,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:13:23,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:13:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:13:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-04-01 12:13:23,170 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:13:23,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571883703] [2023-04-01 12:13:23,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571883703] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:13:23,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865686401] [2023-04-01 12:13:23,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:13:23,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:13:23,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:13:23,172 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:13:23,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-01 12:13:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:13:23,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-01 12:13:23,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:13:23,302 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-04-01 12:13:23,302 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:13:23,812 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 12:13:23,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865686401] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:13:23,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1071110071] [2023-04-01 12:13:23,814 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 12:13:23,814 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:13:23,815 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:13:23,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:13:23,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 16 [2023-04-01 12:13:23,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279049000] [2023-04-01 12:13:23,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:13:23,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-04-01 12:13:23,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:13:23,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-04-01 12:13:23,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-04-01 12:13:23,817 INFO L87 Difference]: Start difference. First operand 67 states and 95 transitions. Second operand has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 11 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (18), 8 states have call predecessors, (18), 11 states have call successors, (18) [2023-04-01 12:13:24,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:13:24,002 INFO L93 Difference]: Finished difference Result 123 states and 207 transitions. [2023-04-01 12:13:24,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-01 12:13:24,003 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 11 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (18), 8 states have call predecessors, (18), 11 states have call successors, (18) Word has length 54 [2023-04-01 12:13:24,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:13:24,004 INFO L225 Difference]: With dead ends: 123 [2023-04-01 12:13:24,005 INFO L226 Difference]: Without dead ends: 101 [2023-04-01 12:13:24,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 100 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2023-04-01 12:13:24,006 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 46 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 12:13:24,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 117 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 12:13:24,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-04-01 12:13:24,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 76. [2023-04-01 12:13:24,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.127659574468085) internal successors, (53), 50 states have internal predecessors, (53), 16 states have call successors, (16), 7 states have call predecessors, (16), 12 states have return successors, (40), 18 states have call predecessors, (40), 15 states have call successors, (40) [2023-04-01 12:13:24,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 109 transitions. [2023-04-01 12:13:24,023 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 109 transitions. Word has length 54 [2023-04-01 12:13:24,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:13:24,023 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 109 transitions. [2023-04-01 12:13:24,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 11 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (18), 8 states have call predecessors, (18), 11 states have call successors, (18) [2023-04-01 12:13:24,024 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 109 transitions. [2023-04-01 12:13:24,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-04-01 12:13:24,025 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:13:24,025 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:13:24,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-01 12:13:24,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:13:24,232 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:13:24,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:13:24,232 INFO L85 PathProgramCache]: Analyzing trace with hash 987730618, now seen corresponding path program 1 times [2023-04-01 12:13:24,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:13:24,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012359736] [2023-04-01 12:13:24,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:13:24,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:13:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:13:24,334 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 31 proven. 33 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-04-01 12:13:24,334 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:13:24,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012359736] [2023-04-01 12:13:24,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012359736] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:13:24,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540992340] [2023-04-01 12:13:24,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:13:24,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:13:24,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:13:24,336 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:13:24,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-01 12:13:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:13:24,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 12:13:24,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:13:24,456 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 31 proven. 33 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-04-01 12:13:24,456 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:13:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 31 proven. 35 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-04-01 12:13:24,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540992340] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:13:24,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [281503857] [2023-04-01 12:13:24,741 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 12:13:24,742 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:13:24,742 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:13:24,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:13:24,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 11 [2023-04-01 12:13:24,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765521729] [2023-04-01 12:13:24,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:13:24,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-01 12:13:24,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:13:24,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-01 12:13:24,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-04-01 12:13:24,744 INFO L87 Difference]: Start difference. First operand 76 states and 109 transitions. Second operand has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 7 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2023-04-01 12:13:24,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:13:24,841 INFO L93 Difference]: Finished difference Result 105 states and 164 transitions. [2023-04-01 12:13:24,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 12:13:24,842 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 7 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) Word has length 83 [2023-04-01 12:13:24,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:13:24,843 INFO L225 Difference]: With dead ends: 105 [2023-04-01 12:13:24,843 INFO L226 Difference]: Without dead ends: 93 [2023-04-01 12:13:24,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 162 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-04-01 12:13:24,844 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 23 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 12:13:24,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 95 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 12:13:24,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-04-01 12:13:24,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78. [2023-04-01 12:13:24,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 48 states have (on average 1.125) internal successors, (54), 52 states have internal predecessors, (54), 16 states have call successors, (16), 7 states have call predecessors, (16), 13 states have return successors, (43), 18 states have call predecessors, (43), 15 states have call successors, (43) [2023-04-01 12:13:24,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 113 transitions. [2023-04-01 12:13:24,861 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 113 transitions. Word has length 83 [2023-04-01 12:13:24,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:13:24,861 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 113 transitions. [2023-04-01 12:13:24,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 7 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2023-04-01 12:13:24,862 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2023-04-01 12:13:24,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-04-01 12:13:24,863 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:13:24,863 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:13:24,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-01 12:13:25,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:13:25,069 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:13:25,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:13:25,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2105971379, now seen corresponding path program 1 times [2023-04-01 12:13:25,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:13:25,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411619487] [2023-04-01 12:13:25,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:13:25,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:13:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:13:25,305 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 69 proven. 74 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2023-04-01 12:13:25,305 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:13:25,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411619487] [2023-04-01 12:13:25,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411619487] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:13:25,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000158825] [2023-04-01 12:13:25,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:13:25,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:13:25,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:13:25,307 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:13:25,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-01 12:13:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:13:25,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-01 12:13:25,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:13:25,466 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 77 proven. 83 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2023-04-01 12:13:25,467 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:13:26,231 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 77 proven. 91 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2023-04-01 12:13:26,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000158825] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:13:26,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1382759143] [2023-04-01 12:13:26,234 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 12:13:26,235 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:13:26,235 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:13:26,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:13:26,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 13] total 18 [2023-04-01 12:13:26,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797867744] [2023-04-01 12:13:26,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:13:26,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-01 12:13:26,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:13:26,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-01 12:13:26,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2023-04-01 12:13:26,240 INFO L87 Difference]: Start difference. First operand 78 states and 113 transitions. Second operand has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 18 states have internal predecessors, (61), 12 states have call successors, (20), 1 states have call predecessors, (20), 6 states have return successors, (21), 9 states have call predecessors, (21), 12 states have call successors, (21) [2023-04-01 12:13:26,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:13:26,492 INFO L93 Difference]: Finished difference Result 128 states and 223 transitions. [2023-04-01 12:13:26,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-01 12:13:26,492 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 18 states have internal predecessors, (61), 12 states have call successors, (20), 1 states have call predecessors, (20), 6 states have return successors, (21), 9 states have call predecessors, (21), 12 states have call successors, (21) Word has length 123 [2023-04-01 12:13:26,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:13:26,494 INFO L225 Difference]: With dead ends: 128 [2023-04-01 12:13:26,494 INFO L226 Difference]: Without dead ends: 81 [2023-04-01 12:13:26,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 236 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2023-04-01 12:13:26,495 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 38 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 12:13:26,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 200 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 12:13:26,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-04-01 12:13:26,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-04-01 12:13:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 54 states have internal predecessors, (57), 15 states have call successors, (15), 8 states have call predecessors, (15), 14 states have return successors, (37), 18 states have call predecessors, (37), 14 states have call successors, (37) [2023-04-01 12:13:26,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 109 transitions. [2023-04-01 12:13:26,509 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 109 transitions. Word has length 123 [2023-04-01 12:13:26,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:13:26,510 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 109 transitions. [2023-04-01 12:13:26,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 18 states have internal predecessors, (61), 12 states have call successors, (20), 1 states have call predecessors, (20), 6 states have return successors, (21), 9 states have call predecessors, (21), 12 states have call successors, (21) [2023-04-01 12:13:26,510 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 109 transitions. [2023-04-01 12:13:26,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-04-01 12:13:26,511 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:13:26,511 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:13:26,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-01 12:13:26,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:13:26,720 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:13:26,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:13:26,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1815494258, now seen corresponding path program 2 times [2023-04-01 12:13:26,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:13:26,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928861872] [2023-04-01 12:13:26,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:13:26,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:13:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:13:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 44 proven. 31 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2023-04-01 12:13:26,816 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:13:26,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928861872] [2023-04-01 12:13:26,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928861872] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:13:26,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302897140] [2023-04-01 12:13:26,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 12:13:26,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:13:26,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:13:26,818 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:13:26,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-01 12:13:26,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-04-01 12:13:26,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 12:13:26,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-01 12:13:26,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:13:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 44 proven. 65 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2023-04-01 12:13:26,988 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:13:27,492 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 44 proven. 69 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-04-01 12:13:27,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302897140] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:13:27,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1107481652] [2023-04-01 12:13:27,495 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 12:13:27,495 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:13:27,496 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:13:27,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:13:27,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 11] total 15 [2023-04-01 12:13:27,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284164036] [2023-04-01 12:13:27,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:13:27,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-04-01 12:13:27,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:13:27,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-04-01 12:13:27,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-04-01 12:13:27,502 INFO L87 Difference]: Start difference. First operand 81 states and 109 transitions. Second operand has 15 states, 13 states have (on average 4.461538461538462) internal successors, (58), 15 states have internal predecessors, (58), 11 states have call successors, (19), 1 states have call predecessors, (19), 6 states have return successors, (21), 7 states have call predecessors, (21), 11 states have call successors, (21) [2023-04-01 12:13:27,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:13:27,693 INFO L93 Difference]: Finished difference Result 156 states and 235 transitions. [2023-04-01 12:13:27,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-01 12:13:27,693 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.461538461538462) internal successors, (58), 15 states have internal predecessors, (58), 11 states have call successors, (19), 1 states have call predecessors, (19), 6 states have return successors, (21), 7 states have call predecessors, (21), 11 states have call successors, (21) Word has length 108 [2023-04-01 12:13:27,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:13:27,695 INFO L225 Difference]: With dead ends: 156 [2023-04-01 12:13:27,695 INFO L226 Difference]: Without dead ends: 86 [2023-04-01 12:13:27,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 204 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2023-04-01 12:13:27,699 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 35 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 12:13:27,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 127 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 12:13:27,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-04-01 12:13:27,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2023-04-01 12:13:27,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 15 states have call successors, (15), 8 states have call predecessors, (15), 13 states have return successors, (28), 17 states have call predecessors, (28), 14 states have call successors, (28) [2023-04-01 12:13:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 98 transitions. [2023-04-01 12:13:27,723 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 98 transitions. Word has length 108 [2023-04-01 12:13:27,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:13:27,724 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 98 transitions. [2023-04-01 12:13:27,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.461538461538462) internal successors, (58), 15 states have internal predecessors, (58), 11 states have call successors, (19), 1 states have call predecessors, (19), 6 states have return successors, (21), 7 states have call predecessors, (21), 11 states have call successors, (21) [2023-04-01 12:13:27,724 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 98 transitions. [2023-04-01 12:13:27,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-04-01 12:13:27,726 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:13:27,727 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:13:27,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-04-01 12:13:27,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:13:27,933 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:13:27,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:13:27,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1451311024, now seen corresponding path program 3 times [2023-04-01 12:13:27,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:13:27,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543978907] [2023-04-01 12:13:27,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:13:27,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:13:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 12:13:27,956 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-01 12:13:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 12:13:28,022 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-04-01 12:13:28,022 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-01 12:13:28,023 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-01 12:13:28,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-04-01 12:13:28,028 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:13:28,032 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-01 12:13:28,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.04 12:13:28 BoogieIcfgContainer [2023-04-01 12:13:28,083 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-01 12:13:28,083 INFO L158 Benchmark]: Toolchain (without parser) took 11219.03ms. Allocated memory was 223.3MB in the beginning and 324.0MB in the end (delta: 100.7MB). Free memory was 175.4MB in the beginning and 176.3MB in the end (delta: -908.9kB). Peak memory consumption was 100.8MB. Max. memory is 8.0GB. [2023-04-01 12:13:28,084 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 223.3MB. Free memory was 194.4MB in the beginning and 194.4MB in the end (delta: 13.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-04-01 12:13:28,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.54ms. Allocated memory is still 223.3MB. Free memory was 175.4MB in the beginning and 165.5MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-04-01 12:13:28,084 INFO L158 Benchmark]: Boogie Preprocessor took 25.00ms. Allocated memory is still 223.3MB. Free memory was 165.5MB in the beginning and 163.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-04-01 12:13:28,085 INFO L158 Benchmark]: RCFGBuilder took 272.39ms. Allocated memory is still 223.3MB. Free memory was 163.9MB in the beginning and 152.3MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-04-01 12:13:28,085 INFO L158 Benchmark]: TraceAbstraction took 10713.73ms. Allocated memory was 223.3MB in the beginning and 324.0MB in the end (delta: 100.7MB). Free memory was 151.8MB in the beginning and 176.3MB in the end (delta: -24.5MB). Peak memory consumption was 77.7MB. Max. memory is 8.0GB. [2023-04-01 12:13:28,087 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.12ms. Allocated memory is still 223.3MB. Free memory was 194.4MB in the beginning and 194.4MB in the end (delta: 13.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 202.54ms. Allocated memory is still 223.3MB. Free memory was 175.4MB in the beginning and 165.5MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.00ms. Allocated memory is still 223.3MB. Free memory was 165.5MB in the beginning and 163.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 272.39ms. Allocated memory is still 223.3MB. Free memory was 163.9MB in the beginning and 152.3MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 10713.73ms. Allocated memory was 223.3MB in the beginning and 324.0MB in the end (delta: 100.7MB). Free memory was 151.8MB in the beginning and 176.3MB in the end (delta: -24.5MB). Peak memory consumption was 77.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 5; VAL [x=5] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [fibo1(x)=5, x=5] [L39] int result = fibo1(x); [L40] COND TRUE result == 5 VAL [result=5, x=5] [L41] reach_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.6s, OverallIterations: 10, TraceHistogramMax: 9, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 340 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 306 mSDsluCounter, 1195 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 975 mSDsCounter, 214 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1558 IncrementalHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 214 mSolverCounterUnsat, 220 mSDtfsCounter, 1558 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1096 GetRequests, 917 SyntacticMatches, 28 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=8, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 75 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1082 NumberOfCodeBlocks, 1075 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1423 ConstructedInterpolants, 0 QuantifiedInterpolants, 2631 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1245 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 1854/2487 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: OVERALL_TIME: 0.5s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 5, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 21, DAG_INTERPRETER_EARLY_EXITS: 4, TOOLS_POST_APPLICATIONS: 19, TOOLS_POST_TIME: 0.1s, TOOLS_POST_CALL_APPLICATIONS: 14, TOOLS_POST_CALL_TIME: 0.1s, TOOLS_POST_RETURN_APPLICATIONS: 10, TOOLS_POST_RETURN_TIME: 0.1s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 43, TOOLS_QUANTIFIERELIM_TIME: 0.3s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.0s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 58, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 6, DOMAIN_JOIN_TIME: 0.1s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 21, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 10, CALL_SUMMARIZER_CACHE_MISSES: 3, CALL_SUMMARIZER_OVERALL_TIME: 0.1s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 165, DAG_COMPRESSION_RETAINED_NODES: 71, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-04-01 12:13:28,119 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...