/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 IntervalDomain -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_20-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 00:02:26,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 00:02:26,570 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 00:02:26,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 00:02:26,608 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 00:02:26,609 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 00:02:26,610 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 00:02:26,611 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 00:02:26,613 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 00:02:26,613 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 00:02:26,614 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 00:02:26,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 00:02:26,615 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 00:02:26,616 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 00:02:26,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 00:02:26,617 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 00:02:26,617 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 00:02:26,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 00:02:26,619 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 00:02:26,649 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 00:02:26,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 00:02:26,652 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 00:02:26,653 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 00:02:26,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 00:02:26,656 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 00:02:26,656 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 00:02:26,656 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 00:02:26,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 00:02:26,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 00:02:26,658 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 00:02:26,658 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 00:02:26,659 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 00:02:26,659 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 00:02:26,660 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 00:02:26,661 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 00:02:26,661 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 00:02:26,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 00:02:26,662 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 00:02:26,662 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 00:02:26,663 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 00:02:26,663 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 00:02:26,664 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 00:02:26,695 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 00:02:26,695 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 00:02:26,695 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 00:02:26,696 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 00:02:26,696 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 00:02:26,696 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 00:02:26,696 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 00:02:26,697 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 00:02:26,697 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 00:02:26,697 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 00:02:26,697 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 00:02:26,697 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 00:02:26,697 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 00:02:26,697 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 00:02:26,697 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 00:02:26,698 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 00:02:26,698 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 00:02:26,698 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 00:02:26,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 00:02:26,698 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 00:02:26,699 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 00:02:26,699 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 00:02:26,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 00:02:26,699 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 00:02:26,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 00:02:26,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 00:02:26,699 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 00:02:26,699 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 00:02:26,700 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 00:02:26,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 00:02:26,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 00:02:26,700 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 00:02:26,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 00:02:26,700 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 00:02:26,700 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 00:02:26,700 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 00:02:26,701 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 00:02:26,701 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 00:02:26,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 00:02:26,701 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 00:02:26,701 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 00:02:26,701 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 -> IntervalDomain [2023-04-01 00:02:26,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 00:02:26,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 00:02:26,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 00:02:26,964 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 00:02:26,965 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 00:02:26,967 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_20-1.c [2023-04-01 00:02:28,289 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 00:02:28,498 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 00:02:28,498 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_20-1.c [2023-04-01 00:02:28,503 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/701bb2a5d/4acc0b1951eb4c8b8eccbf4cab0bc617/FLAG968115c5b [2023-04-01 00:02:28,517 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/701bb2a5d/4acc0b1951eb4c8b8eccbf4cab0bc617 [2023-04-01 00:02:28,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 00:02:28,522 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 00:02:28,524 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 00:02:28,524 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 00:02:28,531 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 00:02:28,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:02:28" (1/1) ... [2023-04-01 00:02:28,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b90563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:28, skipping insertion in model container [2023-04-01 00:02:28,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:02:28" (1/1) ... [2023-04-01 00:02:28,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 00:02:28,548 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 00:02:28,660 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_20-1.c[951,964] [2023-04-01 00:02:28,664 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 00:02:28,671 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 00:02:28,682 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_20-1.c[951,964] [2023-04-01 00:02:28,683 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 00:02:28,693 INFO L208 MainTranslator]: Completed translation [2023-04-01 00:02:28,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:28 WrapperNode [2023-04-01 00:02:28,693 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 00:02:28,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 00:02:28,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 00:02:28,695 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 00:02:28,702 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:28" (1/1) ... [2023-04-01 00:02:28,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:28" (1/1) ... [2023-04-01 00:02:28,706 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:28" (1/1) ... [2023-04-01 00:02:28,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:28" (1/1) ... [2023-04-01 00:02:28,710 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:28" (1/1) ... [2023-04-01 00:02:28,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:28" (1/1) ... [2023-04-01 00:02:28,712 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:28" (1/1) ... [2023-04-01 00:02:28,712 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:28" (1/1) ... [2023-04-01 00:02:28,713 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 00:02:28,714 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 00:02:28,714 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 00:02:28,714 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 00:02:28,715 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:28" (1/1) ... [2023-04-01 00:02:28,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 00:02:28,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:28,744 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 00:02:28,751 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 00:02:28,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 00:02:28,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 00:02:28,781 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 00:02:28,782 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2023-04-01 00:02:28,782 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2023-04-01 00:02:28,782 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 00:02:28,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 00:02:28,782 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 00:02:28,782 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 00:02:28,782 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 00:02:28,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 00:02:28,782 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2023-04-01 00:02:28,782 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2023-04-01 00:02:28,782 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 00:02:28,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 00:02:28,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 00:02:28,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 00:02:28,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 00:02:28,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 00:02:28,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 00:02:28,854 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 00:02:28,856 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 00:02:28,960 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 00:02:28,979 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 00:02:28,980 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-04-01 00:02:28,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:02:28 BoogieIcfgContainer [2023-04-01 00:02:28,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 00:02:28,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 00:02:28,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 00:02:28,989 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 00:02:28,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 12:02:28" (1/3) ... [2023-04-01 00:02:28,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446b83cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:02:28, skipping insertion in model container [2023-04-01 00:02:28,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:28" (2/3) ... [2023-04-01 00:02:28,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446b83cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:02:28, skipping insertion in model container [2023-04-01 00:02:28,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:02:28" (3/3) ... [2023-04-01 00:02:28,992 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_20-1.c [2023-04-01 00:02:29,010 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 00:02:29,011 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 00:02:29,054 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 00:02:29,060 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;@2688bb21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 00:02:29,060 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 00:02:29,064 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 00:02:29,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-04-01 00:02:29,071 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:29,072 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:29,073 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:29,078 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:29,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1638346757, now seen corresponding path program 1 times [2023-04-01 00:02:29,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:29,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193422552] [2023-04-01 00:02:29,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:29,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:29,376 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 00:02:29,376 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:29,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193422552] [2023-04-01 00:02:29,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193422552] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:02:29,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:02:29,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 00:02:29,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846060321] [2023-04-01 00:02:29,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:02:29,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 00:02:29,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:29,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 00:02:29,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 00:02:29,409 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 00:02:29,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:29,499 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2023-04-01 00:02:29,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 00:02:29,503 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 00:02:29,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:29,516 INFO L225 Difference]: With dead ends: 44 [2023-04-01 00:02:29,516 INFO L226 Difference]: Without dead ends: 30 [2023-04-01 00:02:29,520 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 00:02:29,526 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 00:02:29,527 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 00:02:29,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-04-01 00:02:29,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-04-01 00:02:29,569 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 00:02:29,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-04-01 00:02:29,572 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2023-04-01 00:02:29,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:29,573 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-04-01 00:02:29,574 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 00:02:29,574 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-04-01 00:02:29,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-04-01 00:02:29,577 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:29,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:29,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 00:02:29,577 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:29,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:29,582 INFO L85 PathProgramCache]: Analyzing trace with hash -40226507, now seen corresponding path program 1 times [2023-04-01 00:02:29,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:29,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528481329] [2023-04-01 00:02:29,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:29,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:29,660 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 00:02:29,660 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:29,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528481329] [2023-04-01 00:02:29,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528481329] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:02:29,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:02:29,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 00:02:29,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637256267] [2023-04-01 00:02:29,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:02:29,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 00:02:29,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:29,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 00:02:29,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 00:02:29,664 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 00:02:29,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:29,696 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2023-04-01 00:02:29,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 00:02:29,697 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 00:02:29,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:29,699 INFO L225 Difference]: With dead ends: 36 [2023-04-01 00:02:29,700 INFO L226 Difference]: Without dead ends: 32 [2023-04-01 00:02:29,704 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 00:02:29,706 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 00:02:29,706 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 00:02:29,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-04-01 00:02:29,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2023-04-01 00:02:29,715 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 00:02:29,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-04-01 00:02:29,716 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2023-04-01 00:02:29,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:29,717 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-04-01 00:02:29,717 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 00:02:29,717 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-04-01 00:02:29,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-04-01 00:02:29,718 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:29,718 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 00:02:29,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-01 00:02:29,719 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:29,719 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:29,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1791010960, now seen corresponding path program 1 times [2023-04-01 00:02:29,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:29,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794014633] [2023-04-01 00:02:29,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:29,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:29,813 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 00:02:29,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:29,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794014633] [2023-04-01 00:02:29,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794014633] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:29,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202698788] [2023-04-01 00:02:29,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:29,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:29,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:29,821 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 00:02:29,857 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 00:02:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:29,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 00:02:29,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:30,037 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 00:02:30,037 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:30,240 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 00:02:30,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202698788] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:30,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [506949400] [2023-04-01 00:02:30,276 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-04-01 00:02:30,276 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:30,282 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 00:02:30,295 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 00:02:30,295 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 00:02:30,366 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 8 for LOIs [2023-04-01 00:02:30,425 INFO L197 IcfgInterpreter]: Interpreting procedure fibo1 with input of size 11 for LOIs [2023-04-01 00:02:30,442 INFO L197 IcfgInterpreter]: Interpreting procedure fibo2 with input of size 11 for LOIs [2023-04-01 00:02:30,445 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 00:02:30,451 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 00:02:30,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [506949400] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:02:30,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:30,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6, 7, 7] total 20 [2023-04-01 00:02:30,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264954851] [2023-04-01 00:02:30,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:02:30,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-01 00:02:30,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:30,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-01 00:02:30,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2023-04-01 00:02:30,627 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 10 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-01 00:02:31,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:31,208 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2023-04-01 00:02:31,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-01 00:02:31,209 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 26 [2023-04-01 00:02:31,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:31,210 INFO L225 Difference]: With dead ends: 72 [2023-04-01 00:02:31,210 INFO L226 Difference]: Without dead ends: 48 [2023-04-01 00:02:31,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2023-04-01 00:02:31,211 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 77 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:31,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 5 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:02:31,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-04-01 00:02:31,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2023-04-01 00:02:31,235 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 00:02:31,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2023-04-01 00:02:31,242 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26 [2023-04-01 00:02:31,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:31,242 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2023-04-01 00:02:31,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-01 00:02:31,243 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2023-04-01 00:02:31,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-04-01 00:02:31,245 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:31,245 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 00:02:31,260 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 00:02:31,450 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 00:02:31,450 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:31,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:31,451 INFO L85 PathProgramCache]: Analyzing trace with hash 997297373, now seen corresponding path program 1 times [2023-04-01 00:02:31,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:31,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438699678] [2023-04-01 00:02:31,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:31,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:31,520 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 00:02:31,520 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:31,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438699678] [2023-04-01 00:02:31,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438699678] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:31,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443568907] [2023-04-01 00:02:31,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:31,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:31,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:31,525 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 00:02:31,544 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 00:02:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:31,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 00:02:31,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:31,648 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 00:02:31,648 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:31,912 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 00:02:31,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443568907] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:31,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1768551855] [2023-04-01 00:02:31,915 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:31,915 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:31,916 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 00:02:31,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:31,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 14 [2023-04-01 00:02:31,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331494639] [2023-04-01 00:02:31,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:31,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-01 00:02:31,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:31,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-01 00:02:31,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-04-01 00:02:31,923 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 00:02:32,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:32,108 INFO L93 Difference]: Finished difference Result 89 states and 125 transitions. [2023-04-01 00:02:32,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 00:02:32,109 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 00:02:32,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:32,110 INFO L225 Difference]: With dead ends: 89 [2023-04-01 00:02:32,111 INFO L226 Difference]: Without dead ends: 57 [2023-04-01 00:02:32,111 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 00:02:32,112 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 37 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:32,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 128 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:02:32,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-04-01 00:02:32,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2023-04-01 00:02:32,128 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 00:02:32,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2023-04-01 00:02:32,129 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 39 [2023-04-01 00:02:32,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:32,129 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2023-04-01 00:02:32,130 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 00:02:32,130 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2023-04-01 00:02:32,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-04-01 00:02:32,131 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:32,131 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 00:02:32,149 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 00:02:32,336 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 00:02:32,337 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:32,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:32,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1525437707, now seen corresponding path program 1 times [2023-04-01 00:02:32,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:32,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168288265] [2023-04-01 00:02:32,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:32,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:32,508 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 00:02:32,509 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:32,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168288265] [2023-04-01 00:02:32,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168288265] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:32,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766956120] [2023-04-01 00:02:32,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:32,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:32,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:32,511 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 00:02:32,524 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 00:02:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:32,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 00:02:32,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:32,653 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 00:02:32,653 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:33,027 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 00:02:33,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766956120] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:33,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1398671099] [2023-04-01 00:02:33,031 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:33,031 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:33,032 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 00:02:33,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:33,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2023-04-01 00:02:33,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88384178] [2023-04-01 00:02:33,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:33,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-01 00:02:33,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:33,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-01 00:02:33,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2023-04-01 00:02:33,036 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 00:02:33,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:33,374 INFO L93 Difference]: Finished difference Result 125 states and 207 transitions. [2023-04-01 00:02:33,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-01 00:02:33,374 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 00:02:33,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:33,380 INFO L225 Difference]: With dead ends: 125 [2023-04-01 00:02:33,380 INFO L226 Difference]: Without dead ends: 81 [2023-04-01 00:02:33,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2023-04-01 00:02:33,384 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 62 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:33,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 181 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 00:02:33,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-04-01 00:02:33,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2023-04-01 00:02:33,412 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 00:02:33,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 95 transitions. [2023-04-01 00:02:33,414 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 95 transitions. Word has length 40 [2023-04-01 00:02:33,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:33,414 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 95 transitions. [2023-04-01 00:02:33,415 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 00:02:33,415 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 95 transitions. [2023-04-01 00:02:33,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-04-01 00:02:33,422 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:33,423 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 00:02:33,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-04-01 00:02:33,628 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 00:02:33,629 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:33,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:33,629 INFO L85 PathProgramCache]: Analyzing trace with hash -684158310, now seen corresponding path program 1 times [2023-04-01 00:02:33,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:33,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549723198] [2023-04-01 00:02:33,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:33,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:33,728 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 00:02:33,729 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:33,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549723198] [2023-04-01 00:02:33,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549723198] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:33,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777110716] [2023-04-01 00:02:33,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:33,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:33,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:33,730 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 00:02:33,771 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 00:02:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:33,792 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-01 00:02:33,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:33,855 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 00:02:33,855 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:34,265 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 00:02:34,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777110716] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:34,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [241685377] [2023-04-01 00:02:34,272 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:34,272 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:34,272 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 00:02:34,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:34,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 17 [2023-04-01 00:02:34,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457758944] [2023-04-01 00:02:34,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:34,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-04-01 00:02:34,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:34,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-04-01 00:02:34,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2023-04-01 00:02:34,276 INFO L87 Difference]: Start difference. First operand 67 states and 95 transitions. Second operand has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 17 states have internal predecessors, (55), 12 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (19), 8 states have call predecessors, (19), 12 states have call successors, (19) [2023-04-01 00:02:34,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:34,456 INFO L93 Difference]: Finished difference Result 123 states and 207 transitions. [2023-04-01 00:02:34,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-01 00:02:34,457 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 17 states have internal predecessors, (55), 12 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (19), 8 states have call predecessors, (19), 12 states have call successors, (19) Word has length 54 [2023-04-01 00:02:34,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:34,458 INFO L225 Difference]: With dead ends: 123 [2023-04-01 00:02:34,458 INFO L226 Difference]: Without dead ends: 101 [2023-04-01 00:02:34,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 100 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2023-04-01 00:02:34,459 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 40 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:34,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 118 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:02:34,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-04-01 00:02:34,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 76. [2023-04-01 00:02:34,474 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 00:02:34,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 109 transitions. [2023-04-01 00:02:34,475 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 109 transitions. Word has length 54 [2023-04-01 00:02:34,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:34,475 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 109 transitions. [2023-04-01 00:02:34,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 17 states have internal predecessors, (55), 12 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (19), 8 states have call predecessors, (19), 12 states have call successors, (19) [2023-04-01 00:02:34,476 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 109 transitions. [2023-04-01 00:02:34,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-04-01 00:02:34,477 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:34,477 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 00:02:34,485 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 00:02:34,682 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 00:02:34,682 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:34,683 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:34,683 INFO L85 PathProgramCache]: Analyzing trace with hash 987730618, now seen corresponding path program 1 times [2023-04-01 00:02:34,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:34,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057252692] [2023-04-01 00:02:34,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:34,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:34,902 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 39 proven. 42 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-04-01 00:02:34,902 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:34,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057252692] [2023-04-01 00:02:34,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057252692] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:34,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056078822] [2023-04-01 00:02:34,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:34,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:34,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:34,904 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 00:02:34,905 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 00:02:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:34,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-01 00:02:34,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:35,079 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 12 proven. 71 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-04-01 00:02:35,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 12 proven. 81 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-04-01 00:02:35,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056078822] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:35,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1744936837] [2023-04-01 00:02:35,844 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:35,844 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:35,845 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 00:02:35,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:35,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2023-04-01 00:02:35,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817916334] [2023-04-01 00:02:35,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:35,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-04-01 00:02:35,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:35,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-04-01 00:02:35,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2023-04-01 00:02:35,848 INFO L87 Difference]: Start difference. First operand 76 states and 109 transitions. Second operand has 23 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 23 states have internal predecessors, (73), 18 states have call successors, (24), 1 states have call predecessors, (24), 9 states have return successors, (26), 10 states have call predecessors, (26), 18 states have call successors, (26) [2023-04-01 00:02:36,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:36,505 INFO L93 Difference]: Finished difference Result 208 states and 415 transitions. [2023-04-01 00:02:36,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-04-01 00:02:36,506 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 23 states have internal predecessors, (73), 18 states have call successors, (24), 1 states have call predecessors, (24), 9 states have return successors, (26), 10 states have call predecessors, (26), 18 states have call successors, (26) Word has length 83 [2023-04-01 00:02:36,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:36,511 INFO L225 Difference]: With dead ends: 208 [2023-04-01 00:02:36,511 INFO L226 Difference]: Without dead ends: 119 [2023-04-01 00:02:36,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 156 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2023-04-01 00:02:36,513 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 118 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:36,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 294 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 00:02:36,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-04-01 00:02:36,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 102. [2023-04-01 00:02:36,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 67 states have internal predecessors, (76), 21 states have call successors, (21), 10 states have call predecessors, (21), 15 states have return successors, (51), 24 states have call predecessors, (51), 20 states have call successors, (51) [2023-04-01 00:02:36,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 148 transitions. [2023-04-01 00:02:36,537 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 148 transitions. Word has length 83 [2023-04-01 00:02:36,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:36,537 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 148 transitions. [2023-04-01 00:02:36,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 23 states have internal predecessors, (73), 18 states have call successors, (24), 1 states have call predecessors, (24), 9 states have return successors, (26), 10 states have call predecessors, (26), 18 states have call successors, (26) [2023-04-01 00:02:36,538 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 148 transitions. [2023-04-01 00:02:36,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-04-01 00:02:36,539 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:36,539 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 13, 13, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:36,550 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 00:02:36,745 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 00:02:36,746 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:36,746 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:36,746 INFO L85 PathProgramCache]: Analyzing trace with hash -646746926, now seen corresponding path program 2 times [2023-04-01 00:02:36,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:36,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674784] [2023-04-01 00:02:36,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:36,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:36,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 57 proven. 208 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2023-04-01 00:02:36,936 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:36,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674784] [2023-04-01 00:02:36,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674784] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:36,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761552267] [2023-04-01 00:02:36,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:02:36,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:36,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:36,938 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 00:02:36,980 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 00:02:37,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-01 00:02:37,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:02:37,045 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2023-04-01 00:02:37,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 319 proven. 3 refuted. 0 times theorem prover too weak. 887 trivial. 0 not checked. [2023-04-01 00:02:37,125 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:37,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 248 proven. 5 refuted. 0 times theorem prover too weak. 956 trivial. 0 not checked. [2023-04-01 00:02:37,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761552267] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:37,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [558677610] [2023-04-01 00:02:37,649 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:37,650 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:37,650 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 00:02:37,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:37,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 15 [2023-04-01 00:02:37,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759595234] [2023-04-01 00:02:37,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:37,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-04-01 00:02:37,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:37,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-04-01 00:02:37,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-04-01 00:02:37,652 INFO L87 Difference]: Start difference. First operand 102 states and 148 transitions. Second operand has 15 states, 14 states have (on average 3.5) internal successors, (49), 15 states have internal predecessors, (49), 5 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2023-04-01 00:02:37,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:37,834 INFO L93 Difference]: Finished difference Result 192 states and 313 transitions. [2023-04-01 00:02:37,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 00:02:37,838 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 15 states have internal predecessors, (49), 5 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 212 [2023-04-01 00:02:37,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:37,841 INFO L225 Difference]: With dead ends: 192 [2023-04-01 00:02:37,841 INFO L226 Difference]: Without dead ends: 104 [2023-04-01 00:02:37,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 415 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2023-04-01 00:02:37,843 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 28 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:37,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 200 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:02:37,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-04-01 00:02:37,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2023-04-01 00:02:37,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 65 states have internal predecessors, (74), 21 states have call successors, (21), 10 states have call predecessors, (21), 14 states have return successors, (44), 23 states have call predecessors, (44), 20 states have call successors, (44) [2023-04-01 00:02:37,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 139 transitions. [2023-04-01 00:02:37,859 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 139 transitions. Word has length 212 [2023-04-01 00:02:37,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:37,860 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 139 transitions. [2023-04-01 00:02:37,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 15 states have internal predecessors, (49), 5 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2023-04-01 00:02:37,860 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 139 transitions. [2023-04-01 00:02:37,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-04-01 00:02:37,861 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:37,861 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:37,871 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 00:02:38,081 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 00:02:38,081 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:38,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:38,082 INFO L85 PathProgramCache]: Analyzing trace with hash 2122311264, now seen corresponding path program 1 times [2023-04-01 00:02:38,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:38,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710823849] [2023-04-01 00:02:38,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:38,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:38,276 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 71 proven. 162 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2023-04-01 00:02:38,276 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:38,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710823849] [2023-04-01 00:02:38,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710823849] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:38,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071545545] [2023-04-01 00:02:38,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:38,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:38,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:38,278 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 00:02:38,280 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 00:02:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:38,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 14 conjunts are in the unsatisfiable core [2023-04-01 00:02:38,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:38,510 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 34 proven. 242 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2023-04-01 00:02:38,510 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:39,656 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 34 proven. 258 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2023-04-01 00:02:39,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071545545] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:39,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [98841679] [2023-04-01 00:02:39,658 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:39,659 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:39,659 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 00:02:39,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:39,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 25 [2023-04-01 00:02:39,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095091852] [2023-04-01 00:02:39,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:39,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-04-01 00:02:39,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:39,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-04-01 00:02:39,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2023-04-01 00:02:39,662 INFO L87 Difference]: Start difference. First operand 99 states and 139 transitions. Second operand has 25 states, 23 states have (on average 3.608695652173913) internal successors, (83), 25 states have internal predecessors, (83), 20 states have call successors, (28), 1 states have call predecessors, (28), 10 states have return successors, (33), 11 states have call predecessors, (33), 20 states have call successors, (33) [2023-04-01 00:02:40,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:40,366 INFO L93 Difference]: Finished difference Result 254 states and 441 transitions. [2023-04-01 00:02:40,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-04-01 00:02:40,367 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 3.608695652173913) internal successors, (83), 25 states have internal predecessors, (83), 20 states have call successors, (28), 1 states have call predecessors, (28), 10 states have return successors, (33), 11 states have call predecessors, (33), 20 states have call successors, (33) Word has length 164 [2023-04-01 00:02:40,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:40,369 INFO L225 Difference]: With dead ends: 254 [2023-04-01 00:02:40,369 INFO L226 Difference]: Without dead ends: 139 [2023-04-01 00:02:40,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 309 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=321, Invalid=1571, Unknown=0, NotChecked=0, Total=1892 [2023-04-01 00:02:40,371 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 101 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:40,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 376 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 00:02:40,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-04-01 00:02:40,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 119. [2023-04-01 00:02:40,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 79 states have internal predecessors, (93), 25 states have call successors, (25), 13 states have call predecessors, (25), 16 states have return successors, (57), 26 states have call predecessors, (57), 24 states have call successors, (57) [2023-04-01 00:02:40,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 175 transitions. [2023-04-01 00:02:40,388 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 175 transitions. Word has length 164 [2023-04-01 00:02:40,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:40,388 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 175 transitions. [2023-04-01 00:02:40,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 3.608695652173913) internal successors, (83), 25 states have internal predecessors, (83), 20 states have call successors, (28), 1 states have call predecessors, (28), 10 states have return successors, (33), 11 states have call predecessors, (33), 20 states have call successors, (33) [2023-04-01 00:02:40,388 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 175 transitions. [2023-04-01 00:02:40,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2023-04-01 00:02:40,394 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:40,394 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 16, 16, 13, 13, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:40,403 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 00:02:40,600 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 00:02:40,601 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:40,601 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:40,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1434230079, now seen corresponding path program 2 times [2023-04-01 00:02:40,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:40,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107760278] [2023-04-01 00:02:40,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:40,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:40,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 126 proven. 246 refuted. 0 times theorem prover too weak. 1032 trivial. 0 not checked. [2023-04-01 00:02:40,857 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:40,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107760278] [2023-04-01 00:02:40,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107760278] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:40,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284531789] [2023-04-01 00:02:40,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:02:40,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:40,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:40,858 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:40,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-01 00:02:40,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-04-01 00:02:40,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:02:40,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-01 00:02:40,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:41,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 251 proven. 50 refuted. 0 times theorem prover too weak. 1103 trivial. 0 not checked. [2023-04-01 00:02:41,027 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:41,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 253 proven. 53 refuted. 0 times theorem prover too weak. 1098 trivial. 0 not checked. [2023-04-01 00:02:41,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284531789] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:41,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [579592273] [2023-04-01 00:02:41,715 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:41,715 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:41,715 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 00:02:41,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:41,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 18 [2023-04-01 00:02:41,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512614008] [2023-04-01 00:02:41,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:41,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-01 00:02:41,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:41,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-01 00:02:41,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2023-04-01 00:02:41,717 INFO L87 Difference]: Start difference. First operand 119 states and 175 transitions. Second operand has 18 states, 16 states have (on average 4.0) internal successors, (64), 18 states have internal predecessors, (64), 12 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (25), 12 states have call predecessors, (25), 12 states have call successors, (25) [2023-04-01 00:02:41,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:41,893 INFO L93 Difference]: Finished difference Result 149 states and 238 transitions. [2023-04-01 00:02:41,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-01 00:02:41,893 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 4.0) internal successors, (64), 18 states have internal predecessors, (64), 12 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (25), 12 states have call predecessors, (25), 12 states have call successors, (25) Word has length 231 [2023-04-01 00:02:41,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:41,895 INFO L225 Difference]: With dead ends: 149 [2023-04-01 00:02:41,895 INFO L226 Difference]: Without dead ends: 135 [2023-04-01 00:02:41,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 454 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2023-04-01 00:02:41,896 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 35 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:41,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 165 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:02:41,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-04-01 00:02:41,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2023-04-01 00:02:41,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 81 states have (on average 1.1975308641975309) internal successors, (97), 83 states have internal predecessors, (97), 25 states have call successors, (25), 13 states have call predecessors, (25), 18 states have return successors, (62), 28 states have call predecessors, (62), 24 states have call successors, (62) [2023-04-01 00:02:41,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 184 transitions. [2023-04-01 00:02:41,911 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 184 transitions. Word has length 231 [2023-04-01 00:02:41,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:41,912 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 184 transitions. [2023-04-01 00:02:41,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 4.0) internal successors, (64), 18 states have internal predecessors, (64), 12 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (25), 12 states have call predecessors, (25), 12 states have call successors, (25) [2023-04-01 00:02:41,912 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 184 transitions. [2023-04-01 00:02:41,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2023-04-01 00:02:41,916 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:41,916 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 30, 30, 24, 24, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 9, 9, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:41,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-04-01 00:02:42,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-04-01 00:02:42,138 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:42,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:42,138 INFO L85 PathProgramCache]: Analyzing trace with hash 2016528351, now seen corresponding path program 3 times [2023-04-01 00:02:42,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:42,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903718808] [2023-04-01 00:02:42,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:42,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:42,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4992 backedges. 133 proven. 901 refuted. 0 times theorem prover too weak. 3958 trivial. 0 not checked. [2023-04-01 00:02:42,621 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:42,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903718808] [2023-04-01 00:02:42,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903718808] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:42,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037234224] [2023-04-01 00:02:42,622 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 00:02:42,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:42,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:42,639 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:42,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-04-01 00:02:42,784 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 00:02:42,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:02:42,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 22 conjunts are in the unsatisfiable core [2023-04-01 00:02:42,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:42,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4992 backedges. 2805 proven. 449 refuted. 0 times theorem prover too weak. 1738 trivial. 0 not checked. [2023-04-01 00:02:42,944 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:45,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4992 backedges. 359 proven. 1270 refuted. 0 times theorem prover too weak. 3363 trivial. 0 not checked. [2023-04-01 00:02:45,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037234224] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:45,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1678718185] [2023-04-01 00:02:45,341 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:45,341 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:45,341 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 00:02:45,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:45,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 23] total 30 [2023-04-01 00:02:45,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862247362] [2023-04-01 00:02:45,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:45,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-04-01 00:02:45,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:45,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-04-01 00:02:45,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=772, Unknown=0, NotChecked=0, Total=870 [2023-04-01 00:02:45,344 INFO L87 Difference]: Start difference. First operand 125 states and 184 transitions. Second operand has 30 states, 29 states have (on average 4.0344827586206895) internal successors, (117), 30 states have internal predecessors, (117), 27 states have call successors, (38), 2 states have call predecessors, (38), 14 states have return successors, (45), 14 states have call predecessors, (45), 27 states have call successors, (45) [2023-04-01 00:02:46,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:46,364 INFO L93 Difference]: Finished difference Result 298 states and 572 transitions. [2023-04-01 00:02:46,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-04-01 00:02:46,364 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.0344827586206895) internal successors, (117), 30 states have internal predecessors, (117), 27 states have call successors, (38), 2 states have call predecessors, (38), 14 states have return successors, (45), 14 states have call predecessors, (45), 27 states have call successors, (45) Word has length 421 [2023-04-01 00:02:46,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:46,367 INFO L225 Difference]: With dead ends: 298 [2023-04-01 00:02:46,367 INFO L226 Difference]: Without dead ends: 176 [2023-04-01 00:02:46,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 885 GetRequests, 819 SyntacticMatches, 11 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=501, Invalid=2691, Unknown=0, NotChecked=0, Total=3192 [2023-04-01 00:02:46,369 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 168 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:46,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 375 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-01 00:02:46,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-04-01 00:02:46,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 166. [2023-04-01 00:02:46,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 112 states have (on average 1.1607142857142858) internal successors, (130), 111 states have internal predecessors, (130), 34 states have call successors, (34), 23 states have call predecessors, (34), 19 states have return successors, (90), 31 states have call predecessors, (90), 33 states have call successors, (90) [2023-04-01 00:02:46,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 254 transitions. [2023-04-01 00:02:46,391 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 254 transitions. Word has length 421 [2023-04-01 00:02:46,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:46,392 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 254 transitions. [2023-04-01 00:02:46,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.0344827586206895) internal successors, (117), 30 states have internal predecessors, (117), 27 states have call successors, (38), 2 states have call predecessors, (38), 14 states have return successors, (45), 14 states have call predecessors, (45), 27 states have call successors, (45) [2023-04-01 00:02:46,392 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 254 transitions. [2023-04-01 00:02:46,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2023-04-01 00:02:46,398 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:46,399 INFO L195 NwaCegarLoop]: trace histogram [42, 42, 37, 37, 33, 30, 21, 21, 21, 21, 21, 21, 21, 18, 18, 18, 18, 18, 18, 18, 12, 12, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:46,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-04-01 00:02:46,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:46,606 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:46,606 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:46,606 INFO L85 PathProgramCache]: Analyzing trace with hash -2104863278, now seen corresponding path program 4 times [2023-04-01 00:02:46,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:46,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046185039] [2023-04-01 00:02:46,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:46,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:47,138 INFO L134 CoverageAnalysis]: Checked inductivity of 8523 backedges. 230 proven. 966 refuted. 0 times theorem prover too weak. 7327 trivial. 0 not checked. [2023-04-01 00:02:47,138 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:47,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046185039] [2023-04-01 00:02:47,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046185039] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:47,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538926272] [2023-04-01 00:02:47,138 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 00:02:47,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:47,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:47,139 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:47,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-04-01 00:02:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:47,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 1238 conjuncts, 18 conjunts are in the unsatisfiable core [2023-04-01 00:02:47,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:47,499 INFO L134 CoverageAnalysis]: Checked inductivity of 8523 backedges. 176 proven. 1399 refuted. 0 times theorem prover too weak. 6948 trivial. 0 not checked. [2023-04-01 00:02:47,500 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:49,920 INFO L134 CoverageAnalysis]: Checked inductivity of 8523 backedges. 176 proven. 1432 refuted. 0 times theorem prover too weak. 6915 trivial. 0 not checked. [2023-04-01 00:02:49,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538926272] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:49,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1160475605] [2023-04-01 00:02:49,922 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:49,922 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:49,923 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 00:02:49,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:49,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 19] total 26 [2023-04-01 00:02:49,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432001809] [2023-04-01 00:02:49,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:49,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-04-01 00:02:49,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:49,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-04-01 00:02:49,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2023-04-01 00:02:49,926 INFO L87 Difference]: Start difference. First operand 166 states and 254 transitions. Second operand has 26 states, 24 states have (on average 3.625) internal successors, (87), 26 states have internal predecessors, (87), 22 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (37), 14 states have call predecessors, (37), 22 states have call successors, (37) [2023-04-01 00:02:50,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:50,260 INFO L93 Difference]: Finished difference Result 218 states and 389 transitions. [2023-04-01 00:02:50,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-01 00:02:50,261 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.625) internal successors, (87), 26 states have internal predecessors, (87), 22 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (37), 14 states have call predecessors, (37), 22 states have call successors, (37) Word has length 544 [2023-04-01 00:02:50,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:50,264 INFO L225 Difference]: With dead ends: 218 [2023-04-01 00:02:50,264 INFO L226 Difference]: Without dead ends: 194 [2023-04-01 00:02:50,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1114 GetRequests, 1070 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=270, Invalid=1136, Unknown=0, NotChecked=0, Total=1406 [2023-04-01 00:02:50,265 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 86 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:50,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 220 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 00:02:50,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-04-01 00:02:50,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 179. [2023-04-01 00:02:50,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 120 states have (on average 1.15) internal successors, (138), 119 states have internal predecessors, (138), 36 states have call successors, (36), 23 states have call predecessors, (36), 22 states have return successors, (105), 36 states have call predecessors, (105), 35 states have call successors, (105) [2023-04-01 00:02:50,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 279 transitions. [2023-04-01 00:02:50,289 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 279 transitions. Word has length 544 [2023-04-01 00:02:50,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:50,290 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 279 transitions. [2023-04-01 00:02:50,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.625) internal successors, (87), 26 states have internal predecessors, (87), 22 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (37), 14 states have call predecessors, (37), 22 states have call successors, (37) [2023-04-01 00:02:50,290 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 279 transitions. [2023-04-01 00:02:50,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1186 [2023-04-01 00:02:50,298 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:50,299 INFO L195 NwaCegarLoop]: trace histogram [88, 88, 85, 85, 71, 69, 44, 44, 44, 44, 44, 44, 44, 42, 42, 42, 42, 42, 42, 42, 27, 27, 19, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:50,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-04-01 00:02:50,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-04-01 00:02:50,507 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:50,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:50,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1297418233, now seen corresponding path program 5 times [2023-04-01 00:02:50,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:50,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804370273] [2023-04-01 00:02:50,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:50,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:52,152 INFO L134 CoverageAnalysis]: Checked inductivity of 41651 backedges. 749 proven. 2918 refuted. 0 times theorem prover too weak. 37984 trivial. 0 not checked. [2023-04-01 00:02:52,153 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:52,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804370273] [2023-04-01 00:02:52,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804370273] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:52,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80748367] [2023-04-01 00:02:52,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:02:52,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:52,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:52,154 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:52,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-04-01 00:02:52,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-04-01 00:02:52,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:02:52,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-01 00:02:52,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 41651 backedges. 5233 proven. 34 refuted. 0 times theorem prover too weak. 36384 trivial. 0 not checked. [2023-04-01 00:02:52,505 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:55,505 INFO L134 CoverageAnalysis]: Checked inductivity of 41651 backedges. 2984 proven. 104 refuted. 0 times theorem prover too weak. 38563 trivial. 0 not checked. [2023-04-01 00:02:55,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80748367] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:55,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [897279317] [2023-04-01 00:02:55,508 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:55,508 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:55,508 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 00:02:55,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:55,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 24 [2023-04-01 00:02:55,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386508757] [2023-04-01 00:02:55,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:55,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-04-01 00:02:55,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:55,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-04-01 00:02:55,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2023-04-01 00:02:55,512 INFO L87 Difference]: Start difference. First operand 179 states and 279 transitions. Second operand has 24 states, 23 states have (on average 4.217391304347826) internal successors, (97), 24 states have internal predecessors, (97), 18 states have call successors, (31), 2 states have call predecessors, (31), 13 states have return successors, (39), 15 states have call predecessors, (39), 18 states have call successors, (39) [2023-04-01 00:02:56,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:56,344 INFO L93 Difference]: Finished difference Result 430 states and 786 transitions. [2023-04-01 00:02:56,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-04-01 00:02:56,344 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.217391304347826) internal successors, (97), 24 states have internal predecessors, (97), 18 states have call successors, (31), 2 states have call predecessors, (31), 13 states have return successors, (39), 15 states have call predecessors, (39), 18 states have call successors, (39) Word has length 1185 [2023-04-01 00:02:56,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:56,348 INFO L225 Difference]: With dead ends: 430 [2023-04-01 00:02:56,348 INFO L226 Difference]: Without dead ends: 259 [2023-04-01 00:02:56,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2414 GetRequests, 2360 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=383, Invalid=2067, Unknown=0, NotChecked=0, Total=2450 [2023-04-01 00:02:56,351 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 119 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:56,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 305 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 00:02:56,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2023-04-01 00:02:56,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 220. [2023-04-01 00:02:56,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 149 states have (on average 1.1543624161073827) internal successors, (172), 147 states have internal predecessors, (172), 45 states have call successors, (45), 30 states have call predecessors, (45), 25 states have return successors, (151), 42 states have call predecessors, (151), 44 states have call successors, (151) [2023-04-01 00:02:56,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 368 transitions. [2023-04-01 00:02:56,380 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 368 transitions. Word has length 1185 [2023-04-01 00:02:56,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:56,381 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 368 transitions. [2023-04-01 00:02:56,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.217391304347826) internal successors, (97), 24 states have internal predecessors, (97), 18 states have call successors, (31), 2 states have call predecessors, (31), 13 states have return successors, (39), 15 states have call predecessors, (39), 18 states have call successors, (39) [2023-04-01 00:02:56,381 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 368 transitions. [2023-04-01 00:02:56,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1159 [2023-04-01 00:02:56,392 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:56,393 INFO L195 NwaCegarLoop]: trace histogram [91, 91, 78, 78, 70, 67, 45, 45, 45, 45, 45, 45, 45, 39, 39, 39, 39, 39, 39, 39, 31, 22, 21, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:56,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-04-01 00:02:56,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-04-01 00:02:56,601 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:56,601 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:56,601 INFO L85 PathProgramCache]: Analyzing trace with hash -894792987, now seen corresponding path program 6 times [2023-04-01 00:02:56,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:56,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027280082] [2023-04-01 00:02:56,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:56,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:58,531 INFO L134 CoverageAnalysis]: Checked inductivity of 39942 backedges. 734 proven. 2413 refuted. 0 times theorem prover too weak. 36795 trivial. 0 not checked. [2023-04-01 00:02:58,531 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:58,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027280082] [2023-04-01 00:02:58,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027280082] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:58,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717961578] [2023-04-01 00:02:58,532 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 00:02:58,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:58,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:58,533 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:58,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-04-01 00:02:58,929 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 00:02:58,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:02:58,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 2066 conjuncts, 22 conjunts are in the unsatisfiable core [2023-04-01 00:02:58,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:59,215 INFO L134 CoverageAnalysis]: Checked inductivity of 39942 backedges. 12870 proven. 409 refuted. 0 times theorem prover too weak. 26663 trivial. 0 not checked. [2023-04-01 00:02:59,215 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:03:04,115 INFO L134 CoverageAnalysis]: Checked inductivity of 39942 backedges. 781 proven. 4847 refuted. 0 times theorem prover too weak. 34314 trivial. 0 not checked. [2023-04-01 00:03:04,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717961578] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:03:04,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [393801725] [2023-04-01 00:03:04,120 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:03:04,120 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:03:04,121 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 00:03:04,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:03:04,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 23] total 34 [2023-04-01 00:03:04,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938635506] [2023-04-01 00:03:04,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:03:04,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-04-01 00:03:04,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:03:04,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-04-01 00:03:04,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2023-04-01 00:03:04,127 INFO L87 Difference]: Start difference. First operand 220 states and 368 transitions. Second operand has 34 states, 33 states have (on average 3.8484848484848486) internal successors, (127), 34 states have internal predecessors, (127), 29 states have call successors, (41), 2 states have call predecessors, (41), 18 states have return successors, (53), 17 states have call predecessors, (53), 29 states have call successors, (53) [2023-04-01 00:03:05,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:03:05,234 INFO L93 Difference]: Finished difference Result 586 states and 1340 transitions. [2023-04-01 00:03:05,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-04-01 00:03:05,235 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.8484848484848486) internal successors, (127), 34 states have internal predecessors, (127), 29 states have call successors, (41), 2 states have call predecessors, (41), 18 states have return successors, (53), 17 states have call predecessors, (53), 29 states have call successors, (53) Word has length 1158 [2023-04-01 00:03:05,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:03:05,249 INFO L225 Difference]: With dead ends: 586 [2023-04-01 00:03:05,250 INFO L226 Difference]: Without dead ends: 382 [2023-04-01 00:03:05,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2368 GetRequests, 2289 SyntacticMatches, 11 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=719, Invalid=4111, Unknown=0, NotChecked=0, Total=4830 [2023-04-01 00:03:05,255 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 213 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-01 00:03:05,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 344 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-01 00:03:05,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2023-04-01 00:03:05,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 291. [2023-04-01 00:03:05,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 202 states have (on average 1.1386138613861385) internal successors, (230), 195 states have internal predecessors, (230), 58 states have call successors, (58), 45 states have call predecessors, (58), 30 states have return successors, (239), 50 states have call predecessors, (239), 57 states have call successors, (239) [2023-04-01 00:03:05,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 527 transitions. [2023-04-01 00:03:05,291 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 527 transitions. Word has length 1158 [2023-04-01 00:03:05,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:03:05,291 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 527 transitions. [2023-04-01 00:03:05,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.8484848484848486) internal successors, (127), 34 states have internal predecessors, (127), 29 states have call successors, (41), 2 states have call predecessors, (41), 18 states have return successors, (53), 17 states have call predecessors, (53), 29 states have call successors, (53) [2023-04-01 00:03:05,291 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 527 transitions. [2023-04-01 00:03:05,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1363 [2023-04-01 00:03:05,303 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:03:05,303 INFO L195 NwaCegarLoop]: trace histogram [103, 103, 96, 96, 83, 78, 51, 51, 51, 51, 51, 51, 51, 48, 48, 48, 48, 48, 48, 48, 35, 27, 20, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:03:05,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-04-01 00:03:05,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-04-01 00:03:05,511 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:03:05,511 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:03:05,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1531352142, now seen corresponding path program 7 times [2023-04-01 00:03:05,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:03:05,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047724583] [2023-04-01 00:03:05,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:03:05,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:03:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:03:07,487 INFO L134 CoverageAnalysis]: Checked inductivity of 55270 backedges. 855 proven. 3380 refuted. 0 times theorem prover too weak. 51035 trivial. 0 not checked. [2023-04-01 00:03:07,487 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:03:07,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047724583] [2023-04-01 00:03:07,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047724583] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:03:07,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629032261] [2023-04-01 00:03:07,488 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 00:03:07,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:03:07,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:03:07,489 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:03:07,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-04-01 00:03:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:03:08,001 INFO L262 TraceCheckSpWp]: Trace formula consists of 3054 conjuncts, 22 conjunts are in the unsatisfiable core [2023-04-01 00:03:08,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:03:08,138 INFO L134 CoverageAnalysis]: Checked inductivity of 55270 backedges. 608 proven. 4682 refuted. 0 times theorem prover too weak. 49980 trivial. 0 not checked. [2023-04-01 00:03:08,138 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:03:13,645 INFO L134 CoverageAnalysis]: Checked inductivity of 55270 backedges. 608 proven. 4738 refuted. 0 times theorem prover too weak. 49924 trivial. 0 not checked. [2023-04-01 00:03:13,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629032261] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:03:13,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2073971175] [2023-04-01 00:03:13,650 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:03:13,650 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:03:13,651 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 00:03:13,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:03:13,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 23] total 30 [2023-04-01 00:03:13,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144789023] [2023-04-01 00:03:13,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:03:13,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-04-01 00:03:13,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:03:13,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-04-01 00:03:13,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2023-04-01 00:03:13,655 INFO L87 Difference]: Start difference. First operand 291 states and 527 transitions. Second operand has 30 states, 28 states have (on average 3.5357142857142856) internal successors, (99), 30 states have internal predecessors, (99), 26 states have call successors, (32), 1 states have call predecessors, (32), 15 states have return successors, (43), 16 states have call predecessors, (43), 26 states have call successors, (43) [2023-04-01 00:03:14,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:03:14,086 INFO L93 Difference]: Finished difference Result 370 states and 809 transitions. [2023-04-01 00:03:14,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-04-01 00:03:14,087 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 3.5357142857142856) internal successors, (99), 30 states have internal predecessors, (99), 26 states have call successors, (32), 1 states have call predecessors, (32), 15 states have return successors, (43), 16 states have call predecessors, (43), 26 states have call successors, (43) Word has length 1362 [2023-04-01 00:03:14,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:03:14,094 INFO L225 Difference]: With dead ends: 370 [2023-04-01 00:03:14,094 INFO L226 Difference]: Without dead ends: 346 [2023-04-01 00:03:14,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2756 GetRequests, 2704 SyntacticMatches, 10 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=356, Invalid=1536, Unknown=0, NotChecked=0, Total=1892 [2023-04-01 00:03:14,096 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 157 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 00:03:14,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 248 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 00:03:14,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2023-04-01 00:03:14,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 326. [2023-04-01 00:03:14,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 223 states have (on average 1.1255605381165918) internal successors, (251), 216 states have internal predecessors, (251), 65 states have call successors, (65), 45 states have call predecessors, (65), 37 states have return successors, (315), 64 states have call predecessors, (315), 64 states have call successors, (315) [2023-04-01 00:03:14,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 631 transitions. [2023-04-01 00:03:14,146 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 631 transitions. Word has length 1362 [2023-04-01 00:03:14,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:03:14,147 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 631 transitions. [2023-04-01 00:03:14,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 3.5357142857142856) internal successors, (99), 30 states have internal predecessors, (99), 26 states have call successors, (32), 1 states have call predecessors, (32), 15 states have return successors, (43), 16 states have call predecessors, (43), 26 states have call successors, (43) [2023-04-01 00:03:14,147 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 631 transitions. [2023-04-01 00:03:14,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1691 [2023-04-01 00:03:14,168 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:03:14,169 INFO L195 NwaCegarLoop]: trace histogram [128, 128, 119, 119, 103, 98, 64, 64, 64, 64, 64, 64, 64, 59, 59, 59, 59, 59, 59, 59, 44, 34, 25, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:03:14,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-04-01 00:03:14,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-04-01 00:03:14,380 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:03:14,380 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:03:14,380 INFO L85 PathProgramCache]: Analyzing trace with hash -912748488, now seen corresponding path program 8 times [2023-04-01 00:03:14,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:03:14,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772908004] [2023-04-01 00:03:14,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:03:14,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:03:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:03:17,067 INFO L134 CoverageAnalysis]: Checked inductivity of 85510 backedges. 937 proven. 5030 refuted. 0 times theorem prover too weak. 79543 trivial. 0 not checked. [2023-04-01 00:03:17,067 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:03:17,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772908004] [2023-04-01 00:03:17,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772908004] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:03:17,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434736343] [2023-04-01 00:03:17,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:03:17,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:03:17,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:03:17,069 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:03:17,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-04-01 00:03:17,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2023-04-01 00:03:17,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:03:17,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-01 00:03:17,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:03:17,615 INFO L134 CoverageAnalysis]: Checked inductivity of 85510 backedges. 10117 proven. 63 refuted. 0 times theorem prover too weak. 75330 trivial. 0 not checked. [2023-04-01 00:03:17,615 INFO L327 TraceCheckSpWp]: Computing backward predicates...