/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 OctagonDomain -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-03 01:16:18,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-03 01:16:18,892 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-03 01:16:18,923 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-03 01:16:18,923 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-03 01:16:18,925 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-03 01:16:18,927 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-03 01:16:18,929 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-03 01:16:18,930 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-03 01:16:18,934 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-03 01:16:18,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-03 01:16:18,935 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-03 01:16:18,936 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-03 01:16:18,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-03 01:16:18,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-03 01:16:18,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-03 01:16:18,938 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-03 01:16:18,938 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-03 01:16:18,939 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-03 01:16:18,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-03 01:16:18,941 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-03 01:16:18,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-03 01:16:18,944 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-03 01:16:18,946 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-03 01:16:18,955 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-03 01:16:18,956 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-03 01:16:18,956 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-03 01:16:18,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-03 01:16:18,957 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-03 01:16:18,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-03 01:16:18,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-03 01:16:18,958 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-03 01:16:18,958 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-03 01:16:18,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-03 01:16:18,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-03 01:16:18,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-03 01:16:18,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-03 01:16:18,961 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-03 01:16:18,961 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-03 01:16:18,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-03 01:16:18,962 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-03 01:16:18,963 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-03 01:16:18,986 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-03 01:16:18,986 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-03 01:16:18,987 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-03 01:16:18,987 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-03 01:16:18,987 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-03 01:16:18,988 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-03 01:16:18,988 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-03 01:16:18,988 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-03 01:16:18,988 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-03 01:16:18,988 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-03 01:16:18,988 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-03 01:16:18,989 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-03 01:16:18,989 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-03 01:16:18,989 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-03 01:16:18,989 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-03 01:16:18,989 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-03 01:16:18,989 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-03 01:16:18,989 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-03 01:16:18,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-03 01:16:18,990 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-03 01:16:18,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-03 01:16:18,990 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-03 01:16:18,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-03 01:16:18,990 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-03 01:16:18,990 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-03 01:16:18,990 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-03 01:16:18,990 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-03 01:16:18,990 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-03 01:16:18,990 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-03 01:16:18,990 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-03 01:16:18,991 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-03 01:16:18,991 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-03 01:16:18,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-03 01:16:18,991 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-03 01:16:18,991 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-03 01:16:18,991 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-03 01:16:18,991 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-03 01:16:18,991 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-03 01:16:18,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-03 01:16:18,991 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-03 01:16:18,992 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-03 01:16:18,992 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 -> OctagonDomain [2023-04-03 01:16:19,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-03 01:16:19,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-03 01:16:19,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-03 01:16:19,221 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-03 01:16:19,221 INFO L275 PluginConnector]: CDTParser initialized [2023-04-03 01:16:19,222 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c [2023-04-03 01:16:20,251 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-03 01:16:20,392 INFO L351 CDTParser]: Found 1 translation units. [2023-04-03 01:16:20,393 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c [2023-04-03 01:16:20,396 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24ff88656/bac99972980b43af9197b67ad3dc3393/FLAG02e665cbf [2023-04-03 01:16:20,409 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24ff88656/bac99972980b43af9197b67ad3dc3393 [2023-04-03 01:16:20,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-03 01:16:20,411 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-03 01:16:20,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-03 01:16:20,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-03 01:16:20,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-03 01:16:20,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.04 01:16:20" (1/1) ... [2023-04-03 01:16:20,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bbf7275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:16:20, skipping insertion in model container [2023-04-03 01:16:20,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.04 01:16:20" (1/1) ... [2023-04-03 01:16:20,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-03 01:16:20,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-03 01:16:20,530 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_4-1.c[946,959] [2023-04-03 01:16:20,533 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-03 01:16:20,541 INFO L203 MainTranslator]: Completed pre-run [2023-04-03 01:16:20,551 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_4-1.c[946,959] [2023-04-03 01:16:20,552 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-03 01:16:20,562 INFO L208 MainTranslator]: Completed translation [2023-04-03 01:16:20,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:16:20 WrapperNode [2023-04-03 01:16:20,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-03 01:16:20,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-03 01:16:20,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-03 01:16:20,564 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-03 01:16:20,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:16:20" (1/1) ... [2023-04-03 01:16:20,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:16:20" (1/1) ... [2023-04-03 01:16:20,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:16:20" (1/1) ... [2023-04-03 01:16:20,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:16:20" (1/1) ... [2023-04-03 01:16:20,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:16:20" (1/1) ... [2023-04-03 01:16:20,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:16:20" (1/1) ... [2023-04-03 01:16:20,590 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:16:20" (1/1) ... [2023-04-03 01:16:20,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:16:20" (1/1) ... [2023-04-03 01:16:20,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-03 01:16:20,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-03 01:16:20,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-03 01:16:20,597 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-03 01:16:20,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:16:20" (1/1) ... [2023-04-03 01:16:20,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-03 01:16:20,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:16:20,619 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-03 01:16:20,622 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-03 01:16:20,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-03 01:16:20,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-03 01:16:20,649 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-03 01:16:20,649 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2023-04-03 01:16:20,649 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2023-04-03 01:16:20,650 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-03 01:16:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-03 01:16:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-03 01:16:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-03 01:16:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-03 01:16:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-03 01:16:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2023-04-03 01:16:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2023-04-03 01:16:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-03 01:16:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-03 01:16:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-03 01:16:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-03 01:16:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-03 01:16:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-03 01:16:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-03 01:16:20,696 INFO L236 CfgBuilder]: Building ICFG [2023-04-03 01:16:20,698 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-03 01:16:20,812 INFO L277 CfgBuilder]: Performing block encoding [2023-04-03 01:16:20,841 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-03 01:16:20,841 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-04-03 01:16:20,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.04 01:16:20 BoogieIcfgContainer [2023-04-03 01:16:20,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-03 01:16:20,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-03 01:16:20,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-03 01:16:20,847 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-03 01:16:20,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.04 01:16:20" (1/3) ... [2023-04-03 01:16:20,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539820d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.04 01:16:20, skipping insertion in model container [2023-04-03 01:16:20,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:16:20" (2/3) ... [2023-04-03 01:16:20,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539820d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.04 01:16:20, skipping insertion in model container [2023-04-03 01:16:20,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.04 01:16:20" (3/3) ... [2023-04-03 01:16:20,848 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-1.c [2023-04-03 01:16:20,862 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-03 01:16:20,862 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-03 01:16:20,934 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-03 01:16:20,939 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;@74b8f5bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-03 01:16:20,939 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-03 01:16:20,943 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-03 01:16:20,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-04-03 01:16:20,949 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:16:20,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:16:20,950 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:16:20,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:16:20,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1638346757, now seen corresponding path program 1 times [2023-04-03 01:16:20,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:16:20,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713190595] [2023-04-03 01:16:20,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:20,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:16:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:21,160 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-03 01:16:21,161 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:16:21,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713190595] [2023-04-03 01:16:21,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713190595] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-03 01:16:21,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-03 01:16:21,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-03 01:16:21,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966260329] [2023-04-03 01:16:21,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-03 01:16:21,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-03 01:16:21,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:16:21,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-03 01:16:21,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-03 01:16:21,217 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, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-03 01:16:21,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:16:21,302 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2023-04-03 01:16:21,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-03 01:16:21,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2023-04-03 01:16:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:16:21,310 INFO L225 Difference]: With dead ends: 42 [2023-04-03 01:16:21,311 INFO L226 Difference]: Without dead ends: 30 [2023-04-03 01:16:21,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-03 01:16:21,315 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-03 01:16:21,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 89 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-03 01:16:21,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-04-03 01:16:21,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-04-03 01:16:21,345 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-03 01:16:21,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-04-03 01:16:21,347 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2023-04-03 01:16:21,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:16:21,347 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-04-03 01:16:21,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-03 01:16:21,347 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-04-03 01:16:21,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-04-03 01:16:21,348 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:16:21,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:16:21,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-03 01:16:21,374 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:16:21,376 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:16:21,376 INFO L85 PathProgramCache]: Analyzing trace with hash -40226507, now seen corresponding path program 1 times [2023-04-03 01:16:21,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:16:21,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749376017] [2023-04-03 01:16:21,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:21,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:16:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:21,501 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-03 01:16:21,501 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:16:21,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749376017] [2023-04-03 01:16:21,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749376017] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-03 01:16:21,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-03 01:16:21,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-03 01:16:21,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11973569] [2023-04-03 01:16:21,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-03 01:16:21,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-03 01:16:21,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:16:21,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-03 01:16:21,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-03 01:16:21,504 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-03 01:16:21,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:16:21,546 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2023-04-03 01:16:21,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-03 01:16:21,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2023-04-03 01:16:21,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:16:21,547 INFO L225 Difference]: With dead ends: 36 [2023-04-03 01:16:21,547 INFO L226 Difference]: Without dead ends: 32 [2023-04-03 01:16:21,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-03 01:16:21,548 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-03 01:16:21,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 78 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-03 01:16:21,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-04-03 01:16:21,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2023-04-03 01:16:21,553 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-03 01:16:21,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-04-03 01:16:21,554 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2023-04-03 01:16:21,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:16:21,554 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-04-03 01:16:21,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-03 01:16:21,555 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-04-03 01:16:21,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-04-03 01:16:21,555 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:16:21,555 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-03 01:16:21,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-03 01:16:21,556 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:16:21,556 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:16:21,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1791010960, now seen corresponding path program 1 times [2023-04-03 01:16:21,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:16:21,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311455709] [2023-04-03 01:16:21,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:21,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:16:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:21,679 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-03 01:16:21,679 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:16:21,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311455709] [2023-04-03 01:16:21,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311455709] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:16:21,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549500669] [2023-04-03 01:16:21,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:21,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:16:21,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:16:21,682 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-03 01:16:21,684 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-03 01:16:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:21,750 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-03 01:16:21,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:16:21,847 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-03 01:16:21,847 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:16:22,034 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-03 01:16:22,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549500669] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:16:22,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [443027780] [2023-04-03 01:16:22,055 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-04-03 01:16:22,055 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:16:22,063 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-03 01:16:22,066 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-03 01:16:22,067 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-03 01:16:22,136 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 9 for LOIs [2023-04-03 01:16:22,181 INFO L197 IcfgInterpreter]: Interpreting procedure fibo1 with input of size 12 for LOIs [2023-04-03 01:16:22,198 INFO L197 IcfgInterpreter]: Interpreting procedure fibo2 with input of size 12 for LOIs [2023-04-03 01:16:22,201 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-03 01:16:22,208 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-03 01:16:22,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [443027780] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-03 01:16:22,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:16:22,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6, 7, 7] total 20 [2023-04-03 01:16:22,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851776402] [2023-04-03 01:16:22,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-03 01:16:22,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-03 01:16:22,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:16:22,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-03 01:16:22,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2023-04-03 01:16:22,358 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-03 01:16:22,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:16:22,855 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2023-04-03 01:16:22,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-03 01:16:22,856 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-03 01:16:22,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:16:22,856 INFO L225 Difference]: With dead ends: 72 [2023-04-03 01:16:22,857 INFO L226 Difference]: Without dead ends: 48 [2023-04-03 01:16:22,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2023-04-03 01:16:22,858 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 72 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:16:22,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 6 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:16:22,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-04-03 01:16:22,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2023-04-03 01:16:22,882 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-03 01:16:22,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2023-04-03 01:16:22,884 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26 [2023-04-03 01:16:22,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:16:22,884 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2023-04-03 01:16:22,884 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-03 01:16:22,884 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2023-04-03 01:16:22,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-04-03 01:16:22,886 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:16:22,886 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-03 01:16:22,912 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-03 01:16:23,094 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-03 01:16:23,094 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:16:23,094 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:16:23,094 INFO L85 PathProgramCache]: Analyzing trace with hash 997297373, now seen corresponding path program 1 times [2023-04-03 01:16:23,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:16:23,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689357816] [2023-04-03 01:16:23,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:23,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:16:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:23,197 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-03 01:16:23,197 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:16:23,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689357816] [2023-04-03 01:16:23,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689357816] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:16:23,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445991792] [2023-04-03 01:16:23,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:23,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:16:23,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:16:23,218 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-03 01:16:23,221 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-03 01:16:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:23,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-03 01:16:23,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:16:23,316 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-03 01:16:23,316 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:16:23,589 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-03 01:16:23,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445991792] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:16:23,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1295552652] [2023-04-03 01:16:23,593 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-03 01:16:23,593 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:16:23,594 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-03 01:16:23,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:16:23,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 14 [2023-04-03 01:16:23,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827428696] [2023-04-03 01:16:23,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:16:23,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-03 01:16:23,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:16:23,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-03 01:16:23,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-04-03 01:16:23,601 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-03 01:16:23,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:16:23,775 INFO L93 Difference]: Finished difference Result 89 states and 125 transitions. [2023-04-03 01:16:23,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-03 01:16:23,775 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-03 01:16:23,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:16:23,780 INFO L225 Difference]: With dead ends: 89 [2023-04-03 01:16:23,780 INFO L226 Difference]: Without dead ends: 57 [2023-04-03 01:16:23,781 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-03 01:16:23,783 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 34 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:16:23,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 143 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:16:23,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-04-03 01:16:23,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2023-04-03 01:16:23,805 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-03 01:16:23,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2023-04-03 01:16:23,810 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 39 [2023-04-03 01:16:23,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:16:23,810 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2023-04-03 01:16:23,810 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-03 01:16:23,810 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2023-04-03 01:16:23,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-04-03 01:16:23,815 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:16:23,816 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-03 01:16:23,832 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-03 01:16:24,021 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-03 01:16:24,021 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:16:24,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:16:24,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1525437707, now seen corresponding path program 1 times [2023-04-03 01:16:24,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:16:24,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555048247] [2023-04-03 01:16:24,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:24,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:16:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:24,130 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-03 01:16:24,130 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:16:24,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555048247] [2023-04-03 01:16:24,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555048247] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:16:24,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743341191] [2023-04-03 01:16:24,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:24,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:16:24,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:16:24,132 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-03 01:16:24,134 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-03 01:16:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:24,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-03 01:16:24,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:16:24,235 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-03 01:16:24,235 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:16:24,529 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-03 01:16:24,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743341191] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:16:24,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [749338925] [2023-04-03 01:16:24,530 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-03 01:16:24,531 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:16:24,531 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-03 01:16:24,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:16:24,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 17 [2023-04-03 01:16:24,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087920441] [2023-04-03 01:16:24,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:16:24,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-04-03 01:16:24,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:16:24,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-04-03 01:16:24,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2023-04-03 01:16:24,533 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 10 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) [2023-04-03 01:16:24,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:16:24,909 INFO L93 Difference]: Finished difference Result 125 states and 207 transitions. [2023-04-03 01:16:24,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-03 01:16:24,909 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 10 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) Word has length 40 [2023-04-03 01:16:24,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:16:24,911 INFO L225 Difference]: With dead ends: 125 [2023-04-03 01:16:24,911 INFO L226 Difference]: Without dead ends: 81 [2023-04-03 01:16:24,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2023-04-03 01:16:24,912 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 44 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-03 01:16:24,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 232 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-03 01:16:24,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-04-03 01:16:24,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2023-04-03 01:16:24,924 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-03 01:16:24,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 95 transitions. [2023-04-03 01:16:24,925 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 95 transitions. Word has length 40 [2023-04-03 01:16:24,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:16:24,925 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 95 transitions. [2023-04-03 01:16:24,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 10 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) [2023-04-03 01:16:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 95 transitions. [2023-04-03 01:16:24,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-04-03 01:16:24,926 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:16:24,926 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-03 01:16:24,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-03 01:16:25,131 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-03 01:16:25,131 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:16:25,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:16:25,132 INFO L85 PathProgramCache]: Analyzing trace with hash -684158310, now seen corresponding path program 1 times [2023-04-03 01:16:25,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:16:25,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169927708] [2023-04-03 01:16:25,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:25,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:16:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:25,235 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-03 01:16:25,235 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:16:25,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169927708] [2023-04-03 01:16:25,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169927708] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:16:25,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356982215] [2023-04-03 01:16:25,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:25,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:16:25,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:16:25,250 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-03 01:16:25,251 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-03 01:16:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:25,295 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-03 01:16:25,297 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:16:25,332 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-03 01:16:25,332 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:16:25,559 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-04-03 01:16:25,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356982215] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:16:25,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [732399487] [2023-04-03 01:16:25,564 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-03 01:16:25,565 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:16:25,565 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-03 01:16:25,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:16:25,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 11 [2023-04-03 01:16:25,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299748069] [2023-04-03 01:16:25,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:16:25,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-03 01:16:25,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:16:25,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-03 01:16:25,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-04-03 01:16:25,568 INFO L87 Difference]: Start difference. First operand 67 states and 95 transitions. Second operand has 11 states, 10 states have (on average 3.9) internal successors, (39), 11 states have internal predecessors, (39), 7 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2023-04-03 01:16:25,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:16:25,664 INFO L93 Difference]: Finished difference Result 92 states and 137 transitions. [2023-04-03 01:16:25,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-03 01:16:25,664 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 11 states have internal predecessors, (39), 7 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) Word has length 54 [2023-04-03 01:16:25,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:16:25,667 INFO L225 Difference]: With dead ends: 92 [2023-04-03 01:16:25,667 INFO L226 Difference]: Without dead ends: 80 [2023-04-03 01:16:25,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 106 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-04-03 01:16:25,668 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:16:25,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 95 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:16:25,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-04-03 01:16:25,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2023-04-03 01:16:25,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 49 states have internal predecessors, (52), 17 states have call successors, (17), 7 states have call predecessors, (17), 11 states have return successors, (42), 18 states have call predecessors, (42), 16 states have call successors, (42) [2023-04-03 01:16:25,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 111 transitions. [2023-04-03 01:16:25,699 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 111 transitions. Word has length 54 [2023-04-03 01:16:25,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:16:25,699 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 111 transitions. [2023-04-03 01:16:25,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 11 states have internal predecessors, (39), 7 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2023-04-03 01:16:25,699 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 111 transitions. [2023-04-03 01:16:25,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-04-03 01:16:25,700 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:16:25,700 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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-03 01:16:25,708 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-03 01:16:25,901 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-03 01:16:25,901 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:16:25,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:16:25,901 INFO L85 PathProgramCache]: Analyzing trace with hash -382403334, now seen corresponding path program 1 times [2023-04-03 01:16:25,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:16:25,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947537858] [2023-04-03 01:16:25,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:25,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:16:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:25,995 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-04-03 01:16:25,996 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:16:25,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947537858] [2023-04-03 01:16:25,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947537858] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:16:25,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388947193] [2023-04-03 01:16:25,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:25,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:16:25,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:16:26,005 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-03 01:16:26,030 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-03 01:16:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:26,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-03 01:16:26,072 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:16:26,094 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-04-03 01:16:26,095 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:16:26,254 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-04-03 01:16:26,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388947193] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:16:26,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1980522851] [2023-04-03 01:16:26,257 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-03 01:16:26,257 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:16:26,258 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-03 01:16:26,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:16:26,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2023-04-03 01:16:26,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051318569] [2023-04-03 01:16:26,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:16:26,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-03 01:16:26,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:16:26,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-03 01:16:26,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-04-03 01:16:26,261 INFO L87 Difference]: Start difference. First operand 75 states and 111 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 4 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2023-04-03 01:16:26,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:16:26,347 INFO L93 Difference]: Finished difference Result 91 states and 129 transitions. [2023-04-03 01:16:26,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-03 01:16:26,348 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 4 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 55 [2023-04-03 01:16:26,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:16:26,349 INFO L225 Difference]: With dead ends: 91 [2023-04-03 01:16:26,349 INFO L226 Difference]: Without dead ends: 84 [2023-04-03 01:16:26,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 107 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-04-03 01:16:26,350 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:16:26,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 103 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:16:26,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-04-03 01:16:26,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2023-04-03 01:16:26,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 49 states have internal predecessors, (52), 17 states have call successors, (17), 7 states have call predecessors, (17), 11 states have return successors, (41), 18 states have call predecessors, (41), 16 states have call successors, (41) [2023-04-03 01:16:26,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 110 transitions. [2023-04-03 01:16:26,372 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 110 transitions. Word has length 55 [2023-04-03 01:16:26,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:16:26,373 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 110 transitions. [2023-04-03 01:16:26,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 4 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2023-04-03 01:16:26,373 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 110 transitions. [2023-04-03 01:16:26,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-04-03 01:16:26,376 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:16:26,376 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:16:26,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-04-03 01:16:26,580 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-03 01:16:26,581 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:16:26,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:16:26,581 INFO L85 PathProgramCache]: Analyzing trace with hash -492770403, now seen corresponding path program 2 times [2023-04-03 01:16:26,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:16:26,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729092438] [2023-04-03 01:16:26,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:26,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:16:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:26,701 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 38 proven. 8 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-04-03 01:16:26,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:16:26,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729092438] [2023-04-03 01:16:26,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729092438] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:16:26,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307629820] [2023-04-03 01:16:26,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-03 01:16:26,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:16:26,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:16:26,703 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-03 01:16:26,738 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-03 01:16:26,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-03 01:16:26,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:16:26,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-03 01:16:26,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:16:26,790 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 38 proven. 8 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-04-03 01:16:26,790 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:16:27,023 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-04-03 01:16:27,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307629820] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:16:27,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [90297842] [2023-04-03 01:16:27,025 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-03 01:16:27,025 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:16:27,026 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-03 01:16:27,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:16:27,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 11 [2023-04-03 01:16:27,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014171247] [2023-04-03 01:16:27,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:16:27,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-03 01:16:27,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:16:27,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-03 01:16:27,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-04-03 01:16:27,028 INFO L87 Difference]: Start difference. First operand 75 states and 110 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 6 states have call successors, (15), 1 states have call predecessors, (15), 4 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2023-04-03 01:16:27,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:16:27,102 INFO L93 Difference]: Finished difference Result 100 states and 161 transitions. [2023-04-03 01:16:27,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-03 01:16:27,103 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 6 states have call successors, (15), 1 states have call predecessors, (15), 4 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) Word has length 69 [2023-04-03 01:16:27,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:16:27,106 INFO L225 Difference]: With dead ends: 100 [2023-04-03 01:16:27,106 INFO L226 Difference]: Without dead ends: 93 [2023-04-03 01:16:27,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 133 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-04-03 01:16:27,108 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-03 01:16:27,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 94 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-03 01:16:27,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-04-03 01:16:27,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2023-04-03 01:16:27,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 19 states have call successors, (19), 7 states have call predecessors, (19), 14 states have return successors, (64), 23 states have call predecessors, (64), 18 states have call successors, (64) [2023-04-03 01:16:27,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 143 transitions. [2023-04-03 01:16:27,120 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 143 transitions. Word has length 69 [2023-04-03 01:16:27,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:16:27,120 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 143 transitions. [2023-04-03 01:16:27,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 6 states have call successors, (15), 1 states have call predecessors, (15), 4 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2023-04-03 01:16:27,120 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 143 transitions. [2023-04-03 01:16:27,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-04-03 01:16:27,121 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:16:27,121 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:16:27,130 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-03 01:16:27,326 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-03 01:16:27,326 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:16:27,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:16:27,326 INFO L85 PathProgramCache]: Analyzing trace with hash -774980398, now seen corresponding path program 1 times [2023-04-03 01:16:27,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:16:27,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497133223] [2023-04-03 01:16:27,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:27,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:16:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:27,462 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 46 proven. 14 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-04-03 01:16:27,462 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:16:27,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497133223] [2023-04-03 01:16:27,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497133223] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:16:27,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246070331] [2023-04-03 01:16:27,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:27,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:16:27,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:16:27,464 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-03 01:16:27,475 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-03 01:16:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:27,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-03 01:16:27,530 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:16:27,575 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 54 proven. 16 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-04-03 01:16:27,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:16:27,977 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 54 proven. 20 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-04-03 01:16:27,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246070331] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:16:27,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2043778140] [2023-04-03 01:16:27,979 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-03 01:16:27,979 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:16:27,980 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-03 01:16:27,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:16:27,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11] total 16 [2023-04-03 01:16:27,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38511092] [2023-04-03 01:16:27,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:16:27,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-04-03 01:16:27,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:16:27,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-04-03 01:16:27,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-04-03 01:16:27,981 INFO L87 Difference]: Start difference. First operand 88 states and 143 transitions. Second operand has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 16 states have internal predecessors, (55), 10 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 8 states have call predecessors, (18), 10 states have call successors, (18) [2023-04-03 01:16:28,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:16:28,120 INFO L93 Difference]: Finished difference Result 115 states and 198 transitions. [2023-04-03 01:16:28,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-03 01:16:28,121 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 16 states have internal predecessors, (55), 10 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 8 states have call predecessors, (18), 10 states have call successors, (18) Word has length 81 [2023-04-03 01:16:28,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:16:28,122 INFO L225 Difference]: With dead ends: 115 [2023-04-03 01:16:28,122 INFO L226 Difference]: Without dead ends: 108 [2023-04-03 01:16:28,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 153 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2023-04-03 01:16:28,123 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:16:28,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 200 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:16:28,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-04-03 01:16:28,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 86. [2023-04-03 01:16:28,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 57 states have internal predecessors, (60), 18 states have call successors, (18), 8 states have call predecessors, (18), 14 states have return successors, (55), 20 states have call predecessors, (55), 17 states have call successors, (55) [2023-04-03 01:16:28,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 133 transitions. [2023-04-03 01:16:28,134 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 133 transitions. Word has length 81 [2023-04-03 01:16:28,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:16:28,135 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 133 transitions. [2023-04-03 01:16:28,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 16 states have internal predecessors, (55), 10 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 8 states have call predecessors, (18), 10 states have call successors, (18) [2023-04-03 01:16:28,135 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 133 transitions. [2023-04-03 01:16:28,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-04-03 01:16:28,136 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:16:28,136 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:16:28,143 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-03 01:16:28,341 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-03 01:16:28,341 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:16:28,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:16:28,342 INFO L85 PathProgramCache]: Analyzing trace with hash 522282597, now seen corresponding path program 2 times [2023-04-03 01:16:28,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:16:28,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763236783] [2023-04-03 01:16:28,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:28,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:16:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:28,652 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-04-03 01:16:28,653 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:16:28,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763236783] [2023-04-03 01:16:28,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763236783] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:16:28,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246286764] [2023-04-03 01:16:28,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-03 01:16:28,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:16:28,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:16:28,665 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-03 01:16:28,666 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-03 01:16:28,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-04-03 01:16:28,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:16:28,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 39 conjunts are in the unsatisfiable core [2023-04-03 01:16:28,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:16:28,895 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-04-03 01:16:28,895 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:16:29,131 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-04-03 01:16:29,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246286764] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:16:29,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1406645601] [2023-04-03 01:16:29,133 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-03 01:16:29,133 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:16:29,133 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-03 01:16:29,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:16:29,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 21 [2023-04-03 01:16:29,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551192974] [2023-04-03 01:16:29,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:16:29,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-04-03 01:16:29,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:16:29,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-04-03 01:16:29,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2023-04-03 01:16:29,134 INFO L87 Difference]: Start difference. First operand 86 states and 133 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 12 states have internal predecessors, (32), 4 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (13), 13 states have call predecessors, (13), 4 states have call successors, (13) [2023-04-03 01:16:29,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:16:29,262 INFO L93 Difference]: Finished difference Result 142 states and 252 transitions. [2023-04-03 01:16:29,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-04-03 01:16:29,263 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 12 states have internal predecessors, (32), 4 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (13), 13 states have call predecessors, (13), 4 states have call successors, (13) Word has length 68 [2023-04-03 01:16:29,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:16:29,264 INFO L225 Difference]: With dead ends: 142 [2023-04-03 01:16:29,264 INFO L226 Difference]: Without dead ends: 130 [2023-04-03 01:16:29,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 119 SyntacticMatches, 18 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2023-04-03 01:16:29,265 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:16:29,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 760 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:16:29,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-04-03 01:16:29,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 101. [2023-04-03 01:16:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 66 states have internal predecessors, (69), 21 states have call successors, (21), 8 states have call predecessors, (21), 17 states have return successors, (81), 26 states have call predecessors, (81), 20 states have call successors, (81) [2023-04-03 01:16:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 171 transitions. [2023-04-03 01:16:29,277 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 171 transitions. Word has length 68 [2023-04-03 01:16:29,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:16:29,277 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 171 transitions. [2023-04-03 01:16:29,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 12 states have internal predecessors, (32), 4 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (13), 13 states have call predecessors, (13), 4 states have call successors, (13) [2023-04-03 01:16:29,277 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 171 transitions. [2023-04-03 01:16:29,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-04-03 01:16:29,279 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:16:29,279 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:16:29,304 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-03 01:16:29,494 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-03 01:16:29,495 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:16:29,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:16:29,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1441541709, now seen corresponding path program 1 times [2023-04-03 01:16:29,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:16:29,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104261007] [2023-04-03 01:16:29,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:29,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:16:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 17 proven. 33 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-04-03 01:16:29,662 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:16:29,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104261007] [2023-04-03 01:16:29,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104261007] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:16:29,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392201654] [2023-04-03 01:16:29,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:29,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:16:29,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:16:29,678 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-03 01:16:29,679 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-03 01:16:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:29,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-03 01:16:29,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:16:29,763 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 17 proven. 33 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-04-03 01:16:29,763 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:16:30,119 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-04-03 01:16:30,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392201654] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:16:30,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1875277828] [2023-04-03 01:16:30,121 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-03 01:16:30,121 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:16:30,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-03 01:16:30,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:16:30,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 13 [2023-04-03 01:16:30,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66553002] [2023-04-03 01:16:30,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:16:30,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-03 01:16:30,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:16:30,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-03 01:16:30,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-04-03 01:16:30,122 INFO L87 Difference]: Start difference. First operand 101 states and 171 transitions. Second operand has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 13 states have internal predecessors, (47), 9 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14) [2023-04-03 01:16:30,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:16:30,271 INFO L93 Difference]: Finished difference Result 139 states and 270 transitions. [2023-04-03 01:16:30,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-03 01:16:30,272 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 13 states have internal predecessors, (47), 9 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14) Word has length 69 [2023-04-03 01:16:30,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:16:30,272 INFO L225 Difference]: With dead ends: 139 [2023-04-03 01:16:30,272 INFO L226 Difference]: Without dead ends: 65 [2023-04-03 01:16:30,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 134 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2023-04-03 01:16:30,273 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 15 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:16:30,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 201 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:16:30,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-04-03 01:16:30,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-04-03 01:16:30,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 44 states have internal predecessors, (46), 12 states have call successors, (12), 8 states have call predecessors, (12), 11 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2023-04-03 01:16:30,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2023-04-03 01:16:30,278 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 69 [2023-04-03 01:16:30,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:16:30,278 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2023-04-03 01:16:30,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 13 states have internal predecessors, (47), 9 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14) [2023-04-03 01:16:30,279 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2023-04-03 01:16:30,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-04-03 01:16:30,279 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:16:30,279 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 3, 3, 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, 1] [2023-04-03 01:16:30,297 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-03 01:16:30,486 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-03 01:16:30,486 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:16:30,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:16:30,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1341101280, now seen corresponding path program 3 times [2023-04-03 01:16:30,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:16:30,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991239615] [2023-04-03 01:16:30,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:30,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:16:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:30,582 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 29 proven. 30 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-04-03 01:16:30,582 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:16:30,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991239615] [2023-04-03 01:16:30,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991239615] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:16:30,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956611450] [2023-04-03 01:16:30,582 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-03 01:16:30,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:16:30,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:16:30,597 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-03 01:16:30,604 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-03 01:16:30,655 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-03 01:16:30,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:16:30,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 9 conjunts are in the unsatisfiable core [2023-04-03 01:16:30,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:16:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 31 proven. 27 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-04-03 01:16:30,699 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:16:30,989 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 30 proven. 29 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-04-03 01:16:30,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956611450] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:16:30,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1508935292] [2023-04-03 01:16:30,990 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-03 01:16:30,990 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:16:30,991 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-03 01:16:30,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:16:30,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 16 [2023-04-03 01:16:30,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296346300] [2023-04-03 01:16:30,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:16:30,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-04-03 01:16:30,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:16:30,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-04-03 01:16:30,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2023-04-03 01:16:30,992 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 9 states have call successors, (18), 1 states have call predecessors, (18), 4 states have return successors, (17), 8 states have call predecessors, (17), 9 states have call successors, (17) [2023-04-03 01:16:31,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:16:31,053 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2023-04-03 01:16:31,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-03 01:16:31,053 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 9 states have call successors, (18), 1 states have call predecessors, (18), 4 states have return successors, (17), 8 states have call predecessors, (17), 9 states have call successors, (17) Word has length 80 [2023-04-03 01:16:31,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:16:31,053 INFO L225 Difference]: With dead ends: 65 [2023-04-03 01:16:31,053 INFO L226 Difference]: Without dead ends: 0 [2023-04-03 01:16:31,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 152 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2023-04-03 01:16:31,054 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-03 01:16:31,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 144 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-03 01:16:31,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-04-03 01:16:31,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-04-03 01:16:31,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-04-03 01:16:31,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-04-03 01:16:31,055 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2023-04-03 01:16:31,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:16:31,055 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-04-03 01:16:31,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 9 states have call successors, (18), 1 states have call predecessors, (18), 4 states have return successors, (17), 8 states have call predecessors, (17), 9 states have call successors, (17) [2023-04-03 01:16:31,055 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-04-03 01:16:31,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-04-03 01:16:31,057 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-03 01:16:31,062 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-03 01:16:31,262 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-03 01:16:31,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-04-03 01:16:33,784 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2023-04-03 01:16:33,784 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line 4) no Hoare annotation was computed. [2023-04-03 01:16:33,784 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 41) no Hoare annotation was computed. [2023-04-03 01:16:33,785 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 37 44) no Hoare annotation was computed. [2023-04-03 01:16:33,785 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 37 44) the Hoare annotation is: true [2023-04-03 01:16:33,785 INFO L899 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2023-04-03 01:16:33,785 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2023-04-03 01:16:33,785 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (or (not (= (select .cse0 0) 48)) (not (= |#NULL.offset| 0)) (not (= 2 (select |#length| 1))) (not (= (select |#valid| 3) 1)) (not (= (select |#length| 3) 12)) (not (= (select |#valid| 0) 0)) (not (= (select .cse0 1) 0)) (not (= (select |#valid| 1) 1)) (not (= 18 (select |#length| 2))) (not (= |#NULL.base| 0)) (not (= (select |#valid| 2) 1)) (= main_~x~0 4) (<= |#StackHeapBarrier| 0))) [2023-04-03 01:16:33,785 INFO L899 garLoopResultBuilder]: For program point L39-1(line 39) no Hoare annotation was computed. [2023-04-03 01:16:33,785 INFO L899 garLoopResultBuilder]: For program point L40-2(lines 40 42) no Hoare annotation was computed. [2023-04-03 01:16:33,786 INFO L895 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (or (not (= (select .cse0 0) 48)) (not (= |#NULL.offset| 0)) (not (= 2 (select |#length| 1))) (not (= (select |#valid| 3) 1)) (not (= (select |#length| 3) 12)) (not (= (select |#valid| 0) 0)) (not (= (select .cse0 1) 0)) (not (= (select |#valid| 1) 1)) (not (= 18 (select |#length| 2))) (not (= |#NULL.base| 0)) (and (<= |fibo2_#in~n| fibo2_~n) (< 1 fibo2_~n) (<= fibo2_~n |fibo2_#in~n|)) (not (= (select |#valid| 2) 1)) (<= |#StackHeapBarrier| 0))) [2023-04-03 01:16:33,786 INFO L899 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2023-04-03 01:16:33,786 INFO L895 garLoopResultBuilder]: At program point L25-2(line 25) the Hoare annotation is: (let ((.cse12 (select |#memory_int| 1))) (let ((.cse0 (not (= (select .cse12 0) 48))) (.cse1 (not (= |#NULL.offset| 0))) (.cse2 (not (= 2 (select |#length| 1)))) (.cse3 (not (= (select |#valid| 3) 1))) (.cse4 (not (= (select |#length| 3) 12))) (.cse5 (not (= (select |#valid| 0) 0))) (.cse6 (not (= (select .cse12 1) 0))) (.cse7 (not (= (select |#valid| 1) 1))) (.cse8 (not (= 18 (select |#length| 2)))) (.cse9 (not (= |#NULL.base| 0))) (.cse10 (not (= (select |#valid| 2) 1))) (.cse11 (<= |#StackHeapBarrier| 0))) (and (or (and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|)) .cse0 .cse1 .cse2 (<= 4 |fibo2_#in~n|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and (<= |fibo2_#in~n| fibo2_~n) (< 1 fibo2_~n) (<= fibo2_~n |fibo2_#in~n|)) .cse10 .cse11)))) [2023-04-03 01:16:33,786 INFO L899 garLoopResultBuilder]: For program point L22(lines 22 26) no Hoare annotation was computed. [2023-04-03 01:16:33,786 INFO L899 garLoopResultBuilder]: For program point L25-3(line 25) no Hoare annotation was computed. [2023-04-03 01:16:33,786 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 26) no Hoare annotation was computed. [2023-04-03 01:16:33,786 INFO L899 garLoopResultBuilder]: For program point fibo2FINAL(lines 19 27) no Hoare annotation was computed. [2023-04-03 01:16:33,786 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 19 27) the Hoare annotation is: true [2023-04-03 01:16:33,786 INFO L899 garLoopResultBuilder]: For program point fibo2EXIT(lines 19 27) no Hoare annotation was computed. [2023-04-03 01:16:33,786 INFO L895 garLoopResultBuilder]: At program point L15(line 15) the Hoare annotation is: (let ((.cse12 (select |#memory_int| 1))) (let ((.cse0 (not (= (select .cse12 0) 48))) (.cse1 (not (= |#NULL.offset| 0))) (.cse2 (not (= 2 (select |#length| 1)))) (.cse3 (not (= (select |#valid| 3) 1))) (.cse4 (not (= (select |#length| 3) 12))) (.cse5 (not (= (select |#valid| 0) 0))) (.cse6 (not (= (select .cse12 1) 0))) (.cse7 (not (= (select |#valid| 1) 1))) (.cse8 (not (= 18 (select |#length| 2)))) (.cse9 (not (= |#NULL.base| 0))) (.cse10 (not (= (select |#valid| 2) 1))) (.cse11 (<= |#StackHeapBarrier| 0))) (and (or .cse0 .cse1 .cse2 .cse3 (< 1 |fibo1_#in~n|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or (and (<= fibo1_~n |fibo1_#in~n|) (<= |fibo1_#in~n| fibo1_~n)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2023-04-03 01:16:33,786 INFO L899 garLoopResultBuilder]: For program point L15-1(line 15) no Hoare annotation was computed. [2023-04-03 01:16:33,787 INFO L895 garLoopResultBuilder]: At program point L15-2(line 15) the Hoare annotation is: (let ((.cse14 (select |#memory_int| 1))) (let ((.cse0 (not (= (select .cse14 0) 48))) (.cse1 (not (= |#NULL.offset| 0))) (.cse2 (not (= 2 (select |#length| 1)))) (.cse3 (not (= (select |#valid| 3) 1))) (.cse4 (not (= (select |#length| 3) 12))) (.cse5 (not (= (select |#valid| 0) 0))) (.cse6 (not (= (select .cse14 1) 0))) (.cse7 (not (= (select |#valid| 1) 1))) (.cse8 (not (= 18 (select |#length| 2)))) (.cse9 (not (= |#NULL.base| 0))) (.cse10 (not (= (select |#valid| 2) 1))) (.cse11 (<= |#StackHeapBarrier| 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= |fibo1_#in~n| 4)) .cse11 (and (<= 2 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 2))) (let ((.cse12 (<= fibo1_~n |fibo1_#in~n|)) (.cse13 (<= |fibo1_#in~n| fibo1_~n))) (or .cse0 .cse1 (and (<= 3 fibo1_~n) .cse12 .cse13) .cse2 (and .cse12 (= |fibo1_#t~ret4| 1) (< 1 fibo1_~n) .cse13) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))))) [2023-04-03 01:16:33,787 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 16) no Hoare annotation was computed. [2023-04-03 01:16:33,787 INFO L899 garLoopResultBuilder]: For program point L15-3(line 15) no Hoare annotation was computed. [2023-04-03 01:16:33,787 INFO L899 garLoopResultBuilder]: For program point fibo1FINAL(lines 9 17) no Hoare annotation was computed. [2023-04-03 01:16:33,787 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 16) no Hoare annotation was computed. [2023-04-03 01:16:33,787 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 9 17) the Hoare annotation is: true [2023-04-03 01:16:33,787 INFO L899 garLoopResultBuilder]: For program point fibo1EXIT(lines 9 17) no Hoare annotation was computed. [2023-04-03 01:16:33,787 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2023-04-03 01:16:33,787 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2023-04-03 01:16:33,787 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-04-03 01:16:33,787 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= 18 (select |#length| 2)) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2023-04-03 01:16:33,787 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-04-03 01:16:33,787 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-04-03 01:16:33,790 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:16:33,791 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-03 01:16:33,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.04 01:16:33 BoogieIcfgContainer [2023-04-03 01:16:33,795 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-03 01:16:33,795 INFO L158 Benchmark]: Toolchain (without parser) took 13384.01ms. Allocated memory was 334.5MB in the beginning and 483.4MB in the end (delta: 148.9MB). Free memory was 289.6MB in the beginning and 364.6MB in the end (delta: -75.0MB). Peak memory consumption was 273.1MB. Max. memory is 8.0GB. [2023-04-03 01:16:33,796 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 196.1MB. Free memory was 147.3MB in the beginning and 147.2MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. [2023-04-03 01:16:33,796 INFO L158 Benchmark]: CACSL2BoogieTranslator took 150.87ms. Allocated memory is still 334.5MB. Free memory was 289.2MB in the beginning and 279.1MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-04-03 01:16:33,796 INFO L158 Benchmark]: Boogie Preprocessor took 32.53ms. Allocated memory is still 334.5MB. Free memory was 279.1MB in the beginning and 277.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-04-03 01:16:33,796 INFO L158 Benchmark]: RCFGBuilder took 246.45ms. Allocated memory is still 334.5MB. Free memory was 277.7MB in the beginning and 266.6MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-04-03 01:16:33,796 INFO L158 Benchmark]: TraceAbstraction took 12950.58ms. Allocated memory was 334.5MB in the beginning and 483.4MB in the end (delta: 148.9MB). Free memory was 265.9MB in the beginning and 364.6MB in the end (delta: -98.7MB). Peak memory consumption was 248.9MB. Max. memory is 8.0GB. [2023-04-03 01:16:33,797 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 196.1MB. Free memory was 147.3MB in the beginning and 147.2MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 150.87ms. Allocated memory is still 334.5MB. Free memory was 289.2MB in the beginning and 279.1MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.53ms. Allocated memory is still 334.5MB. Free memory was 279.1MB in the beginning and 277.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 246.45ms. Allocated memory is still 334.5MB. Free memory was 277.7MB in the beginning and 266.6MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 12950.58ms. Allocated memory was 334.5MB in the beginning and 483.4MB in the end (delta: 148.9MB). Free memory was 265.9MB in the beginning and 364.6MB in the end (delta: -98.7MB). Peak memory consumption was 248.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 41]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.9s, OverallIterations: 12, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 340 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 297 mSDsluCounter, 2145 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1834 mSDsCounter, 144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2254 IncrementalHoareTripleChecker+Invalid, 2398 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 144 mSolverCounterUnsat, 311 mSDtfsCounter, 2254 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1351 GetRequests, 1121 SyntacticMatches, 52 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=10, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 97 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 137 PreInvPairs, 269 NumberOfFragments, 710 HoareAnnotationTreeSize, 137 FomulaSimplifications, 23304 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 11 FomulaSimplificationsInter, 6812 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1189 NumberOfCodeBlocks, 1149 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1738 ConstructedInterpolants, 0 QuantifiedInterpolants, 3706 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1463 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 32 InterpolantComputations, 2 PerfectInterpolantSequences, 1436/1890 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 0.2s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 5, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 19, DAG_INTERPRETER_EARLY_EXITS: 6, TOOLS_POST_APPLICATIONS: 15, TOOLS_POST_TIME: 0.0s, TOOLS_POST_CALL_APPLICATIONS: 12, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 8, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 34, TOOLS_QUANTIFIERELIM_TIME: 0.1s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.0s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 49, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 3, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 19, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 8, CALL_SUMMARIZER_CACHE_MISSES: 3, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 165, DAG_COMPRESSION_RETAINED_NODES: 71, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-04-03 01:16:33,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...